This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Lower Bounds on the Loading of Multiple Bus Networks for Binary Tree Algorithms
December 2004 (vol. 53 no. 12)
pp. 1535-1546
A Multiple Bus Network (MBN) connects a set of processors via a set of buses. Two important parameters of an MBN are its loading (largest number of connections on a bus) and its degree (largest number of connections to a processor). These parameters determine the cost, speed, and implementability of the MBN. The smallest degree that any useful MBN can have is 2. In this paper, we study the relationship between running time, degree, and loading of degree-2 MBNs running a fundamental class of algorithms called binary tree algorithms. (A binary tree algorithm reduces 2^n inputs at the leaves of a balanced binary tree to a single result at the root of the tree.) Specifically, we establish a nontrivial \Omega({\frac{n}{\log n}}) loading lower bound for any degree-2 MBN running a 2^n input binary tree algorithm optimally in n steps. We show that this bound does not hold if the restriction on the degree or the running time is relaxed. That is, optimal-time, degree-3, constant loading MBNs and suboptimal-time, degree-2, constant loading MBNs exist for binary tree algorithms. We also derive a lower bound on the additional time (beyond the optimal) needed to run binary tree algorithms on a degree--2, loading-L MBN, for any L\ge 3.

[1] A.E. Caldwell, A.B. Kahng, and I.L. Markov, “Hypergraph Partitioning with Fixed Vertices,” IEEE Trans. Computer-Aided Design, pp. 267-272, 2000.
[2] A. Ali and R. Vaidyanathan, “Exact Bounds on Running ASCEND/DESCEND and FAN-IN Algorithms on Synchronous Multiple Bus Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 7, pp. 783-790, 1996.
[3] H.M. El-Boghdadi, “On Implementing Dynamically Reconfigurable Architectures,” PhD dissertation, Dept. of Electrical & Computer Eng., Louisiana State Univ., 2003.
[4] H.M. El-Boghdadi, R. Vaidyanathan, J.L. Trahan, and S. Rai, “Implementing Prefix Sums and Multiple Addition Algorithms for the Reconfigurable Mesh on the Reconfigurable Tree Architecture,” Proc. Int'l Conf. Parallel and Distributed Processing Techniques and Applications, vol. 3, pp. 1068-1074, 2002.
[5] C.-H. Chen and F.-F. Lin, “An Easy to Use Approach for Practical Bus-Based System Design,” IEEE Trans. Computers, vol. 48, pp. 780-793, 1999.
[6] H.P. Dharmasena, “Multiple Bus Networks for Binary-Tree Algorithms,” PhD dissertation, Dept. of Electrical & Computer Eng., Louisiana State Univ., 2000.
[7] H.P. Dharmasena and R. Vaidyanathan, “The Mesh with Binary-Tree Networks: An Enhanced Mesh with Low Bus-Loading,” J. Interconnection Networks, to appear.
[8] H.P. Dharmasena, R. Vaidyanathan, “An-Optimal Multiple Bus Networks for Fan-In Algorithms,” Proc. Int'l Conf. Parallel Processing, pp. 100-103, 1997.
[9] H.P. Dharmasena and R. Vaidyanathan, “Lower Bound on the Loading of Degree-2 Multiple Bus Networks for Binary-Tree Algorithms,” Proc. Int'l Parallel Processing Symp., pp. 21-25, 1999.
[10] O.M. Dighe, R. Vaidyanathan, and S.Q. Zheng, “The Bus-Connected Ringed Tree: A Versatile Interconnection Network,” J. Parallel and Distributed Computing, vol. 33, pp. 189-196, 1996.
[11] M. Feldman, R. Vaidyanathan, and A. El-Amawy, “High Speed, High Capacity Bused Interconnects Using Optical Slab Waveguides,” Proc. 1999 Workshop Optics in Computer Science, pp. 924-937, 1999.
[12] G. Gallo and S. Pallottino, “Hypergraph Models and Assembly Problem,” Technical Report TR-6/92, Dept. of Information Science, Univ. of Pisa, 1992.
[13] R. Giorgi and C. Antonio, “PSCR: A Coherence Protocol for Eliminating Passive Sharing in Shared-Bus Shared-Memory Multiprocessors,” IEEE Trans. Parallel an Distributed Systems, vol. 7, pp. 742-761, 1999.
[14] Z. Guo and R.G. Melhem, “Embeddding Binary X-Trees and Pyramids in Processor Arrays with Spanning Buses,” IEEE Trans. Parallel and Distributed Systems, vol. 5, pp. 664-672, 1994.
[15] T. Hayashi, K. Nakano, and S. Olariu, “Randomized Initialization Protocols for Packet Radio Networks,” Proc. Int'l Parallel Processing Symp., pp. 544-548, 1999.
[16] J. Jájá, An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
[17] G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar, “Multilevel Hypergraph Partitioning: Applications in VLSI Design,” Proc. ACM/IEEE Design Automation Conf., pp. 526-529 1997.
[18] P. Kulasinghe and A. El-Amawy, “On the Complexity of Bused Interconnections,” IEEE Trans. Computers, vol. 44, pp. 1248-1251, 1995.
[19] P. Kulasinghe and A. El-Amawy, “Optimal Realizations of Sets of Interconnection Functions on Synchronous Multiple Bus Systems,” IEEE Trans. Computers, vol. 45, pp. 964-969, 1996.
[20] F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays $\cdot$ Trees $\cdot$ Hypercubes. San Mateo, Calif.: Morgan Kaufmann, 1992.
[21] R. Lin, S. Olariu, J.L. Schwing, and B.F. Wang, “The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry,” IEEE Trans. Parallel and Distributed Systems, vol. 10, pp. 266-280, 1999.
[22] Y.-W. Lu, J.B. Burr, and A.M. Peterson, “Permutation on the Mesh with Reconfigurable Bus: Algorithms and Practical Considerations,” Proc. Int'l Parallel Processing Symp., pp. 298-308, 1993.
[23] M. Slater, Microprocessor Based Design— A Comprehensive Guide to Hardware Design. Prentice Hall, 1989.
[24] T.N. Mudge, J.P. Hayes, and D.C. Winsor, “Multiple Bus Architectures,” Computer, pp. 42-48, 1987.
[25] Y. Pan, S.Q. Zheng, K. Li, and H. Shen, “An Improved Generalization of Mesh-Connected Computers with Multiple Buses,” IEEE Trans. Parallel and Distributed Systems, vol. 12, pp. 293-305, 2001.
[26] G. Panchapakesan and A. Sengupta, “On a Light Wave Network Topology Using Kautz Diagraphs,” IEEE Trans. Computers, vol. 48, pp. 1131-1137, 1999.
[27] A.L. Rosenberg, “A Hypergraph Model for Fault-Tolerant VLSI Processor Arrays,” IEEE Trans. Computers, vol. 34, pp. 578-584, 1985.
[28] R. Sidhu, S. Wadhwa, A. Mei, and V.K. Prasanna, “A Self-Reconfigurable Gate Array Architecture,” Proc. Int'l Conf. Field Programmable Logic and Applications, pp. 106-120, 2000.
[29] R.K. Thiruchelvan, J.L. Trahan, and R. Vaidyanathan, “On the Power of Segmenting and Fusing Buses,” J. Parallel and Distributed Computing, vol. 34, pp. 82-94, 1996.
[30] R. Vaidyanathan and A. Padmanabhan, “Bus-Based Networks for Fan-In and Uniform Hypercube Algorithms,” Parallel Computing, vol. 21, pp. 1807-1821, 1995.
[31] R. Vaidyanathan, Dynamic Reconfiguration: Architectures and Algorithms. New York: Kluwer Academic/Plenum Publishers, 2004.
[32] J.F. Wakerly, Digital System Design, Principles & Practice. Upper Saddle River, N.J.: Prentice Hall, 1994.

Index Terms:
Multiple bus networks, binary tree algorithms, bus loading, lower bounds, interconnection networks.
Citation:
Hettihe P. Dharmasena, Ramachandran Vaidyanathan, "Lower Bounds on the Loading of Multiple Bus Networks for Binary Tree Algorithms," IEEE Transactions on Computers, vol. 53, no. 12, pp. 1535-1546, Dec. 2004, doi:10.1109/TC.2004.117
Usage of this product signifies your acceptance of the Terms of Use.