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 Rudolphen Limba Engleză Paperback – 16 oct 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.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (7) | 317.08 lei 43-57 zile | |
| Springer – 18 oct 2000 | 317.08 lei 43-57 zile | |
| Springer – 13 oct 1999 | 318.73 lei 43-57 zile | |
| Springer – 5 aug 1998 | 319.75 lei 43-57 zile | |
| Springer Berlin, Heidelberg – 16 oct 1996 | 320.37 lei 43-57 zile | |
| Springer – 27 aug 1997 | 322.01 lei 43-57 zile | |
| Springer Berlin, Heidelberg – 30 oct 2001 | 323.73 lei 43-57 zile | |
| Springer – 19 iul 1995 | 325.06 lei 43-57 zile |
Din seria Lecture Notes in Computer Science
- 20%
Preț: 1020.28 lei -
Preț: 395.25 lei - 20%
Preț: 327.36 lei - 20%
Preț: 556.96 lei - 20%
Preț: 400.77 lei - 15%
Preț: 558.12 lei - 20%
Preț: 328.94 lei - 20%
Preț: 340.04 lei - 20%
Preț: 487.46 lei - 20%
Preț: 629.71 lei - 20%
Preț: 386.08 lei - 20%
Preț: 489.11 lei - 20%
Preț: 620.33 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 782.57 lei - 20%
Preț: 679.09 lei - 20%
Preț: 330.54 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 435.28 lei - 20%
Preț: 375.72 lei - 20%
Preț: 342.61 lei - 20%
Preț: 432.78 lei - 20%
Preț: 904.16 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 373.80 lei - 20%
Preț: 400.17 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 984.64 lei - 20%
Preț: 560.93 lei - 20%
Preț: 731.97 lei - 20%
Preț: 563.29 lei - 20%
Preț: 403.00 lei - 20%
Preț: 793.92 lei - 20%
Preț: 324.19 lei - 20%
Preț: 733.68 lei - 20%
Preț: 336.86 lei - 20%
Preț: 327.36 lei - 20%
Preț: 573.45 lei - 20%
Preț: 558.53 lei - 20%
Preț: 850.42 lei - 20%
Preț: 560.93 lei - 20%
Preț: 560.93 lei - 20%
Preț: 631.96 lei - 20%
Preț: 568.70 lei - 20%
Preț: 488.90 lei - 20%
Preț: 293.24 lei
Preț: 320.37 lei
Preț vechi: 400.47 lei
-20%
Puncte Express: 481
Preț estimativ în valută:
56.64€ • 67.53$ • 49.12£
56.64€ • 67.53$ • 49.12£
Carte tipărită la comandă
Livrare economică 16-30 martie
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
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/practitionerCuprins
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