Job Scheduling Strategies for Parallel Processing - Feitelson
Bisher 57,99 €**
56,99 €
versandkostenfrei*

inkl. MwSt.
**Früherer Preis
Versandfertig in 2-4 Wochen
28 °P sammeln
    Broschiertes Buch

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.…mehr

Produktbeschreibung
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.
  • Produktdetails
  • Lecture Notes in Computer Science Vol.1459
  • Verlag: Springer, Berlin
  • Artikelnr. des Verlages: 10638279
  • 1998.
  • Seitenzahl: 272
  • Erscheinungstermin: 5. August 1998
  • Englisch
  • Abmessung: 235mm x 155mm x 14mm
  • Gewicht: 358g
  • ISBN-13: 9783540648253
  • ISBN-10: 3540648259
  • Artikelnr.: 09252683
Inhaltsangabe
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.