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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Feitelson, Dror G. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Rudolph, Larry (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
• Έκδοση: 1st ed. 2000.
• Σειρά: Lecture Notes in Computer Science, 1911
• Θέματα: Operating systems (Computers).; Architecture, Computer.; Computer programming.; Algorithms.; Microprocessors.; Computer hardware.; Operating Systems.; Computer System Implementation.; Programming Techniques.; Algorithm Analysis and Problem Complexity.; Processor Architectures.; Computer Hardware.

Πίνακας περιεχομένων:

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