Real-time safety-critical systems are getting more complex by integrating multiple applications with different criticality levels on a single platform. The increasing complexity in the design of mixed-criticality real-time systems has motivated researchers to move from uniprocessor to multiprocessor platforms. In this paper, we focus on the time-triggered scheduling of both independent and dependent mixed-criticality jobs on an identical multiprocessor platform. We show that our algorithm is more efficient than the Mixed criticality Priority Improvement (MCPI) algorithm, the only existing such algorithm for a multiprocessor platform.
CITATION STYLE
Behera, L., & Bhaduri, P. (2018). Time-Triggered Scheduling for Multiprocessor Mixed-Criticality Systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10722 LNCS, pp. 135–151). Springer Verlag. https://doi.org/10.1007/978-3-319-72344-0_10
Mendeley helps you to discover research relevant for your work.