Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE), 2013 2013
DOI: 10.7873/date.2013.271
|View full text |Cite
|
Sign up to set email alerts
|

Holistic Design Parameter Optimization of Multiple Periodic Resources in Hierarchical Scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 13 publications
(20 citation statements)
references
References 0 publications
0
20
0
Order By: Relevance
“…Thus the partition sizes are assumed to be predefined. The interested reader in partition parameter selection problem is referred to [7,31]. 9 A Physical-I/O is not a partition but a time duration for raw I/O operation.…”
Section: Formal Modelmentioning
confidence: 99%
“…Thus the partition sizes are assumed to be predefined. The interested reader in partition parameter selection problem is referred to [7,31]. 9 A Physical-I/O is not a partition but a time duration for raw I/O operation.…”
Section: Formal Modelmentioning
confidence: 99%
“…The worst-case release pattern of τ s occurs when τ s and all high-priority tasks are released simultaneously [16]. Using response time analysis [17] we can determine an upper bound to the interference experienced by τ s for a given core π m as follows:…”
Section: Assignment Of Security Tasks With Period Adaptationmentioning
confidence: 99%
“…For the security server with unknown capacity Q and replenishment period P , we can derive the lower (upper) bound of Q (P ) that makes security tasks τ i ∈ Γ S running under server schedulable by using periodic server model introduced in literature [14] [15] [16]. The key idea from previous work is that a task τ i can be schedulable if minimum supply for the server can match the maximum workload generated by τ i and hp(τ i ) during a time interval t. If the server task τ S is scheduled by a fixed-priority scheme, the minimum supply of the server is delivered to the security tasks when its (k−1)-th execution has just finished with minimum interference from the high-priority real-time tasks τ j ∈ Γ R .…”
Section: A Linear Lower-bound Supply Functionmentioning
confidence: 99%