Job scheduling strategies for parallel processing : IPPS '97 Workshop, Geneva, Switzerland, April 5, 1997 : proceedings
Author(s)
Bibliographic Information
Job scheduling strategies for parallel processing : IPPS '97 Workshop, Geneva, Switzerland, April 5, 1997 : proceedings
(Lecture notes in computer science, 1291)
Springer-Verlag, c1997
Available at / 49 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
pbk.L/N||LNCS||129197035492
-
INTERNATIONAL CHRISTIAN UNIVERSITY LIBRARY図
V.1291007.6/L507/v.129105010980,
007.6/L507/v.129105010980 -
University of Tsukuba Library, Library on Library and Information Science
: pbk007.08:L-49:1291971006820
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
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.
Table of 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.
by "Nielsen BookData"