Job scheduling strategies for parallel processing

Job Scheduling Strategies for Parallel Processing: IPPS/SPDP’99Workshop, JSSPP’99 San Juan, Puerto Rico, April 16, 1999 Proceedings<br />Author: Dror G. Feitelson, Larry Rudolph<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-66676-9<br /> DOI: 10.1007/3-540-47954-6<br /><br />Table of Contents:<p></p><ul><li>Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization </li><li>On the Design and Evaluation of Job Scheduling Algorithms </li><li>Comparing Logs and Models of Parallel Workloads Using the Co-plot Method </li><li>Benchmarks and Standards for the Evaluation of Parallel Job Schedulers </li><li>The Effect of Correlating Quantum Allocation and Job Size for Gang Scheduling </li><li>Scheduling on AP/Linux for Fine and Coarse Grain Parallel Processes </li><li>Job Re-packing for Enhancing the Performance of Gang Scheduling </li><li>Process Tracking for Parallel Job Control </li><li>The Legion Resource Management System </li><li>Scheduling a Metacomputer with Uncooperative Sub-schedulers </li><li>Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance </li><li>Deterministic Batch Scheduling without Static Partitioning</li></ul>