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 (1) | 317.08 lei 6-8 săpt. | |
| Springer – 18 oct 2000 | 317.08 lei 6-8 săpt. | |
| Paperback (1) | 325.06 lei 6-8 săpt. | |
| Springer – 19 iul 1995 | 325.06 lei 6-8 săpt. | |
| Paperback (1) | 320.37 lei 6-8 săpt. | |
| Springer Berlin, Heidelberg – 16 oct 1996 | 320.37 lei 6-8 săpt. | |
| Paperback (1) | 322.01 lei 6-8 săpt. | |
| Springer – 27 aug 1997 | 322.01 lei 6-8 săpt. | |
| Paperback (1) | 319.75 lei 6-8 săpt. | |
| Springer – 5 aug 1998 | 319.75 lei 6-8 săpt. | |
| Paperback (1) | 323.73 lei 6-8 săpt. | |
| Springer Berlin, Heidelberg – 30 oct 2001 | 323.73 lei 6-8 săpt. | |
| Paperback (1) | 318.73 lei 6-8 săpt. | |
| Springer – 13 oct 1999 | 318.73 lei 6-8 săpt. |
Din seria Lecture Notes in Computer Science
- 20%
Preț: 323.14 lei - 20%
Preț: 461.32 lei - 20%
Preț: 460.98 lei - 20%
Preț: 390.41 lei - 20%
Preț: 526.98 lei - 15%
Preț: 388.21 lei - 20%
Preț: 461.21 lei - 20%
Preț: 390.08 lei - 20%
Preț: 496.30 lei - 20%
Preț: 461.21 lei - 20%
Preț: 389.45 lei - 15%
Preț: 461.53 lei - 20%
Preț: 389.63 lei - 20%
Preț: 496.68 lei - 20%
Preț: 461.70 lei - 20%
Preț: 251.97 lei - 20%
Preț: 390.86 lei - 20%
Preț: 532.16 lei - 20%
Preț: 461.52 lei - 20%
Preț: 255.72 lei - 20%
Preț: 498.10 lei - 20%
Preț: 497.19 lei - 20%
Preț: 499.02 lei - 20%
Preț: 389.82 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.86 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.08 lei - 20%
Preț: 461.45 lei - 20%
Preț: 392.36 lei - 20%
Preț: 460.75 lei - 20%
Preț: 461.32 lei - 20%
Preț: 389.90 lei - 20%
Preț: 639.26 lei - 20%
Preț: 390.66 lei - 20%
Preț: 391.57 lei - 20%
Preț: 389.57 lei - 20%
Preț: 497.97 lei - 20%
Preț: 462.36 lei - 20%
Preț: 460.67 lei - 20%
Preț: 423.95 lei - 5%
Preț: 515.91 lei - 15%
Preț: 535.55 lei - 20%
Preț: 531.90 lei - 20%
Preț: 403.00 lei - 20%
Preț: 535.41 lei - 20%
Preț: 461.25 lei - 20%
Preț: 498.17 lei - 20%
Preț: 461.52 lei - 20%
Preț: 249.77 lei
Preț: 320.37 lei
Preț vechi: 400.47 lei
-20%
Puncte Express: 481
Preț estimativ în valută:
56.70€ • 66.26$ • 49.23£
56.70€ • 66.26$ • 49.23£
Carte tipărită la comandă
Livrare economică 20 februarie-06 martie
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
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