High speed, high capacity bused interconnects using optical slab waveguides

Feldman, Moran; Vaidyanathan, Ramachandran; El-Amawy, A.

doi:10.1007/bfb0097977

Cited by 6 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The degree of an MBN is indicative of the number of input/output ports needed per processor. A large loading can introduce a significant delay or attenuation of the signal traversing a bus [14,29]. Figure 1 shows a 16 x 8 MBN with degree 3 and loading 3.…”

Section: Multiple-bus Networkmentioning

confidence: 99%

“…Typically an enhanced mesh with N processors connects $l(N c ) processors to a bus, where 0 < c < 1 is a constant. This large number of connections causes a high capacitive loading on the bus, resulting in a reduction of the bus data rate to ensure reliable operation [14,29]. Thus, the assumption of constant time broadcasting on a bus, that enhanced mesh models make, may be quite difficult to realize.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The Mesh With Binary Tree Networks: An Enhanced Mesh With Low Bus-Loading

Dharmasena

Vaidyanathan

2004

J. Inter. Net.

Self Cite

View full text Add to dashboard Cite

The literature abounds with enhanced mesh models and numerous results for them. These models employ buses connecting a large (usually a polynomial) number of processors resulting in high bus loading and a very low bus data rate. In this paper we propose an enhanced mesh model called the mesh with binary-tree (multiple bus) network (MBTN) with low bus loading. We measure the cost of the model in terms of its loading, degree (connections per processor), number of buses and layout area. We also devise an algorithm to perform prefix computations on the MBTN. The MBTN's parameters can be selected to provide a wide range of tradeoffs between its cost and performance. Most importantly, for every major existing enhanced mesh model, there is a choice of parameters that makes the MBTN superior to the existing model.Key to the MBTN is a novel implementation of a binary-tree algorithm on a multiple bus network (MBN). We propose two constant loading MBNs that can run binary tree algorithms optimally. We also show that any network (such as the MBTN) that is capable of running binary tree algorithms efficiently can also solve linear recurrences efficiently. These results may be of independent interest.

show abstract

Section: Multiple-bus Networkmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%