203 search results - page 13 / 41 » Evaluating Heuristic Scheduling Algorithms for High Performa... |
PPOPP
2009
ACM
14 years 8 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
IEEEPACT
2002
IEEE
14 years 19 days ago
2002
IEEE
Simultaneous Multithreading (SMT) processors achieve high processor throughput at the expense of single-thread performance. This paper investigates resource allocation policies fo...
OSN
2011
12 years 10 months ago
2011
—This paper presents PI-OPS (Parallel-Iterative Optical Packet Scheduler) a parallel-iterative scheduler for asynchronous Optical Packet Switching nodes with optical buffering. O...
FAST
2011
12 years 11 months ago
2011
Exploiting spatial locality is critical for a disk scheduler to achieve high throughput. Because of the high cost of disk head seeks and the non-preemptible nature of request serv...
ESCIENCE
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we present algorithms for Grid resource provisioning that employ agreement-based resource management. These algorithms allow userlevel resource allocation and sched...