Job Scheduling Strategies for Parallel Processing: IPPS '96 Workshop, Honolulu, Hawaii, April 16, 1996. Proceedings

Front Cover
Springer Science & Business Media, Oct 16, 1996 - Computers - 289 pages
This book constitutes the strictly refereed post-workshop proceedings of the International Workshop on Job Scheduling Strategies for Parallel Processing, held in conjunction with IPPS '96 symposium in Honolulu, Hawaii, in April 1996.
The book presents 15 thoroughly revised full papers accepted for inclusion on the basis of the reports of at least five program committee members. The volume is a highly competent contribution to advancing the state-of-the-art in the area of job scheduling for parallel supercomputers. Among the topics addressed are job scheduler, workload evolution, gang scheduling, multiprocessor scheduling, parallel processor allocation, and distributed memory environments.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Toward Convergence in Job Schedulers for Parallel Supercomputers
1
Workload Evolution on the Cornell Theory Center IBM SP2
27
The EASY LoadLeveler API Project
41
A Batch Scheduler for the Intel Paragon with a Noncontiguous Node Allocation Algorithm
48
ArchitectureIndependent RequestScheduling with Tight WaitingTime Estimations
65
Packing Schemes for Gang Scheduling
89
A Gang Scheduling Design for Multiprogrammed Parallel Computing Environments
111
Implementation of GangScheduling on Workstation Cluster
126
Using Runtime Measured Workload Characteristics in Parallel Processor Scheduling
155
Parallel Application Characterization for Multiprocessor Scheduling Policy Design
175
Dynamic vs Static QuantumBased Parallel Processor Allocation
200
An Empirical Comparison
224
Dynamic Partitioning in Different DistributedMemory Environments
244
LocalityInformationBased Scheduling in SharedMemory Multiprocessors
271
Author Index
Copyright

Managing Checkpoints for Parallel Programs
140

Common terms and phrases