Modeling and scheduling real-time control systems with relative consistency constraints

Control applications control and monitor an external physical environment. Process control and manufacturing systems are examples of such applications. In such systems the temporal relationship between the external environment and the control system plays an important role. In this paper, the temporal relationship of data within the control system and the external environment, known as data temporal consistency, is considered. First the control system is modeled as a graph of periodic tasks. Then the problem of scheduling a set of periodic tasks on a uniprocessor with the relative consistency as a scheduling constraint is studied and its computational complexity is investigated. A novel aspect of the scheduling problem is with respect to the scheduling constraints. More precisely, it is shown how the relative phasing of a periodic task is constrained by the relative phasings of its predecessor tasks.<<ETX>>

[1]  Yu-Chi Ho,et al.  Discrete event dynamic systems : analyzing complexity and performance in the modern world , 1992 .

[2]  Guevara Noubir,et al.  Design and implementation of a robust Fieldbus protocol , 1993, ISIE '93 - Budapest: IEEE International Symposium on Industrial Electronics Conference Proceedings.

[3]  Guevara Noubir,et al.  A software architecture for maintaining temporal consistency in a distributed real-time environment , 1993, Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93.

[4]  Sudarshan K. Dhall,et al.  On a Real-Time Scheduling Problem , 1978, Oper. Res..

[5]  Xiaohui Song,et al.  Performance of multiversion concurrency control algorithms in maintaining temporal consistency , 1990, Proceedings., Fourteenth Annual International Computer Software and Applications Conference.

[6]  K. H. Kim,et al.  Temporal uncertainties in interactions among real-time objects , 1990, Proceedings Ninth Symposium on Reliable Distributed Systems.

[7]  Richard Gerber,et al.  Scheduling with relative timing constraints , 1993 .

[8]  Hermann Kopetz,et al.  CONSISTENCY CONSTRAINTS IN DISTRIBUTED REAL TIME SYSTEMS , 1988 .

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  P. Pleinevaux,et al.  Time critical communication networks: field buses , 1988, IEEE Network.

[11]  Guevara Noubir,et al.  A functional approach for expressing temporal properties of inputs and outputs of real-time applications , 1993, 1993 4th Workshop on Future Trends of Distributed Computing Systems.

[12]  Karl Johan Åström,et al.  Computer-Controlled Systems: Theory and Design , 1984 .

[13]  Ching Han,et al.  Scheduling Real-Time Computations With Temporal Distance and Separation Constraints and With Extended Deadlines , 1992 .

[14]  P. Raja,et al.  Characterizing Temporal Consistency In A Fieldbus Environment , 1992, Singapore International Conference on Intelligent Control and Instrumentation [Proceedings 1992].

[15]  Xiaohui Song.  Data temporal consistency in hard real-time systems , 1992 .

[16]  Kwei-Jay Lin,et al.  Recovering imprecise transactions with real-time constraints , 1988, Proceedings [1988] Seventh Symposium on Reliable Distributed Systems.