Hard real-time communication in bus-based networks

Route selection is an important aspect of the design of real-time systems in which messages might have to travel over multiple hops to reach their destination and multiple paths exist between a source and a destination. The length of a route affects the ability to meet deadlines and greedy routing might leave certain messages with no feasible route. We consider bus-based networks on which periodic message transmissions need to be scheduled and present a technique for synthesizing routes such that all messages meet their deadlines. Our offline technique enables system designers to configure routes in a large-scale embedded system. In our solution, we allow message fragmentation and utilize multiple paths to satisfy the requirements of each message. The routing problem is NP-complete and our approximation algorithm is based on a linear programming formulation. In our methodology, we deal with both earliest deadline first and rate monotonic scheduling at each bus in the system. Apart from point-to-point messages, we discuss scheduling multicast messages to facilitate the publisher/subscriber model. Finally, we also mention some heuristics for online routing which might be of value in soft real-time systems.

[1]  John P. Lehoczky.  Scheduling communication networks carrying real-time traffic , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[2]  John Rushby,et al.  A Comparison of Bus Architectures for Safety-Critical Embedded Systems , 2003 .

[3]  Steve Goddard,et al.  A theory of rate-based execution , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[4]  Clifford Stein,et al.  Improved approximation algorithms for unsplittable flow problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[5]  Jun Sun,et al.  An end-to-end approach to schedule tasks with shared resources in multiprocessor systems , 1994, Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software.

[6]  Shu-Ngai Yeung,et al.  End-to-end delay analysis for real-time networks , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[7]  Jane W.-S. Liu,et al.  Validating timing constraints in multiprocessor and distributed real-time systems , 1994, 14th International Conference on Distributed Computing Systems.

[8]  Christian Scheideler,et al.  Improved bounds for the unsplittable flow problem , 2002, SODA '02.

[9]  Wei Zhao,et al.  The timed-token protocol for real-time communications , 1994, Computer.

[10]  Kwei-Jay Lin,et al.  Scheduling Real-Time Systems with End-to-End Timing Constraints Using the Distributed Pinwheel Model , 2001, IEEE Trans. Computers.

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

[12]  Wayne Luk,et al.  A Gaussian noise generator for hardware-based simulations , 2004, IEEE Transactions on Computers.

[13]  John P. Lehoczky,et al.  Real-time queueing network theory , 1997, Proceedings Real-Time Systems Symposium.

[14]  Dale Skeen,et al.  The Information Bus: an architecture for extensible distributed systems , 1994, SOSP '93.

[15]  Enhanced utilization bounds for QoS management , 2004, IEEE Transactions on Computers.

[16]  Kang G. Shin,et al.  Traffic-controlled rate monotonic priority scheduling of ATM cells , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[17]  Krithi Ramamritham,et al.  Preemptive Scheduling Under Time and Resource Constraints , 1987, IEEE Transactions on Computers.

[18]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[19]  J. M. Borky,et al.  Architectures for next generation military avionics systems , 1998, 1998 IEEE Aerospace Conference Proceedings (Cat. No.98TH8339).

[20]  Jun Sun,et al.  Fixed-Priority End-To-End Scheduling in Distributed Real-Time Systems , 1997 .

[21]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[22]  Lui Sha,et al.  Performance of real-time bus scheduling algorithms , 1986, SIGMETRICS '86/PERFORMANCE '86.

[23]  Hugh Garraway.  Parallel Computer Architecture: A Hardware/Software Approach , 1999, IEEE Concurrency.

[24]  John P. Lehoczky,et al.  Real-time scheduling support in Futurebus+ , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[25]  Riccardo Bettati,et al.  End-to-end scheduling to meet deadlines in distributed systems , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[26]  Anoop Gupta,et al.  Parallel computer architecture - a hardware / software approach , 1998 .

[27]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.

[28]  Amit Kumar,et al.  Approximation Algorithms for the Unsplittable Flow Problem , 2002, Algorithmica.

[29]  Gautam H. Thaker,et al.  A feasible region for meeting aperiodic end-to-end deadlines in resource pipelines , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[30]  Marco Di Natale,et al.  Scheduling Messages with Earliest Deadline Techniques , 2001, Real-Time Systems.

[31]  Jane W.-S. Liu,et al.  Multicast tree construction in bus-based networks , 1989, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings.

[32]  K. Hoyme,et al.  SAFEbus (for avionics) , 1993, IEEE Aerospace and Electronic Systems Magazine.

[33]  Lui Sha,et al.  The real-time publisher/subscriber inter-process communication model for distributed real-time systems: design and implementation , 1995, Proceedings Real-Time Technology and Applications Symposium.

[34]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[35]  Bruce S. Davie,et al.  Computer Networks: A Systems Approach , 1996 .

[36]  Alan Burns,et al.  Fixed priority pre-emptive scheduling: An historical perspective , 1995, Real-Time Systems.

[37]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 2003, J. Comput. Syst. Sci..

[38]  Aravind Srinivasan,et al.  Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems , 2000, Math. Oper. Res..

[39]  Lui Sha,et al.  An implicit prioritized access protocol for wireless sensor networks , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[40]  Gautam H. Thaker,et al.  Empirical quantification of pessimism in state-of-the-art scheduling theory techniques for periodic and sporadic DRE tasks , 2004, Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004..

[41]  Giorgio C. Buttazzo,et al.  Rate Monotonic Analysis: The Hyperbolic Bound , 2003, IEEE Trans. Computers.