SFB-ACO for Submicron VLSI Routing Optimization with Timing Constraints

The arrival of submicron era has created a huge difference on VLSI (very large scale integration): delay on interconnects has far exceeded that on gates so the total delay for a sink can no longer be simply assessed by the length of weighted edges which makes its routing more complicated than ever.

[1]  Andrew B. Kahng,et al.  A new class of iterative Steiner tree heuristics with good performance , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Thomas Stützle,et al.  Ant colony optimization: artificial ants as a computational intelligence technique , 2006 .

[3]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[4]  Yu Hu,et al.  An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the λ-geometry plane , 2006, ISPD '06.

[5]  Timothy Law Snyder,et al.  On the Exact Location of Steiner Points in General Dimension , 1992, SIAM J. Comput..

[6]  Anthony Vannelli,et al.  On routing in VLSI design and communication networks , 2008, Discret. Appl. Math..

[7]  Sergio Consoli,et al.  Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem , 2010, Natural Computing.

[8]  F. Hwang,et al.  The Steiner Tree Problem , 2012 .

[9]  Chris Chu.  FLUTE: fast lookup table based wirelength estimation technique , 2004, ICCAD 2004.

[10]  Martin Zachariasen,et al.  Exact solutions to large-scale plane Steiner tree problems , 1999, SODA '99.

[11]  Andrew B. Kahng,et al.  Near-optimal critical sink routing tree constructions , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Yiyu Shi,et al.  Circuit simulation based obstacle-aware Steiner routing , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[13]  Marcus Brazil,et al.  Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics , 2005, Algorithmica.

[14]  Majid Sarrafzadeh,et al.  Predictable routing , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[15]  Min Pan,et al.  FastRoute: A Step to Integrate Global Routing into Placement , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

[16]  Sachin S. Sapatnekar,et al.  Non-Hanan routing , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Mark Horowitz,et al.  Signal Delay in RC Tree Networks , 1983, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  Bryant A. Julstrom,et al.  A spanning-tree-based genetic algorithm for some instances of the rectilinear Steiner problem with obstacles , 2003, SAC '03.

[19]  Benny K. Nielsen,et al.  An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem , 2002, ESA.

[20]  Anthony Vannelli.  An adaptation of the interior point method for solving the global routing problem , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[21]  Chris C. N. Chu,et al.  Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design , 2005, ISPD '05.

[22]  J.A. Roy,et al.  High-performance routing at the nanometer scale , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

[23]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[24]  Hafizur Rahaman,et al.  Revisiting fidelity: a case of elmore-based Y-routing trees , 2008, SLIP '08.

[25]  Rostam Joobbani,et al.  Artificial Intelligence Approach to VLSI Routing , 1985 .

[26]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[27]  Mary Jane Irwin,et al.  An edge-based heuristic for Steiner routing , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[28]  Parthasarathi Dasgupta,et al.  Revisiting VLSI interconnects in deep sub-micron: some open questions , 2005, 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design.

[29]  Patrick Groeneveld,et al.  Probabilistic congestion prediction , 2004, ISPD '04.

[30]  Sachin S. Sapatnekar,et al.  A survey on multi-net global routing for integrated circuits , 2001, Integr..

[31]  Jeffrey S. Salowe,et al.  Closing the gap: near-optimal Steiner trees in polynomial time , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[32]  David Z. Pan,et al.  BoxRouter: A New Global Router Based on Box Expansion and Progressive ILP , 2007, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[33]  J.-W. Lee,et al.  Energy-Efficient Coverage of Wireless Sensor Networks Using Ant Colony Optimization With Three Types of Pheromones , 2011, IEEE Transactions on Industrial Informatics.

[34]  Pawel Winter,et al.  An algorithm for the steiner problem in the euclidean plane , 1985, Networks.

[35]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[36]  Majid Sarrafzadeh,et al.  Pattern routing: use and theory for increasing predictability andavoiding coupling , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[37]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[38]  Andrew B. Kahng,et al.  Q-Tree: a new iterative improvement approach for buffered interconnect optimization , 2003, IEEE Computer Society Annual Symposium on VLSI, 2003. Proceedings..

[39]  Chris C. N. Chu,et al.  Efficient rectilinear Steiner tree construction with rectilinear blockages , 2005, 2005 International Conference on Computer Design.

[40]  Yao-Wen Chang,et al.  Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs , 2008, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[41]  Chris C. N. Chu,et al.  FastRoute 2.0: A High-quality and Efficient Global Router , 2007, 2007 Asia and South Pacific Design Automation Conference.

[42]  Andrew B. Kahng,et al.  Fidelity and near-optimality of Elmore-based routing constructions , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.

[43]  R. Courant,et al.  What Is Mathematics , 1943 .

[44]  Wai-Kai Chen,et al.  The Electrical Engineering Handbook , 2004 .

[45]  F. Hwang.  On Steiner Minimal Trees with Rectilinear Distance , 1976 .