Job Scheduling Strategies for Parallel Processing IPPS/SPDP'99 Workshop, JSSPP'99, San Juan, Puerto Rico, April 16, 1999, Proceedings /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Feitelson, Dror G. (Editor, http://id.loc.gov/vocabulary/relators/edt), Rudolph, Larry (Editor, http://id.loc.gov/vocabulary/relators/edt)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
• Edition: 1st ed. 1999.
• Series: Lecture Notes in Computer Science, 1659
• Subjects: Operating systems (Computers).; Computer programming.; Architecture, Computer.; Algorithms.; Microprocessors.; Logic design.; Operating Systems.; Programming Techniques.; Computer System Implementation.; Algorithm Analysis and Problem Complexity.; Processor Architectures.; Logic Design.

Table 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.