Symbolic schedulability analysis of real-time systems

Author

Kwak, Hee-Hwan ; Lee, Insup ; Philippou, Anna ; Choi, Jin-Young ; Sokolsky, Oleg

Author_Institution

Dept. of Comput. & Inf. Sci., Pennsylvania Univ., Philadelphia, PA, USA

fYear

1998

fDate

2-4 Dec 1998

Firstpage

409

Lastpage

418

Abstract

We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities. We use ACSR-VP to describe an instance of a scheduling problem as a process that has parameters of the problem as free variables. The specification is analyzed by means of a symbolic algorithm. The outcome of the analysis is a set of equations, a solution to which yields the values of the parameters that make the system schedulable. Equations are solved using integer programming or constraint logic programming. The paper presents specifications of two scheduling problems as examples

Keywords

formal specification; integer programming; logic programming; process algebra; processor scheduling; real-time systems; ACSR-VP; constraint logic programming; free variables; integer programming; real-time process algebra; real-time systems; specifications; symbolic schedulability analysis; value-passing capabilities; Algebra; Command and control systems; Computer science; Equations; Information science; Logic programming; Processor scheduling; Real time systems; Safety; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Systems Symposium, 1998. Proceedings., The 19th IEEE

Conference_Location

Madrid

Print_ISBN

0-8186-9212-X

Type

conf

DOI

10.1109/REAL.1998.739774

Filename

739774