Cantitate/Preț
Produs

Job Scheduling Strategies for Parallel Processing

Editat de Dror G. Feitelson, Larry Rudolph
en Limba Engleză Paperback – 27 aug 1997
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.
Citește tot Restrânge

Carte tipărită la comandă

Livrare economică 08-22 iulie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.

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

Public țintă

Research

Cuprins

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.