A survey of research into mixed criticality systems

A Burns, RI Davis - ACM Computing Surveys (CSUR), 2017 - dl.acm.org
This survey covers research into mixed criticality systems that has been published since
Vestal's seminal paper in 2007, up until the end of 2016. The survey is organised along the …

[PDF][PDF] Mixed criticality systems-a review

A Burns, R Davis - Department of Computer Science, University of York …, 2013 - Citeseer
This review covers research on the topic of mixed criticality systems that has been published
since Vestal's 2007 paper. It covers the period up to and including July 2015. The review is …

Cyber–physical systems: A perspective at the centennial

KD Kim, PR Kumar - Proceedings of the IEEE, 2012 - ieeexplore.ieee.org
Cyber-physical systems (CPSs) are the next generation of engineered systems in which
computing, communication, and control technologies are tightly integrated. Research on …

[BUCH][B] Hard real-time computing systems

GC Buttazzo, G Buttanzo - 1997 - Springer
Real-time computing plays a crucial role in our society since an increasing number of
complex systems rely, in part or completely, on computer control. Examples of applications …

Priority inheritance protocols: An approach to real-time synchronization

L Sha, R Rajkumar, JP Lehoczky - IEEE Transactions on …, 1990 - ieeexplore.ieee.org
An investigation is conducted of two protocols belonging to the priority inheritance protocols
class; the two are called the basic priority inheritance protocol and the priority ceiling …

[PDF][PDF] The rate monotonic scheduling algorithm: Exact characterization and average case behavior

J Lehoczky, L Sha, Y Ding - RTSS, 1989 - bears.ece.ucsb.edu
This paper presents an exact characterization of the ability of the rate monotonic scheduling
algorithm to meet the deadlines of a periodic task set. In addition, a stochastic analysis is …

Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance

S Vestal - 28th IEEE international real-time systems symposium …, 2007 - ieeexplore.ieee.org
This paper is based on a conjecture that the more confidence one needs in a task execution
time bound (the less tolerant one is of missed deadlines), the larger and more conservative …

Fixed priority scheduling of periodic task sets with arbitrary deadlines

JP Lehoczky - [1990] Proceedings 11th Real-Time Systems …, 1990 - ieeexplore.ieee.org
Consideration is given to the problem of fixed priority scheduling of period tasks with
arbitrary deadlines. A general criterion for the schedulability of such a task set is given …

Stack-based scheduling of realtime processes

TP Baker - Real-Time Systems, 1991 - Springer
Abstract The Priority Ceiling Protocol (PCP) of Sha, Rajkumar and Lehoczky is a policy for
locking binary semaphores that bounds priority inversion (ie, the blocking of a job while a …

Aperiodic task scheduling for hard-real-time systems

B Sprunt, L Sha, J Lehoczky - Real-Time Systems, 1989 - Springer
A real-time system consists of both aperiodic and periodic tasks. Periodic tasks have regular
arrival times and hard deadlines. Aperiodic tasks have irregular arrival times and either soft …