Abstract
A depth-first search (DFS) algorithm requires much less memory than breadth-first search (BFS) one. However, the former doesn’t guarantee to find the shortest path in the VLSI (Very Large Integration Circuits) wire routing when the latter does. To remedy the shortcoming of DFS, this paper attempts to improve the DFS algorithm for VLSI wire routing by introducing a method of pruning and iterative deepening. This method guarantees to find all of the existing shortest paths with the same length in the VLSI wire routing to provide the wire routing designers more options for optimal designs.
The work was supported by the Natural Science Foundation of Fujian Province (No.2009J05142), the Talents Foundation (No.0220826788) and the Scientific & Technological Development Foundation (No.2011-xq-24) of Fuzhou University.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kumar, H., Kalyan, R., Bayoumi, M., Tyagi, A., Ling, N.: Parallel implementation of a cut and paste maze routing algorithm. In: Proceedings of IEEE International Symposium on Circuits and Systems ISCAS 1993, vol. 3, pp. 2035–2038 (1993)
Taghavi, T., Ghiasi, S., Sarrafzadeh, M.: Routing algorithms: architecture driven rerouting enhancement for FPGAs. In: Proceedings of IEEE International Symposium on Circuits and Systems ISCAS 2006, pp. 5443–5446 (2006)
Wolf, W.: Modern VLSI Design: System-on-Chip Design, 3rd edn., pp. 518–522. Pearson Education, Inc, London (2003)
Lee, C.Y.: An algorithm for path connections and its applications. IRE Trans. Electronic Computers (September 1961)
Sherwani, N.A.: Algorithms for VLSI Physical Design Automation, 3rd edn., pp. 286–288. Kluwer Academic Publishers, Dordrecht (2002)
Sahni, S.: Data Structures, Algorithms, and Applications in C++, 2nd edn., pp. 268–279. McGraw-Hill, New York (2004)
Kantardzic, M.: Data Mining:Concepts, Models, Methods, and Algorithms, 1st edn., pp. 139–164. Wiley-IEEE Press (2002)
Ibrahim, A., Fahmi, S.A., Hashmi, S.I., Ho-Jin, C.: Addressing Effective Hidden Web Search Using Iterative Deepening Search and Graph Theory. In: Proceedings of IEEE 8th International Workshops on Computer and Information Technology, CIT 2008, pp. 145–149 (July 2008)
Cazenave, T.: Optimizations of data structures, heuristics and algorithms for path-finding on maps. In: Proceedings of IEEE International Symposium on Computational Intelligence and Games, CIG 2006, pp. 27–33 (2006)
Dar-Jen, C., Desoky, A.H., Ming, O.Y., Rouchka, E.C.: Compute Pairwise Manhattan Distance and Pearson Correlation Coefficient of Data Points with GPU. In: Proceedings of IEEE International Conference on Software Engineering, Artificial Intelligences, Networking and Parallel/Distributed Computing, SNPD 2009, pp. 501–506 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deng, X., Yao, Y., Chen, J. (2011). Improving Depth-First Search Algorithm of VLSI Wire Routing with Pruning and Iterative Deepening. In: Deng, H., Miao, D., Wang, F.L., Lei, J. (eds) Emerging Research in Artificial Intelligence and Computational Intelligence. AICI 2011. Communications in Computer and Information Science, vol 237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24282-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-24282-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24281-6
Online ISBN: 978-3-642-24282-3
eBook Packages: Computer ScienceComputer Science (R0)