Job Scheduling Strategies for Parallel Processing IPPS '97 Workshop, Geneva, Switzerland, April 5, 1997, 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, 1997.
• Έκδοση: 1st ed. 1997.
• Σειρά: Lecture Notes in Computer Science, 1291
• Θέματα: Architecture, Computer.; Operating systems (Computers).; Computer programming.; Algorithms.; Microprocessors.; Logic design.; Computer System Implementation.; Operating Systems.; Programming Techniques.; Algorithm Analysis and Problem Complexity.; Processor Architectures.; Logic Design.

 This book constitutes the strictly refereed post-workshop proceedings of the 1997 IPPS Workshop on Job Scheduling Strategies for Parallel Processing held in Geneva, Switzerland, in April 1997, as a satelite meeting of the IEEE/CS International Parallel Processing Symposium. The 12 revised full papers presented were carefully reviewed and revised for inclusion in the book. Also included is a detailed introduction surveying the state of the art in the area. Among the topics covered are processor allocation, parallel scheduling, massively parallel processing, shared-memory architectures, gang scheduling, etc. 

 Theory and practice in parallel job scheduling -- Using queue time predictions for processor allocation -- A historical application profiler for use by parallel schedulers -- Memory usage in the LANL CM-5 workload -- Modeling of workload in MPPs -- PScheD Political scheduling on the CRAY T3E -- An experimental evaluation of processor pool-based scheduling for shared-memory NUMA multiprocessors -- Implementing multiprocessor scheduling disciplines -- Objective-oriented algorithm for job scheduling in parallel heterogeneous systems -- Implications of I/O for gang scheduled workloads -- Improved utilization and responsiveness with gang scheduling -- Global state detection using network preemption -- Performance evaluation of gang scheduling for parallel and distributed multiprogramming.