Job Scheduling Strategies for Parallel Processing
IPPS '97 Workshop, Geneva, Switzerland, April 5, 1997, Proceedings
Published on 27. August 1997
Book
Paperback/Softback
VII, 305 pages
978-3-540-63574-1 (ISBN)
Description
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.
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.
More details
Series
Edition
1997 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
VII, 305 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 18 mm
Weight
482 gr
ISBN-13
978-3-540-63574-1 (9783540635741)
DOI
10.1007/3-540-63574-2
Schweitzer Classification
Content
Theory and practice in parallel job scheduling.- Using queue time predictions for processor allocation.- A historical application profiler for use by parallel schedulers.- Memory usage in the LANL CM-5 workload.- Modeling of workload in MPPs.- PScheD Political scheduling on the CRAY T3E.- An experimental evaluation of processor pool-based scheduling for shared-memory NUMA multiprocessors.- Implementing multiprocessor scheduling disciplines.- Objective-oriented algorithm for job scheduling in parallel heterogeneous systems.- Implications of I/O for gang scheduled workloads.- Improved utilization and responsiveness with gang scheduling.- Global state detection using network preemption.- Performance evaluation of gang scheduling for parallel and distributed multiprogramming.