Efficient routing techniques for cooperating processors in dataflow computers
Barry G. Douglass, A. Yavuz Oruç · 1990
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 Ο(N log2 N) binary switches, and have Ο(log22 N) delay, and distribution networks require Ο(N log22 N) binary switches, and have Ο(log22 N) delay.