Efficient routing techniques for cooperating processors in dataflow computers

Authors:
Barry G. Douglass;A. Yavuz Oruc
Affiliations:
Electrical, Computer and Systems Engineering Department, Rensselaer Polytechnic Institute, Troy, NY;Electrical Engineering Department and Institute for Advanced Computer Studies, University of Maryland, College Park, MD
Venue:
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Year:
1990

Citing 5
Cited 0

The Manchester prototype dataflow computer

Communications of the ACM - Special section on computer architecture
Dataflow architectures

Annual review of computer science vol. 1, 1986
An Architectural Comparison of Dataflow Systems

Computer
A Permutation Network

Journal of the ACM (JACM)
A data flow processor array system: Design and analysis

ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

A key problem in designing a dataflow computer is to maintain a strong cooperation among the processors. This requires two types of communications among the processors which are commonly referred to as arbitration and distribution. The paper describes a family of switches, called CP networks which can be used as arbitrators and distributors in dataflow computers. The arbitration networks require &Ogr;(N log2 N) binary switches, and have &Ogr;(log22 N) delay, and distribution networks require &Ogr;(N log22 N) binary switches, and have &Ogr;(log22 N) delay.