Abstract
Designing cost-efficient multi-core real-time systems requires efficient techniques to allocate applications to cores while satisfying their timing constraints. However, existing approaches typically allocate using a First-Fit algorithm, which does not consider the execution time and potential parallelism of paths in the applications, resulting in over-dimensioned systems.
This work addresses this problem by proposing a new heuristic algorithm, Critical-Path-First, for the allocation of real-time streaming applications modeled as dataflow graphs on 2D mesh multi-core processors. The main criteria of the algorithm is to allocate paths that have the highest impact on the execution time of the application first. It is also able to exploit parallelism in the application by allocating parallel paths on different cores. Experimental evaluation shows that the proposed heuristic improves the resource utilization by allocating up to 7% more applications and it minimizes the average end-to-end worst-case response time of the allocated applications by up to 31%.
Original language | English |
---|---|
Title of host publication | Proceedings of the 19th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), 19-21 Augustus 2013, Taipei, Taiwan |
Place of Publication | Piscataway |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 201-208 |
DOIs | |
Publication status | Published - 2013 |
Event | 19th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2013 - GIS NTU Convention Center, Taipei, Taiwan Duration: 19 Aug 2013 → 21 Aug 2013 Conference number: 19 |
Conference
Conference | 19th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2013 |
---|---|
Abbreviated title | RTCSA 2013 |
Country/Territory | Taiwan |
City | Taipei |
Period | 19/08/13 → 21/08/13 |
Other | RTCSA-2013 |