Cantitate/Preț
Produs

Job Scheduling Strategies for Parallel Processing: IPPS '96 Workshop, Honolulu, Hawaii, April 16, 1996. Proceedings: Lecture Notes in Computer Science, cartea 1162

Editat de Dror G. Feitelson, Larry Rudolph
en Limba Engleză Paperback – 16 oct 1996
This book constitutes the strictly refereed post-workshop proceedings of the International Workshop on Job Scheduling Strategies for Parallel Processing, held in conjunction with IPPS '96 symposium in Honolulu, Hawaii, in April 1996.
The book presents 15 thoroughly revised full papers accepted for inclusion on the basis of the reports of at least five program committee members. The volume is a highly competent contribution to advancing the state-of-the-art in the area of job scheduling for parallel supercomputers. Among the topics addressed are job scheduler, workload evolution, gang scheduling, multiprocessor scheduling, parallel processor allocation, and distributed memory environments.
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.

Din seria Lecture Notes in Computer Science

Preț: 32037 lei

Preț vechi: 40047 lei
-20% Nou

Puncte Express: 481

Preț estimativ în valută:
5668 6664$ 4964£

Carte tipărită la comandă

Livrare economică 29 ianuarie-12 februarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540618645
ISBN-10: 3540618643
Pagini: 308
Ilustrații: VIII, 300 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.44 kg
Ediția:1996
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Professional/practitioner

Cuprins

Toward convergence in job schedulers for parallel supercomputers.- Workload evolution on the Cornell Theory Center IBM SP2.- The EASY — LoadLeveler API project.- A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm.- Architecture-independent request-scheduling with tight waiting-time estimations.- Packing schemes for gang scheduling.- A gang scheduling design for multiprogrammed parallel computing environments.- Implementation of gang-scheduling on workstation cluster.- Managing checkpoints for parallel programs.- Using runtime measured workload characteristics in parallel processor scheduling.- Parallel application characterization for multiprocessor scheduling policy design.- Dynamic vs. static quantum-based parallel processor allocation.- Dynamic versus adaptive processor allocation policies for message passing parallel computers: An empirical comparison.- Dynamic partitioning in different distributed-memory environments.- Locality-information-based scheduling in shared-memory multiprocessors.

Caracteristici

Includes supplementary material: sn.pub/extras