1257 search results - page 110 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
152
click to vote
JSSPP
1997
Springer
1997
Springer
An Experimental Evaluation of Processor Pool-Based Scheduling for Shared-Memory NUMA Multiprocessors
15 years 5 months ago
In this paper we describe the design, implementation and experimental evaluation of a technique for operating system schedulers called processor pool-based scheduling [51]. Our tec...
123
click to vote
JSSPP
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. As multi-core processors proliferate, it has become more important than ever to ensure efficient execution of parallel jobs on multiprocessor systems. In this paper, we s...
113
click to vote
HPDC
2007
IEEE
15 years 8 months ago
2007
IEEE
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
102
click to vote
IPPS
2007
IEEE
15 years 8 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...
102
click to vote
HPDC
2003
IEEE
15 years 7 months ago
2003
IEEE
Divisible workload applications arise in many fields of science and engineering. They can be parallelized in master-worker fashion and relevant scheduling strategies have been pr...