Name
Title | ||
|---|---|---|
Minimizing Stack Memory for Hard Real-Time Applications on Multicore Platforms with Partitioned Fixed-Priority or EDF Scheduling. |
Abstract | ||
|---|---|---|
Multicore processors are increasingly adopted in resource-constrained real-time embedded applications. In the development of such applications, efficient use of RAM memory is as important as the effective scheduling of software tasks. Preemption Threshold Scheduling (PTS) is a well-known technique for controlling the degree of preemption, possibly improving system schedulability, and to reduce system stack usage. In this paper, we consider partitioned multi-processor scheduling on a multicore processor with either Fixed-Priority or Earliest Deadline First scheduling algorithms with PTS and address the design optimization problem of mapping tasks to processor cores and assignment of task priorities and preemption thresholds with the optimization objective of minimizing system stack usage. We present both optimal solution techniques based on Mixed Integer Linear Programming and efficient heuristic algorithms that can achieve high-quality results. We perform extensive performance evaluations using both synthetic tasksets and industrial case studies.
|
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2846096 | ACM Trans. Design Autom. Electr. Syst. |
Keywords | Field | DocType |
Multicore, partitioned scheduling, real-time scheduling | Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Parallel computing,Deadline-monotonic scheduling,Real-time computing,Two-level scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling | Journal |
Volume | Issue | ISSN |
21 | 3 | 1084-4309 |
Citations | PageRank | References |
6 | 0.41 | 24 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chao Wang | 1 | 895 | 190.04 |
| Chuansheng Dong | 2 | 30 | 4.06 |
| Haibo Zeng | 3 | 62 | 5.84 |
| Zonghua Gu | 4 | 748 | 51.23 |