737 search results - page 13 / 148 » Group Priority Scheduling |
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
The duration of time for which each application locks each shared resource is critically important in composing multiple independently-developed applications upon a shared “open...
PODC
1999
ACM
13 years 11 months ago
1999
ACM
d Abstract) James H. Anderson Department of Computer Science University of North Carolina at Chapel Hill Mark Moiry Department of Computer Science University of Pittsburgh We cons...
SIGMETRICS
2004
ACM
14 years 28 days ago
2004
ACM
The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for sh...
IPCCC
2007
IEEE
14 years 1 months ago
2007
IEEE
Currently, wireless priority services (WPS) are provided using call queueing with a weighted round-robin schedule based on a fixed parameter. In this paper, we introduce a flexi...