Please use this identifier to cite or link to this item:
Title: Transforming real-time task graphs to improve schedulability
Authors: Gu, C
Guan, N
Feng, Z
Deng, Q
Hu, XS
Yi, W
Keywords: DRT
Real-time systems
Workload shaping
Issue Date: 2016
Publisher: Institute of Electrical and Electronics Engineers Inc.
Source: Proceedings - 2016 IEEE 22nd International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2016, 2016, 7579924, p. 29-38 How to cite?
Abstract: Real-time task graphs are used to describe complex real-time systems with non-cyclic timing behaviors. The workload of such systems are typically bursty, which may degrade their schedulability even with sufficient resource in the long term. In this paper, we propose to use task graph transformation to improve system schedulability. The idea is to insert artificial delays to the release times of certain vertices of a task graph to get a new graph with a smoother workload, while still meeting the timing constraints of the original task graph. Delaying the release time of a vertex may smoothen the workload of some paths of the task graph, but at the same time make the workload of other paths even more bursty. We developed efficient techniques to search for an appropriate release time delay for each vertex. Experiments with randomly generated task systems show that the proposed transformation method can make a significant number of task systems that was originally unschedulable to become schedulable, and the transformation procedure is very efficient and can easily handle large-scale task graph systems in very short computation time.
Description: 22nd IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2016, South Korea, 17-19 August 2016
ISBN: 9781509024797
DOI: 10.1109/RTCSA.2016.13
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Checked on Sep 18, 2017

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.