Buch, Englisch, Band 1459, 266 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 417 g
IPPS/SPDP'98 Workshop, Orlando, Florida, USA, March 30, 1998 Proceedings
Buch, Englisch, Band 1459, 266 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 417 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-64825-3
Verlag: Springer Berlin Heidelberg
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Funktionale, Logische, Parallele und Visuelle Programmierung
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Technische Informatik Hochleistungsrechnen, Supercomputer
- Mathematik | Informatik EDV | Informatik Betriebssysteme Windows Betriebssysteme
Weitere Infos & Material
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.
