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

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (7) 31708 lei  6-8 săpt.
  Springer – 18 oct 2000 31708 lei  6-8 săpt.
  Springer – 13 oct 1999 31873 lei  6-8 săpt.
  Springer – 5 aug 1998 31975 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 16 oct 1996 32037 lei  6-8 săpt.
  Springer – 27 aug 1997 32201 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 30 oct 2001 32373 lei  6-8 săpt.
  Springer – 19 iul 1995 32506 lei  6-8 săpt.

Preț: 32201 lei

Preț vechi: 40251 lei
-20% Nou

Puncte Express: 483

Preț estimativ în valută:
5697 6647$ 4981£

Carte tipărită la comandă

Livrare economică 17-31 ianuarie 26

Preluare comenzi: 021 569.72.76

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.

Caracteristici

Includes supplementary material: sn.pub/extras