FEEDBACK Smiley face
Job Scheduling Strategies for Parallel Processing IPPS/SPDP'98 Workshop Orlando, Florida, USA, March 30, 1998 Proceedings / [electronic resource] : edited by Dror G. Feitelson, Larry Rudolph. - X, 266 p. online resource. - Lecture Notes in Computer Science, 1459 0302-9743 ; . - Lecture Notes in Computer Science, 1459 .

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.

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.

9783540685364

10.1007/BFb0053977 doi


Computer science.
Microprocessors.
Architecture, Computer.
Computer programming.
Operating systems (Computers).
Algorithms.
Computer Science.
Computer System Implementation.
Operating Systems.
Programming Techniques.
Algorithm Analysis and Problem Complexity.
Processor Architectures.
Register-Transfer-Level Implementation.

QA76.9.A73 QA76.9.S88

003.3

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in