Blick ins Buch

Job Scheduling Strategies for Parallel Processing

IPPS '97 Workshop, Geneva, Switzerland, April 5, 1997, Proceedings

Dror G. Feitelson, Larry Rudolph (Herausgeber)

Buch | Softcover

VII, 305 Seiten

1997
Springer Berlin (Verlag)
978-3-540-63574-1 (ISBN)

Lese- und Medienproben

Inhaltsverzeichnis (PDF)

Artikel merken

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.

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.

Erscheint lt. Verlag	27.8.1997
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	VII, 305 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	412 g
Themenwelt	Mathematik / Informatik ► Informatik ► Betriebssysteme / Server
Themenwelt	Mathematik / Informatik ► Informatik ► Theorie / Studium
Schlagworte	algorithm • Algorithm analysis and problem complexity • algorithms • Hardcover, Softcover / Informatik, EDV/Betriebssysteme, Benutzeroberflächen • HC/Informatik, EDV/Betriebssysteme, Benutzeroberflächen • Job Scheduling • Load Balancing • Modeling • multiprocessor architectures • Networking • Parallelprogrammierung • parallel scheduling • Processor • programming • Scheduling
ISBN-10	3-540-63574-2 / 3540635742
ISBN-13	978-3-540-63574-1 / 9783540635741
Zustand	Neuware