A resource synchronization protocol for multiprocessor real-time systems

Chia Mei Chen; S. K. Tripathi; A. Blackmore

doi:10.1109/ICPP.1994.44

A resource synchronization protocol for multiprocessor real-time systems

Chia Mei Chen
, S. K. Tripathi
, A. Blackmore

OTP Administrative Operations

University of Maryland, College Park

Research output: Contribution to journal › Conference article › peer-review

6 Scopus citations

Abstract

We study resource synchronization in multiprocessor hard real-time systems. Specifically, we propose a multiprocessor resource control protocol which allows a job to simultaneously lock multiple global resources, removing a restriction from previous protocols. Allowing nested critical sections may permit a finer granularity of synchronization, increasing parallelism and throughput. All the protocols discussed belong to the class of priority inheritance protocols and rely in some fashion on priority ceilings for global semaphores. The extended protocol prevents deadlock and transitive blocking. We derive bounds for worse case blocking time, and describe sufficient conditions to guarantee that m sets of periodic tasks can be scheduled on an m multiprocessor system.

Original language	English
Article number	5727850
Pages (from-to)	III159-III162
Journal	Proceedings of the International Conference on Parallel Processing
Volume	3
DOIs	https://doi.org/10.1109/ICPP.1994.44
State	Published - 1994
Event	23rd International Conference on Parallel Processing, ICPP 1994 - Raleigh, NC, United States Duration: Aug 15 1994 → Aug 19 1994

Access to Document

10.1109/ICPP.1994.44

Cite this

@article{a7a3d9e7a62e43bf8f35934ef14d9439,

title = "A resource synchronization protocol for multiprocessor real-time systems",

abstract = "We study resource synchronization in multiprocessor hard real-time systems. Specifically, we propose a multiprocessor resource control protocol which allows a job to simultaneously lock multiple global resources, removing a restriction from previous protocols. Allowing nested critical sections may permit a finer granularity of synchronization, increasing parallelism and throughput. All the protocols discussed belong to the class of priority inheritance protocols and rely in some fashion on priority ceilings for global semaphores. The extended protocol prevents deadlock and transitive blocking. We derive bounds for worse case blocking time, and describe sufficient conditions to guarantee that m sets of periodic tasks can be scheduled on an m multiprocessor system.",

author = "Chen, \{Chia Mei\} and Tripathi, \{S. K.\} and A. Blackmore",

year = "1994",

doi = "10.1109/ICPP.1994.44",

language = "English",

volume = "3",

pages = "III159--III162",

journal = "Proceedings of the International Conference on Parallel Processing",

issn = "0190-3918",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "23rd International Conference on Parallel Processing, ICPP 1994 ; Conference date: 15-08-1994 Through 19-08-1994",

}

TY - JOUR

T1 - A resource synchronization protocol for multiprocessor real-time systems

AU - Chen, Chia Mei

AU - Tripathi, S. K.

AU - Blackmore, A.

PY - 1994

Y1 - 1994

N2 - We study resource synchronization in multiprocessor hard real-time systems. Specifically, we propose a multiprocessor resource control protocol which allows a job to simultaneously lock multiple global resources, removing a restriction from previous protocols. Allowing nested critical sections may permit a finer granularity of synchronization, increasing parallelism and throughput. All the protocols discussed belong to the class of priority inheritance protocols and rely in some fashion on priority ceilings for global semaphores. The extended protocol prevents deadlock and transitive blocking. We derive bounds for worse case blocking time, and describe sufficient conditions to guarantee that m sets of periodic tasks can be scheduled on an m multiprocessor system.

AB - We study resource synchronization in multiprocessor hard real-time systems. Specifically, we propose a multiprocessor resource control protocol which allows a job to simultaneously lock multiple global resources, removing a restriction from previous protocols. Allowing nested critical sections may permit a finer granularity of synchronization, increasing parallelism and throughput. All the protocols discussed belong to the class of priority inheritance protocols and rely in some fashion on priority ceilings for global semaphores. The extended protocol prevents deadlock and transitive blocking. We derive bounds for worse case blocking time, and describe sufficient conditions to guarantee that m sets of periodic tasks can be scheduled on an m multiprocessor system.

UR - https://www.scopus.com/pages/publications/80155191404

U2 - 10.1109/ICPP.1994.44

DO - 10.1109/ICPP.1994.44

M3 - Conference article

AN - SCOPUS:80155191404

SN - 0190-3918

VL - 3

SP - III159-III162

JO - Proceedings of the International Conference on Parallel Processing

JF - Proceedings of the International Conference on Parallel Processing

M1 - 5727850

T2 - 23rd International Conference on Parallel Processing, ICPP 1994

Y2 - 15 August 1994 through 19 August 1994

ER -

A resource synchronization protocol for multiprocessor real-time systems

Abstract

Access to Document

Other files and links

Fingerprint

Cite this