Cantitate/Preț
Produs

Job Scheduling Strategies for Parallel Processing

Editat de Dror G. Feitelson, Larry Rudolph
en Limba Engleză Paperback – 13 oct 1999
This volume contains the papers selected after a very careful refereeing process for presentation during the Workshop on Job Scheduling Stategies for Parallel Processing, held in Santa Barbara, California, as a prelude to the IPPS '95 conference in April 1995.
The 19 full papers presented demonstrate that parallel job scheduling takes on a crucial role as multi-user parallel supercomputers become more widespread. All aspects of job scheduling for parallel systems are covered, from the perspectives of academic research, industrial design of parallel systems, as well as user needs. Of particular interest, also for nonexpert readers, is the introductory paper "Parallel Job Scheduling: Issues and Approaches" by the volume editors.
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.

Preț: 31873 lei

Preț vechi: 39841 lei
-20% Nou

Puncte Express: 478

Preț estimativ în valută:
5639 6630$ 4939£

Carte tipărită la comandă

Livrare economică 28 ianuarie-11 februarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540666769
ISBN-10: 3540666761
Pagini: 252
Ilustrații: VIII, 244 p.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.39 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization.- On the Design and Evaluation of Job Scheduling Algorithms.- Comparing Logs and Models of Parallel Workloads Using the Co-plot Method.- Benchmarks and Standards for the Evaluation of Parallel Job Schedulers.- The Effect of Correlating Quantum Allocation and Job Size for Gang Scheduling.- Scheduling on AP/Linux for Fine and Coarse Grain Parallel Processes.- Job Re-packing for Enhancing the Performance of Gang Scheduling.- Process Tracking for Parallel Job Control.- The Legion Resource Management System.- Scheduling a Metacomputer with Uncooperative Sub-schedulers.- Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance.- Deterministic Batch Scheduling without Static Partitioning.

Caracteristici

Includes supplementary material: sn.pub/extras