This Article 
 Bibliographic References 
 Add to: 
Performance Analysis of Virtual Cut-Through Switching in HARTS: A Hexagonal Mesh Multicomputer
June 1991 (vol. 40 no. 6)
pp. 669-680

The authors present a formal analysis of virtual cut-through in a C-wrapped hexagonal mesh multicomputer, called the HARTS (hexagonal architecture for real-time systems). In virtual cut-through, packets arriving at an intermediate node are forwarded to the next node in the route without buffering if a circuit can be established to the next node. The hexagonal mesh is first characterized using a combinatorial analysis to determine the probability that a packet will establish a cut-through at an intermediate node. Given this parameter the probability distribution function for packet delivery times in HARTS is derived. The delivery times obtained from the analytic model are then compared against results collected from a simulator of the routing hardware designed for use in HARTS. The results from both the analytic model and the simulator further reinforce the choice of the virtual cut-through routing scheme for use in HARTS.

[1] M.-S. Chen, K. G. Shin, and D. D. Kandlur, "Addressing, routing and broadcasting in hexagonal mesh multiprocessors,"IEEE Trans. Comput., vol. 39, no. 1, pp. 10-18, Jan. 1990.
[2] J.W. Dolter, P. Ramanathan, and K.G. Shin, "A Microprogrammable VLSI Routing Controller for HARTS,"Proc. Int'l Conf. Computer Design: VLSI in Computers, Computer Society Press, Order No. 1971, Oct. 1989, pp. 160-163.
[3] P. Kermani and L. Kleinrock, "Virtual cut-through: A new computer communication switching technique,"Comput. Networks, vol. 3, pp. 267-286, 1979.
[4] L. Kleinrock,Queueing Systems, Vol. I: Theory. New York: Wiley, 1975.
[5] A. J. Martin, "The torus: An exercise in constructing a processing surface," inProc. Caltech. Conf. VLSI, 1981, pp. 527-537.
[6] K. S. Stevens, "The communication framework for a distributed ensemble architecture," AI Tech. Rep. 47, Schlumberger Research Lab., Feb. 1986.

Index Terms:
performance analysis; virtual cut-through switching; HARTS; hexagonal mesh multicomputer; formal analysis; C-wrapped; hexagonal architecture; real-time systems; combinatorial analysis; probability; simulator; analytic model; combinatorial mathematics; computer architecture; distributed processing; performance evaluation; real-time systems.
J.W. Dolter, P. Ramanathan, K.G. Shin, "Performance Analysis of Virtual Cut-Through Switching in HARTS: A Hexagonal Mesh Multicomputer," IEEE Transactions on Computers, vol. 40, no. 6, pp. 669-680, June 1991, doi:10.1109/12.90246
Usage of this product signifies your acceptance of the Terms of Use.