The bus-connected ringed tree: A versatile interconnection network

Document Type

Article

Publication Date

3-15-1996

Abstract

We consider the use of multiple-bus networks (MBNs) in a synchronous parallel processing environment. We propose a class of MBNs called bus-connected ringed trees (BRTs). A 1-dimensional BRT is shown to have an optimal processor fanout of 2 and to be capable of optimally simulating a complete binary tree and a ring. The results for the 1-dimensional BRT extend to higher dimensional BRTs. In particular, the 2-dimensional BRT is shown to have a constant processor fan-out of 4 and to be capable of efficiently simulating a complete binary tree, ring, and fixed-degree 2-dimensional structures that include the torus, mesh, and mesh of trees. The 2-dimensional BRT serves as a uniform platform on which all algorithms for the above topologies can be run efficiently. © 1996 Academic Press, Inc.

Publication Source (Journal or Book title)

Journal of Parallel and Distributed Computing

First Page

189

Last Page

196

This document is currently not available here.

Share

COinS