Abstract
In VLSI physical design automation, channel routing problem (CRP) for minimizing total wire length to interconnect the nets of different circuit blocks is one of the most challenging requirements to enhance the performance of a chip to be designed. Interconnection with minimum wire length occupies minimum area and has minimum overall capacitance and resistance present in a circuit. Reducing the total wire length for interconnection minimizes the cost of physical wire segments required, signal propagation delays, electrical hazards, power consumption, the chip environment temperature, the heat of the neighboring interconnects or transistors, and the thermal conductivity of the surrounding materials. Thus, it meets the needs of green computing and has a direct impact on daily life and environment. Since the problem of computing minimum wire length routing solutions for three-layer no-dogleg general channel instance is NP-hard, it is interesting to develop heuristic algorithms that compute reduced total wire length routing solutions within practical time limit. In this paper, we have developed an efficient polynomial time graph-based heuristic algorithm that minimizes the total wire length for most of the benchmark channel instances available in the reserved three-layer no-dogleg Manhattan channel routing model. The results we compute are highly encouraging in terms of efficiency and performance of our algorithm in comparison to other existing algorithms for computing the same.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alpert, C.J., Mehta, D.P., Sapatnekar, S.S.: Handbook of Algorithms for Physical Design Automation. CRC Press, New York (2009)
Cong, J., Wong, D.F., Liu, C.L.: A new approach to the three-layer channel routing problem. In: Proceedings of IEEE ICCAD, pp. 378–381 (1987)
Formann, M., Wagner, D., Wagner, F.: Routing through a dense channel with minimum total wire length. In: Proceedings of 2nd Annual ACM-SIAM Symposium, pp. 475–482 (1991)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)
Hashimoto, A., Stevens, J.: Wire routing by optimizing channel assignment within large apertures. In: Proceedings of 8th ACM Design Automation Workshop, pp. 155–169 (1971)
Hong, C., Kim, Y.: The efficient hybrid approach to channel routing problem. Int. J. Adv. Sci. Technol. 42, 61–68 (2012)
Lienig, J.: Introduction to electromigration-aware physical design (invited talk). In: Proceedings of ISPD’06, pp. 39–46 (2006)
Pal, R.K.: Multi-layer Channel Routing: Complexity and Algorithms, Narosa Publishing House, New Delhi (Also published from CRC Press, Boca Raton, USA and Alpha Science International Ltd., UK) (2000)
Pal, R.K., Datta, A.K., Pal, S.P., Das, M.M., Pal, A.: A General Graph Theoretic Framework for Multi-layer Channel Routing. In: Proceedings of 8th VSI/IEEE International Conference on VLSI Design, pp. 202–207 (1995)
Pal, R.K., Datta, A.K., Pal, S.P., Pal, A.: Resolving Horizontal Constraints and Minimizing Net Wire Length for Multi-layer Channel Routing. In: Proceedings of IEEE Region 10’s 8th Annual International Conference on Computer, Communication, Control, and Engineering (TENCON 1993), vol. 1, pp. 569–573 (1993)
Sau, S.S., Pal, A., Mandal, T.N., Datta, A.K., Pal, R.K., Chaudhuri, A.: A Graph based Algorithm to Minimize Total Wire Length in VLSI Channel Routing. In: Proceedings of International 2011 IEEE Conference on Computer Science and Automation Engineering (CSAE), vol. 3, pp. 61–65 (2011)
Somogyi, K.A., Recski, A.: On the complexity of the channel routing problem in the dogleg-free multilayer manhattan model, ACTA Polytechnica Hungarica, vol. 1, no. 2 (2004)
Szymanski, T.G.: Dogleg channel routing is NP-complete. IEEE Trans. CAD Integr. Circ. Syst. 4, 31–41 (1985)
Yoshimura, T., Kuh, E.S.: Efficient algorithms for channel routing, IEEE Trans. CAD Integr. Circ. Syst. CAD-1, 25–35 (1982)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer India
About this chapter
Cite this chapter
Sau, S.S., Pal, R.K. (2015). An Efficient Algorithm for Reducing Wire Length in Three-Layer Channel Routing. In: Chaki, R., Saeed, K., Choudhury, S., Chaki, N. (eds) Applied Computation and Security Systems. Advances in Intelligent Systems and Computing, vol 305. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1988-0_9
Download citation
DOI: https://doi.org/10.1007/978-81-322-1988-0_9
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-1987-3
Online ISBN: 978-81-322-1988-0
eBook Packages: EngineeringEngineering (R0)