Performance characteristics of gang scheduling in multiprogrammed environments
Gang scheduling provides both space-slicing and time-slicing of computer resources for parallel programs. Each thread of execution from a parallel job is concurrently scheduled on an independent processor in order to achieve an optimal level of program performance. Time-slicing of parallel jobs prov...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: |
Social and professional topics
> Professional topics
> Computing profession
> Testing, certification and licensing
Software and its engineering
> Software creation and management
> Software verification and validation
Software and its engineering
> Software creation and management
> Software verification and validation
> Software defect analysis
Software and its engineering
> Software organization and properties
> Software system structures
> Distributed systems organizing principles
Theory of computation
> Theory and algorithms for application domains
> Machine learning theory
> Reinforcement learning
|
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Gang scheduling provides both space-slicing and time-slicing of computer resources for parallel programs. Each thread of execution from a parallel job is concurrently scheduled on an independent processor in order to achieve an optimal level of program performance. Time-slicing of parallel jobs provides for better overall system responsiveness and utilization than otherwise possible. Lawrence Livermore National Laboratory has deployed three generations of its gang scheduler on a variety of computing platforms. Results indicate the potential benefits of this technology to parallel processing are no less significant than time-sharing was in the 1960's. |
|---|---|
| DOI: | 10.1145/509593.509647 |