This Article 
 Bibliographic References 
 Add to: 
Exact Bounds on Running ASCEND/DESCEND and FAN-IN Algorithms on Synchronous Multiple Bus Networks
August 1996 (vol. 7 no. 8)
pp. 783-790

Abstract—We consider the problem of running ASCEND/DESCEND and FAN-IN algorithms on synchronous multiple bus networks with a restricted number of buses. Exact1 lower bounds on the time are derived. We present a method that runs FAN-IN algorithms optimally and ASCEND/DESCEND algorithms in one step beyond the lower bound.

[1] H.M. Alnuwieri, M. Alimuddin, and H. Aljunaidi, "Switch Models and Reconfigurable Networks: Tutorial and Partial Survey," Proc. First Workshop on Reconfigurable Architectures, 1994.
[2] D.M. Chiarulli, S. Levitan, and R.G. Melhem, "Optical Bus Control for Distributed Multiprocessors," J. Parallel and Distributed Computing, vol. 10, pp. 45-54, 1990.
[3] O.M. Dighe, R. Vaidyanathan, and S.Q. Zheng, "The Bus-Connected Ringed Tree: A Versatile Interconnection Network," J. Parallel And Distributeda Computing, vol. 33, pp. 189-196, 1996.
[4] J. J'aJ'a, An Introduction to Parallel Algorithms.New York: Addison-Wesley, 1992.
[5] H. Jiang and K.C. Smith, "PPMB: A Partial Multiple Bus Multiprocessor Architecture for Improved Cost Effectiveness," IEEE Trans. Computers, vol. 14, pp. 361-366, Mar. 1992.
[6] J. Killian,S. Kipnis,, and C.E. Leiserson,“The organization of permutation architectures with bused interconnections,” IEEE Trans. Computers, vol. 39, no. 11, pp. 1,346-1,357, Nov. 1990.
[7] P. Kulasinghe and A. El-Amawy,“Optimal realization of sets of interconnection functions on multiple bus systems,” IEEE Trans. Computers, to appear.
[8] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[9] H. Li and M. Maresca, "Polymorphic-Torus Architecture for Computer Vision," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 3, pp. 233-243, Mar. 1989.
[10] R. Miller,V.K. Prasanna Kumar,D.I. Reisis, and Q.F. Stout,“Parallel computations on reconfigurable meshes,” IEEE Trans. on Computers, pp. 678-692, June 1993.
[11] T.N. Mudge, D.C. Winsor, and J.P. Hayes, “Multiple Bus Architectures,” Computer, vol. 20, pp. 42-48, June 1987.
[12] S. Nadella, "Fault-Tolerant Multiple Bus Networks for FAN-IN Algorithms," MS thesis, Dept. of Electrical and Computer Engineering, Louisiana State University, Baton Rouge, 1995.
[13] F.P. Preparata and J. Vuillemin, “The Cube-Connected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300-309, 1981.
[14] M.J. Serrano and B. Parhami, "Optimal Architectures and Algorithms for Mesh-Connected Parallel Computers with Separable Row/Column Buses," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 1,073-1,080, Oct. 1993.
[15] J.L. Trahan, R. Vaidyanathan, and R.K. Thiruchelvan, "On the Power of Segmenting and Fusing Buses," J. Parallel and Distributed Computing, vol. 34, no. 1, pp. 82-94, Apr. 1996.
[16] R. Vaidyanathan, "Design of Multiple-Bus Interconnection Networks for Fan-in Computations," Proc. 29th Ann. Allerton Conf. on Communication, Control and Computing, pp. 1,093-1,102, 1991.
[17] R. Vaidyanathan, "Sorting on PRAMs with Reconfigurable Buses," Info. Processing Letters, vol. 42, pp. 203-208, June 1992.
[18] R. Vaidyanathan and A. Padmanabhan, "Bus-Based Networks for Fan-in and Uniform Hypercube Algorithms," Parallel Computing, vol. 21, pp. 1,807-1,821, 1995.
[19] Q. Yang and L.N. Bhuyan, "Analysis of Packet-Switched Multiple-Bus Multiprocessor Systems," IEEE Trans. Computers, vol. 40, pp. 352-357, March 1991.

Index Terms:
ASCEND/DESCEND algorithms, FAN-IN algorithms, multiple bus networks, parallel algorithms, scheduling, synchronous parallelism.
Arshad Ali, Ramachandran Vaidyanathan, "Exact Bounds on Running ASCEND/DESCEND and FAN-IN Algorithms on Synchronous Multiple Bus Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 8, pp. 783-790, Aug. 1996, doi:10.1109/71.532110
Usage of this product signifies your acceptance of the Terms of Use.