1 option
Job Scheduling Strategies for Parallel Processing : IPPS '97 Workshop, Geneva, Switzerland, April 5, 1997, Proceedings / edited by Dror G. Feitelson, Larry Rudolph.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1291.
- Lecture Notes in Computer Science, 0302-9743 ; 1291
- Language:
- English
- Subjects (All):
- Computer architecture.
- Operating systems (Computers).
- Computer programming.
- Algorithms.
- Microprocessors.
- Logic design.
- Computer System Implementation.
- Operating Systems.
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Processor Architectures.
- Logic Design.
- Local Subjects:
- Computer System Implementation.
- Operating Systems.
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Processor Architectures.
- Logic Design.
- Physical Description:
- 1 online resource (VII, 305 pages).
- Edition:
- First edition 1997.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
- System Details:
- text file PDF
- Summary:
- 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, et cetera.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-69599-8
- 9783540695998
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.