Communications of the ACM - Special section on computer architecture
High-performance computer architecture
High-performance computer architecture
Parallel Sorting in Two-Dimensional VLSI Models of Computation
IEEE Transactions on Computers
An Orthogonal Multiprocessor for Parallel Scientific Computations
IEEE Transactions on Computers
Two nearly optimal sorting algorithms for mesh-connected processor arrays using shear-sort
Journal of Parallel and Distributed Computing
Analysis and applications of the orthogonal access multiprocessor
Journal of Parallel and Distributed Computing
Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)
Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)
Definition and analysis of a class of spanning bus orthogonal multiprocessing systems
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Applied combinatorics (3rd ed.)
Applied combinatorics (3rd ed.)
Discrete and Combinatoral Mathematics: An Applied Introduction 2nd Ed.
Discrete and Combinatoral Mathematics: An Applied Introduction 2nd Ed.
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Study of multistage SIMD interconnection networks
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
A New Family of Cayley Graph Interconnection Networks of Constant Degree Four
IEEE Transactions on Parallel and Distributed Systems
On the Performance of Parallel Matrix Factorisation on the Hypermesh
The Journal of Supercomputing
IEEE Transactions on Computers
Sorting in Mesh Connected Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
A graph theoretical representation for a class of interconnection networks is suggested.The idea is based on a definition of orthogonal binary vectors and leads to a constructionrule for a class of orthogonal graphs. An orthogonal graph is first defined as a set of2/sup m/ nodes, which in turn are linked by 2/sup m-n/ edges for every link model definedin an integer set Q*. The degree and diameter of an orthogonal graph are determined interms of the parameters n, m, and the number of link modes defined in Q*. Routing inorthogonal graphs is shown to reduce to the node covering problem in bipartite graphs.The proposed theory is applied to describe a number of well-known interconnectionnetworks such as the binary m-cube and spanning-bus meshes. Multidimensional access (MDA) memories are also shown as examples of orthogonal shared memory multiprocessingsystems. Finally, orthogonal graphs are applied to the construction of multistageinterconnection networks. Connectivity and placement rules are given and shown to yielda number of well-known networks.