Job Scheduling Strategies for Parallel Processing IPDPS 2000 Workshop, JSSPP 2000, Cancun, Mexico, May 1, 2000 Proceedings / edited by Dror G. Feitelson, Larry Rudolph.

Saved in:

Bibliographic Details
Corporate Author:	SpringerLink (Online service)
Other Authors:	Feitelson, Dror G. (Editor), Rudolph, Larry (Editor)
Format:	eBook
Language:	English
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
Edition:	1st ed. 2000.
Series:	Lecture Notes in Computer Science, 1911 Springer eBook Collection.
Subjects:	Operating systems (Computers). Architecture, Computer. Computer programming. Algorithms. Microprocessors. Computer hardware. Electronic resources (E-books)
Online Access:	Click to view e-book
Holy Cross Note:	Loaded electronically. Electronic access restricted to members of the Holy Cross Community.

Table of Contents:

Effect of Job Size Characteristics on Job Scheduling Performance
Improving Parallel Job Scheduling Using Runtime Measurements
Valuation of Ultra-scale Computing Systems
System Utilization Benchmark on the Cray T3E and IBM SP
A Critique of ESP
Resource Allocation Schemes for Gang Scheduling
A Tool to Schedule Parallel Applications on Multiprocessors: The NANOS CPU Manager
Time-Sharing Parallel Jobs in the Presence of Multiple Resource Requirements
The Performance Impact of Advance Reservation Meta-scheduling
The Influence of the Structure and Sizes of Jobs on the Performance of Co-allocation
Load Balancing for Minimizing Execution Time of a Target Job on a Network of Heterogeneous Workstations
Adaptive Selection of Partition Size for Supercomputer Requests.

Similar Items