Job scheduling strategies for parallel processing

Job Scheduling Strategies for Parallel Processing: 7th International Workshop, JSSPP 2001 Cambridge, MA, USA, June 16, 2001 Revised Papers
Author: Dror G. Feitelson, Larry Rudolph
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42817-6
DOI: 10.1007/3-540-45540-X

Table of Contents:

• Performance Evaluation with Heavy Tailed Distributions
• SRPT Scheduling for Web Servers
• An Efficient and Scalable Coscheduling Technique for Large Symmetric Multiprocessor Clusters
• Coscheduling under Memory Constraints in a NOW Environment
• The Influence of Communication on the Performance of Co-allocation
• Core Algorithms of the Maui Scheduler
• On the Development of an Efficient Coscheduling System
• Effects of Memory Performance on Parallel Job Scheduling
• An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration
• Characteristics of a Large Shared Memory Production Workload
• Metrics for Parallel Job Scheduling and Their Convergence