Abstract
Current algorithms of the dynamic programming or longest increasing subsequence with the time complexity of O(n2) or O(nlogn) can only find one maximum non-crossing subset of nets even if there is more than one with the same length. In order to traverse all possible ones in the VLSI (Very Large Integration Circuits) wire routing, a dynamic programming algorithm is adopted and modified to calculate the length of maximum non-crossing subsets. For this purpose, an adjacent list is created for the traverse and a recursive function is used to output all maximum non-crossing subsets of nets. The effectiveness of the algorithm with a time complexity of O(n2) is illustrated through the theoretical analysis and experimental results of corresponding C++ program.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wolf, W.: Modern VLSI Design: System-on-Chip Design, 3rd edn., pp. 510–522. Pearson Education, Inc., London (2003)
Song, X., Wang, Y.: On the crossing distribution problem. ACM Transaction on Design Automation of Electronic Systems 4(1), 39–51 (1999)
Sahni, S.: Data Structures, Algorithms, and Applications in C++, 2nd edn., pp. 735–740. McGraw-Hill, Inc., New York (2004)
Wang, X.: Algorithm Design and Analysis, 3rd edn., pp. 74–76. Publishing House of Electronics Industry (2007)
Deng, X., Zhong, R.: Finding Maximum Noncrossing Subset of Nets Using Longest Increasing Subsequence. In: 2nd IEEE International Conference on Multimedia and Computational Intelligence, pp. 697–700. IEEE Press, Wuhan (2010)
Skiena, S.S.: The Algorithm Design Manul, 2nd edn., pp. 273–315. Springer, Inc., Heidelberg (2008)
Pandey, H.M.: Design Analysis and Algorithms, 1st edn., pp. 258–286. University Science Press (2008)
Iliopoulos, C.S., Sohel Rahman, M.: A New Efficient Algorithm for Computing the Longest Common Subsequence. Theory of Computing Systems 45(2), 355–371 (2009)
Krusche, P., Tiskin, A.: Parallel Dynamic programmings in Scalable Time and Memory. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds.) PPAM 2009. LNCS, vol. 6067, pp. 176–185. Springer, Heidelberg (2010)
Neapolitan, R., Naimipour, K.: Foundations of Algorithms, 4th edn., pp. 277–328. Jones and Bartlett Publishers, LLC (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., Chen, J., Zhang, S. (2011). Finding All Maximum Non-crossing Subsets of Nets Using Dynamic Programming. In: Lee, J. (eds) Advanced Electrical and Electronics Engineering. Lecture Notes in Electrical Engineering, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19712-3_74
Download citation
DOI: https://doi.org/10.1007/978-3-642-19712-3_74
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19711-6
Online ISBN: 978-3-642-19712-3
eBook Packages: EngineeringEngineering (R0)