Job Scheduling Strategies for Parallel Processing: IPDPS 2000 Workshop, JSSPP 2000 Cancun, Mexico, May 1, 2000 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the thoroughly refereed post-workshop proceedings of the 6th International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP 2000, held in Cancun, Mexico in May 2000 as a satelite meeting of IPDPS 2000.
The 12 revised full papers presented were carefully reviewed during an iterated evaluation process and present the state of the art in the area.

Author(s): Kento Aida (auth.), Dror G. Feitelson, Larry Rudolph (eds.)
Series: Lecture Notes in Computer Science 1911
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2000

Language: English
Pages: 212
Tags: Operating Systems; Programming Techniques; Algorithm Analysis and Problem Complexity; Processor Architectures; Computer Hardware

Effect of Job Size Characteristics on Job Scheduling Performance....Pages 1-17
Improving Parallel Job Scheduling Using Runtime Measurements....Pages 18-38
Valuation of Ultra-scale Computing Systems....Pages 39-55
System Utilization Benchmark on the Cray T3E and IBM SP....Pages 56-67
A Critique of ESP....Pages 68-73
Resource Allocation Schemes for Gang Scheduling....Pages 74-86
A Tool to Schedule Parallel Applications on Multiprocessors: The NANOS CPU Manager ....Pages 87-112
Time-Sharing Parallel Jobs in the Presence of Multiple Resource Requirements....Pages 113-136
The Performance Impact of Advance Reservation Meta-scheduling....Pages 137-153
The Influence of the Structure and Sizes of Jobs on the Performance of Co-allocation....Pages 154-173
Load Balancing for Minimizing Execution Time of a Target Job on a Network of Heterogeneous Workstations....Pages 174-186
Adaptive Selection of Partition Size for Supercomputer Requests....Pages 187-207