1 option
Job Scheduling Strategies for Parallel Processing : IPPS/SPDP'98 Workshop, Orlando, Florida, USA, March 30, 1998 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 ; 1459.
- Lecture Notes in Computer Science, 0302-9743 ; 1459
- Language:
- English
- Subjects (All):
- Computer architecture.
- Operating systems (Computers).
- Computer programming.
- Algorithms.
- Microprocessors.
- Computer System Implementation.
- Operating Systems.
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Processor Architectures.
- Register-Transfer-Level Implementation.
- Local Subjects:
- Computer System Implementation.
- Operating Systems.
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Processor Architectures.
- Register-Transfer-Level Implementation.
- Physical Description:
- 1 online resource (X, 266 pages).
- Edition:
- First edition 1998.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
- System Details:
- text file PDF
- Summary:
- This book constitutes the thoroughly refereed post-workshop proceedings of the 4th International Workshop on Job Scheduling Strategies for Parallel Processing held during IPPS/SPDP'98, in Orlando, Florida, USA, in March 1998. The 13 revised full papers presented have gone through an iterated reviewing process and give a report on the state of the art in the area.
- Contents:
- Metrics and benchmarking for parallel job scheduling
- A comparative study of real workload traces and synthetic workload models for parallel job scheduling
- Lachesis: A job scheduler for the cray T3E
- A resource management architecture for metacomputing systems
- Implementing the combination of time sharing and space sharing on AP/Linux
- Job scheduling scheme for pure space sharing among rigid jobs
- Predicting application run times using historical information
- Job scheduling strategies for networks of workstations
- Probabilistic loop scheduling considering communication overhead
- Improving first-come-first-serve job scheduling by gang scheduling
- Expanding symmetric multiprocessor capability through gang scheduling
- Overhead analysis of preemptive gang scheduling
- Dynamic coscheduling on workstation clusters.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-68536-4
- 9783540685364
- 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.