Name
Title | ||
|---|---|---|
Partitioned Scheduling of Implicit-deadline Sporadic Task Systems under Multiple Resource Constraints |
Abstract | ||
|---|---|---|
On many multiprocessor platforms each individual processor may have limited amounts of several different kinds of resources such as computing capacity, local memory, and network bandwidth. In order to partition tasks effectively upon such platforms the partitioning algorithm should be cognizant of all the resource constraints. We present and evaluate an algorithm for partitioning a collection of implicit-deadline sporadic tasks upon a multiprocessor platform in a manner that is cognizant of multiple such resource constraints. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/RTCSA.2012.27 | RTCSA |
Keywords | Field | DocType |
partitioned scheduling,local memory,multiprocessor platform,multiple resource constraints,network bandwidth,partitioning algorithm,different kind,implicit-deadline sporadic task,individual processor,resource constraint,implicit-deadline sporadic task systems,limited amount,approximation algorithms,computational modeling,memory management,algorithm design and analysis | Metrical task system,Approximation algorithm,Multiprocessor scheduling,Algorithm design,Scheduling (computing),Computer science,Multiprocessing,Real-time computing,Memory management,Bandwidth (signal processing),Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.35 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bipasa Chattopadhyay | 1 | 73 | 4.02 |
| Sanjoy K. Baruah | 2 | 4664 | 374.79 |