Critical-path-first based allocation of real-time streaming applications on 2D mesh-type multi-cores.

Hazem Ali, Luis Miguel Pinho, K.B. Akesson

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

8 Citations (Scopus)
220 Downloads (Pure)


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 languageEnglish
Title of host publicationProceedings of the 19th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), 19-21 Augustus 2013, Taipei, Taiwan
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Publication statusPublished - 2013
Eventconference; RTCSA-2013; 2013-08-19; 2013-08-21 -
Duration: 19 Aug 201321 Aug 2013


Conferenceconference; RTCSA-2013; 2013-08-19; 2013-08-21


Dive into the research topics of 'Critical-path-first based allocation of real-time streaming applications on 2D mesh-type multi-cores.'. Together they form a unique fingerprint.

Cite this