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<br />Author: Dror G. Feitelson, Larry Rudolph<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42817-6<br /> DOI: 10.1007/3-540-45540-X<br /><br />Table of Contents:<p></p><ul><li>Performance Evaluation with Heavy Tailed Distributions
</li><li>SRPT Scheduling for Web Servers
</li><li>An Efficient and Scalable Coscheduling Technique for Large Symmetric Multiprocessor Clusters
</li><li>Coscheduling under Memory Constraints in a NOW Environment
</li><li>The Influence of Communication on the Performance of Co-allocation
</li><li>Core Algorithms of the Maui Scheduler
</li><li>On the Development of an Efficient Coscheduling System
</li><li>Effects of Memory Performance on Parallel Job Scheduling
</li><li>An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration
</li><li>Characteristics of a Large Shared Memory Production Workload
</li><li>Metrics for Parallel Job Scheduling and Their Convergence</li></ul>