Symbolic schedulability analysis of real-time systems

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

Research output: Contribution to conferencePaper

16 Citations (Scopus)

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.

Original languageEnglish
Pages409-418
Number of pages10
Publication statusPublished - 1998
EventProceedings of the 1998 19th IEEE Real-Time Systems Symposium - Madrid, Spain
Duration: 1998 Dec 21998 Dec 4

Other

OtherProceedings of the 1998 19th IEEE Real-Time Systems Symposium
CityMadrid, Spain
Period98/12/298/12/4

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Symbolic schedulability analysis of real-time systems'. Together they form a unique fingerprint.

  • Cite this

    Kwak, H. H., Lee, I., Philippou, A., Choi, J. Y., & Sokolsky, O. (1998). Symbolic schedulability analysis of real-time systems. 409-418. Paper presented at Proceedings of the 1998 19th IEEE Real-Time Systems Symposium, Madrid, Spain, .