Amazon cover image
Image from Amazon.com

Job Scheduling Strategies for Parallel Processing : IPPS '97 Processing Workshop Geneva, Switzerland, April 5, 1997 Proceedings / edited by Dror G. Feitelson, Larry Rudolph.

Contributor(s): Feitelson, Dror G | Rudolph, LarryMaterial type: TextTextSeries: Serienbezeichnung | Lecture notes in computer science ; 1291,Publication details: Berlin ; Heidelberg : Springer-Verlag, 1997. Description: 1 online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540695998; 3540695990Subject(s): Computer science | Logic design | Operating systems (Computers) | Computer software | Operating Systems | Programming Techniques | Algorithm Analysis and Problem Complexity | Processor Architectures | Computer science | Computer software | Logic design | Operating systems (Computers) | Computer Science | Engineering & Applied SciencesGenre/Form: Electronic books. Additional physical formats: Printed edition:: No titleDDC classification: 005.4/3475 LOC classification: QA76.58Online resources: Click here to access online
Contents:
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.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

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.

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.

Powered by Koha