Theory of Generalized Branch and Combine Clock Networks

Authors:
Ahmed El-Amawy;Priyalal Kulasinghe
Affiliations:
Louisiana State University, USA;Louisiana State University, USA
Venue:
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Year:
1994

Citing 5
Cited 0

Synchronizing Large VLSI Processor Arrays

IEEE Transactions on Computers
Performance of Synchronous and Asynchronous Schemes for VLSI Systems

IEEE Transactions on Computers
Clock system design

IEEE Design & Test
Clocking Arbitrarily Large Computing Structures Under Constant Skew Bound

IEEE Transactions on Parallel and Distributed Systems
Asynchronous and Clocked Control Structures for VSLI Based Interconnection Networks

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a recent development a new clock distribution scheme, called Branch-and-Combine or BaC, has been introduced. The scheme is the first to guarantee constant skew bound regardless of network size. In this paper we generalize and extend the work on BaC networks. We establish some interesting results on clocking paths, node input sequences, node inputs' relative timing, network stability, and skew bound. Furthermore, this study establishes an upper bound on maximum clocking rates for BaC networks which is about double that predicted by earlier studies.