2016
DOI: 10.1155/2016/3414816
|View full text |Cite
|
Sign up to set email alerts
|

Control-Scheduling Codesign Exploiting Trade-Off between Task Periods and Deadlines

Abstract: A control task’s performance heavily depends on its sampling frequency and sensing-to-actuation delay. More frequent sampling, that is, shorter period, improves the control performance. Similarly, shorter delay also has a positive effect. Moreover, schedulability is also a function of periods and deadlines. By taking into account the control performance and schedulability at the same time, this paper defines a period and deadline selection problem for fixed-priority systems. Our problem is to find the optimal … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(12 citation statements)
references
References 12 publications
0
12
0
Order By: Relevance
“…Bini et al proposed the branch-bound search based task scheduler with fixed priorities in order to maximize the system performance without violation of deadlines [18]. Likewise, Hyun-Jun Cha et al developed a deadline monotonic task scheduler for optimality of deadline and period constraints in automotive systems [19].…”
Section: Conventional Scheduling Algorithms On Real-time Embedded Iot Systemsmentioning
confidence: 99%
“…Bini et al proposed the branch-bound search based task scheduler with fixed priorities in order to maximize the system performance without violation of deadlines [18]. Likewise, Hyun-Jun Cha et al developed a deadline monotonic task scheduler for optimality of deadline and period constraints in automotive systems [19].…”
Section: Conventional Scheduling Algorithms On Real-time Embedded Iot Systemsmentioning
confidence: 99%
“…Cha et al [58] propose a method for scheduling of control tasks which determines the deadline and period of the tasks for achieving maximum QoC. The method optimizes the QoC of the control applications and resource utilization.…”
Section: Related Workmentioning
confidence: 99%
“…The time complexity of their proposed system is deterministic, and thus the proposed method is appropriate for online applications. More recently, Cha et al [37] developed a searching-based heuristic scheme to compute near-optimal values for feasible task periods such that the overall performance of the system is maximised. The time complexity of their proposed algorithm is linear and hence suitable for online use.…”
Section: Related Workmentioning
confidence: 99%