reine Buchbestellungen ab 5 Euro senden wir Ihnen Portofrei zuDiesen Artikel senden wir Ihnen ohne weiteren Aufpreis als PAKET

Job Scheduling Strategies for Parallel Processing
(Englisch)
IPPS/SPDP'99 Workshop, JSSPP'99, San Juan, Puerto Rico, April 16, 1999, Proceedings
Feitelson, Dror & Rudolph, Larry

Print on Demand - Dieser Artikel wird für Sie gedruckt!

44,95 €

inkl. MwSt. · Portofrei
Dieses Produkt wird für Sie gedruckt, Lieferzeit ca. 10 Werktage
Menge:

Job Scheduling Strategies for Parallel Processing

Seiten
Erscheinungsdatum
Auflage
Ausstattung
Erscheinungsjahr
Sprache
Abbildungen
Serienfolge
alternative Ausgabe
Vertrieb
Kategorie
Buchtyp
Warengruppenindex
Warengruppe
Laenge
Breite
Hoehe
Gewicht
Herkunft
Relevanz
Referenznummer
Verantwortlich für dieses Produkt
  • Springer Gabler
    in Springer-Verlag GmbH
    Heidelberger Platz 3
    DE-14197 Berlin
Moluna-Artikelnummer
  • 4897815

Produktbeschreibung

Includes supplementary material: sn.pub/extras


Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization.- On the Design and Evaluation of Job Scheduling Algorithms.- Comparing Logs and Models of Parallel Workloads Using the Co-plot Method.- Benchmarks and Standards for the Evaluation of Parallel Job Schedulers.- The Effect of Correlating Quantum Allocation and Job Size for Gang Scheduling.- Scheduling on AP/Linux for Fine and Coarse Grain Parallel Processes.- Job Re-packing for Enhancing the Performance of Gang Scheduling.- Process Tracking for Parallel Job Control.- The Legion Resource Management System.- Scheduling a Metacomputer with Uncooperative Sub-schedulers.- Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance.- Deterministic Batch Scheduling without Static Partitioning.

This volume contains the papers presented at the f th workshop on Job SchedulingStrategiesforParallelProcessing,whichwasheldinconjunctionwith the IPPS/SPDP 99conference in San Juan, Puerto Rico, on April 16, 1999.The papers have been through a complete refereeing process, with the full version beingreadandevaluatedbyv etosevenmembersoftheprogramcommittee.We would like to take this opportunity to thank the program committee, Andrea Arpaci-Dusseau, Stephen Booth, Allen Downey, Allan Gottlieb, Atsushi Hori, PhilKrueger,RichardLagerstrom,MironLivny,VirginiaLo,ReaganMoore,Bill Nitzberg,UweSchwiegelshohn,KenSevcik,MarkSquillante,andJohnZahorjan, for an excellent job. Thanks are also due to the authors for their submissions, presentations,and nal revisionsfor this volume. Finally,we wouldlike to thank the MIT Laboratory for Computer Science and the Computer Science Institute at the Hebrew Universityfor the use of their facilities in the preparationof these proceedings. Thiswasthe fth annualworkshopinthis series,whichre?ectsthe continued interest in this eld. The previous four were held in conjunction with IPPS 95 through IPPS/SPDP 98. Their proceedings are available from Springer-Verlag as volumes 949, 1162, 1291, and 1459 of the Lecture Notes in Computer Science series. Sinceour rstworkshop,parallelprocessinghas evolvedtothe pointwhereit is no longer synonymous with scienti c computing on massively parallel sup- computers. In fact, enterprise computing on one hand and metasystems on the other hand often overshadow the original uses of parallel processing. This shift has underscored the importance of job scheduling in multi-user parallelsystems. Correspondingly, we had a session in the workshop devoted to job scheduling on standalonesystems, emphasizing gang scheduling, and another on scheduling for meta-systems. A third session continued the trend from previous workshops of discussing evaluation methodology and workloads. Aninnovationthisyearwasapaneldiscussiononthepossiblestandardization ofaworkloadbenchmarkthatwillservefortheevaluationofdi erentschedulers.


Inhaltsverzeichnis



Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization.- On the Design and Evaluation of Job Scheduling Algorithms.- Comparing Logs and Models of Parallel Workloads Using the Co-plot Method.- Benchmarks and Standards for the Evaluation of Parallel Job Schedulers.- The Effect of Correlating Quantum Allocation and Job Size for Gang Scheduling.- Scheduling on AP/Linux for Fine and Coarse Grain Parallel Processes.- Job Re-packing for Enhancing the Performance of Gang Scheduling.- Process Tracking for Parallel Job Control.- The Legion Resource Management System.- Scheduling a Metacomputer with Uncooperative Sub-schedulers.- Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance.- Deterministic Batch Scheduling without Static Partitioning.


Klappentext



scheduling, and another on scheduling for meta-systems. A third session continued the trend from previous workshops of discussing evaluation methodology and workloads. Aninnovationthisyearwasapaneldiscussiononthepossiblestandardization ofaworkloadbenchmarkthatwillservefortheevaluationofdi erentschedulers.




Includes supplementary material: sn.pub/extras



Datenschutz-Einstellungen