Etfa2011 2011
DOI: 10.1109/etfa.2011.6059194
|View full text |Cite
|
Sign up to set email alerts
|

Temporal partitioning for mixed-criticality systems

Abstract: In embedded systems, such as aerospace crafts and automobiles, it is desirable to run several real-time applications of different criticality on a single computing board by exploiting temporal partitioning. The applications, however, are usually developed by different organizations independently. Thus providing a seamless way to integrate separate applications on a control board guaranteeing real-time requirements and criticality is a very important issue. In this paper, we suggest a partition model with a mec… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…Few studies have proposed an enhanced method for determining a partition's execution time [36,37]. In this paper, we utilize the algorithm suggested in [37], but the basic discussions in this paper do not depend on a specific scheduling algorithm. There have also been implementation studies of hierarchical scheduling [38][39][40][41][42][43][44].…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Few studies have proposed an enhanced method for determining a partition's execution time [36,37]. In this paper, we utilize the algorithm suggested in [37], but the basic discussions in this paper do not depend on a specific scheduling algorithm. There have also been implementation studies of hierarchical scheduling [38][39][40][41][42][43][44].…”
Section: Related Workmentioning
confidence: 99%
“…The ARINC 653 standard does not define detail scheduling algorithms. We use a mixed‐criticality offline scheduling algorithm for partition scheduling. The basic idea of this algorithm is to generate a partition scheduling table preventing a partition of a low criticality from preempting a partition of a high criticality (i.e., criticality inversion avoidance) while facilitating high throughput.…”
Section: Design Alternatives For Avionics Application Standard Softwamentioning
confidence: 99%
See 1 more Smart Citation
“…We utilize a static priority real-time scheduling algorithm suggested by Jin and Han [7]. We detail the partition scheduling in "Partition Scheduling" section.…”
Section: Figure 1 Overall Design Of Full Virtualization Based Arinc 653mentioning
confidence: 99%
“…Our partition scheduling scheme uses a periodic, fixed-priority partition model with variable execution time [7]. Traditional partition models with fixed execution time can experience either criticality inconsistency or low system utilization.…”
Section: Partition Schedulingmentioning
confidence: 99%