11 search results - page 2 / 3 » jsspp 2004 |
JSSPP
2004
Springer
13 years 10 months ago
2004
Springer
Computer system batch schedulers typically require information from the user upon job submission, including a runtime estimate. Inaccuracy of these runtime estimates, relative to ...
JSSPP
2004
Springer
13 years 10 months ago
2004
Springer
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
JSSPP
2004
Springer
13 years 10 months ago
2004
Springer
Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
JSSPP
2004
Springer
13 years 10 months ago
2004
Springer
The self-tuning dynP scheduler for modern cluster resource management systems switches between different basic scheduling policies dynamically during run time. This allows to reac...
JSSPP
2004
Springer
13 years 10 months ago
2004
Springer
As we continue to evolve into large-scale parallel systems, many of them employing hundreds of computing engines to take on mission-critical roles, it is crucial to design those s...