Job scheduling strategies for parallel processing : IPPS/SPDP'99 workshop, [5th workshop] JSSPP'99, San Juan, Puerto Rico, April 16, 1999 : proceedings

Uloženo v:
Podrobná bibliografie
Korporace: International Workshop on Job Scheduling Strategies for Parallel Processing :San Juan, International Parallel Processing Symposium (Autor)
Další autoři: Feitelson, Dror, 1960- (Šéfredaktor, odpovědný redaktor), Rudolph, Larry, 1954- (Šéfredaktor, odpovědný redaktor)
Médium: Livre numérique
Jazyk:Anglais
Vydáno: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Edice:Lecture notes in computer science 1659
Témata:
On-line přístup:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Poznámka: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Job scheduling strategies for parallel processing, IPPS/SPDP'99 workshop, JSSPP'99, San Juan, Puerto Rico, April 16, 1999, proceedings, Dror G. Feitelson, Larry Rudolph (eds.), 1999, New York, Springer, 1 vol. (135 p.), Lecture notes in computer science, 3-540-66676-1
• Job Scheduling Strategies for Parallel Processing, Texte imprimé, 9783662173770
Obsah:
  • 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.