ACM Home Page
Please provide us with feedback. Feedback
High-performance clock routing based on recursive geometric matching
Full text PdfPdf (651 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 28th ACM/IEEE Design Automation Conference table of contents
San Francisco, California, United States
Pages: 322 - 327  
Year of Publication: 1991
ISBN:0-89791-395-7
Authors
Andrew Kahng  UCLA Department of Computer Science, Los Angeles, California
Jason Cong  UCLA Department of Computer Science, Los Angeles, California
Gabriel Robins  UCLA Department of Computer Science, Los Angeles, California
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 26,   Citation Count: 26
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/127601.127688
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
D. Avis, "Worst Case Bounds for the Euclidean Matching Problem", International J. CompuL Math. Appl. 7 (1981), pp. 251-257.
 
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.
 
3
H. Bakoglu, Circuits, Interconnections and Packaging for VLS1, Addison-Wesley, 1990.
 
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.
 
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.
 
6
A. L. Fisher and It. T. Kung, "Synchronizing Large Systolic Arrays", Proc. SPIE 341, May 1982, pp. 44-52.
7
 
8
A. Kahng, J. Cong and G. Robins, "High- Performance Clock Routing Based on Recursive Geometric Matching", UCLA CSD TR-900045, Nov. 1990.
 
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.
 
10
E. Lawler, Combinatorial Optimization: Networks and Matroids, Holt Rinehart and Winston, New York, 1976.
11
 
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.
 
13
 
14
P. Ramanathan and K. G. Shin, "A Clock Distribution Scheme for Non-Symmetric VLSI Circuits", Proc. IEEE ICCAD, November 1989, pp. 398-401.
 
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.
 
16
T. L. Snyder and J. M. Steele, "Worst-Case Greedy Matchings in the Unit d-Cube", Networks 20 (1990), pp. 779-800.
 
17
A. Srinivasan, private communication, Oct. 1990.
 
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.
 
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.
 
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.
21
 
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.

CITED BY  26

Collaborative Colleagues:
Andrew Kahng: colleagues
Jason Cong: colleagues
Gabriel Robins: colleagues