Job Scheduling Strategies for Parallel Processing
Editat de Dror G. Feitelson, Larry Rudolphen Limba Engleză Paperback – 27 aug 1997
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.
Preț: 322.99 lei
Preț vechi: 403.74 lei
-20%
Puncte Express: 484
Carte tipărită la comandă
Livrare economică 22 mai-05 iunie
Specificații
ISBN-13: 9783540635741
ISBN-10: 3540635742
Pagini: 316
Ilustrații: VII, 305 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.48 kg
Ediția:1997
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540635742
Pagini: 316
Ilustrații: VII, 305 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.48 kg
Ediția:1997
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.