Mixed-Criticality Real-Time Scheduling for Multicore Systems

Mollison, Malcolm S.; Erickson, Jeremy P.; Anderson, James H.; Baruah, Sanjoy; Scoredos, John A.

doi:10.1109/cit.2010.320

Cited by 120 publications

(70 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Differently from this, the new theory performs a paradigm shift towards asymmetric isolation, as pointed out in [2]. Some previous literature achieves this goal by on-demand best-effort priority switching in favor of highly critical tasks [2], others assume that lower-critical tasks are soft real-time [4].…”

Section: Introductionmentioning

confidence: 99%

Mixed Critical Earliest Deadline First

Socci

Poplavko

Bensalem

et al. 2013

2013 25th Euromicro Conference on Real-Time Systems

View full text Add to dashboard Cite

Using the advances of the modern microelectronics technology, the safety-critical systems, such as avionics, can reduce their costs by integrating multiple tasks on one device. This makes such systems essentially mixed-critical, as this brings together different tasks whose error probability requirements may differ by an order of magnitude 10 6 . In the context of mixed-critical scheduling theory, we studied the problem of scheduling a finite set of jobs. In this work we propose an algorithm which is proved to dominate OCBP, one of the best scheduling algorithms for this problem. We show through empirical studies that our algorithm can reduce the set of non-schedulable instances by a factor of 2.5 or, under certain assumptions, by a factor of 4.5, when compared to OCBP.

show abstract

Section: Introductionmentioning

confidence: 99%

Mixed Critical Earliest Deadline First

Socci

Poplavko

Bensalem

et al. 2013

2013 25th Euromicro Conference on Real-Time Systems

View full text Add to dashboard Cite

show abstract

“…In contrast, we apply traditional, fixedpriority uniprocessor scheduling, but with schedulability analysis performed using the model proposed by Vestal in [21], and our focus is the assessment of variation in partitioning and priority assignment approaches in terms of their impact on schedulability in a mixed-criticality setting. Mixed-criticality, multiprocessor scheduling is also considered in [19], which extends the work presented in [1]. These papers propose a twolevel, hierarchical scheduling framework that makes use of container tasks, with a different type of container task applied to the scheduling of tasks at each criticality level.…”

Section: Related Workmentioning

confidence: 88%

On Partitioned Scheduling of Fixed-Priority Mixed-Criticality Task Sets

Kelly

Aydın

Zhao

2011

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications

View full text Add to dashboard Cite

Abstract-Mixed-criticality real-time systems, where tasks may be associated with different criticality and assurance levels, have attracted much attention in the recent past. In this paper, we consider partitioning-based multiprocessor scheduling of mixedcriticality real-time task sets. Guaranteeing feasibility in this setting is shown to be NP-Hard. With a focus on fixed-priority preemptive scheduling on each processor, we identify the two main aspects of the problem, namely the task allocation and priority assignment dimensions. For the task allocation dimension, we propose and compare bin-packing-inspired heuristics, based on offline task ordering according to utilization and criticality. For the priority assignment dimension, we compare the wellknown Rate Monotonic priority assignment policy with Audsley's priority assignment algorithm. Through simulations, we also assess and discuss the relative importance of these two primary dimensions on the overall mixed-criticality feasibility problem for multiprocessor platforms.

show abstract

“…Later, Gu et al [15] extended the work on uniprocessor MC scheduling [16] to multicore systems and presented two improvements for processor schedulability by exploiting criticality-cognizance policy. Mollison et al developed a scheduling heuristic for MC tasks on multicore platforms, implementing various methods (i.e., Cyclic Executive, partitioned-EDF, global-EDF and global best effort) for five different criticalities and enabling temporal isolation between tasks through a bandwidth reservation server [17]. In this work, the more critical tasks are executed with high priorities and the less critical tasks can run in the residual slack time.…”

Section: Related Workmentioning

confidence: 99%

Criticality-cognizant Clustering-based Task Scheduling on Multicore Processors in the Avionics Domain

Nagalakshmi¹,

Gomathi²

2018

IJCIS

View full text Add to dashboard Cite

Scheduling of mixed-criticality systems (MCS) on a common computational platform is challenging because conventional scheduling approaches may cause inefficient utilization of shared computing resources. In this paper, we propose an approach called Clustering-based Partitioned Earliest Deadline First (C-PEDF) algorithm to schedule dual-criticality implicit-deadline sporadic tasks on a homogeneous multicore system. Our C-PEDF scheduling approach exploits (i) a Clustering-based bin-packing algorithm that explicitly accounts the demands of tasks based on their levels of confidence; and (ii) an Enhanced dual-mode scheduling policy to schedule tasks within a core. The proposed C-PEDF integrates every single high-level workload with a group of low-level workloads and coalesces them into a cluster. Within each cluster, tasks are scheduled under our Enhanced dualmode scheduling policy to improve the service level of high-level tasks without jeopardizing the schedulability of low-level tasks. Clusters are scheduled under Earliest Deadline First (EDF) scheduling approach. We conduct a schedulability test for the proposed technique, and we demonstrate how workloads can be clustered by means of Mixed Integer Nonlinear Programming (MINLP) model. Extensive simulation results reveal that our algorithm significantly outperforms other existing approaches both in acceptance ratio and the impact factor of low-level tasks.

show abstract

Mixed-Criticality Real-Time Scheduling for Multicore Systems

Cited by 120 publications

References 13 publications

Mixed Critical Earliest Deadline First

Mixed Critical Earliest Deadline First

On Partitioned Scheduling of Fixed-Priority Mixed-Criticality Task Sets

Criticality-cognizant Clustering-based Task Scheduling on Multicore Processors in the Avionics Domain

Contact Info

Product

Resources

About