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

Kelly, Owen R.; Aydın, Hakan; Zhao, Baoxian

doi:10.1109/trustcom.2011.144

Cited by 44 publications

(47 citation statements)

References 19 publications

(51 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…• DU-RMS: a scheduling algorithm from [20] in which the workloads are arranged in descending order based on their utilization and higher priorities are allocated to workloads with lower inter-arrival time (i.e., Decreasing Utilization-Rate Monotonic Scheduling);…”

Section: Experiments and Resultsmentioning

confidence: 99%

See 1 more Smart Citation

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

Section: Experiments and Resultsmentioning

confidence: 99%

“…They proposed an SIL-based WCET for the tasks and a dispatching algorithm for mapping tasks to processor [20]. In order to explore both general and criticality mode change protocols, Burns surveyed the pessimistic assumptions of high criticality tasks in the higher criticality modes [21].…”

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

show abstract

“…This work differs from the approach we consider in this paper in that it assumes the existence of a run-time mechanism that terminates tasks of a particular criticality level if the criticality level attributed to the behaviour of the system exceeds that level. In Kelly et al (2011), we explored the partitioned scheduling of mixed-criticality systems, considering the relative importance of the two key dimensions of this problem, namely task allocation and priority assignment.…”

Section: Related Workmentioning

confidence: 99%

“…In Kelly et al (2011), we explored the use of Audsley's algorithm in the partitioned scheduling of mixed-criticality task sets where it was applied following the allocation step for the scheduling of the subset of tasks allocated to each processor. We found that it offered a significant performance gain over RM priority assignment in this setting.…”

Section: Audsley's Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Fixed-priority global scheduling for mixed-criticality real-time systems

Kelly¹,

Aydın²

2014

IJES

Self Cite

View full text Add to dashboard Cite

There has been a growing interest in recent years in mixed-criticality real-time systems in which tasks are attributed different levels of criticality based on the degree to which their deadlines must be assured. While most of the initial efforts on mixed-criticality systems targeted single-processor systems, the research community has recently started to investigate multiprocessor mixed-criticality real-time systems. In this paper we investigate how global, fixed-priority algorithms can be applied in the context of multiprocessor mixed-criticality systems. We identify the two key dimensions of the problem -priority assignment and schedulability testing, and consider candidate algorithms for each dimension. We also propose a new and simple priority assignment policy called CPRatio that considers both task criticality and timing constraints to improve the schedulability of mixed-criticality task sets. We experimentally evaluate the performance of priority assignment strategies and schedulability tests in the global multiprocessor mixed-criticality scheduling context. Keywords: mixed-criticality; real-time scheduling; global scheduling; fixed-priority scheduling; multiprocessor scheduling; schedulability tests.

show abstract

On the Homogeneous Multiprocessor Virtual Machine Partitioning Problem

Groesbrink

2013

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Abstract. This work addresses the partitioning of virtual machines with real-time requirements onto a multi-core platform. The partitioning is usually done manually through interactions between subsystem vendors and system designers. Such a proceeding is expensive, does not guarantee to find the best solution, and does not scale with regard to the upcoming higher complexity in terms of an increasing number of both virtual machines and processor cores. The partitioning problem is defined in a formal manner by the abstraction of computation time demand of virtual machines and computation time supply of a shared processor. The application of a branch-and-bound partitioning algorithm is proposed. Combined with a generation of a feasible schedule for the virtual machines mapped to a processor, it is guaranteed that the demand of a virtual machine is satisfied, even if independently developed virtual machines share a processor. The partitioning algorithm offers two optimization goals, required number of processors and the introduced optimization metric criticality distribution, a first step towards a partitioning that considers multiple criticality levels. The different outcomes of the two approaches are illustrated exemplarily.

show abstract

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

Cited by 44 publications

References 19 publications

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

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

Fixed-priority global scheduling for mixed-criticality real-time systems

On the Homogeneous Multiprocessor Virtual Machine Partitioning Problem

Contact Info

Product

Resources

About