Task partitioning and priority assignment for distributed hard real-time systems
Ref: CISTER-TR-151001 Publication Date: Dec 2015
Task partitioning and priority assignment for distributed hard real-time systems
Ref: CISTER-TR-151001 Publication Date: Dec 2015Abstract:
In this paper, we propose the Distributed using Optimal Priority Assignment (DOPA) heuristic that finds a feasible partitioning and priority assignment for distributed applications based on the linear transactional model. DOPA partitions the tasks and messages in the distributed system, and makes use of the Optimal Priority Assignment (OPA) algorithm known as Audsley's algorithm, to find the priorities for that partition. The experimental results show how the use of the OPA algorithm increases in average the number of schedulable tasks and messages in a distributed system when compared to the use of Deadline Monotonic (DM) usually favoured in other works. Afterwards, we extend these results to the assignment of Parallel/Distributed applications and present a second heuristic named Parallel-DOPA (P-DOPA). In that case, we show how the partitioning process can be simplified by using the Distributed Stretch Transformation (DST), a parallel transaction transformation algorithm introduced in [1].
Ricardo Garibay-MartÃnez
Geoffrey Nelissen
Luis Lino Ferreira
Luis Miguel PinhoPublished in Journal of Computer and System Sciences (JCSS), Elsevier, Volume 81, Issue 8, pp 1542-1555.
DOI:doi:10.1016/j.jcss.2015.05.005.
ISSN: 0022-0000.
Record Date: 12, Oct, 2015