A real-time configurable synchronization protocol for self-suspending process sets

Authors:
Ya-Shu Chen;Li-Pin Chang
Affiliations:
Department of Electronic Engineering, National Taiwan University of Science and Technology, Taipei, ROC 106;Department of Computer Sciences, National Chiao Tung University, Hsinchu, ROC 300
Venue:
Real-Time Systems
Year:
2009

Citing 11
Cited 1

Dynamic priority ceilings: a concurrency control protocol for real-time systems

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

Journal of the ACM (JACM)
Abort-Oriented Concurrency Control for Real-Time Databases

IEEE Transactions on Computers
Implications of Classical Scheduling Results for Real-Time Systems

Computer
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers
Distance-Constrained Scheduling and Its Applications to Real-Time Systems

IEEE Transactions on Computers
A dynamically adaptable real time data acquisition and display system

RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
A proportional share resource allocation algorithm for real-time, time-shared systems

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Stride Scheduling: Deterministic Proportional- Share Resource Management

Stride Scheduling: Deterministic Proportional- Share Resource Management
Lottery and stride scheduling: flexible proportional-share resource management

Lottery and stride scheduling: flexible proportional-share resource management
A quantification of aborting effect for real-time data accesses

IEEE Transactions on Computers

The scheduling problem of self-suspending periodic real-time tasks

Proceedings of the 20th International Conference on Real-Time and Network Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

While several of researchers have proposed excellent protocols on resource synchronization, little work has been done for processes that might suspend themselves for I/O access, especially when they tend to be more tolerant to multiple priority inversions. This paper presents research results extended from the concept of priority ceilings with the objective of satisfying different priority-inversion requirements for different processes. We aim at practical considerations in which processes might voluntarily give up CPU and be willing to receive more blocking time than those in more traditional approaches. Extensions on the proposed scheduling protocols for deadlock prevention are also considered.