This book constitutes the strictly refereed post-workshop proceedings of the 1997 IPPS Workshop on Job Scheduling Strategies for Parallel Processing held in Geneva, Switzerland, in April 1997, as a satelite meeting of the IEEE/CS International Parallel Processing Symposium.
The 12 revised full papers presented were carefully reviewed and revised for inclusion in the book. Also included is a detailed introduction surveying the state of the art in the area. Among the topics covered are processor allocation, parallel scheduling, massively parallel processing, shared-memory architectures, gang scheduling, etc.
Author(s): Dror G. Feitelson, Larry Rudolph (auth.), Dror G. Feitelson, Larry Rudolph (eds.)
Series: Lecture Notes in Computer Science 1291
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1997
Language: English
Pages: 305
Tags: Operating Systems; Programming Techniques; Algorithm Analysis and Problem Complexity; Processor Architectures; Logic Design
Theory and practice in parallel job scheduling....Pages 1-34
Using queue time predictions for processor allocation....Pages 35-57
A historical application profiler for use by parallel schedulers....Pages 58-77
Memory usage in the LANL CM-5 workload....Pages 78-94
Modeling of workload in MPPs....Pages 95-116
PScheD Political scheduling on the CRAY T3E....Pages 117-138
An experimental evaluation of processor pool-based scheduling for shared-memory NUMA multiprocessors....Pages 139-165
Implementing multiprocessor scheduling disciplines....Pages 166-192
Objective-oriented algorithm for job scheduling in parallel heterogeneous systems....Pages 193-214
Implications of I/O for gang scheduled workloads....Pages 215-237
Improved utilization and responsiveness with gang scheduling....Pages 238-261
Global state detection using network preemption....Pages 262-276
Performance evaluation of gang scheduling for parallel and distributed multiprogramming....Pages 277-298
