Dynamic and Static Task Allocation for Hard Real-time Video Stream Decoding on NoCs

TY - JOUR

T1 - Dynamic and Static Task Allocation for Hard Real-time Video Stream Decoding on NoCs

AU - Mendis, Hashan Roshantha

AU - Audsley, Neil Cameron

AU - Soares Indrusiak, Leandro

PY - 2017/7/7

Y1 - 2017/7/7

N2 - Hard real-time (HRT) video systems require admission control decisions that rely on two factors. Firstly, schedulability analysis of the data-dependent, communicating tasks within the application need to be carried out in order to guarantee timing and predictability. Secondly, the allocation of the tasks to multi-core processing elements would generate different results in the schedulability analysis. Due to the conservative nature of the state-of-the-art schedulability analysis of tasks and message flows, and the unpredictability in the application, the system resources are often under-utilised. In this paper we propose two blocking-aware dynamic task allocation techniques that exploit application and platform characteristics, in order to increase the number of simultaneous, fully schedulable, video streams handled by the system. A novel, worst-case response time aware, search-based, static hard real-time task mapper is introduced to act as an upper-baseline to the proposed techniques. Further evaluations are carried out against existing heuristic-based dynamic mappers. Improvements to the admission rates and the system utilisation under a range of different workloads and platform sizes are explored.

AB - Hard real-time (HRT) video systems require admission control decisions that rely on two factors. Firstly, schedulability analysis of the data-dependent, communicating tasks within the application need to be carried out in order to guarantee timing and predictability. Secondly, the allocation of the tasks to multi-core processing elements would generate different results in the schedulability analysis. Due to the conservative nature of the state-of-the-art schedulability analysis of tasks and message flows, and the unpredictability in the application, the system resources are often under-utilised. In this paper we propose two blocking-aware dynamic task allocation techniques that exploit application and platform characteristics, in order to increase the number of simultaneous, fully schedulable, video streams handled by the system. A novel, worst-case response time aware, search-based, static hard real-time task mapper is introduced to act as an upper-baseline to the proposed techniques. Further evaluations are carried out against existing heuristic-based dynamic mappers. Improvements to the admission rates and the system utilisation under a range of different workloads and platform sizes are explored.

U2 - 10.4230/LITES-v004-i002-a001

DO - 10.4230/LITES-v004-i002-a001

M3 - Article

SN - 2199-2002

VL - 4

SP - 1

EP - 25

JO - LITES: Leibniz Transactions on Embedded Systems

JF - LITES: Leibniz Transactions on Embedded Systems

IS - 2

M1 - 1

ER -