Optimal multiple bus network for Fan-in algorithms

Document Type

Conference Proceeding

Publication Date

1-1-1997

Abstract

We consider a class of algorithms called Fan-in algorithms, with numerous applications in problems involving semigroup operations. We present a multiple bus network (MBN) that runs any Fan-in algorithm in optimal number of steps. The degree and loading of this MBN are each 3. We prove that the product of the degree and loading of any MBN that runs a Fan-in algorithm in optimal time is at least 9. This establishes the proposed MBN to be optimal.

Publication Source (Journal or Book title)

Proceedings of the International Conference on Parallel Processing

First Page

100

Last Page

103

This document is currently not available here.

Share

COinS