Bus-based networks for fan-in and uniform hypercube algorithms

Document Type

Article

Publication Date

1-1-1995

Abstract

We consider the problem of running two large classes of algorithms (called "fan-in" and "uniform hypercube algorithms") on a synchronous parallel processing environment in which processors are connected by a multiple bus network (MBN). We present two MBNs, F and U, that run fan-in and uniform hypercube algorithms optimally. We also show that the MBN U is highly resilient to bus faults. This coupled with the fact that uniform hypercube algorithms require a rich set of interconnections and find use in a variety of applications, makes U useful as a general purpose interconnection structure. © 1995.

Publication Source (Journal or Book title)

Parallel Computing

First Page

1807

Last Page

1821

This document is currently not available here.

Share

COinS