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.
Author(s): Dror G. Feitelson, Larry Rudolph (auth.), Dror G. Feitelson, Larry Rudolph (eds.)
Series: Lecture Notes in Computer Science 1162
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1996
Language: English
Pages: 300
Tags: Operating Systems; Programming Techniques; Processor Architectures; Logic Design; Computation by Abstract Devices; Computer Communication Networks
Toward convergence in job schedulers for parallel supercomputers....Pages 1-26
Workload evolution on the Cornell Theory Center IBM SP2....Pages 27-40
The EASY — LoadLeveler API project....Pages 41-47
A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm....Pages 48-64
Architecture-independent request-scheduling with tight waiting-time estimations....Pages 65-88
Packing schemes for gang scheduling....Pages 89-110
A gang scheduling design for multiprogrammed parallel computing environments....Pages 111-125
Implementation of gang-scheduling on workstation cluster....Pages 126-139
Managing checkpoints for parallel programs....Pages 140-154
Using runtime measured workload characteristics in parallel processor scheduling....Pages 155-174
Parallel application characterization for multiprocessor scheduling policy design....Pages 175-199
Dynamic vs. static quantum-based parallel processor allocation....Pages 200-223
Dynamic versus adaptive processor allocation policies for message passing parallel computers: An empirical comparison....Pages 224-243
Dynamic partitioning in different distributed-memory environments....Pages 244-270
Locality-information-based scheduling in shared-memory multiprocessors....Pages 271-289
