Cantitate/Preț
Produs
Total produse
Vezi coșul
Job Scheduling Strategies for Parallel Processing: 7th International Workshop, JSSPP 2001, Cambridge, MA, USA, June 16, 2001, Revised Papers de Dror G. Feitelson

Job Scheduling Strategies for Parallel Processing: 7th International Workshop, JSSPP 2001, Cambridge, MA, USA, June 16, 2001, Revised Papers: Lecture Notes in Computer Science, cartea 2221

Editat de Dror G. Feitelson, Larry Rudolph
en Limba Engleză Paperback – 30 oct 2001
This book constitutes the thoroughly refereed post-proceedings of the 7th International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP 2001, held in Cambridge, MA, USA, in June 2001.
The 11 revised full papers presented were carefully selected and improved during two rounds of reviewing and revision, and present state-of-the-art results in the area.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (7) 31708 lei  43-57 zile
  Springer – 18 oct 2000 31708 lei  43-57 zile
  Springer – 13 oct 1999 31873 lei  43-57 zile
  Springer – 5 aug 1998 31975 lei  43-57 zile
  Springer Berlin, Heidelberg – 16 oct 1996 32037 lei  43-57 zile
  Springer – 27 aug 1997 32201 lei  43-57 zile
  Springer Berlin, Heidelberg – 30 oct 2001 32373 lei  43-57 zile
  Springer – 19 iul 1995 32506 lei  43-57 zile

Din seria Lecture Notes in Computer Science

Preț: 32373 lei

Preț vechi: 40466 lei
-20%

Puncte Express: 486
Preț estimativ în valută:
5723€ • 6823$ • 4964£

Carte tipărită la comandă

Livrare economică 16-30 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540428176
ISBN-10: 3540428178
Pagini: 224
Ilustrații: VIII, 216 p.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.53 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Performance Evaluation with Heavy Tailed Distributions.- SRPT Scheduling for Web Servers.- An Efficient and Scalable Coscheduling Technique for Large Symmetric Multiprocessor Clusters.- Coscheduling under Memory Constraints in a NOW Environment.- The Influence of Communication on the Performance of Co-allocation.- Core Algorithms of the Maui Scheduler.- On the Development of an Efficient Coscheduling System.- Effects of Memory Performance on Parallel Job Scheduling.- An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration.- Characteristics of a Large Shared Memory Production Workload.- Metrics for Parallel Job Scheduling and Their Convergence.

Caracteristici

Includes supplementary material: sn.pub/extras