Job Scheduling Strategies for Parallel Processing

Editat de Dror G. Feitelson, Larry Rudolph

en Limba Engleză Paperback – 5 aug 1998

This book constitutes the thoroughly refereed post-workshop proceedings of the 4th International Workshop on Job Scheduling Strategies for Parallel Processing held during IPPS/SPDP'98, in Orlando, Florida, USA, in March 1998. The 13 revised full papers presented have gone through an iterated reviewing process and give a report on the state of the art in the area.

Citește tot Restrânge

Toate formatele și edițiile

	Preț	Express
Paperback (7)	317^.08 lei 6-8 săpt.
Springer – 18 oct 2000	317^.08 lei 6-8 săpt.
Springer – 13 oct 1999	318^.73 lei 6-8 săpt.
Springer – 5 aug 1998	319^.75 lei 6-8 săpt.
Springer Berlin, Heidelberg – 16 oct 1996	320^.37 lei 6-8 săpt.
Springer – 27 aug 1997	322^.01 lei 6-8 săpt.
Springer Berlin, Heidelberg – 30 oct 2001	323^.73 lei 6-8 săpt.
Springer – 19 iul 1995	325^.06 lei 6-8 săpt.

Preț: 319^.75 lei

Preț vechi: 399^.68 lei
-20% Nou

Puncte Express: 480

:
56^.57€ • 65^.91$ • 49^.40£

Carte tipărită la comandă

Livrare economică 17-31 ianuarie 26

Adaugă în coș

Wish list
Gift list
Am citit!

Adaugă în listă

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540648253
ISBN-10: 3540648259
Pagini: 272
Ilustrații: X, 266 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.42 kg
Ediția:1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Metrics and benchmarking for parallel job scheduling.- A comparative study of real workload traces and synthetic workload models for parallel job scheduling.- Lachesis: A job scheduler for the cray T3E.- A resource management architecture for metacomputing systems.- Implementing the combination of time sharing and space sharing on AP/Linux.- Job scheduling scheme for pure space sharing among rigid jobs.- Predicting application run times using historical information.- Job scheduling strategies for networks of workstations.- Probabilistic loop scheduling considering communication overhead.- Improving first-come-first-serve job scheduling by gang scheduling.- Expanding symmetric multiprocessor capability through gang scheduling.- Overhead analysis of preemptive gang scheduling.- Dynamic coscheduling on workstation clusters.

Caracteristici

Includes supplementary material: sn.pub/extras

Papetărie, jocuri, reviste