Fundamental data movement operations and its applications on a hyper-bus broadcast network

A hyper-bus broadcast network (HBBN) consists of processors only sharing by some global buses, and there are no local links between processors. Based on such an architecture, we will exploit several efficient time parallel algorithms for solving the well-known fundamental data movement problems which had been extensively studied by researchers and widely applied to the field of image processing, digitized geometry and computer graphics. These include the leftmost one problem, the prefix maxima/minima problem, the m-contour problem, the all nearest neighbor problem and the all nearest smaller values problem, respectively. Note that the proposed algorithms not only can be implemented on the HBBN but also can be easily modified to run on other broadcast-based networks with the same time and processor complexities.

[1]  Pranay Chaudhuri.  Parallel algorithms: design and analysis , 1992 .

[2]  Kang G. Shin,et al.  Implementation of Decentralized Load Sharing in Networked Workstations Using the Condor Package , 1997, J. Parallel Distributed Comput..

[3]  D J Evans,et al.  Parallel processing , 1986 .

[4]  Stephan Olariu,et al.  Data Movement Techniques on Reconfigurable Meshes, with Applications , 1994, Int. J. High Speed Comput..

[5]  Viktor K. Prasanna,et al.  Array Processor with Multiple Broadcasting , 1985, ISCA.

[6]  Massimo Maresca,et al.  Polymorphic-Torus Architecture for Computer Vision , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  S. Olariu,et al.  A constant-time channel-assignment algorithm on reconfigurable meshes , 1992, Proceedings IEEE Southeastcon '92.

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

[9]  Ivan Stojmenovic,et al.  Time-optimal proximity algorithms on meshes with multiple broadcasting , 1994, Proceedings of 8th International Parallel Processing Symposium.

[10]  Tse-yun Feng,et al.  A Survey of Interconnection Networks , 1981, Computer.

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

[12]  Uzi Vishkin,et al.  Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm , 1990, Discret. Appl. Math..

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

[14]  Shahid H. Bokhari,et al.  Finding Maximum on an Array Processor with a Global Bus , 1984, IEEE Transactions on Computers.

[15]  Gen-Huey Chen,et al.  Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems , 1990, IEEE Trans. Parallel Distributed Syst..

[16]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

[17]  Jang-Ping Sheu,et al.  Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting , 1990, IEEE Trans. Parallel Distributed Syst..

[18]  Uzi Vishkin,et al.  Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values , 1993, J. Algorithms.

[19]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[20]  Dionysios I. Reisis,et al.  Parallel Computations on Reconfigurable Meshes , 1993, IEEE Trans. Computers.

[21]  Douglas A. Pucknell,et al.  Basic VLSI Design , 1987 .

[22]  Kuo-Liang Chung.  Prefix Computations on a Generalized Mesh-Connected Computer with Multiple Buses , 1995, IEEE Trans. Parallel Distributed Syst..

[23]  Alok Aggarwal,et al.  Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses , 1986, IEEE Transactions on Computers.

[24]  Himabindu Gurla.  Leftmost one Computation on Meshes with Row Broadcasting , 1993, Inf. Process. Lett..

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

[26]  Ivan Stojmenovic,et al.  Time-optimal visibility-related algorithms on meshes with multiple broadcasting , 1993, Proceedings of International Conference on Application Specific Array Processors (ASAP '93).

[27]  Quentin F. Stout,et al.  Meshes with multiple buses , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[28]  Shi-Jinn Horng,et al.  Efficient algorithms for computing two nearest-neighbor problems on a rap , 1994, Pattern Recognit..

[29]  Hungwen Li,et al.  Connection Autonomy in SIMD Computers: A VLSI Implementation , 1989, J. Parallel Distributed Comput..

[30]  Shi-Jinn Horng.  Generalized Mesh-Connected Computers with Hyperbus Broadcasting for a Computer Network (Special Issue on Architectures, Algorithms and Networks for Massively parallel Computing) , 1996 .

[31]  Charles C. Weems,et al.  Image understanding architecture and applications , 1988 .

[32]  D. T. Lee,et al.  The All Nearest-Neighbor Problem for Convex Polygons , 1978, Inf. Process. Lett..

[33]  Ivan Stojmenovic,et al.  Time-optimal visibility-related algorithms of meshes with multiple broadcasting , 1994, Proceedings of 8th International Parallel Processing Symposium.