Communications of the ACM - Special section on computer architecture
Multigrid Algorithms on the Hypercube Multiprocessor
IEEE Transactions on Computers
Communication effect basic linear algebra computations on hypercube architectures
Journal of Parallel and Distributed Computing
On mapping parallel algorithms into parallel architectures
Journal of Parallel and Distributed Computing
The characteristics of parallel algorithms
The characteristics of parallel algorithms
Pyramidal systems for computer vision
BBN Butterfly parallel processor
Programming parallel processors
The physical mapping problem for parallel architectures
Journal of the ACM (JACM)
IEEE Transactions on Computers
Embedding meshes in Boolean cubes by graph decomposition
Journal of Parallel and Distributed Computing - Special issue: algorithms for hypercube computers
Embedding mesh of trees in the hypercube
Journal of Parallel and Distributed Computing
Embedding shuffle networks in hypercubes
Journal of Parallel and Distributed Computing
Efficient embeddings of trees in hypercubes
SIAM Journal on Computing
Embedding all binary trees in the hypercube
Journal of Parallel and Distributed Computing
Embeddings among meshes and tori
Journal of Parallel and Distributed Computing
Performance analysis of a synchronous, circuit-switched interconnection cached network
ICS '94 Proceedings of the 8th international conference on Supercomputing
NetSim: a tool for modeling the performance of circuit switched multicomputer networks
Proceedings of the 7th international conference on Computer performance evaluation : modelling techniques and tools: modelling techniques and tools
Cost Trade-offs in Graph Embeddings, with Applications
Journal of the ACM (JACM)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
IEEE Transactions on Parallel and Distributed Systems
Extremal Graph Theory
Graphs and Hypergraphs
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Recursive Cube of Rings: A New Topology for Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Communication Models for a Free-Space Optical Cross-Connect Switch
The Journal of Supercomputing
Hi-index | 0.01 |
This paper presents novel embeddings of various classical topologies into the OPAM multicomputer. OPAM consists of a large number of processors that are connected by a two level, crossbar based interconnection network. The network combines a large, optical circuit-switched crossbar (reconfigurable network), with many small, packet-switching crossbars. The needed embedding is very different than the classical approaches. The goal in our case is to minimize routing decisions, so that communication requests can be satisfied by passing through two small crossbars. We show how to map parallel programs to this architecture using graph contraction notations. The family of parallel programs that we consider consists of multiple processes and communication links that are represented by connected, regular graphs such as rings, trees, two dimensional grids, cube connected cycles and hypercubes. In each case we show how to partition the vertex set of the program's graph to subsets, and how to assign each subset a cluster of processors in order to realize the topology of the given problem. In some of the cases we also prove that our partition and assignment algorithms are optimal.