Fully dynamic evaluation of sequence pair

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 32, Issue 6, 2013, Pages 894-904

  Kozik, Andrzej ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Evaluation algorithm; fully dynamic algorithm; sequence pair

Indexed keywords

DYNAMIC MODIFICATIONS; ELECTRONIC DESIGN AUTOMATION; EVALUATION ALGORITHM; FULLY DYNAMIC ALGORITHMS; INSERTIONS AND DELETIONS; NUMERICAL EXPERIMENTS; PREDECESSOR PROBLEMS; SEQUENCE PAIR;

DATA STRUCTURES;

ALGORITHMS;

EID: 84877919051     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2013.2244642     Document Type: Article

References (46)

1. T. M. Chan, M. Patraşcu, and L. Roditty, "Dynamic connectivity: Connecting to networks and geometry," SIAM J. Comput., vol. 40, no. 2, pp. 333-349, 2011.
2. P. K. Agarwal, L. Arge, H. Kaplan, E. Molad, R. E. Tarjan, and K. Yi, "An optimal dynamic data structure for stabbing-semigroup queries," SIAM J. Comput., vol. 41, no. 1, pp. 104-127, 2012.
3. C. Blum and A. Roli, "Metaheuristics in combinatorial optimization: Overview and conceptual comparison," ACM Computing Surveys, vol. 35, no. 3, pp. 268-308, 2003.
4. J. Cong, M. Romesis, and J. R. Shinnerl, "Fast floorplanning by lookahead enabled recursive bipartitioning," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 25, no. 9, pp. 1719-1732, Sep. 2006. (Pubitemid 44304101)
5. O. He, S. Dong, J. Bian, S. Goto, and C.-K. Cheng, "A novel fixedoutline floorplanner with zero deadspace for hierarchical design," in Proc. Int. Conf. Comput.-Aided Design, 2008, pp. 16-23.
6. J. Z. Yan and C. Chu, "DeFer: Deferred decision making enabled fixed-outline floorplanning algorithm," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 29, no. 3, pp. 367-381, Mar. 2010.
7. C.-C. Chang, J. Cong, and X. Yuan, "Multi-level placement for largescale mixed-size IC designs," in Proc. 2003 Asia South Pacific Design Autom. Conf., 2003, pp. 325-330.
8. J. Z. Yan, N. Viswanathan, and C. Chu, "Handling complexities in modern large-scale mixed-size placement," in Proc. 46th Annu. Design Autom. Conf., 2009, pp. 436-441.
9. M.-C. Kim, D.-J. Lee, and I. L. Markov, "SimPL: An effective placement algorithm," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 31, no. 1, pp. 50-60, Jan. 2012.
10. T.-C. Chen and Y.-W. Chang, "Modern floorplanning based on B-tree and fast simulated annealing," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 25, no. 4, pp. 637-650, Apr. 2006.
11. J.-M. Lin and Z.-X. Hung, "UFO: Unified convex optimization algorithms for fixed-outline floorplanning considering pre-placed modules," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 30, no. 7, pp. 1034-1044, Jul. 2011.
12. S. N. Adya, S. Chaturvedi, J. A. Roy, D. A. Papa, and I. L. Markov, "Unification of partitioning, placement and floorplanning," in Proc. 2004 IEEE/ACM Int. Conf. Comput.-Aided Des., 2004, pp. 550-557. (Pubitemid 40449287)
13. Y. Pang, C.-K. Cheng, and T. Yoshimura, "An enhanced perturbing algorithm for floorplan design using the O-tree representation," in Proc. 2000 Int. Symp. Phys. Des., 2000, pp. 168-73.
14. J.-M. Lin and Y.-W. Chang, "TCG: A transitive closure graph-based representation for non-slicing floorplans," in Proc. 38th Annu. Des. Autom. Conf., 2001, pp. 764-769. (Pubitemid 32841052)
15. A. Janiak, A. Kozik, and M. Lichtenstein, "New perspectives in VLSI design automation: Deterministic packing by sequence pair," Ann. Oper. Res., vol. 179, no. 1, pp. 35-56, 2010.
16. E. F. Y. Young, C. C. N. Chu, and M. L. Ho, "Placement constraints in floorplan design," IEEE Trans. Very Large Scale Integr. Syst., vol. 12, no. 7, pp. 735-745, Jul. 2004.
17. M. D. Moffitt, J. A. Roy, I. L. Markov, and M. E. Pollack, "Constraintdriven floorplan repair," ACM Trans. Des. Autom. Electron. Syst., vol. 13, no. 4, pp. 1-13, 2008.
18. J. Knechtel, I. L. Markov, and J. Lienig, "Assembling 2-D blocks into 3-D chips," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 31, no. 2, pp. 228-241, Feb. 2012.
19. H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani, "VLSI module placement based on rectangle-packing by the sequence pair," IEEE Trans. CAD ICs., vol. 15, no. 12, pp. 1518-1524, Dec. 1996. (Pubitemid 126780413)
20. H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani, "Rectanglepacking based module placement," in Proc. ICCAD, 1995, pp. 472-479.
21. A. Kuehlmann, The Best of ICCAD 20 Years of Excellence in Computer-Aided Design. Dordrecht, the Netherlands: Kluwer Academic, 2003.
22. T. Takahashi, "An algorithm for finding a maximum-weight decreasing sequence in a permutation, motivated by rectangle packing problem," IEICE Tech. Rep. VLSI Design Technol., vol. VLD96. no. 7, pp. 31-35, 1996.
23. X. Tang, R. Tian, and D. Wong, "Fast evaluation of sequence pair in block placement by longest common subsequence computation," IEEE Trans. CAD ICs., vol. 20, no. 12, pp. 1406-1413, Dec. 2001. (Pubitemid 34035689)
24. J. Hunt and T. Szymanski, "A fast algorithm for computing longest common subsequences," Commun. ACM, vol. 20, no. 5, pp. 350-353, 1977.
25. B. Yao, H. Chen, C.-K. Cheng, and R. Graham, "Floorplan representations: Complexity and connections," ACM Trans. Des. Autom. Electron. Syst., vol. 8, no. 1, pp. 55-80, 2003. (Pubitemid 36320984)
26. T.-C. Chen, P.-H. Yuh, Y.-W. Chang, F.-J. Huang, and D. Liu, "MP-trees: A packing-based macro placement algorithm for mixed-size designs," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 27, no. 9, pp. 1621-1634, Sep. 2008.
27. J.-M. Lin, Y.-W. Chang, and S.-P. Lin, "Corner sequence: A P-admissible floorplan representation with a worst case linear-time packing scheme," IEEE Trans. Very Large Scale Integr. Syst., vol. 11, no. 4, pp. 679-686, Aug. 2003.
28. P.-N. Guo, C.-K. Cheng, and T. Yoshimura, "An O-tree representation of non-slicing floorplan and its applications," in Proc. 36th Annu. ACM/IEEE Design Automation Conf., Jun. 1999, pp. 268-273.
29. Y.-C. Chang, Y.-W. Chang, G.-M. Wu, and S.-W. Wu, "B-trees: A new representation for non-slicing floorplans," in Proc. 37th Annu. Des. Autom. Conf., 2000, pp. 458-463.
30. J. Z. Yan and C. Chu, "Optimal slack-driven block shaping algorithm in fixed-outline floorplanning," in Proc. 2012 ACM Int. Symp. Phys. Des., 2012, pp. 179-186.
31. C. Kodama and K. Fujiyoshi, "Selected Sequence-Pair: An efficient decodable packing representation in linear time using sequence-pair," in Proc. DAC, pp. 331-337, 2003.
32. J. Lai, M.-S. Lin, T.-C. Wang, and L.-C. Wang, "Module placement with boundary constraints using the sequence-pair representation," in Proc. 2001 Asia South Pacific Des. Autom. Conf., 2001, pp. 515-520.
33. B. Galler and M. Fischer, "An improved equivalence algorithm," Comm. ACM, vol. 7, no. 5, pp. 301-303, 1964.
34. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms. New York: McGraw-Hill, 1990.
35. P. van Emde Boas, R. Kaas, and E. Zijlstra, "Design and implementation of an efficient priority queue," Math. Syst. Theory, vol. 10, no. 1, pp. 99-127, 1977.
36. D. Johnson, "A priority queue in which initialization and queue operations take O(log logD) time," Math. Syst. Theory, vol. 15, no. 4, pp. 295-309, 1982.
37. M. Fredman and M. Saks, "The cell probe complexity of dynamic data structures," in Proc. STOC, pp. 345-354, 1989.
38. A. Brodnik, S. Carlsson, J. Karlsson, and J. Munro, "Worst case constant time priority queue," in Proc. 12th Annu. ACM-SIAM Symp. Discrete Algorithms, 2001, pp. 523-528.
39. R. Tarjan, "Efficiency of a good but not linear disjoint set union algorithm," J. ACM, vol. 22, no. 2, pp. 215-225, 1975.
40. P. Flajolet, B. Salvy, and P. Zimmermann, "Automatic average-case analysis of algorithms," Theoretical Comput. Sci., vol. 79, no. 1, pp. 37-109, 1991. (Pubitemid 21671631)
41. A. T. Jonassen and D. E. Knuth, "A trivial algorithm whose analysis is not," J. Comput. Syst. Sci., vol. 16, no. 3, pp. 301-322, 1978.
42. GSRC Benchmarks. (2013, Feb. 12) [Online]. Available: http://vlsicad.eecs.umich.edu/BK/GSRCbench/
43. J. Cong and M. Romesis. (2013, Feb. 12). HB Suite [Online]. Available: http://cadlab.cs.ucla.edu/cpmo/HBsuite.html
44. S. Adya and I. Markov, "Fixed-outline floorplanning: Enabling hierarchical design," IEEE Trans. VLSI, vol. 11, no. 6, pp. 1120-1135, Dec. 2003.
45. X. Tang, R. Tian, and D. F. Wong, "Fast evaluation of sequence pair in block placement by longest common subsequence computation," in Proc. DATE, 2000, pp. 106-111.
46. B. Valĺee, J. Cĺement, J. Fill, and P. Flajolet, "The number of symbol comparisons in quicksort and quickselect," in Proc. Automata, Languages Programm., LNCS 5555. pp. 750-763, 2009.