Analyzing hard-real-time programs for guaranteed schedulability

Author

Stoyenko, Alexander D. ; Hamacher, V. Carl ; Holt, Richard C.

Author_Institution

Dept. of Comput. & Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA

Volume

17

Issue

8

fYear

1991

fDate

8/1/1991 12:00:00 AM

Firstpage

737

Lastpage

750

Abstract

A set of language-independent schedulability analysis techniques is presented. Utilizing knowledge of implementation- and hardware-dependent information in a table-driven fashion, these techniques provide accurate worst-case time bounds and other schedulability information. A prototype schedulability analyzer has been developed to demonstrate the effectiveness of these techniques. The analyzer consists of a partially language-dependent front-end, targeted at real-time Euclid, a real-time language specifically designed with a set of schedulability analysis provisions built-in, and a language-dependent back-end. The analyzer has been used on a number of realistic real-time programs run on a multiple-microprocessor system. Predicted program performance differs only marginally from the actual performance

Keywords

high level languages; program verification; real-time systems; scheduling; systems analysis; hardware-dependent information; language-dependent back-end; language-independent schedulability analysis; multiple-microprocessor system; partially language-dependent front-end; program performance; prototype schedulability analyzer; real-time Euclid; real-time language; realistic real-time programs; schedulability analysis provisions; table-driven fashion; worst-case time bounds; Chemical processes; Failure analysis; Performance analysis; Process control; Program processors; Programming profession; Real time systems; Scheduling; Software performance; Timing;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/32.83911

Filename

83911