Job scheduling strategies for parallel processing : IPPS '97 Workshop, Geneva, Switzerland, April 5, 1997 : proceedings

This book constitutes the strictly refereed post-workshop proceedings of the 1997 IPPS Workshop on Job Scheduling Strategies for Parallel Processing held in Geneva, Switzerland, in April 1997, as a satelite meeting of the IEEE/CS International Parallel Processing Symposium. The 12 revised full paper...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor Corporativo: International Parallel Processing Symposium :Genève, Suisse
Otros Autores: Feitelson, Dror, 1960- (Director de publicación), Rudolph, Larry, 1954- (Director de publicación)
Formato: Livre numérique
Lenguaje:Anglais
Publicado: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Colección:Lecture notes in computer science 1291
Materias:
Acceso en línea:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Nota: 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 '97 Workshop, Geneva, Switzerland, April 5, 1997 proceedings, Dror G. Feitelson, Larry Rudolph, eds, 1997, Berlin, Springer, 1 vol. (VI-299 p.), Lecture notes in computer science, 3-540-63574-2
• Job Scheduling Strategies for Parallel Processing, Texte imprimé, 9783662197943
Tabla de Contenidos:
  • Theory and practice in parallel job scheduling
  • Using queue time predictions for processor allocation
  • A historical application profiler for use by parallel schedulers
  • Memory usage in the LANL CM-5 workload
  • Modeling of workload in MPPs
  • PScheD Political scheduling on the CRAY T3E
  • An experimental evaluation of processor pool-based scheduling for shared-memory NUMA multiprocessors
  • Implementing multiprocessor scheduling disciplines
  • Objective-oriented algorithm for job scheduling in parallel heterogeneous systems
  • Implications of I/O for gang scheduled workloads
  • Improved utilization and responsiveness with gang scheduling
  • Global state detection using network preemption
  • Performance evaluation of gang scheduling for parallel and distributed multiprogramming.