This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
May 1994 (vol. 5 no. 5)
pp. 449-458

All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A goodsolution to this problem is essential for clock synchronization, distributed agreement, etc.We propose a novel solution in which the reliable broadcasts from individual nodes areinterleaved in such a manner that no two packets contend for the same link at any giventime-this type of method is particularly suited for systems which use virtual cut-throughor wormhole routing for fast communication between nodes. Our solution, called the IHCAlgorithm, can be used on a large class of regular interconnection networks includingregular meshes and hypercubes. By adjusting a parameter /spl eta/ referred to as theinterleaving distance, we can flexibly decrease the link utilization of the IHC algorithm (for normal traffic) at the expense of an increase in the time required for ATA reliablebroadcast. We compare the IHC algorithm to several other possible virtual cut-throughsolutions and a store-and-forward solution. The IHC algorithm with the minimum value of /spl eta/ is shown to be optimal in minimizing the execution time of ATA reliable broadcast when used in a dedicated mode (with no other network traffic).

[1] B. Alspach, J. C. Bermond, and D. Sotteau, "Decomposition into cycles 1: Hamiltonian decompositions," inCycles and Rays, G. Hahn, G. Sabidussi, and R.E. Woodrow, Eds. Boston: Kluwer Academic, 1990, pp. 9-18.
[2] J. Arbert and B. Schneider, "Decomposition de la somme cartesienne d'un cycle et de I'union de deux cycles Hamiltoniens en cycles Hamiltoniens,"Discrete Math., vol. 38, pp. 7-20, 1982.
[3] B. Becker and H. U. Simon, "How robust is then-cube?," inProc. 27th Annu. Symp. on Found. of Comput. Sci., Oct. 1986, pp. 283-291.
[4] J. A. Bondy and U. S. R. Murty,Graph Theory with Applications. New York: North-Holland, 1976.
[5] M. S. Chen, K. G. Shin, and D. D. Kandlur, "Addressing, routing and broadcasting in hexagonal mesh multiprocessors,"IEEE Trans. Comput., vol. C-39, no. 1, pp. 10-18, Jan. 1990.
[6] W. J. Dally and C. L. Seitz, "The torus routing chip,"J. Distribut. Computing, vol. 1, no. 3, pp. 187-196, 1986.
[7] 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.
[8] W. J. Dally, "A fine-grain, message-passing processing node," inConcurrent Computations: Algorithms, Architecture, and Technology. New York: Plenum Press, 1988, pp. 375-389.
[9] D. Dolev, "The Byzantine generals strike again,"J. Algorithms, vol. 3, pp. 14-30, 1982.
[10] 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.
[11] M. Foregger, "Hamiltonian decompositions of products of cycles,"Discrete Math., vol. 24, pp. 251-260, 1978.
[12] P. Fraigniaud, "Asymptotically optimal broadcast and total-exchange algorithms in faulty hypercube multicomputers," Laboratories de l'Informatique du Parallelisme, Ecole Normal Superieure de Lyon, May 1989.
[13] C. T. Ho, personal communication, Nov. 1989.
[14] H. Kanakia and D.R. Cheriton, "The VMP Network Adapter Board (NAB): High-Performance Network Communication for Multiprocessors,"Proc. SIGComm 88 Symp. Comm. Architectures and Protocols, ACM Press, New York, 1988, pp. 175-187.
[15] D. Kandlur and K. Shin, "Reliable Broadcast Algorithms for HARTS,"ACM Trans. Computer Systems, Nov. 1991, pp. 374-398.
[16] P. Kermani and L. Kleinrock, "Virtual cut-through: A new computer communication switching technique,"Comput. Netw., vol. 3, no. 4, pp. 267-286, Sept. 1979.
[17] C.M. Krishna, K.G. Shin, and R.W. Butler, "Ensuring Fault Tolerance of Phase-Locked Clocks,"IEEE Trans. Computers, Vol. C- 34, No. 8, Aug. 1985, pp. 752-756.
[18] L. Lamport, R. Shostak, and M. Pease, "The Byzantine Generals Problem,"ACM Trans. Programming Languages and Systems, Vol. 4, No. 3, July 1982, pp. 382-401.
[19] L. Lamport and P.M. Melliar-Smith, "Synchronizing Clocks in the Presence of Faults,"J. ACM, Vol. 32, No. 1, Jan. 1985, pp. 52-78.
[20] P. Ramanathan and K. G. Shin, "Reliable broadcast in hypercube multicomputers,"IEEE Trans. Comput., vol. 37, no. 12, pp. 1654-1657, Dec. 1988.
[21] P. Ramanathan, D. D. Kandlur, and K. G. Shin, "Hardware-assisted software clock synchronization for homogeneous distributed systems,"IEEE Trans. Comput., vol. 39, no. 4, pp. 514-524, Apr. 1990.
[22] R.L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,"Comm. ACM, Vol. 21, No. 2, Feb. 1978, pp. 120-126.
[23] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.
[24] H. Sulivan and T. R. Bashkov, "A large scale homogeneous, fully distributed parallel machine, I," inProc. 4th Symp. Comput. Arch., March 1977, pp. 105-117.
[25] C. L. Yang and G. M. Masson, "A distributed algorithm for fault diagnosis in systems with soft failures,"IEEE Trans. Comput., vol. 37, no. 11, pp. 1476-1479, Nov. 1988.

Index Terms:
Index Termsmultiprocessor interconnection networks; telecommunication network routing; all-to-allreliable broadcast; meshes; hypercubes; point-to-point interconnection networks; reliablebroadcasts; wormhole routing; IHC Algorithm; interconnection networks; regular meshes; broadcast; fault-tolerance; virtual cut-through
Citation:
S. Lee, K.G. Shin, "Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 5, pp. 449-458, May 1994, doi:10.1109/71.282556
Usage of this product signifies your acceptance of the Terms of Use.