A faster one-dimensional topological compaction algorithm with jog insertion

Algorithmica (New York)

Volumn 28, Issue 4, 2000, Pages 390-421

  Chen, H Steven ^a,b   Lee, D T ^a,c  

^a Northwestern University   (United States)

^b MAGMA DESIGN AUTOMATION   (United States)

^c INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

Homotopic compaction; Rubber band equivalent; VLSI

Indexed keywords

EID: 0000524522     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010044     Document Type: Article

References (39)

1. R. C. Carden IV and C. K. Cheng, A Global Router Using an Efficient Approximate Multicommodity Multiterminal Flow Algorithm, Proceedings of the 28th Design Automation Conference, pp. 316-321, 1991.
2. H.-F. S. Chen, Topological Optimization for VLSI Layout Design, Ph.D. Thesis, Northwestern Uni-veristy, Evanston, IL, June 1997.
3. H.-F. S. Chen and D. T. Lee, A Faster Algorithm for Rubber-Band Equivalent Transformation for Planar VLSI Layouts, IEEE Transactions on Computer-Aided Design, vol. 15, pp. 217-227, Feb. 1996.
4. H.-F. S. Chen and D. T. Lee, On Crossing Minimization Problem, IEEE Transactions on Computer-Aided Design, vol. 17, no. 5, pp. 406-418, May 1998.
5. C. Chiang, M. Sarrafzadeh, and C. K. Wong, Global Routing Based on Steiner Minmax Trees, IEEE Transactions on Computer-Aided Design, vol. CAD-9, no. 12, pp. 1318-1325, Dec. 1990.
6. R. Cole and A. Siegel, River Routing Every Which Way, but Loose, in Proceedings of the 25th Annual Symposium on Foundations of Computer Science, pp. 65-73, Oct. 1984.
7. W. W.-M. Dai, T. Dayan, and D. Staepelaere, Topological Routing in SURF: Generating a Rubber-Band Sketch, Proceedings of the 28th ACM/IEEE Design Automation Conference, pp. 39-44, 1991.
8. W. W.-M Dai, R. Kong, and J. Jue, Rubber Band Routing and Dynamic Data Representation, in Proceedings of ICCAD, pp. 52-55, 1990.
9. A. E. Dunlop, SLIP: Symbolic Layout of Integrated Circuits with Compaction, IEEE Transactions on Computer-Aided Design, vol. 10, pp. 387-391, Nov. 1978.
10. S. Gao, M. Jerrum, M. Kaufmann, K. Mehlhorn, W. Rülling, and C. Storb, On Continuous Homotopic One Layer Routing, Proceedings of the 4th Annual Symposium on Computational Geometry, pp. 392-402, 1988.
11. S. Gao, M. Kaufmann, and F. M. Maley, Advances in Homotopic Layout Compaction, Proceedings of the 1st ACM Symposium on Parallel Algorithms and Architectures, pp. 273-282, 1989.
12. P. Groeneveld, On Global Wire Ordering for Macro-Cell Routing, Proceedings of the Design Automation Conference, pp. 155-160, 1989.
13. J.-M. Ho, A. Suzuki, and M. Sarrafzadeh, An Exact Algorithm for Single-Layer Wire Length Minimization, IEEE Transactions on Computer-Aided Design, pp. 175-180, Jan. 1993.
14. W.-C. Kao and T.-M. Parng, Cross Point Assignment with Global Rerouting for General-Architecture Designs, IEEE Transactions on Computer-Aided Design, vol. CAD-14, no. 3, pp. 337-348, March 1995.
15. M. Kaufmann, S. Gao, and K. Thulasiraman, On Stenier Minimal Trees in Grid Graphs and Its Application to VLSI Routing, in Proceedings of the 5th International Symposium on Algorithms and Computation, Beijing, China, pp. 351-359, Aug. 1994.
16. M. Kaufmann and K. Mehlhorn, A Linear Time Homotopic Routing Algorithm, SIAM Journal on Computing, vol. 23, no. 2, pp. 227-246, April 1994.
17. G. Kedem and H. Watanbe, Graph-Optimization Techniques for IC-Layout and Compaction, IEEE Transactions on Computer-Aided Design, vol. 3, pp. 12-20, 1984.
18. D. T. Lee and F. P. Preparata, Euclidean Shortest Paths in the Presence of Rectilinear Barriers, Networks, vol. 14, pp. 393-410, 1984.
19. C. E. Leiserson and F. M. Maley, Algorithms for Routing and Testing Routability of Planar VLSI Layouts, Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pp. 69-78, 1985.
20. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Wiley, New York, 1990.
21. J. T. Li and M. Marek-Sadowski, Global Routing for Gatearray, IEEE Transactions on Computer-Aided Design, vol. CAD-4, pp. 298-307, Oct. 1984.
22. K. F. Liao and M. Sarrafzadeh, Boundary Single Layer Routing with Movable Terminals, IEEE Transactions on Computer-Aided Design of Integrated Circuits, vol. 10, pp. 1382-1391, Nov. 1991.
23. 1.5 log n) 1-D Compaction Algorithm, Proceedings of the 26th Design Automation Conference, pp. 382-387, 1990.
24. F. M. Maley, A Generic Algorithm for One-Dimensional Homotopic Compaction, Algorithmica, vol. 6, pp. 103-128, 1991.
25. F. M. Maley, Testing Homotopic Routability Under Polygonal Wiring Rules, Algorithmica, vol. 15, pp. 1-16, Jan. 1996.
26. M. Marek-Sadowska and M. Sarrafzadeh, The Crossing Distribution Problem, IEEE Transactions on Computer-Aided Design, vol. CAD-14, no. 4, pp. 423-433, Apr. 1995.
27. K. Mehlhom and S. Näher, A Faster Compaction Algorithm with Automatic Jog Insertion, IEEE Transactions on Computer-Aided Design, Vol. 9, pp. 451-466, Feb. 1990.
28. T. Ohtsuki (editor). Layout Design and Verification, Advances in CAD for VLSI, vol. 4, North-Holland, Amsterdam, 1986.
29. J. K. Ouserhout, G. Handachi, R. N. Mayo, W. S. Scott, and G. S. Taylor, The Magic VLSI Layout System, Proceedings of the 21st Design Automation Conference, June 1984.
30. R. Y. Pinter, River Routing: Methodology and Analysis, Proceedings of the 3rd Caltech Conference on VLSI, pp. 141-164, 1982.
31. F. Preparata and M. Shamos, Computational Geometry, An Introduction, Spring-Verlag, New York, 1985.
32. D. Richards, Complexity of Single-Layer Routing, IEEE Transactions on Computers, vol. 33, pp. 286-288, Mar. 1984.
33. M. Sarrafzadeh and D. T. Lee, A New Approach to Topological Via Minimization, IEEE Transactions on Computer-Aided Design of Integrated Circuits, vol. 8, pp. 890-900, Aug. 1989.
34. M. Sarrafzadeh, K.-F. Liao, and C. K. Wong, Single-Layer Global Routing, IEEE Transactions on Computer-Aided Design, vol. 13, pp. 38-47, Jan. 1994.
35. S. Sastry and A. Parker, The Complexity of 2-Dimensional Compaction of VLSI Layouts, Proceedings of the IEEE International Conference on Circuits and Computers, New York, pp. 402-406, 1982.
36. M. Schlag, Y. Z. Liao, and C. K. Wong, An Algorithm for Optimal Two-Dimensional Compaction of VLSI Layouts, Integration, VLSI Journal, vol. 1, pp. 179-209, 1983.
37. W. S. Scott and J. K. Ouserhout, Plowing: Interactive Stretching and Compaction in Magic, Proceedings of the 21st Design Automation Conference, pp. 166-172, June 1984.
38. H. Shin and C.-Y. Lo, An Efficient Two Dimensional Compaction of VLSI Layouts, Proceedings of the 26th Design Automation Conference, pp. 290-295, 1990
39. W. H. Wolf, R. G. Mathews, J. A. Newkirk, and R. W. Dutton, Algorithms for Optimizing Two Dimen-sional Symbolic Layout Compaction, IEEE Transactions on Computer-Aided Design, vol. 7, pp. 451-466, Apr. 1988.