Name
Abstract | ||
|---|---|---|
Algorithms for scheduling independent tasks on to the processors of a multiprocessor system must trade-off processor load balance, memory locality, and scheduling overhead. Most existing algorithms, however, do not adequately balance these conflicting factors. This paper introduces the self-adjusting dynamic scheduling (SADS) class of algorithms that use a unified cost model to explicitly account for these factors at runtime. A dedicated processor performs scheduling in phases by maintaining a tree of partial schedules and incrementally assigning tasks to the least-cost schedule. A scheduling phase terminates whenever any processor becomes idle, at which time partial schedules are distributed to the processors. An extension of the basic SADS algorithm, called DBSADS, controls the scheduling overhead by giving higher priority to partial schedules with more task-to-processor assignments. These algorithms are compared to two distributed scheduling algorithms within a database application on an Intel Paragon distributed memory multiprocessor system. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/71.888636 | Parallel and Distributed Systems, IEEE Transactions |
Keywords | Field | DocType |
computational complexity,distributed memory systems,performance evaluation,processor scheduling,resource allocation,Intel Paragon distributed memory multiprocessor,database application,dynamic task scheduling,memory locality,multiprocessor system,online optimization,partial schedules,processor load balance,scheduling overhead,self-adjusting dynamic scheduling,task-to-processor assignments | Fixed-priority pre-emptive scheduling,Multiprocessor scheduling,Fair-share scheduling,Computer science,Parallel computing,Two-level scheduling,Real-time computing,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling,Distributed computing | Journal |
Volume | Issue | ISSN |
11 | 11 | 1045-9219 |
Citations | PageRank | References |
24 | 1.12 | 50 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hamidzadeh Babak | 1 | 184 | 24.99 |
| Lau Ying Kit | 2 | 24 | 1.12 |
| David J. Lilja | 3 | 1878 | 175.33 |