
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 15351546, December, 2004.  
BibTex  x  
@article{ 10.1109/TC.2004.117, author = {Hettihe P. Dharmasena and Ramachandran Vaidyanathan}, title = {Lower Bounds on the Loading of Multiple Bus Networks for Binary Tree Algorithms}, journal ={IEEE Transactions on Computers}, volume = {53}, number = {12}, issn = {00189340}, year = {2004}, pages = {15351546}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2004.117}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Lower Bounds on the Loading of Multiple Bus Networks for Binary Tree Algorithms IS  12 SN  00189340 SP1535 EP1546 EPD  15351546 A1  Hettihe P. Dharmasena, A1  Ramachandran Vaidyanathan, PY  2004 KW  Multiple bus networks KW  binary tree algorithms KW  bus loading KW  lower bounds KW  interconnection networks. VL  53 JA  IEEE Transactions on Computers ER   
[1] A.E. Caldwell, A.B. Kahng, and I.L. Markov, “Hypergraph Partitioning with Fixed Vertices,” IEEE Trans. ComputerAided Design, pp. 267272, 2000.
[2] A. Ali and R. Vaidyanathan, “Exact Bounds on Running ASCEND/DESCEND and FANIN Algorithms on Synchronous Multiple Bus Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 7, pp. 783790, 1996.
[3] H.M. ElBoghdadi, “On Implementing Dynamically Reconfigurable Architectures,” PhD dissertation, Dept. of Electrical & Computer Eng., Louisiana State Univ., 2003.
[4] H.M. ElBoghdadi, 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. 10681074, 2002.
[5] C.H. Chen and F.F. Lin, “An Easy to Use Approach for Practical BusBased System Design,” IEEE Trans. Computers, vol. 48, pp. 780793, 1999.
[6] H.P. Dharmasena, “Multiple Bus Networks for BinaryTree Algorithms,” PhD dissertation, Dept. of Electrical & Computer Eng., Louisiana State Univ., 2000.
[7] H.P. Dharmasena and R. Vaidyanathan, “The Mesh with BinaryTree Networks: An Enhanced Mesh with Low BusLoading,” J. Interconnection Networks, to appear.
[8] H.P. Dharmasena, R. Vaidyanathan, “AnOptimal Multiple Bus Networks for FanIn Algorithms,” Proc. Int'l Conf. Parallel Processing, pp. 100103, 1997.
[9] H.P. Dharmasena and R. Vaidyanathan, “Lower Bound on the Loading of Degree2 Multiple Bus Networks for BinaryTree Algorithms,” Proc. Int'l Parallel Processing Symp., pp. 2125, 1999.
[10] O.M. Dighe, R. Vaidyanathan, and S.Q. Zheng, “The BusConnected Ringed Tree: A Versatile Interconnection Network,” J. Parallel and Distributed Computing, vol. 33, pp. 189196, 1996.
[11] M. Feldman, R. Vaidyanathan, and A. ElAmawy, “High Speed, High Capacity Bused Interconnects Using Optical Slab Waveguides,” Proc. 1999 Workshop Optics in Computer Science, pp. 924937, 1999.
[12] G. Gallo and S. Pallottino, “Hypergraph Models and Assembly Problem,” Technical Report TR6/92, Dept. of Information Science, Univ. of Pisa, 1992.
[13] R. Giorgi and C. Antonio, “PSCR: A Coherence Protocol for Eliminating Passive Sharing in SharedBus SharedMemory Multiprocessors,” IEEE Trans. Parallel an Distributed Systems, vol. 7, pp. 742761, 1999.
[14] Z. Guo and R.G. Melhem, “Embeddding Binary XTrees and Pyramids in Processor Arrays with Spanning Buses,” IEEE Trans. Parallel and Distributed Systems, vol. 5, pp. 664672, 1994.
[15] T. Hayashi, K. Nakano, and S. Olariu, “Randomized Initialization Protocols for Packet Radio Networks,” Proc. Int'l Parallel Processing Symp., pp. 544548, 1999.
[16] J. Jájá, An Introduction to Parallel Algorithms. AddisonWesley, 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. 526529 1997.
[18] P. Kulasinghe and A. ElAmawy, “On the Complexity of Bused Interconnections,” IEEE Trans. Computers, vol. 44, pp. 12481251, 1995.
[19] P. Kulasinghe and A. ElAmawy, “Optimal Realizations of Sets of Interconnection Functions on Synchronous Multiple Bus Systems,” IEEE Trans. Computers, vol. 45, pp. 964969, 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. 266280, 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. 298308, 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. 4248, 1987.
[25] Y. Pan, S.Q. Zheng, K. Li, and H. Shen, “An Improved Generalization of MeshConnected Computers with Multiple Buses,” IEEE Trans. Parallel and Distributed Systems, vol. 12, pp. 293305, 2001.
[26] G. Panchapakesan and A. Sengupta, “On a Light Wave Network Topology Using Kautz Diagraphs,” IEEE Trans. Computers, vol. 48, pp. 11311137, 1999.
[27] A.L. Rosenberg, “A Hypergraph Model for FaultTolerant VLSI Processor Arrays,” IEEE Trans. Computers, vol. 34, pp. 578584, 1985.
[28] R. Sidhu, S. Wadhwa, A. Mei, and V.K. Prasanna, “A SelfReconfigurable Gate Array Architecture,” Proc. Int'l Conf. Field Programmable Logic and Applications, pp. 106120, 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. 8294, 1996.
[30] R. Vaidyanathan and A. Padmanabhan, “BusBased Networks for FanIn and Uniform Hypercube Algorithms,” Parallel Computing, vol. 21, pp. 18071821, 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.