From Task Scheduling in Single Processor Environments to Message Scheduling in a PROFIBUS Fieldbus Network

In this paper we survey the most relevant results for the prioritybased schedulability analysis of real-time tasks, both for the fixed and dynamic priority assignment schemes. We give emphasis to the worst-case response time analysis in non-preemptive contexts, which is fundamental for the communication schedulability analysis. We define an architecture to support priority-based scheduling of messages at the application process level of a specific fieldbus communication network, the PROFIBUS. The proposed architecture improves the worst-case messages’ response time, overcoming the limitation of the first-come-first-served (FCFS) PROFIBUS queue implementations.

[1]  Eduardo Tovar,et al.  Real-time fieldbus communications using Profibus networks , 1999, IEEE Trans. Ind. Electron..

[2]  Jean-Dominique Decotignie,et al.  On the necessary real-time conditions for the producer-distributor-consumer model , 1995, Proceedings 1995 IEEE International Workshop on Factory Communication Systems. WFCS'95.

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

[4]  Adriano Valenzano,et al.  Time Characteristics of IEE802. 4 Token Bus Protocol , 1992 .

[5]  Eduardo Tovar,et al.  Scheduling real-time communications with P-NET , 1998 .

[6]  John A. Stankovic,et al.  Real-time computing systems: the next generation , 1988 .

[7]  A. Burns,et al.  Scheduling hard real-time systems: a review , 1991, Softw. Eng. J..

[8]  Qin Zheng.  Real-time fault-tolerant communication in computer networks , 1993 .

[9]  Marco Spuri,et al.  Holistic Analysis for Deadline Scheduled Real-Time Distributed Systems , 1996 .

[10]  Kang G. Shin,et al.  On the ability of establishing real-time channels in point-to-point packet-switched networks , 1994, IEEE Trans. Commun..

[11]  Eduardo Tovar,et al.  Pre-run-time schedulability analysis of P-NET fieldbus networks , 1998, IECON '98. Proceedings of the 24th Annual Conference of the IEEE Industrial Electronics Society (Cat. No.98CH36200).

[12]  Alan Burns,et al.  Calculating controller area network (can) message response times , 1994 .

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

[14]  Eduardo Tovar,et al.  Cycle time properties of the PROFIBUS timed-token protocol , 1999, Comput. Commun..

[15]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[16]  Alan Burns,et al.  Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..

[17]  A. Burns,et al.  Worst case response time analysis of hard real-time sporadic traffic in FIP networks , 1997, Proceedings Ninth Euromicro Workshop on Real Time Systems.

[18]  Marco Spuri,et al.  Preemptive and Non-Preemptive Real-Time UniProcessor Scheduling , 1996 .

[19]  Sanjoy K. Baruah,et al.  Preemptively scheduling hard-real-time sporadic tasks on one processor , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[20]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[21]  Abha Moitra,et al.  Scheduling of Hard Real-Time Systems , 1986, FSTTCS.

[22]  BurnsA..  Scheduling hard real-time systems , 1991 .

[23]  Rocquencourt,et al.  Analysis of Deadline Scheduled Real-Time Systems , 1996 .

[24]  Wei Zhao,et al.  Guaranteeing synchronous message deadlines with the timed token protocol , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[25]  Krithi Ramamritham,et al.  Tutorial on hard real-time systems , 1989 .

[26]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.