This book constitutes the thoroughly refereed post-workshop proceedings of the 4th International Workshop on Job Scheduling Strategies for Parallel Processing held during IPPS/SPDP'98, in Orlando, Florida, USA, in March 1998. The 13 revised full papers presented have gone through an iterated reviewing process and give a report on the state of the art in the area.
Metrics and benchmarking for parallel job scheduling.- A comparative study of real workload traces and synthetic workload models for parallel job scheduling.- Lachesis: A job scheduler for the cray T3E.- A resource management architecture for metacomputing systems.- Implementing the combination of time sharing and space sharing on AP/Linux.- Job scheduling scheme for pure space sharing among rigid jobs.- Predicting application run times using historical information.- Job scheduling strategies for networks of workstations.- Probabilistic loop scheduling considering communication overhead.- Improving first-come-first-serve job scheduling by gang scheduling.- Expanding symmetric multiprocessor capability through gang scheduling.- Overhead analysis of preemptive gang scheduling.- Dynamic coscheduling on workstation clusters.
This book constitutes the thoroughly refereed post-workshop proceedings of the 4th International Workshop on Job Scheduling Strategies for Parallel Processing held during IPPS/SPDP'98, in Orlando, Florida, USA, in March 1998. The 13 revised full papers presented have gone through an iterated reviewing process and give a report on the state of the art in the area.
Inhaltsverzeichnis
Metrics and benchmarking for parallel job scheduling.- A comparative study of real workload traces and synthetic workload models for parallel job scheduling.- Lachesis: A job scheduler for the cray T3E.- A resource management architecture for metacomputing systems.- Implementing the combination of time sharing and space sharing on AP/Linux.- Job scheduling scheme for pure space sharing among rigid jobs.- Predicting application run times using historical information.- Job scheduling strategies for networks of workstations.- Probabilistic loop scheduling considering communication overhead.- Improving first-come-first-serve job scheduling by gang scheduling.- Expanding symmetric multiprocessor capability through gang scheduling.- Overhead analysis of preemptive gang scheduling.- Dynamic coscheduling on workstation clusters.
Springer Book Archives
