2013
DOI: 10.1109/tc.2012.243
|View full text |Cite
|
Sign up to set email alerts
|

Period Selection for Minimal Hyperperiod in Periodic Task Systems

Abstract: Abstract-Task period and deadline selection are often used to adjust the workload to the available computational resources. This paper presents a method for adjusting the periods of the tasks which obtains the minimal hyper-period. Task periods are modelled as a range of possible periods. The selected periods are not constrained to be natural numbers, but can also be rational numbers. Without this limitation, the resulting hyper-period is much smaller than that of previous works. Hyper-period for natural perio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
17
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 38 publications
(17 citation statements)
references
References 17 publications
0
17
0
Order By: Relevance
“…Similarly, while computing periods for a given tasks' set, different approaches for reducing the hyper-period are presented in [29,40]. However, the underlying assumption for the validity of such research is that given tasks are executed over a uni-processor platform independently.…”
Section: Related Workmentioning
confidence: 99%
“…Similarly, while computing periods for a given tasks' set, different approaches for reducing the hyper-period are presented in [29,40]. However, the underlying assumption for the validity of such research is that given tasks are executed over a uni-processor platform independently.…”
Section: Related Workmentioning
confidence: 99%
“…Harmonic task periods have some potential benefits, both for scheduling analysis and for control system design [8], [9]. The hyperperiod of a harmonic task set is finite and small [10], [11]. RM scheduling of harmonic tasks is feasible if the utilization is less than or equal to 1, e.g., [12].…”
Section: Related Workmentioning
confidence: 99%
“…The schedule of partitions repeats every major cycle. In the case that the complexity (size) of the schedule would be an issue, a technique to reduce MC, such as one proposed in[25], could be applied to reduce the complexity (size) of the schedule 7. Although there are a large number of symbols used, this is a consequence of the richness of the scheduling model (i.e., the number of relevant parameters for which we will derive values).…”
mentioning
confidence: 99%