Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees

Nath,; Maheshwari,; Bhatt,

doi:10.1109/tc.1983.1676279

Cited by 98 publications

(8 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mesh of trees is shown to be quite powerful computationally [23], [20]. In [32] it is shown that the 2 P x 2' 4 mesh of trees M T ( 2 P , 2q) is a subgraph of T ( p + l ) x T ( q + l ) .…”

Section: ) Mesh Of Treesmentioning

confidence: 99%

The hyper-deBruijn networks: scalable versatile architecture

Ganesan

Pradhan

1993

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Both Hypercube and deBruijn networks possess desirable properties. It should be understood, though, that some of the attractive features of one are not found in the other. The architecture proposed in this paper is a combination of these architectures, providing some of the desirable properties of both the networks such as admitting many computationally important networks, flexibility in terms of connections per node as well as level of fault-tolerance. Also the network allows a simple VLSI layout, scalability as well as decomposability. Thus, these networks can be a potential candidate for VLSI multiprocessor networks. The proposed network possesses logarithmic diameter, optimal connectivity, and simple routing algorithms amendable to networks with faults. Importantly, in addition to being pancyclic, these hyper-deBruijn networks admit most computationally important subnetworks including rings, multidimensional meshes, complete binary trees, and mesh of trees with perfect dilation.Techniques for optimal one-to-all (OTA) broadcasting in these networks are presented. As an intermediate result, this technique provides the fastest OTA broadcasting in binary deBruijn networks as well. The recent renewed interest in binary deBruijn networks makes this later result valuable.

show abstract

“…Mesh of trees is shown to be quite powerful computationally [23], [20]. In [32] it is shown that the 2 P x 2' 4 mesh of trees M T ( 2 P , 2q) is a subgraph of T ( p + l ) x T ( q + l ) .…”

Section: ) Mesh Of Treesmentioning

confidence: 99%

The hyper-deBruijn networks: scalable versatile architecture

Ganesan

Pradhan

1993

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…The orthogonal trees network (OTH) (Leighton, 1981;Nath, Maheshwari & Bhatt, 1983) can efficiently solve a large class of problems such as sorting, matrix multiplication, FFT, and finding connected components in a graph, etc. In some problems the 0TN outperforms both the SEN and the CCC.…”

Section: Further Researchmentioning

confidence: 99%

Dictionary Machines on Cube-Class Networks

Schwartz

Loui

1987

IEEE Trans. Comput.

View full text Add to dashboard Cite

“…However, among all, the diameter is the most important factor that puts the lower bound on the time complexity for many parallel algorithms, especially for those which require communication between arbitrary pair of nodes. MOT (Mesh of Trees) is an efficient interconnection network which is well known for its small diameter, large bisection width and area universality [22,30,36]. In the recent years, MOT has created a lot of interest among researchers.…”

Section: Introductionmentioning

confidence: 99%

“…MOT has been shown as an efficient interconnection network for single-chip parallel processing by Balkan [3][4][5]. It has also been studied for FPGA [27] and MFPGA [28] architectures by Marrakchi et al This network can provide logarithmic time algorithms for many problems such as matrix-vector multiplication, sorting, packet routing, prefix computation, minimum spanning trees, convex hull and so on [16,22,30]. Algorithms for other computations, including image compression, broadcasting and gossiping and Euclidean distance [1,21,37], have been efficiently developed on this architecture.…”

Section: Introductionmentioning

confidence: 99%

OTIS-MOT: an efficient interconnection network for parallel processing

Jana

Mallick

2010

J Supercomput

View full text Add to dashboard Cite

Mesh of trees (MOT) is well known for its small diameter, high bisection width, simple decomposability and area universality. On the other hand, OTIS (Optical Transpose Interconnection System) provides an efficient optoelectronic model for massively parallel processing system. In this paper, we present OTIS-MOT as a competent candidate for a two-tier architecture that can take the advantages of both the OTIS and the MOT. We show that an n 4 − processor OTIS-MOT has diameter 8 log n * + 1 (The base of the logarithm is assumed to be 2 throughout this paper.) and fault diameter 8 log n + 2 under single node failure. We establish other topological properties such as bisection width, multiple paths and the modularity. We show that many communication as well as application algorithms can run on this network in comparable time or even faster than other similar tree-based two-tier architectures. The communication algorithms including row/column-group broadcast and one-toall broadcast are shown to require O(log n) time, multicast in O(n 2 log n) time and the bit-reverse permutation in O(n) time. Many parallel algorithms for various problems such as finding polynomial zeros, sales forecasting, matrix-vector multiplication and the DFT computation are proposed to map in O(log n) time. Sorting and prefix computation are also shown to run in O(log n) time.

show abstract

Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees

Cited by 98 publications

References 14 publications

The hyper-deBruijn networks: scalable versatile architecture

The hyper-deBruijn networks: scalable versatile architecture

Dictionary Machines on Cube-Class Networks

OTIS-MOT: an efficient interconnection network for parallel processing

Contact Info

Product

Resources

About