CFP last date
20 December 2024
Reseach Article

Aerial Monotonic based Layer Assignment on 3D Global Routing

Published on November 2012 by K. Mahapackialakshmi, P. Sivakumar
International Conference on Electronics, Communication and Information systems
Foundation of Computer Science USA
ICECI - Number 3
November 2012
Authors: K. Mahapackialakshmi, P. Sivakumar
e8096e71-f54d-414a-92ac-5085d8389767

K. Mahapackialakshmi, P. Sivakumar . Aerial Monotonic based Layer Assignment on 3D Global Routing. International Conference on Electronics, Communication and Information systems. ICECI, 3 (November 2012), 6-9.

@article{
author = { K. Mahapackialakshmi, P. Sivakumar },
title = { Aerial Monotonic based Layer Assignment on 3D Global Routing },
journal = { International Conference on Electronics, Communication and Information systems },
issue_date = { November 2012 },
volume = { ICECI },
number = { 3 },
month = { November },
year = { 2012 },
issn = 0975-8887,
pages = { 6-9 },
numpages = 4,
url = { /specialissues/iceci/number3/9473-1021/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Special Issue Article
%1 International Conference on Electronics, Communication and Information systems
%A K. Mahapackialakshmi
%A P. Sivakumar
%T Aerial Monotonic based Layer Assignment on 3D Global Routing
%J International Conference on Electronics, Communication and Information systems
%@ 0975-8887
%V ICECI
%N 3
%P 6-9
%D 2012
%I International Journal of Computer Applications
Abstract

The complexity and routability of layout depends on the number of layers, which can be used for the completion of interconnections. The global routing can be solved by graph based techniques. Efficient 3D routing methods are efficient to minimize the via overflows and total number of vias. The minimization methods rip-up and reassignment for a integer programming based layer assignment. Benchmark process is used to achieves performance of routability and minimum wire length.

References
  1. Ke-Rn Dai; Wen-Hao Liu; Yih-Lang Li, "NCTU-GR: Efficient Simulated Evolution-Based Rerouting and Congestion-Relaxed Layer Assignment on 3-D Global Routing" IEEE Trans VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 20, NO. 3, MARCH 2012
  2. H. -Y. Chen, M. -F. Chiang, Y. -W. Chang, L. Chen, and B. Han, "Fullchip gridless routing considering double-via insertion," IEEE Trans Comput. -Aided Des. Integr. Circuits Syst. , vol. 27, no. 5, pp. 844–857,May 2008.
  3. C. Chu and Y. -C. Wong, "FLUTE: fast lookup table based rectilinear steiner minimal tree algorithm for VLSI design," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 27, no. 1, pp. 70–83, 2008.
  4. T. -C. Chen and Y. -W. Chang, "Multilevel full-chip gridless routing with applications to optical proximity correction," IEEE Trans. Comput. -Aided Des. Integr. Circuits Syst. , vol. 26, no. 6, pp. 1041–1053, Jun. 2007.
  5. Y. -L. Li, X. -Y. Chen, and Z. -D. Lin, "NEMO: A new implicit connection graph-based gridless router with multi-layer planes and pseudo-tile propagation," IEEE Trans. Comput. -Aided Des. Integr. Circuits Syst. , vol. 26, no. 4, pp. 705–718, Apr. 2007.
  6. J. A. Roy and I. L. Markov, "High-Performance Routing at the Nanometer Scale", In Proc. IEEE/ACM Intl. Conf. on Compuer-Aided Design, pp. 496- 502, Nov 2007.
  7. J. Cong, J. Fang, M. Xie, and Y. Zhang, "MARS—A multilevel fullchip gridless routing system," IEEE Trans. Comput. -Aided Des. Integr. Circuits Syst. , vol. 24, no. 3, pp. 382–394, Mar. 2005.
  8. J. Cong, J. Fang, and K. -Y. Khoo, "DUNE: A multilayer gridless routing system," IEEE Trans. Comput. -Aided Des. Integr. Circuits Syst. , vol. 20, no. 5, pp. 633–646, May 2001.
  9. M. Pan and C. Chu, "IPR: An integrated placement and routing algorithm," in Proc. IEEE/ACM Des. Autom. Conf. , 2007, pp. 59–62.
  10. ISPD 2007 Global Routing Contest and benchmark suite. http://www. sigda. org/ispd2007/rcontest
  11. ISPD 2008 Global Routing Contest and benchmark suite. http://www. ispd. cc/contests/ispd08rc. html
Index Terms

Computer Science
Information Sciences

Keywords

Global Routing Integer Programming