Publication: Task Partitioning and Priority Assigment for Hard Real-Time Distributed System
Loading...
Creative Commons license
Publication date
2013-12-03
Defense date
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
Universidad Carlos III de Madrid
Impact
Export
To cite this item, use the following identifier: https://hdl.handle.net/10016/17915
Abstract
The partitioning of flxed-priority hard real-time tasks and messages in a distributed system is a well know NP-hard problem. Therefore, there are no methods that provide an optimal solution in polynomial time. In this paper, we propose the Distributed using Optimal Priority Assignment (DOPA) heuristic, which simultaneously solves the problem of assigning task to processors and assigning priorities to tasks. DOPA makes use of Audsley's ptimal Priority Assignment (OPA) algorithm to assign priorities to tasks and messages. However, in order to use the OPA algorithm for task sets with dependencies, we first transform the task set into a set of independent tasks by imposing intermedíate deadlines. The experimental results show how the utilisation of the OPA algorithm increases in average the number of schedulable tasks and messages in a distributed system when compared to the utilisation of the Deadline Monotonic (DM) priority assignment usually used in other works.
Note
REACTION 2013. 2nd International Workshop on Real-time and distributed computing in emerging applications. December 3rd, 2013, Vancouver, Canada.
Keywords
Sistemas en tiempo real, Sistemas distribuidos, Cloud computing, Real-time, Distributed systems, Task allocation, Priority assignment, Intermediate deadlines, Holistic analysis, Scheduling
Funder
Research project
Bibliographic citation
REACTION 2013, co-located with IEEE RTSS. Vancouver, Canada. December 3rd, 2013. Universidad Carlos III de Madrid, 2013, pp. 25-30.