Job scheduling strategies for parallel processing : IPPS/SPDP' 98 Workshop Orlando, Florida, USA, March 30, 1998 : proceedings
This book constitutes the thoroughly refereed post-workshop proceedings of the 4th International Workshop on Job Scheduling Strategies for Parallel Processing held during IPPS/SPDP'98, in Orlando, Florida, USA, in March 1998. The 13 revised full papers presented have gone through an iterated re...
محفوظ في:
| مؤلف مشترك: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science
1459 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
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 '98 Workshop, Orlando, Florida, USA, March 30, 1998, proceedings, Dror G. Feitelson, Larry Rudolph, eds, 1998, Berlin, Springer, 1 vol. (256 p.), Lecture notes in computer science, 3-540-64825-9 • Job Scheduling Strategies for Parallel Processing, Texte imprimé, 9783662211526 |
جدول المحتويات:
- Metrics and benchmarking for parallel job scheduling
- A comparative study of real workload traces and synthetic workload models for parallel job scheduling
- Lachesis: A job scheduler for the cray T3E
- A resource management architecture for metacomputing systems
- Implementing the combination of time sharing and space sharing on AP/Linux
- Job scheduling scheme for pure space sharing among rigid jobs
- Predicting application run times using historical information
- Job scheduling strategies for networks of workstations
- Probabilistic loop scheduling considering communication overhead
- Improving first-come-first-serve job scheduling by gang scheduling
- Expanding symmetric multiprocessor capability through gang scheduling
- Overhead analysis of preemptive gang scheduling
- Dynamic coscheduling on workstation clusters.