Name
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. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1109/ICPP.1994.190 | ICPP (1) |
Keywords | Field | DocType |
combine clock networks,node input sequence,bac network,new clock distribution scheme,network size,node input,generalized branch,constant skew,clocking path,maximum clocking rate,earlier study,network stability,network topology,stability,synchronization,threshold voltage,upper bound,parallel processing,propagation delay | Network size,Synchronization,Propagation delay,Computer science,Upper and lower bounds,Parallel processing,Parallel computing,Network topology,Memory management,Skew,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-8493-2493-9 | 1 | 0.38 |
References | Authors | |
6 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ahmed El Amawy | 1 | 55 | 10.92 |
| Priyalal Kulasinghe | 2 | 78 | 8.72 |