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

Saved in:
Bibliographic Details
Title: A real-time configurable synchronization protocol for self-suspending process sets.
Authors: Ya-Shu Chen1, Li-Pin Chang2
Source: Real-Time Systems. Aug2009, Vol. 42 Issue 1-3, p34-62. 29p.
Subjects: Computer input-output equipment, Information science, Random access memory, Computer storage devices
Abstract: 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. [ABSTRACT FROM AUTHOR]
Copyright of Real-Time Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract: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. [ABSTRACT FROM AUTHOR]
ISSN:09226443
DOI:10.1007/s11241-009-9070-0