Systematic Scheduling Method for Messages and Tasks in Distributed Control Systems

This paper presents a systematic scheduling method to guarantee the end-to-end constraints including precedence constraints of tasks, messages and both. The presented systematic method is the integrated or joint one of both tasks executed in each node and messages transmitted via the network. The presented method is designed to apply to the general distributed control system that has multiple loops and in a single loop has sensor nodes with multiple sensors, actuator nodes with multiple actuators, controller nodes with multiple tasks, and several constraints. The worst-case response time is analysed using the proposed method.

[1]  Krithi Ramamritham,et al.  Scheduling algorithms and operating systems support for real-time systems , 1994, Proc. IEEE.

[2]  David Lorge Parnas,et al.  Scheduling Processes with Release Times, Deadlines, Precedence, and Exclusion Relations , 1990, IEEE Trans. Software Eng..

[3]  Pascal Lorenz,et al.  Real-Time Software Architecture: Application to FIP Fieldbus , 1995 .

[4]  P. Raja,et al.  Priority polling and dynamic time-window mechanisms in a multicycle Fieldbus , 1993, 1993 CompEuro Proceedings Computers in Design, Manufacturing, and Production.

[5]  John A. Clark,et al.  Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[6]  Andy J. Wellings,et al.  Analysing real-time communications: controller area network (CAN) , 1994, 1994 Proceedings Real-Time Systems Symposium.

[7]  A. Burns,et al.  Deadline monotonic scheduling theory and application , 1993 .

[8]  Alan Burns,et al.  Preemptive priority-based scheduling: an appropriate engineering approach , 1995 .

[9]  Wook Hyun Kwon,et al.  An architecture for a network based robot control system , 1999, 1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467).