Skip to main content
SpringerLink
Log in

Analytical Partitioning: Improvement over FM

  • Conference paper
  • First Online:
Book cover VLSI Design and Test (VDAT 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 711))

Included in the following conference series:

  • 1454 Accesses

Abstract

Traditionally, VLSI standard cell placement has been driven by hypergraph partitioning tools such as hMetis and MLPart, which employ FM based partitioning. According to the results seen in recent ISPD placement contests, none of the partition driven placers could produce a good solution. Hence, there is a room for improvement of hypergraph partitioning algorithms. In this paper, we present a novel hypergraph partitioning algorithm, which is based on nonlinear optimization. We solve nonlinear equations to partition the hypergraphs in ISPD98 benchmarks. Our results show an improvement over well-known FM heuristic. Our algorithm outperforms FM in 17 benchmarks out of 18, and an average improvement of 111.5% in the quality the of cuts.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. FM hypergraph partitioning code. http://vlsicad.ucsd.edu/UCLAWeb/cheese/codes/code.tar.gz. Accessed 17 Jan 2017

  2. Ispd98 hyergraph partitioning benchmarks. http://vlsicad.ucsd.edu/UCLAWeb/cheese/ispd98.html. Accessed 17 Jan 2017

  3. Agnihotri, A., Yildiz, M.C., Khatkhate, A., Mathur, A., Ono, S., Madden, P.H.: Fractional cut: improved recursive bisection placement. In: Proceedings of International Conference on Computer Aided Design (ICCAD), pp. 307–310 (2003). https://doi.org/10.1109/ICCAD.2003.1257685

  4. Alpert, C., Caldwell, A., Kahng, A., Markov, I.: Hypergraph partitioning with fixed vertices [vlsi cad]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(2), 267–272 (2000). https://doi.org/10.1109/43.828555

    Article  Google Scholar 

  5. Alpert, C., Huang, J.H., Kahng, A.: Multilevel circuit partitioning. IEEE Trans. Comput. Aid. Des. Integr. Circ. Syst. 17(8), 655–667 (1998). https://doi.org/10.1109/43.712098

    Article  Google Scholar 

  6. Boman, E., Wolf, M.: A nested dissection partitioning method for parallel sparse matrix-vector multiplication. In: 2013 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1–6 (2013). https://doi.org/10.1109/HPEC.2013.6670333

  7. Caldwell, A.E., Kahng, A.B., Markov, I.L.: Can recursive bisection alone produce routable, placements? In: Proceedings of Design Automation Conference, pp. 477–482 (2000). https://doi.org/10.1109/DAC.2000.855358

  8. Catalyurek, U., Aykanat, C.: Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans. Parallel Distrib. Syst. 10(7), 673–693 (1999). https://doi.org/10.1109/71.780863

    Article  Google Scholar 

  9. Chan, T., Cong, J., Sze, K.: Multilevel generalized force-directed method for circuit placement. In: Proceedings of the 2005 International Symposium on Physical Design, ISPD 2005, pp. 185–192. ACM, New York (2005). https://doi.org/10.1145/1055137.1055177

  10. Alpert, C.J., Yao, S.Z.: Spectral partitioning: the more eigenvectors, the better. In: 32nd Conference on Design Automation, DAC 1995, pp. 195–200 (1995). https://doi.org/10.1109/DAC.1995.250089

  11. Chen, T.C., Jiang, Z.W., Hsu, T.C., Chen, H.C., Chang, Y.W.: Ntuplace3: an analytical placer for large-scale mixed-size designs with preplaced blocks and density constraints. IEEE Trans. Comput. Aid. Des. Integr. Circ. Syst. 27(7), 1228–1240 (2008). https://doi.org/10.1109/TCAD.2008.923063

    Article  Google Scholar 

  12. Eisenmann, H., Johannes, F.: Generic global placement and floorplanning. In: Proceedings of Design Automation Conference, pp. 269–274 (1998)

    Google Scholar 

  13. Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Proceedings of the 19th Design Automation Conference, DAC 1982, pp. 175–181. IEEE Press, Piscataway (1982). http://dl.acm.org/citation.cfm?id=800263.809204

  14. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)

    MATH  Google Scholar 

  15. Hagen, L., Kahng, A.: A new approach to effective circuit clustering. In: 1992 IEEE/ACM International Conference on Computer-Aided Design, ICCAD-92. Digest of Technical Papers, pp. 422–427 (1992). https://doi.org/10.1109/ICCAD.1992.279334

  16. Kahng, A.B., Wang, Q.: Implementation and extensibility of an analytic placer. IEEE Trans. Comput. Aid. Des. Integr. Circ. Syst. 24(5), 734–747 (2005). https://doi.org/10.1109/TCAD.2005.846366

    Article  Google Scholar 

  17. Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: application in VLSI domain. In: Proceedings of the 34th Design Automation Conference, pp. 526–529 (1997). https://doi.org/10.1109/DAC.1997.597203

  18. Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. In: Proceedings of 36th Design Automation Conference, pp. 343–348 (1999). https://doi.org/10.1109/DAC.1999.781339

  19. Kennings, A., Markov, I.: Analytical minimization of half-perimeter wirelength. In: Proceedings of the Design Automation Conference, ASP-DAC 2000, Asia and South Pacific, pp. 179–184 (2000). https://doi.org/10.1109/ASPDAC.2000.835093

  20. Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291–307 (1970)

    Article  MATH  Google Scholar 

  21. Lee, C., Kim, M., Park, C.: An efficient k-way graph partitioning algorithm for task allocation in parallel computing systems. In: Proceedings of the First International Conference on Systems Integration, Systems Integration 1990, pp. 748–751 (1990). https://doi.org/10.1109/ICSI.1990.138741

  22. Leland, R., Hendrickson, B.: An empirical study of static load balancing algorithms. In: Proceedings of the Scalable High-Performance Computing Conference, pp. 682–685 (1994). https://doi.org/10.1109/SHPCC.1994.296707

  23. Luo, S., Liu, L., Wang, H., Wu, B., Liu, Y.: Implementation of a parallel graph partition algorithm to speed up BSP computing. In: 2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD), pp. 740–744 (2014). https://doi.org/10.1109/FSKD.2014.6980928

  24. MLPart: Hypergraph partitioning survey. http://web.eecs.umich.edu/~imarkov/pubs/book/part_survey.pdf

  25. Narayan, A.: BDD partitioning for formal verification and synthesis of digital systems. Ph.D. thesis, University of California, Berkeley (1998)

    Google Scholar 

  26. Naylor, W.C., Donelly, R., Sha, L.: Non-linear optimization system and method for wire length and delay optimization for an automatic electric circuit placer. U.S. Patent 6 301 693(12) (2001)

    Google Scholar 

  27. Pawanekar, S., Kapoor, K., Trivedi, G.: Kapees: a new tool for standard cell placement. In: Gaur, M.S., Zwolinski, M., Laxmi, V., Boolchandani, D., Sing, V., Sing, A.D. (eds.) VDAT 2013. CCIS, vol. 382, pp. 66–73. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-42024-5_9

    Chapter  Google Scholar 

  28. Sahoo, D., Iyer, S., Jain, J., Stangier, C., Narayan, A., Dill, D.L., Emerson, E.A.: A partitioning methodology for BDD-based verification. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 399–413. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30494-4_28

    Chapter  Google Scholar 

  29. Trifunovic, A., Knottenbelt, W.J.: Parkway 2.0: a parallel multilevel hypergraph partitioning tool. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds.) ISCIS 2004. LNCS, vol. 3280, pp. 789–800. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30182-0_79

    Chapter  Google Scholar 

  30. Vastenhouw, B., Bisseling, R.: A two-dimensional data distribution method for parallel sparse matrix-vector multiplication. SIAM Rev. 47(1), 67–95 (2005). https://doi.org/10.1137/S0036144502409019

    Article  MathSciNet  MATH  Google Scholar 

  31. Yang, H., Wong, D.: Efficient network flow based min-cut balanced partitioning. In: IEEE/ACM International Conference on Computer-Aided Design, pp. 50–55 (1994). https://doi.org/10.1109/ICCAD.1994.629743

  32. Zha, H., He, X., Ding, C., Simon, H., Gu, M.: Bipartite graph partitioning and data clustering. In: Proceedings of the Tenth International Conference on Information and Knowledge Management, CIKM 2001, pp. 25–32. ACM, New York (2001). https://doi.org/10.1145/502585.502591

Download references

Author information

Authors and Affiliations

  1. Department of Electronics and Electrical Engineering, Indian Institute of Technology Guwahati, Guwahati, India

    Sameer Pawanekar & Gaurav Trivedi

Authors
  1. Sameer Pawanekar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gaurav Trivedi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sameer Pawanekar .

Editor information

Editors and Affiliations

  1. Indian Institute of Technology Roorkee, Roorkee, India

    Brajesh Kumar Kaushik

  2. Indian Institute of Technology Roorkee, Roorkee, India

    Sudeb Dasgupta

  3. Indian Institute of Technology Bombay, Mumbai, India

    Virendra Singh

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pawanekar, S., Trivedi, G. (2017). Analytical Partitioning: Improvement over FM. In: Kaushik, B., Dasgupta, S., Singh, V. (eds) VLSI Design and Test. VDAT 2017. Communications in Computer and Information Science, vol 711. Springer, Singapore. https://doi.org/10.1007/978-981-10-7470-7_67

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-7470-7_67

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-7469-1

  • Online ISBN: 978-981-10-7470-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation