Name
Abstract | ||
|---|---|---|
ABSTRACTArbitrary processor affinities are used in multiprocessor systems to specify the processors on which a task can be scheduled. However, affinity constraints can prevent some high priority real-time tasks from being scheduled, while lower priority tasks execute. This paper presents an implementation and evaluation of the Strong Arbitrary Processor Affinity scheduling on a real-time operating system, an approach that not only respects user-defined affinities, but also supports migration of a higher priority task to allow execution of a task limited by affinity constraints. Results show an improvement in response and turnaround times of higher priority tasks. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1145/3477244.3477623 | Embedded Systems Week |
Keywords | DocType | Citations |
RTOS, RTEMS, SMP, APA Scheduling | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richi Dubey | 1 | 0 | 0.34 |
| Vijay Banerjee | 2 | 0 | 0.34 |
| Sena Hounsinou | 3 | 0 | 1.01 |
| Gedare Bloom | 4 | 68 | 13.95 |