The Community for Technology Leaders
Green Image
<p>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.</p>
language-independent schedulability analysis; hardware-dependent information; table-driven fashion; worst-case time bounds; prototype schedulability analyzer; partially language-dependent front-end; real-time Euclid; real-time language; schedulability analysis provisions; language-dependent back-end; realistic real-time programs; multiple-microprocessor system; program performance; high level languages; program verification; real-time systems; scheduling; systems analysis

R. Holt, A. Stoyenko and V. Hamacher, "Analyzing Hard-Real-Time Programs for Guaranteed Schedulability," in IEEE Transactions on Software Engineering, vol. 17, no. , pp. 737-750, 1991.
83 ms
(Ver 3.3 (11022016))