Job Scheduling Strategies for Parallel Processing [electronic resource] : IPPS/SPDP’99Workshop, JSSPP’99 San Juan, Puerto Rico, April 16, 1999 Proceedings / edited by Dror G. Feitelson, Larry Rudolph.Material type: TextLanguage: English Series: Lecture Notes in Computer Science: 1659Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1999Description: VIII, 244 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540479543Subject(s): Computer science | Logic design | Operating systems (Computers) | Computer software | Computer Science | Operating Systems | Programming Techniques | Algorithm Analysis and Problem Complexity | Processor Architectures | Logic DesignAdditional physical formats: Printed edition:: No titleDDC classification: 005.43 LOC classification: QA76.76.O63Online resources: Click here to access online
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.