A FIFO worst case analysis for a hard real-time distributed problem with consistency constraints

Author

George, L. ; Minet, P.

Author_Institution

Inst. Nat. de Recherche en Inf. et Autom., Rocquencourt, France

fYear

1997

fDate

27-30 May 1997

Firstpage

441

Lastpage

448

Abstract

A solution for a hard real time scheduling problem in a distributed system is designed and proved. The constraints of our problem are first to preserve consistency even in the presence of concurrency and second to preserve the order of task releases, provided that task release times differ more than clock precision. That is achieved by FIFO based scheduling. The feasibility conditions resulting from the worst case response time analysis of each task set are given. The solution complexity is shown to be pseudo polynomial

Keywords

computational complexity; concurrency control; data integrity; distributed processing; processor scheduling; real-time systems; FIFO based scheduling; FIFO worst case analysis; clock precision; concurrency; consistency constraints; distributed system; feasibility conditions; hard real time distributed problem; hard real time scheduling problem; pseudo polynomial solution complexity; task release order; task release times; task set; worst case response time analysis; Clocks; Computer aided software engineering; Concrete; Concurrent computing; Delay; Humans; Polynomials; Real time systems; Synchronization; Time factors;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 1997., Proceedings of the 17th International Conference on

Conference_Location

Baltimore, MD

ISSN

1063-6927

Print_ISBN

0-8186-7813-5

Type

conf

DOI

10.1109/ICDCS.1997.603275

Filename

603275