Bus-Based Tree Structures for Efficient Parallel Computation

Authors:
O. M. Dighe;R. Vaidyanathan;S. Q. Zheng
Affiliations:
Louisiana State University, Baton Rouge, LA;Louisiana State University, Baton Rouge, LA;Louisiana State University, Baton Rouge, LA
Venue:
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
Year:
1993

Citing 0
Cited 1

An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a class of new multiprocessor structures called bus based trees (BBTs) that are based on multiple buses. We show that a BBT can simulate a tree machine optimally. We also discuss optimal VLSI layouts for the BBT and show that the BBT can be used as a building block to construct new powerful parallel computing structures.