
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A. ElAmawy, "Clocking Arbitrarily Large Computing Structures Under Constant Skew Bound," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 3, pp. 241255, March, 1993.  
BibTex  x  
@article{ 10.1109/71.210808, author = {A. ElAmawy}, title = {Clocking Arbitrarily Large Computing Structures Under Constant Skew Bound}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {4}, number = {3}, issn = {10459219}, year = {1993}, pages = {241255}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.210808}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Clocking Arbitrarily Large Computing Structures Under Constant Skew Bound IS  3 SN  10459219 SP241 EP255 EPD  241255 A1  A. ElAmawy, PY  1993 KW  Index Termsconstant skew bound; global synchronization; arbitrarily large computing structures; clock skew; communicating cells; network topology; skew upper bound; maximum clocking rate; 2D mesh framework; stability; node design; nonplanar structures; hypercubes; clocks; hypercube networks; parallel architectures; synchronisation VL  4 JA  IEEE Transactions on Parallel and Distributed Systems ER   
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 2D 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.
[1] C. L. Seitz, "System timing," inIntroduction to VLSI Systems, C. Mead and L. Conway, Eds. Reading, MA: Addison Wesley, 1980, ch. 7.
[2] D. Wann and M. Franklin, "Asynchronous and clocked control structures for VLSI based interconnection networks,"IEEE Trans. Comput., vol. C32, no. 3, pp. 284293, Mar. 1983.
[3] SY. Kung, "On supercomputing with systolic/wavefront arrays,"Proc. IEEE, vol. 72, no. 7, pp. 867884, July 1984.
[4] A. L. Fisher and H. T. Kung, "Synchronizing large VLSI arrays,"IEEE Trans. Comput., vol. C34, pp. 734740, Aug. 1985.
[5] M. Franklin and S. Dhar, "On designing interconnection networks for multiprocessors," inProc Int. Conf. Parallel Processing, 1986, pp. 208215.
[6] S. Y. Kung, S. C. Lo, S. N. Jean, and J. N. Hwang, "Wavefront array processorsConcept to implementation,"IEEE Comput. Mag., vol. 20, pp. 1833, July 1987.
[7] J. P. Fishburn, "Clock skew optimization,"IEEE Trans. Comput., vol. C39, no. 7, pp. 945951, July 1990.
[8] P. M. Kogge,The Architecture of Pipelined Computers. New York: McGrawHill, 1981, pp. 2139.
[9] M. Shoji, "Elimination of processdependent clock skew in CMOS VLSI,"IEEE J. SolidState Circuits, vol. SC21, no. 5, pp. 875880, Oct. 1986.
[10] T. Hoshino,PAX Computer: High Speed Parallel Processing and Scientific Computing. Reading, MA: AddisonWesley, 1989, ch. 8.
[11] A. ElAmawy, "Arbitrarily large clock networks with constant skew bound," U.S. Patent 5 163068, 1992.
[12] A. ElAmawy, "Branchandcombine clocking of arbitrarily large computing networks," inProc. Int. Conf. Parallel Processing, Aug. 1991, pp. 1409417.
[13] A. ElAmawy, "Properties of branchandcombine clock networks," Tech. Report #0191CAE, ECE Dep., Louisiana State Univ.
[14] F. M. Klaasen, "Review of physical models for MOS transistors," inProc. NATO Advanced Study Institute on Process and Device Modeling for Integrated Circuit Design, LouvainlaNeuve, Belgium, July 1977, pp. 541571.
[15] Almasi, G.S., and Gottlieb, A.,Highly Parallel Computing, Benjamin/Cummings, Redwood City, Calif., 1989 [survey text: parallel architectures (Connection Machine, GF11, hypercubes, sharedmemory multiprocessors, Ultra, RP3, Cedar), programming difficulties, and compiler methods].