Job Scheduling Strategies for Parallel Processing: IPPS/SPDP'99 Workshop, JSSPP'99, San Juan, Puerto Rico, April 16, 1999, Proceedings
Dror G. Feitelson, Larry Rudolph
Springer, Nov 12, 1999 - Parallel processing (Electronic computers) - 237 pages
This book constitutes the thoroughly refereed post-workshop proceedings of the 5th International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP'99, held in San Juan, Puerto Rico, in April 1999, as a satelite meeting of IPPS/SPDP'99. The 12 revised full papers have been through an iterated reviewing process and present 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.
A Historical Perspective
On the Design and Evaluation of Job Scheduling Algorithms
Comparing Logs and Models of Parallel Workloads Using
10 other sections not shown
Other editions - View all
AP/Linux average Backfill batch jobs batch schedulers benchmark busy wait Co-plot co-scheduling Computer Science context switch Cornell Theory Center correlated CTC workload D. G. Feitelson degree of parallelism Distributed Computing Enactor evaluation FCFS Figure gang scheduling grain parallel processes idle implementation Intel Paragon inter-arrival interactive job re-packing Job Scheduling Strategies kernel Lecture Notes Legion LNCS load LoadLeveler Matrix mean wait metacomputer metasystem Miser Notes Comput Notes in Computer number of processors objective function parallel computers parallel job parallel machines parallel processes parallel systems partitioning percent performance physical memory pool predictor Proceedings production workloads PSRS queue requests resource management Rudolph Eds run-time prediction scheduling algorithms scheduling policy scheduling system SDSC self-similarity simulation slot slowdowns space sharing Springer-Verlag Strategies for Parallel supercomputers synchronization task technique template UNIX users utilization variables variants wait-time prediction workload model Workshop on Job