Job Scheduling Strategies for Parallel Processing: IPPS/SPDP'98 Workshop, Orlando, Florida, USA, March 30, 1998 Proceedings
Dror G. Feitelson, Larry Rudolph
Springer, Sep 18, 1998 - Parallel processing (Electronic computers) - 257 pages
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Metrics and Benchmarking for Parallel Job Scheduling
A Comparative Study of Real Workload Traces and Synthetic Workload
A Job Scheduler for the Cray T3E
11 other sections not shown
Other editions - View all
achieve AP/Linux Backfilling barriers batch benchmark cluster co-allocation communication nodes Computer Science context switch Cornell Theory Center coscheduling Cray T3E D. G. Feitelson Distributed Computing Downey dynamic coscheduling evaluation execution FCFS Figure FPFS FPFS and FPMPFS gang scheduling genetic algorithm graph idle processors implementation job manager job queue job scheduling schemes Job Scheduling Strategies jobsize Latency load machine memory metacomputing multiprocessor Myrinet nodes number of nodes number of processors operating system overhead parallel applications parallel computer parallel jobs parallel process parallel program parameters performance prediction priority probabilistic problem Proceedings processor utilization PScheD real workload traces request resource management Rudolph Eds runtime scheduling algorithms SCore-D SDSC Section simulation slice slowdown Solaris Solaris 2.4 space sharing specific spin spin-block Springer-Verlag Strategies for Parallel supercomputers synchronization synthetic workload models task technique templates threads timesharing UNIX WaitLimit wide job workstations