Job Scheduling Strategies for Parallel Processing
Job Scheduling Strategies for Parallel Processing: IPPS/SPDP’99Workshop, JSSPP’99 San Juan, Puerto Rico, April 16, 1999 ProceedingsAuthor: Dror G. Feitelson, Larry Rudolph Published by Springer Berlin Heidelberg ISBN: 978-3-540-66676-9 DOI: 10.1007/3-540-47954-6Table of Contents: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
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
Komentáře
Přihlas se, abys mohl/a přidat komentář.
Zatím žádné komentáře. Buď první!