Feasibility of Fork-Join Real-Time Task Graph Models: Hardness and Algorithms----Institute of Automation

Feasibility of Fork-Join Real-Time Task Graph Models: Hardness and Algorithms

May 03, 2016Author：

PrintText Size A A

*Click Here to View Full Record

Title:

Feasibility of Fork-Join Real-Time Task Graph Models: Hardness and Algorithms

Authors: Sun, JH; Guan, N; Wang, Y; Deng, QX; Zeng, P; Yi, W

Author Full Names: Sun, Jinghao; Guan, Nan; Wang, Yang; Deng, Qingxu; Zeng, Peng; Yi, Wang

Source:

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 15 (1):10.1145/2809780

2016

Language: English

Abstract: In the formal analysis of real-time systems, modeling of branching codes and modeling of intratask parallelism structures are two of the most important research topics. These two real-time properties are combined, resulting in the fork-join real-time task (FJRT) model, which extends the digraph-based task model with forking and joining semantics. We prove that the EDF schedulability problem on a preemptive uniprocessor for the FJRT model is coNP-hard in the strong sense, even if the utilization of the task system is bounded by a constant strictly less than 1. Then, we show that the problem becomes tractable with some slight structural restrictions on parallel sections, for which we propose an exact schedulability test with pseudo-polynomial time complexity. Our results thus establish a borderline between the tractable and intractable FJRT models.

ISSN:

eISSN:

Article Number:

IDS Number:

DI7BL

Unique ID: WOS:

Journals & Publications

Papers