The Effects of Precedence and Priority Constraints on the Performance of Scan Scheduling for Hypercube Multiprocessors
| Autor: | Phillip Krueger, Davender Babbar |
|---|---|
| Rok vydání: | 1996 |
| Předmět: |
Earliest deadline first scheduling
Job scheduler Rate-monotonic scheduling Computer Networks and Communications Computer science Distributed computing Dynamic priority scheduling Round-robin scheduling computer.software_genre Fair-share scheduling Deadline-monotonic scheduling Theoretical Computer Science Scheduling (computing) Fixed-priority pre-emptive scheduling Artificial Intelligence Hardware and Architecture Two-level scheduling Lottery scheduling computer Software |
| Zdroj: | Journal of Parallel and Distributed Computing. 39:95-104 |
| ISSN: | 0743-7315 |
| Popis: | In the absence of scheduling constraints, Scan scheduling has been shown to considerably improve performance in hypercube multiprocessors relative to previously studied job scheduling disciplines. In practice, jobs may have properties that constrain the choices a job scheduler can make, potentially limiting the scheduler's ability to affect performance. Two common types of job scheduling constraints are precedence and priority constraints. We examine the effects of these constraints on the ability of Scan to improve performance in hypercube systems. We find that, even under severe constraints, Scan scheduling retains its large performance advantage. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect