Utility accrual object distribution in MPSoC real-time embedded systems

This paper considers object-based real-time embedded systems on MPSoCs. Objects provide system services to the real-time tasks. Each task is subject to a time/utility function (TUF) which determines the accrued utility of the task according to its completion time. One major problem in such systems is to place the objects on the processing elements (PEs) in the MPSoC so as to maximize the total accrued utility. In this regard, we propose a utility accrual object distribution (UAOD) algorithm consisting of two phases. In the first phase, the PEs are reserved for the most beneficial tasks in an offline manner. The reservation is constituted of some proposed methods for object placement, object replication, deadline decomposition, and deadline adaptation. For the objects which are not placed in the reservation, UAOD follows a load-balancing approach to place them on the PEs. As the second phase, UAOD performs an online scheduling over the tasks assigned to each PE in the offline object placement. An extension of this algorithm, namely UAOD⁎ is also proposed for the situations where the exact task execution-times are not known a priori. Simulation results reveal that the total accrued utility is improved with the proposed algorithms comparing to the traditional object placement methods.

► Proposing methods of utility-accrual object distribution over MPSoC real-time systems. ► Employing object replication, deadline decomposition, and deadline adaptation methods. ► Improving utility accrual in overloaded conditions using resource reservation. ► Showing robustness of the proposed method for dynamic workloads through experiments. ► Making a trade-off between the task importance and the accrued utility.