Efficient generation of short and fast repeater tree topologies

Proceedings of the International Symposium on Physical Design

Volumn 2006, Issue , 2006, Pages 120-127

  Bartoschek, Christoph ^a   Held, Stephan ^a   Rautenbach, Dieter ^a   Vygen, Jens ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Buffering; Inverter tree; Rectilinear Steiner tree; Repeater tree; Tree topology

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; ELECTRIC INVERTERS; TOPOLOGY;

BUFFERING; INVERTER TREE; RECTILINEAR STEINER TREE; REPEATER TREE; TREE TOPOLOGY;

TREES (MATHEMATICS);

EID: 33745955348     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1123008.1123032     Document Type: Conference Paper

References (30)

1. C.J. Alpert, and A. Dovgan, "Wire augmenting for improved buffer insertion", Proc. 34th DAC (1997), 588-593
2. C.J. Alpert, G. Gandham, J. Hu, J.L. Nevus, S.T. Quay, and S.S. Sapatnekar, "A Steiner tree construction for buffers, blockages, and bays", IEEE Trans. on CAD of Integrated Circuits and Systems 20 (2001), 556-562
3. C.J. Alpert, M. Hrkic, J. Hu, A.B. Kahng, J. Lillis, B. Liu, S.T. Quay, S.S. Sapivtnckar, A.J. Sullivan, and P. Villarrubia, "Buffered Steiner trees for difficult instances", Proc. ISPD (2001), 4-9
4. C.J. Alpert, G. Gandham, M. Hrkic, J. Hu, and S.T. Quay, "Porosity aware buffered steiner tree construction", Proc. ISPD (2003), 158-165
5. C.J. Alpert, M. Hrkic, and S.T. Quay, "A fast algorithm for Identifying good buffer insertion candidate locations", Proc. ISPD (2004), 47-52
6. S. Borkar, "Obeying Moore's law beyond 0.18 micron", Proc. IEEE International ASIC/SOC Conference (2000), 26-31
7. U. Brenner, A. Rohe, "An effective congestion driven placement framework", Proc. ISPD (2002), 6-11
8. C.C.N. Chu, and D.F. Wong, "Closed form solution to simultaneous buffer insertion/sizing and wire sluing", Proc. ISPD (1997), 192-197
9. J. Cong, and X. Yuan, "Routing tree construction under fixed buffer locations", Proc. 37th DAC (2000), 379-384
10. J. Cong, "An intarconnect-contrlc design flow for nanometer technologies", Proc. of the IEEE 89 (2001), 505-528
11. S. Dhar, and M.A. Franklin, "Optimum buffer circuits for driving long uniform lines", IEEE J. of Solid-State Circuits 20 (1991), 32-40
12. E.W. Dijkstra, "A note on two problems In connexion with graphs", Numerische Mathematik 1 (1959), 269-271
13. W.C. Elinore, "The transient response of damped linear networks with particular regard to wideband amplifiers", J. of Applied Physics 19 (1948), 55-63
14. M.R. Garey, and D.S. Johnson, "The rectilinear Steiner tree problem Is NP-compIete", SIAM J. on Applied Mathematics 32 (1977), 826-834
15. L.P.P.P. van Ginneken, "Buffer placement in distributed RC-tree networks for minimal Elmore delay", Proc. IEEE International Symposium of Circuits and Systems (1990), 865-868
16. S. Held, B. Korte, J. Maßberg, M. Ringe, und J. Vygen, "Clock scheduling and clocktree construction for high performance ASICs", Proc. ICCAD (2003), 232-239
17. M. Hrkic, and J. Lillis, "S-Tree: a technique for buffered routing tree synthesis", Proc. ICCAD (2002), 578-583
18. M. Hrkic, and J. Lillis, "Buffer tree synthesis with consideration or temporal locality, sink polarity requirements, solution cost and blockages", Proc. ISPD (2002), 98-103
19. D.A. Huffman, "A method for the construction or minimum-redundancy codes", Proc. of the Institute of Radio Engineers 40 (1952), 1098-1102
20. F.K. Hwang, "On steiner minimal trees with rectilinear distance", SIAM J. of Applied Mathematics 30 (1976), 104-114
21. L.G. Kraft, "A device for quantizing grouping and coding amplitude modulated pulses", Master thesis, EE Dept., MIT, Cambridge 1040
22. J. Lillis, C.-K. Cheng, and T.-T.Y. Liu, "Optimal wire Mixing and buffer insertion for low power and a generalized delay model", Proc. ICCAD (1995), 138-143
23. J. Lillis, C.-K. Cheng, T.-T.Y. Lin, and C.-Y. Ho, "Now performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing", Proc. 33th DAC (1990), 395-400
24. J. Maßberg, and J. Vygen, " Approximation algorithms for nutwork design and facility location with service capacities", in: Approximation, Randomization and Combinatorial Optimization; Proc. APPROX 2005. Springer 2005, pp. 158-109
25. Y.-Y. Mo, and C.C.N. Chu, "A hybrid dynamic/quadratic programming algorithm for Interconnect tree optimization", Proc. ISPD (2000), 134-139
26. M. Müller-Hannemann, and U. Zimmermann, "Slack optimization of timing-critical nets", in: Algorithms; Proc. ESA 2003. Springer 2003, pp. 727-739
27. T. Okamoto, and J. Cong, "Buffered Steiner tree construction with wire sizing for interconnect layout optimization", Proc. ICCAD (1996), 44-49
28. P. Saxena, N. Menezes, P. Cocchini, and D. Kirkpatrick, "The scaling challenge: can correct-by-construction design help?", Proc. ISPD (2003), 51-58
29. W. Shi, and Z. Li, "An O (n log n) time algorithm for optimal buffer insertion", Proc. 40th DAC (2003), 580-585
30. W. Shi, and Z. Li, "A fast, algorithm for optimal buffer insertion", IEEE Trans. on CAD of Integrated Circuits and Systems 26 (2005), 879-891