2006 |
12 | EE | Philip Holman,
James H. Anderson:
Locking under Pfair scheduling.
ACM Trans. Comput. Syst. 24(2): 140-174 (2006) |
11 | EE | Philip Holman,
James H. Anderson:
Supporting lock-free synchronization in Pfair-scheduled real-time systems.
J. Parallel Distrib. Comput. 66(1): 47-67 (2006) |
10 | EE | Philip Holman,
James H. Anderson:
Group-Based Pfair Scheduling.
Real-Time Systems 32(1-2): 125-168 (2006) |
2005 |
9 | EE | Philip Holman,
James H. Anderson:
Adapting Pfair scheduling for symmetric multiprocessors.
J. Embedded Computing 1(4): 543-564 (2005) |
2004 |
8 | EE | Philip Holman,
James H. Anderson:
Implementing Pfairness on a Symmetric Multiprocessor.
IEEE Real-Time and Embedded Technology and Applications Symposium 2004: 544-553 |
2003 |
7 | EE | Philip Holman,
James H. Anderson:
Using Supertasks to Improve Processor Utilization in Multiprocessor Real-Time Systems.
ECRTS 2003: 41-50 |
6 | EE | Anand Srinivasan,
Philip Holman,
James H. Anderson,
Sanjoy K. Baruah:
The Case for Fair Multiprocessor Scheduling.
IPDPS 2003: 114 |
2002 |
5 | EE | Philip Holman,
James H. Anderson:
Object Sharing in Pfair-scheduled Multiprocessor Systems.
ECRTS 2002: 111- |
4 | EE | Anand Srinivasan,
Philip Holman,
James H. Anderson:
Integrating Aperiodic and Recurrent Tasks on Fair-Scheduled Multiprocessors.
ECRTS 2002: 19- |
3 | EE | Philip Holman,
James H. Anderson:
Locking in Pfair-Scheduled Multiprocessor Systems.
IEEE Real-Time Systems Symposium 2002: 149-158 |
2001 |
2 | EE | Philip Holman,
James H. Anderson:
Guaranteeing Pfair Supertasks by Reweighting.
IEEE Real-Time Systems Symposium 2001: 203- |
2000 |
1 | EE | James H. Anderson,
Philip Holman:
Efficient pure-buffer algorithms for real-time systems.
RTCSA 2000: 57-64 |