Name
Abstract | ||
|---|---|---|
Sequencing and assignment are two important issues we need to address when scheduling real-time tasks on a multiprocessor architecture. Different problem represen-tations can schedule such tasks, each emphasizing either a sequencing or assignment task. A sequence-oriented representation satisfies problem constraints by emphasizing the search for an appropriate tasks order, while an as-signment- oriented representation emphasizes the search for an appropriate assignment of tasks. The authors introduce the RT-SADS algorithm, which uses an assignment-oriented representation to dynamically schedule tasks on the processors of a NUMA architecture. The proposed technique automatically controls and allocates the scheduling time to minimize the scheduling overhead and deadline violation of real-time tasks. The authors compare RT-SADS' performance with another dynamic algorithm that uses a sequence-oriented repre-sentation. The results show interesting performance trade-offs among the candidate algorithms. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/4434.736402 | Concurrency, IEEE |
Keywords | Field | DocType |
multiprocessing systems,parallel architectures,processor scheduling,NUMA architecture,RT-SAD algorithm,assignment-oriented representation,multiprocessor architecture,problem constraints,real-time tasks,scheduling,sequence-oriented representation | Multiprocessor scheduling,Computer science,Scheduling (computing),Load balancing (computing),Parallel computing,Generalized assignment problem,Deadline-monotonic scheduling,Multiprocessing,Dynamic priority scheduling,Dynamic problem,Distributed computing | Journal |
Volume | Issue | ISSN |
6 | 4 | 1092-3063 |
Citations | PageRank | References |
4 | 0.50 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hamidzadeh Babak | 1 | 184 | 24.99 |
| Yacine Atif | 2 | 306 | 37.88 |