- 1.D. Avis, "Worst Case Bounds for the Euclidean Matching Problem", International J. CompuL Math. Appl. 7 (1981), pp. 251-257.Google ScholarCross Ref
- 2.H. Bakoglu, J. T. Walker and J. D. Meindl, "A Symmetric Clock-Distribution Tree and Optimized High- Speed Interconnections for Reduced Clock Skew in ULSI and WSI Circuits", Proc. IEEE ICCD, Port Chester, Oct. 1986, pp. 118-122.Google Scholar
- 3.H. Bakoglu, Circuits, Interconnections and Packaging for VLS1, Addison-Wesley, 1990.Google Scholar
- 4.J. J. Bartholdi and L. K. Platzman, "A Fast Heuristic Based on Spacefilling Curves for Minimum-Weight Matching in the Plane", Inf. Proc. Letters 17 (1983), pp. 17%180.Google ScholarCross Ref
- 5.S. Dhar, M. A. Franklin and D. F. Warm, "Reduction of Clock Delays in VLSI Structures", Proc. 1EEE ICCD, Port Chester, Oct. 1984, pp. 778-783.Google Scholar
- 6.A. L. Fisher and It. T. Kung, "Synchronizing Large Systolic Arrays", Proc. SPIE 341, May 1982, pp. 44-52.Google Scholar
- 7.M. A. B. Jackson, A. Srinivasan and E. S. Kuh, "Clock Routing for High-Performance ICs", Proc. A CM/IEEE DAC, June 1990, pp. 573-579. Google ScholarDigital Library
- 8.A. Kahng, J. Cong and G. Robins, "High- Performance Clock Routing Based on Recursive Geometric Matching", UCLA CSD TR-900045, Nov. 1990.Google Scholar
- 9.A. Kahng and G. Robins, "A New Family of Steiner Tree Heuristics With Good Performance" The Iterated 1-Steiner Approach", Proc. IEEE ICCAD, Nov. 1990, pp. 428-431.Google Scholar
- 10.E. Lawler, Combinatorial Optimization: Networks and Matroids, Holt Rinehart and Winston, New York, 1976.Google Scholar
- 11.i. Lin and H. C. Du, "Performance-Driven Constructive Placement", Proc. DAC (1990), pp. 103- 105. Google ScholarDigital Library
- 12.T. M. Lin and C. A. Mead, "Signal Delay in General RC Networks", IEEE Trans. on CAD CAD- 3(4) (1984), pp. 331-349.Google ScholarDigital Library
- 13.F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, New York, Springer- Verlag, 1985. Google ScholarDigital Library
- 14.P. Ramanathan and K. G. Shin, "A Clock Distribution Scheme for Non-Symmetric VLSI Circuits", Proc. IEEE ICCAD, November 1989, pp. 398-401.Google Scholar
- 15.J. R.ubinstein, P. Penfield and M. A. Horowitz, "Signal Delay in RC Tree Networks", IEEE Trans. on CAD CAD-2(3) (1983), pp. 202-211.Google Scholar
- 16.T. L. Snyder and J. M. Steele, "Worst-Case Greedy Matchings in the Unit d-Cube", Networks 20 (1990), pp. 779-800.Google ScholarCross Ref
- 17.A. Srinivasan, private communication, Oct. 1990.Google Scholar
- 18.J. M. Steele, "Growth Rates of Euclidean Minimal Spanning Trees With Power Weighted Edges", The Annals of Probability 16(4) (1988), pp. 1767-1787.Google ScholarCross Ref
- 19.K. J. Supowit and E. M. Reingold, "Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching", SIAM J. Computing 12(1) (1983), pp. 118-143.Google ScholarCross Ref
- 20.K.J. Supowit, E. M. Reingold, and D. A. Plaisted, "The Travelling Salesman Problem and Minimum Matching in the Unit Square", SIAM J. Computing 12(1) (1983), pp. 144-156.Google ScholarCross Ref
- 21.P. Vaidya, "Geometry Helps in Matching", A CM Symposium on the Theory of Computing, pp. 422- 425. Google ScholarDigital Library
- 22.D. F. Wann and M. A. Franklin, "Asynchronous and Clocked Control Structure for VLSI Based Interconnection Networks", IEEE Trans. on Compute~ 21(3) (1983), pp. 284-293.Google ScholarDigital Library
Index Terms
High-performance clock routing based on recursive geometric matching
Recommendations
Clock Power Analysis of Low Power Clock Gated Arithmetic Logic Unit on Different FPGA
CICN '14: Proceedings of the 2014 International Conference on Computational Intelligence and Communication NetworksThis paper, deals with Latch Free Clock Gating technique for reduction of clock power and total power consumption in Low Power Arithmetic and Logic Unit and we have analysed power reduction on different FPGA devices. Without latch free clock gating ...
Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net
PDCAT '09: Proceedings of the 2009 International Conference on Parallel and Distributed Computing, Applications and TechnologiesThe recursive dual-net is a newly proposed interconnection network for of massive parallel computers. The recursive dual-net is based on a recursive dual-construction of a base network. A $\bm{k}$-level dual-construction for $\bm{k>0}$ creates a network ...
Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation
ICA3PP '09: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel ProcessingIn this paper, we propose a new universal network, called recursive dual-net (RDN), as a potential candidate for the interconnection network of supercomputers with very large scale. The recursive dual-net is based on a recursive dual-construction of a ...
Comments