scispace - formally typeset
Journal ArticleDOI

Priority inheritance protocols: an approach to real-time synchronization

TLDR
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 protocol, both of which solve the uncontrolled priority inversion problem.
Abstract
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 protocol. Both protocols solve the uncontrolled priority inversion problem. The priority ceiling protocol solves this uncontrolled priority inversion problem particularly well; it reduces the worst-case task-blocking time to at most the duration of execution of a single critical section of a lower-priority task. This protocol also prevents the formation of deadlocks. Sufficient conditions under which a set of periodic tasks using this protocol may be scheduled is derived. >

read more

Citations
More filters
Journal ArticleDOI

Applying new scheduling theory to static priority pre-emptive scheduling

TL;DR: The paper presents exact schedulability analyses for real-time systems scheduled at runtime with a static priority pre-emptive dispatcher and the predictions that follow are seen to be in close agreement with the behaviour exhibited during simulation studies.
Book

The Real-Time Specification for Java

TL;DR: RTSJ's features and the thinking behind the specification's design are explained, which aims to provide a platform-a Java execution environment and application program interface (API) that lets programmers correctly reason about the temporal behavior of executing software.
Journal ArticleDOI

Aperiodic task scheduling for real-time systems

TL;DR: A new algorithm is presented, the Sporadic Server algorithm, which greatly improves response times for soft deadline a periodic tasks and can guarantee hard deadlines for both periodic and aperiodic tasks.
Journal ArticleDOI

A survey of hard real-time scheduling for multiprocessor systems

TL;DR: The survey outlines fundamental results about multiprocessor real-time scheduling that hold independent of the scheduling algorithms employed, and provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes.
Journal ArticleDOI

Stack-based scheduling for realtime processes

TL;DR: It is shown how to extend the Priority Ceiling Protocol to handle: multiunit resources, which subsume binary semaphores and reader-writer locks; dynamic priority schemes, such as earliest-deadline-first (EDF), that use static “preemption levels”; sharing of runtime stack space between jobs.
References
More filters
Journal ArticleDOI

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

TL;DR: The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service and it is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization.
Proceedings ArticleDOI

The rate monotonic scheduling algorithm: exact characterization and average case behavior

TL;DR: An exact characterization of the ability of the rate monotonic scheduling algorithm to meet the deadlines of a periodic task set and a stochastic analysis which gives the probability distribution of the breakdown utilization of randomly generated task sets are represented.
Dissertation

Fundamental design problems of distributed systems for the hard-real-time environment

TL;DR: This work shall provide a graph-based computation model which is more suitable for expressing the computation requirements of the real-time environment, and is an extension of CONSORT (Control Structure Optimized for Real-Time), an experimental software design system.
Journal ArticleDOI

Experience with processes and monitors in Mesa

TL;DR: These problems are addressed by the facilities described here for concurrent programming in Mesa, and experience with several substantial applications gives us some confidence in the validity of the solutions.
Related Papers (5)