An optimal multiple bus network for fan-in algorithms

We consider a class of algorithms called fan-in algorithms, with numerous applications in problems involving semigroup operations. We present a multiple bus network (MBN) that runs any fan-in algorithm in optimal number of steps. The degree and loading of this MBN are each 3. We prove that the product of the degree and loading of any MBN that runs a fan-in algorithm in optimal time is at least 9. This establishes the proposed MBN to be optimal.

[1]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[2]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[3]  Anand Padmanabhan,et al.  Bus-Based Networks for Fan-In and Uniform Hypercube Algorithms , 1995, Parallel Comput..

[4]  Steven P. Levitan,et al.  Algorithms for a Broadcast Protocol Multiprocessor , 1982, IEEE International Conference on Distributed Computing Systems.

[5]  David A. Carlson,et al.  Solving Linear Recurrence Systems on Mesh-Connected Computers with Multiple Global Buses , 1990, J. Parallel Distributed Comput..

[6]  Leonard Kleinrock,et al.  Broadcast Communications and Distributed Algorithms , 1986, IEEE Transactions on Computers.

[7]  Eli Gafni,et al.  Sorting and Selection in Multi-Channel Broadcast Networks , 1985, ICPP.

[8]  Steven P. Levitan,et al.  Finding an extremum in a network , 1982, ISCA 1982.

[9]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[10]  Richard C. T. Lee,et al.  Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models , 1991, ICCI.

[11]  K. V. S. Ramarao.  Distributed Sorting on Local Area Networks , 1988, IEEE Trans. Computers.

[12]  Gen-Huey Chen,et al.  Conflict-free broadcasting algorithms for graph traversals and their applications , 1992, Parallel Comput..

[13]  Si-Qing Zheng,et al.  The Bus-Connected Ringed Tree: A Versatile Interconnection Network , 1996, J. Parallel Distributed Comput..

[14]  Assaf Schuster,et al.  Self-Simulation for the Passive Optical Star Model , 1995, ESA.

[15]  Richard C. T. Lee,et al.  Parallel Graph Algorithms Based Upon Broadcast Communications , 1990, IEEE Trans. Computers.

[16]  Frank Thomson Leighton.  Introduction to parallel algorithms and architectures: arrays , 1992 .

[17]  Ramachandran Vaidyanathan,et al.  Exact Bounds on Running ASCEND/DESCEND and FAN-IN Algorithms on Synchronous Multiple Bus Networks , 1996, IEEE Trans. Parallel Distributed Syst..

[18]  Cauligi S. Raghavendra,et al.  HMESH: A VLSI Architecture for Parallel Processing , 1986, CONPAR.

[19]  Koji Nakano,et al.  A Bibliography of Published Papers on Dynamically Reconfigurable Architectures , 1995, Parallel Process. Lett..

[20]  Koji Nakano,et al.  Optimal Sorting Algorithms on Bus-Connected Processor Arrays , 1993 .

[21]  Satoshi Fujita,et al.  Fast Gossiping on Mesh-Bus Computers , 1996, IEEE Trans. Computers.