1301 search results - page 29 / 261 » Performance Analysis of Parallel Job Scheduling in Distribut... |
ICPP
2003
IEEE
14 years 3 months ago
2003
IEEE
The bus that connects processors to memory is known to be a major architectural bottleneck in SMPs. However, both software and scheduling policies for these systems generally focu...
SIGMETRICS
2002
ACM
13 years 10 months ago
2002
ACM
Scheduling in large-scale parallel systems has been and continues to be an important and challenging research problem. Several key factors, including the increasing use of off-the...
HPDC
2007
IEEE
14 years 4 months ago
2007
IEEE
Desktop grids combine Peer-to-Peer and Grid computing techniques to improve the robustness, reliability and scalability of job execution infrastructures. However, efficiently mat...
SIGMETRICS
1998
ACM
13 years 10 months ago
1998
ACM
Implicitcoscheduling is a distributed algorithm fortime-sharing communicating processes in a cluster of workstations. By observing and reacting to implicit information, local sche...
PE
2010
Springer
13 years 8 months ago
2010
Springer
From a rare events perspective, scheduling disciplines that work well under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed worklo...