Skip to main content
SpringerLink
Log in

New perspectives in VLSI design automation: deterministic packing by Sequence Pair

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In the paper we consider a problem of packing rectangular blocks on a plane, which is known as Block Packing Problem (BPP). This problem is a central issue of the modern VLSI chips design methods. Basing on a new interpretation of the Sequence-Pair representation of the packing solution-space, which is based on Complementary Mirror Constraint Graphs (CMCG), we develop the efficient method of neighborhood exploration. This method might be able to improve the efficiency of other neighborhood-based search methods, such as simulated annealing or tabu search, as well as, to construct efficient heuristics. We illustrate application of the developed method by constructing a heuristic algorithm for solving BPP and comparing its efficiency and effectiveness to the algorithms commonly used so far.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Adya, S. N., & Markov, I. L. (2003). Fixed-outline floorplanning: enabling hierarchical design. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 11(6), 1120–1135.

    Article  Google Scholar 

  • Adya, S. N., & Markov, I. L. (2005). Combinatorial techniques for mixed-size placement. ACM Transactions on Design Automation of Electronic Systems, 10(5), 58–90.

    Article  Google Scholar 

  • Baker, B. S., Coifman, E. G., & Rivest, R. L. (1980). Orthogonal packings in two dimensions. SIAM Journal on Computing, 9(4), 846–855.

    Article  Google Scholar 

  • Balasa, F., & Lampaert, K. (2000). Symmetry within the sequence-pair representation in the context of placement for analog design. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 19(7), 721–731.

    Article  Google Scholar 

  • Blum, C., & Roli, A. (2003). Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3), 268–308.

    Article  Google Scholar 

  • Chan, H. H., & Markov, I. L. (2004). Practical slicing and nonslicing block-packing without simulated annealing. In Proc. Great Lakes Symp. on Very Large Scale Integration (VLSI) Systems (GLSVLSI), (pp. 282–287) 2004.

  • Chan, H. H., Adya, S. N., & Markov, I. L. (2005). Are floorplan representations useful in digital design? In Proc. ISPD (pp. 129–136) 2005.

  • Chang, Y.-C., Chang, Y.-W., Wu, G.-M., & Wu, S.-W. (2000). B*-trees: A new representation for non-slicing floorplans. In Proc. DAC (pp. 458–463) 2000.

  • Chu, C. C. N., & Young, E. F. Y. (2004). Nonrectangular shaping and sizing of soft modules for floorplan-design improvement. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 23(1), 71–79.

    Article  Google Scholar 

  • Cormen, T., Leiserson, C., & Rivest, R. (1990). Introduction to algorithms. New York: McGraw-Hill.

    Google Scholar 

  • Fujiyoshi, K., & Murata, H. (2000). Arbitrary convex and concave rectilinear block packing using sequence-pair. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 19(2), 224–233.

    Article  Google Scholar 

  • Garey, M. R., & Johnson, D. S. (1979). Computers and intractability; a guide to the theory of NP-completeness. New York: W.H. Freeman.

    Google Scholar 

  • Guo, P.-N., Cheng, C.-K., & Yoshimura, T. (1999). An O-Tree representation of non-slicing floorplan and its applications. In Proc. DAC (pp. 268–273) 1999.

  • Kahng, A. B. Classical floorplanning harmful? In Proc. ISPD (pp. 8–12) 2000.

  • Kang, M. Z., & Dai, W. W.-M. (1998). Arbitrary rectilinear block packing based on sequence pair. In Proc. ICCAD (pp. 259–266) 1998.

  • Kuehlmann, A. (2003). The best of ICCAD—20 years of excellence in computer-aided design. Dordrecht: Kluwer Academic.

    Google Scholar 

  • Lai, J.-B., Lin, M.-S., Wang, T.-C., & Wang, L.-C. (2001). Module placement with boundary constraints using the sequence-pair. In Proc. DAC (pp. 515–520) 2001.

  • Lin, J.-M., & Chang, Y.-W. (2001). TCG: a transitive closure graph based representation for non-slicing floorplans. In Proc. DAC (pp. 764–769) 2001.

  • Lin, J.-M., & Chang, Y.-W. (2002). TCG-S: orthogonal coupling of P*-admissible representations for general floorplans. In Proc. DAC (pp. 842–847) 2002.

  • Milenkovic, V. J. (1998). Rotational polygon containment and minimum enclosure. In Proceedings of the 14th annual symposium on computational geometry. ACM, 1998.

  • Murata, H., & Kuh, E. S. (1998). Sequence-Pair based placement methods for hard/soft/pre-placed modules. In Proc. ISPD (pp. 167–172) 1998.

  • Murata, H., Fujiyoshi, K., Nakatake, S., & Kajitani, Y. (1995). Rectangle-packing based module placement. In Proc. ICCAD (pp. 472–479) 1995.

  • Murata, H., Fujiyoshi, K., Nakatake, S., & Kajitani, Y. (1996). VLSI module placement based on rectangle-packing by the sequence pair. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 15, 1518–1524.

    Article  Google Scholar 

  • Murata, H., Fujiyoshi, K., & Kaneko, M. (1997). VLSI/PCB placement with obstacles based on sequence pair. In Proc. ISPD (pp. 26–31) 1997.

  • Murray, B. T., & Hayes, J. P. (1996). Testing ICs: getting to the core of the problem. IEEE Computer Magazine, 11, 32–38.

    Google Scholar 

  • Nakatake, S., Fujiyoshi, K., Murata, H., & Kajitani, Y. (1996). Module placement on BSG-Structure and IC layout applications. In Proc. ICCAD (pp. 484–491) 1996.

  • Nawaz, M., Enscore, E. E. Jr, & Ham, I. (1983). A heuristic algorithm for m-machine, n-job flow-shop sequencing problem. OMEGA International Journal of Management Science, 11, 91–95.

    Article  Google Scholar 

  • Oğuz, C., Zinder, Y., Do, V. H., Janiak, A., & Lichtenstein, M. (2004). Hybrid flow-shop scheduling problems with multiprocessor task systems. European Journal Operational Research, 152, 115–131.

    Article  Google Scholar 

  • Pang, Y., Cheng, C.-K., & Yoshimura, T. (2000). An enhanced perturbing algorithm for floorplan design using the O-tree representation. In Proc. ISPD (pp. 168–173) 2000.

  • Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial optimization: algorithms and complexity. New York: Prentice-Hall.

    Google Scholar 

  • Riepe, M. A., & Sakallah, K. A. (2003). Transistor placement for noncomplementary digital VLSI cell synthesis. ACM Transactions on Design Automation of Electronic Systems, 8, 81–107.

    Article  Google Scholar 

  • Roy, J. A., Lu, J. F., & Markov, I. L. (2006). Seeing the forest and the trees: steiner wirelength optimization in placement. In Proc. ISPD (pp. 78–85) 2006.

  • Takahashi, T. (1996). An algorithm for finding a maximum-weight decreasing sequence in a permutation, motivated by rectangle packing problem (IEICE Tech. Rep. Very Large Scale Integration (VLSI) Systems Design Technol.), VLD96 (Vol. 7, pp. 31–35).

  • Tang, X., Tian, R., & Wong, D. F. (2001). Fast evaluation of sequence pair in block placement by longest common subsequence computation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 20(12), 1406–1413.

    Article  Google Scholar 

  • Tang, X., & Wong, D. F. (2001). FAST-SP: a fast algorithm for block placement based on sequence pair. In Proc. DAC (pp. 521–526) 2001.

  • Xu, J., Guo, P.-N., & Cheng, C.-K. (1999). Sequence-pair approach for rectilinear module placement. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 18, 484–493.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Janiszewskiego 11/17, 50-372, Wrocław, Poland

    Adam Janiak, Andrzej Kozik & Maciej Lichtenstein

Authors
  1. Adam Janiak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Kozik
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maciej Lichtenstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adam Janiak.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Janiak, A., Kozik, A. & Lichtenstein, M. New perspectives in VLSI design automation: deterministic packing by Sequence Pair. Ann Oper Res 179, 35–56 (2010). https://doi.org/10.1007/s10479-008-0460-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-008-0460-9

Keywords

Search

Navigation