Characterization of blocking time in real-time systems with dynamic priority ceilings

Author

Rodríguez, Pedro ; Molano, A. ; Vifia, A.

Author_Institution

Commun. Technol. Dept., Vigo Univ., Spain

fYear

1997

fDate

11-13 Jun 1997

Firstpage

94

Lastpage

101

Abstract

In a single processor real time system, scheduled via the Earliest Deadline First algorithm (EDF), we have accurately characterized the blocking time that each task can encounter when accesses to shared resources are regulated via the Dynamic Priority Ceiling Protocol (DPCP). It is shown that worst case blocking times do not always reach the total duration of the critical sections which produce them. Our characterization allows the real time system designer to attain a higher processor utilization factor while the tasks meet all their deadlines

Keywords

concurrency control; processor scheduling; real-time systems; synchronisation; Dynamic Priority Ceiling Protocol; Earliest Deadline First algorithm; blocking time; critical sections; dynamic priority ceilings; higher processor utilization factor; real time system designer; shared resources; single processor real time system; worst case blocking times; Access protocols; Communications technology; Contracts; Counting circuits; Dynamic scheduling; Real time systems; Research and development; Scheduling algorithm; Software performance; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Systems, 1997. Proceedings., Ninth Euromicro Workshop on

Conference_Location

Toledo

Print_ISBN

0-8186-8034-2

Type

conf

DOI

10.1109/EMWRTS.1997.613769

Filename

613769