The VLSI Complexity of Selected Graph Problems
Journal of the ACM (JACM)
Depth-size trade-offs for parallel prefix computation
Journal of Algorithms
Data movement techniques for the pyramid computer
SIAM Journal on Computing
Solving linear recurrence systems on mesh-connected computers with multiple global buses
Journal of Parallel and Distributed Computing
Journal of the ACM (JACM)
A universal interconnection pattern for parallel computers
Journal of the ACM (JACM)
Array processor with multiple broadcasting
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Computing connected components on parallel computers
Communications of the ACM
Sorting on a mesh-connected parallel computer
Communications of the ACM
X-Tree: A tree structured multi-processor computer architecture
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Computational Aspects of VLSI
Prefix Computations on a Generalized Mesh-Connected Computer with Multiple Buses
IEEE Transactions on Parallel and Distributed Systems
An Improved Generalization of Mesh-Connected Computers with Multiple Buses
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Scalable Interconnection Network Architecture for Petaflops Computing
The Journal of Supercomputing
Performance, Algorithmic, and Robustness Attributes of Perfect Difference Networks
IEEE Transactions on Parallel and Distributed Systems
Graph theoretic characterization and reliability of the multiple-clique network
Mathematical and Computer Modelling: An International Journal
| Hi-index | 14.98 |
The author explores modifications of a mesh-connected parallel computer for the purpose of increasing the efficiency of executing important application programs. These modifications are made by adding one or more global mesh structures to the processing array. The author shows how his modifications allow asymptotic improvements in the efficiency of executing computations having low to medium interprocessor communication requirements (e.g. tree computations, prefix computations, or finding the connected components of a graph). For computations with high interprocessor communication requirements such as sorting, the author shows that they offer no speedup. He also compares the modified mesh-connected parallel computer to other similar organization including the pyramid, the X-tree, and the mesh-of-trees.