Job Scheduling Strategies for Parallel Processing : IPPS '96 Workshop Honolulu, Hawaii, April 16, 1996 Proceedings
This book constitutes the strictly refereed post-workshop proceedings of the International Workshop on Job Scheduling Strategies for Parallel Processing, held in conjunction with IPPS '96 symposium in Honolulu, Hawaii, in April 1996. The book presents 15 thoroughly revised full papers accepted...
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
1162 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
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 '96 workshop, Honolulu, Hawaii, April 16, 1996, proceedings, Dror G. Feitelson, Larry Rudolph, eds, 1996, New York, Springer, 1 vol. (VIII-289 p.), Lecture notes in computer science, 3-540-61864-3 • Job Scheduling Strategies for Parallel Processing, Texte imprimé, 9783662189573 |
Indholdsfortegnelse:
- Toward convergence in job schedulers for parallel supercomputers
- Workload evolution on the Cornell Theory Center IBM SP2
- The EASY LoadLeveler API project
- A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm
- Architecture-independent request-scheduling with tight waiting-time estimations
- Packing schemes for gang scheduling
- A gang scheduling design for multiprogrammed parallel computing environments
- Implementation of gang-scheduling on workstation cluster
- Managing checkpoints for parallel programs
- Using runtime measured workload characteristics in parallel processor scheduling
- Parallel application characterization for multiprocessor scheduling policy design
- Dynamic vs. static quantum-based parallel processor allocation
- Dynamic versus adaptive processor allocation policies for message passing parallel computers: An empirical comparison
- Dynamic partitioning in different distributed-memory environments
- Locality-information-based scheduling in shared-memory multiprocessors.