Polynomial-time transformations and schedulability analysis of parallel real-time programs with restricted resource contention

Document Type

Article

Publication Date

12-1-1992

Abstract

We present polynomial-time static semantics-preserving transformations of real-time programs. Used in conjunction with schedulability analysis, the transformations significantly increase the class of real-time programs that may be analyzed efficiently for guaranteed schedulability at compile-time. In cases where the form of resource contention among processes resists efficient transformation, we apply a heuristic transformation (and a consequent run-time scheduling heuristic) to allow the programs to be analyzed efficiently. © 1992 Kluwer Academic Publishers.

Identifier

0027063973 (Scopus)

Publication Title

Real Time Systems

External Full Text Location

https://doi.org/10.1007/BF00355297

e-ISSN

15731383

ISSN

09226443

First Page

307

Last Page

329

Issue

4

Volume

4

This document is currently not available here.

Share

COinS