Optimal Architectures and Algorithms for Mesh-Connected Parallel Computers with Separable Row/Column Buses
Issue No. 10 - October (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.246069
<p>A two-dimensional mesh of processing elements (PE's) with separable row and columnbuses (i.e., broadcast mechanisms for rows and columns that can be logically divided intoa number of local buses through the use of PE-controlled switches) has been shown to bequite effective for semigroup computation, prefix computation, and a wide class of othercomputations that do not require excessive communication or data routing. For mesheswith separable row/column buses, the authors show how semigroup and prefixcomputations can be performed with the same asymptotic time complexity without theprovision of buses for every row and every column and discuss the VLSI implications ofthis new architecture.</p>
Index Termsmesh-connected; parallel computers; two-dimensional mesh; processing elements;separable row and column buses; time complexity; data routing; semigroup computation;prefix computation; computational complexity; parallel algorithms; parallel architectures
B. Parhami and M. Serrano, "Optimal Architectures and Algorithms for Mesh-Connected Parallel Computers with Separable Row/Column Buses," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 1073-1080, 1993.