The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1993 vol.4)
pp: 241-255
ABSTRACT
<p>A scheme for global synchronization of arbitrarily large computing structures such thatclock skew between any two communicating cells is bounded above by a constant isdescribed. The scheme utilizes clock nodes that perform simple processing on clocksignals to maintain a constant skew bound irrespective of the size of the computingstructure. Among the salient features of the scheme is the interdependence betweennetwork topology, skew upper bound, and maximum clocking rate achievable. A 2-D mesh framework is used to present the concepts, introduce three network designs, and toprove some basic results. For each network the (constant) upper bound on clock skewbetween any two communicating processors, is established, and its independence ofnetwork size is shown. Simulations were carried out to verify correctness and to checkthe workability of the scheme. A 4*4 network was built and successfully tested forstability. Such issues as node design, clocking of nonplanar structures such ashypercubes, and the concept of fuse programmed clock networks are addressed.</p>
INDEX TERMS
Index Termsconstant skew bound; global synchronization; arbitrarily large computing structures; clock skew; communicating cells; network topology; skew upper bound; maximum clocking rate; 2-D mesh framework; stability; node design; nonplanar structures; hypercubes; clocks; hypercube networks; parallel architectures; synchronisation
CITATION
A. El-Amawy, "Clocking Arbitrarily Large Computing Structures Under Constant Skew Bound", IEEE Transactions on Parallel & Distributed Systems, vol.4, no. 3, pp. 241-255, March 1993, doi:10.1109/71.210808
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool