This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Priority-Driven Flow Control Mechanism for Real-Time Traffic in Multiprocessor Networks
July 1998 (vol. 9 no. 7)
pp. 664-678

Abstract—Real-time applications when mapped to distributed memory multiprocessors produce periodic messages with an associated deadline and priority. Real-time messages may be hard or soft deadline. Real-time extensions to wormhole routing (WR) with multiple virtual channels (VCs) and priority-based physical link arbitration and VC allocation have been proposed in the literature. With a fixed number of VCs/link, a message can face an unbounded priority inversion, rendering the global priority ineffective. In this paper, we propose a new flow control mechanism called Preemptive Pipelined Circuit Switching for Real-Time messages (PPCS-RT) to reduce the priority inversion problem. For the proposed model, with some architectural support, we present an off-line approach to compute delivery guarantees of hard deadline real-time messages. We also perform a comparison of real-time WR and PPCS-RT in terms of performance with soft deadline traffic. The overall miss ratio percentage is over 30 percent higher for WR than PPCS-RT with one VC/link at high traffic loads. Finally, we compare the architectural complexity of a PPCS-RT router and other real-time routers.

[1] Intel Corp., Paragon XP/S Product Overview, 1991.
[2] Cray Research Inc., Cray T3D System Architecture Overview, 1993.
[3] W.J. Dally and C.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[4] W.J. Dally, "Virtual-Channel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
[5] R. Rajkumar, "Real-Time Synchronization Protocols for Shared Memory Multiprocessors," Proc. IEEE 10th Int'l Conf. Distributed Computing, pp. 116-123, 1990.
[6] L. Sha, S. Sathaye, and J.K. Strosnider, "Scheduling Real-Time Communication on Dual-Link Networks," Proc. IEEE Real-Time Systems Symp., pp. 188-197, Dec. 1992.
[7] K. Tindell, A. Burns, and A.J. Wellings, "Guaranteeing Hard Real-Time End-To-End Communications Deadlines," Technical Report RTRG/91/107, Dept. of Computer Science, Univ. of York, Dec. 1991.
[8] D.D. Kandlur, K.G. Shin, and D. Ferrari, “Real-Time Communication in Multi-Hop Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 10, pp. 1,044-1,056, Oct. 1994.
[9] S. Hary, J. McKeeman, and D. VanCleave, "Evaluation of Infrared Missile Warning Suites," Proc. IEEE Nat'l Aerospace and Electronics Conf. (NAECON), pp. 1,060-1,066, May 1993.
[10] S.B. Shukla and D.P. Agrawal, "Scheduling Piplelined Communication in Distributed Memory Multiprocessors for Real-Time Applications," Proc. 18th Ann. Int'l Symp. Computer Architecture, pp. 222-231, 1991.
[11] K. Toda, K. Nishida, E. Takahashi, and Y. Yamaguchi, "A Priority Forwarding Router Chip for Real-Time Interconnection Networks," Proc. IEEE Real-Time Systems Symp., pp. 63-73, 1994.
[12] K. Arvind, K. Ramamritham, and J.A. Stankovic, "A Local Area Network Architecture for Communcation in Distributed Real-Time Systems," Real-Time Systems, vol. 3, pp. 115-147, May 1991.
[13] J.A. Stankovic, "Distributed Real-Time Computing: The Next Generation," Technical Report COINS 92-01, Univ. of Massachusetts, Amherst, Jan. 1992.
[14] J.-P. Li and M. Mutka, "Priority Based Real-Time Communication for Large Scale Wormhole Networks," Proc. Eighth Int'l Parallel Processing Symp., pp. 433-438, 1994.
[15] J. Rexford and K.G. Shin, "Support for Multiple Classes of Traffic in Multicomputer Routers," Proc. Parallel Computer Routing and Communication Workshop, May 1994.
[16] R. Rajkumar, L. Sha, and J.P. Lehoczky, "Real-Time Synchronization Protocols for Multiprocessors," Proc. IEEE Real-Time Systems Symp., pp. 259-269, 1988.
[17] J. Dolter, S. Daniel, A. Mehra, J. Rexford, W. Feng, and K. Shin, "SPIDER: Flexible and Efficient Communication Support for Point-To-Point Distributed Systems," Proc. Int'l Conf. Distributed Computer Systems, pp. 574-580, June 1995.
[18] J. Rexford, J. Dolter, and K. Shin, "Hardware Support for Controlled Interaction of Guaranteed and Best-Effort Communication," Proc. Third IPPS Workshop Parallel and Distributed Real-Time Systems, pp. 188-193, Apr. 1994.
[19] J. Rexford, J. Hall, and K.G. Shin, "A Router Architecture for Real-Time Point-to-Point Networks," Proc. 23rd Ann. Int'l Symp. Computer Architecture, pp. 237-246, May 1996.
[20] P.T. Gaughan and S. Yalamanchili, "A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 6, pp. 482-487, May 1995.
[21] S. Balakrishnan and F. Özgüner, "The Effect of Flow Control and Routing Adaptivity on Priority-Driven Traffic in Multiprocessor Networks," Proc. Euro-Par Workshop Routing and Comm. in Interconnection Networks, pp. 287-298, Aug. 1996.
[22] S. Nugent, "The iPSC/2 Direct-Connect Communications Technology," Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 51-60, Jan. 1998.
[23] K. Aoyama and A.A. Chien, "The Cost of Adaptivity and Virtual Lanes," J. VLSI Design, vol. 2, no. 4, pp. 315-333, 1994.
[24] S. Balakrishnan, "A Study of Architectural Issues for Improved Communication in Pipelined Flit-Buffered Multiprocessor Networks," PhD thesis, Ohio State Univ., Mar. 1996.
[25] L. Sha and J.B. Goodenough, "Real-Time Scheduling Theory and Ada," Computer, vol. 24, no. 4, pp. 53-62, Apr. 1990.
[26] M. Mutka, "Using Rate Monotonic Scheduling Technology for Real-Time Communications in a Wormhole-Routed Network," Proc. Second Workshop Distributed and Parallel Real-Time Systems, pp. 194-199, 1994.
[27] S. Balakrishnan and F. Özgüner, "Providing Message Delivery Guarantees in Pipelined Flit-Buffered Multiprocessor Networks," Proc. IEEE Real-Time Technology and Applications Symp., pp. 120-129, June 1996.
[28] H. Schwetman, "CSIM: A C-based, Process Oriented Simulation Language," Proc. 1991 Winter Simulation Conf., pp. 387-396, 1991.
[29] Q. Zheng and K.G. Shin, "On the Ability of Establishing Real-Time Channels in Point-To-Point Packet-Switched Networks," IEEE J. Selected Areas Comm., vol. 42, pp. 368-379, Feb./Mar./Apr. 1994.
[30] J.D. Allen, P.T. Gaughan, D.E. Schimmel, and S. Yalamanchili, "Ariadne—An Adaptive Router for Fault-Tolerant Multicomputers," Proc. 21st Int'l Symp. Computer Architecture, pp. 278-288, Apr. 1994.
[31] S. Balakrishnan and F. Özgüner, "A Priority-Based Flow Control Mechanism to Support Real-Time Traffic in Pipelined Direct Networks," Proc. Int'l Conf. Parallel Processing, pp. 120-127, Aug. 1996.

Index Terms:
Real-time, wormhole routing, virtual channel, feasibility analysis, pipelined circuit switching.
Citation:
Shobana Balakrishnan, Füsun Özgüner, "A Priority-Driven Flow Control Mechanism for Real-Time Traffic in Multiprocessor Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 7, pp. 664-678, July 1998, doi:10.1109/71.707545
Usage of this product signifies your acceptance of the Terms of Use.