{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:45:46Z","timestamp":1725936346115},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811074691"},{"type":"electronic","value":"9789811074707"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-981-10-7470-7_67","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T18:17:13Z","timestamp":1513793833000},"page":"718-730","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analytical Partitioning: Improvement over FM"],"prefix":"10.1007","author":[{"given":"Sameer","family":"Pawanekar","sequence":"first","affiliation":[]},{"given":"Gaurav","family":"Trivedi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"unstructured":"FM hypergraph partitioning code. \nhttp:\/\/vlsicad.ucsd.edu\/UCLAWeb\/cheese\/codes\/code.tar.gz\n\n. Accessed 17 Jan 2017","key":"67_CR1"},{"unstructured":"Ispd98 hyergraph partitioning benchmarks. \nhttp:\/\/vlsicad.ucsd.edu\/UCLAWeb\/cheese\/ispd98.html\n\n. Accessed 17 Jan 2017","key":"67_CR2"},{"doi-asserted-by":"publisher","unstructured":"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\u2013310 (2003). \nhttps:\/\/doi.org\/10.1109\/ICCAD.2003.1257685","key":"67_CR3","DOI":"10.1109\/ICCAD.2003.1257685"},{"issue":"2","key":"67_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/43.828555","volume":"19","author":"C Alpert","year":"2000","unstructured":"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\u2013272 (2000). \nhttps:\/\/doi.org\/10.1109\/43.828555","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"8","key":"67_CR5","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1109\/43.712098","volume":"17","author":"C Alpert","year":"1998","unstructured":"Alpert, C., Huang, J.H., Kahng, A.: Multilevel circuit partitioning. IEEE Trans. Comput. Aid. Des. Integr. Circ. Syst. 17(8), 655\u2013667 (1998). \nhttps:\/\/doi.org\/10.1109\/43.712098","journal-title":"IEEE Trans. Comput. Aid. Des. Integr. Circ. Syst."},{"doi-asserted-by":"publisher","unstructured":"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\u20136 (2013). \nhttps:\/\/doi.org\/10.1109\/HPEC.2013.6670333","key":"67_CR6","DOI":"10.1109\/HPEC.2013.6670333"},{"doi-asserted-by":"publisher","unstructured":"Caldwell, A.E., Kahng, A.B., Markov, I.L.: Can recursive bisection alone produce routable, placements? In: Proceedings of Design Automation Conference, pp. 477\u2013482 (2000). \nhttps:\/\/doi.org\/10.1109\/DAC.2000.855358","key":"67_CR7","DOI":"10.1109\/DAC.2000.855358"},{"issue":"7","key":"67_CR8","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/71.780863","volume":"10","author":"U Catalyurek","year":"1999","unstructured":"Catalyurek, U., Aykanat, C.: Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans. Parallel Distrib. Syst. 10(7), 673\u2013693 (1999). \nhttps:\/\/doi.org\/10.1109\/71.780863","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"doi-asserted-by":"publisher","unstructured":"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\u2013192. ACM, New York (2005). \nhttps:\/\/doi.org\/10.1145\/1055137.1055177","key":"67_CR9","DOI":"10.1145\/1055137.1055177"},{"doi-asserted-by":"publisher","unstructured":"Alpert, C.J., Yao, S.Z.: Spectral partitioning: the more eigenvectors, the better. In: 32nd Conference on Design Automation, DAC 1995, pp. 195\u2013200 (1995). \nhttps:\/\/doi.org\/10.1109\/DAC.1995.250089","key":"67_CR10","DOI":"10.1109\/DAC.1995.250089"},{"issue":"7","key":"67_CR11","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1109\/TCAD.2008.923063","volume":"27","author":"TC Chen","year":"2008","unstructured":"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\u20131240 (2008). \nhttps:\/\/doi.org\/10.1109\/TCAD.2008.923063","journal-title":"IEEE Trans. Comput. Aid. Des. Integr. Circ. Syst."},{"doi-asserted-by":"crossref","unstructured":"Eisenmann, H., Johannes, F.: Generic global placement and floorplanning. In: Proceedings of Design Automation Conference, pp. 269\u2013274 (1998)","key":"67_CR12","DOI":"10.1145\/277044.277119"},{"unstructured":"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\u2013181. IEEE Press, Piscataway (1982). \nhttp:\/\/dl.acm.org\/citation.cfm?id=800263.809204","key":"67_CR13"},{"key":"67_CR14","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"doi-asserted-by":"publisher","unstructured":"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\u2013427 (1992). \nhttps:\/\/doi.org\/10.1109\/ICCAD.1992.279334","key":"67_CR15","DOI":"10.1109\/ICCAD.1992.279334"},{"issue":"5","key":"67_CR16","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1109\/TCAD.2005.846366","volume":"24","author":"AB Kahng","year":"2005","unstructured":"Kahng, A.B., Wang, Q.: Implementation and extensibility of an analytic placer. IEEE Trans. Comput. Aid. Des. Integr. Circ. Syst. 24(5), 734\u2013747 (2005). \nhttps:\/\/doi.org\/10.1109\/TCAD.2005.846366","journal-title":"IEEE Trans. Comput. Aid. Des. Integr. Circ. Syst."},{"doi-asserted-by":"publisher","unstructured":"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\u2013529 (1997). \nhttps:\/\/doi.org\/10.1109\/DAC.1997.597203","key":"67_CR17","DOI":"10.1109\/DAC.1997.597203"},{"doi-asserted-by":"publisher","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. In: Proceedings of 36th Design Automation Conference, pp. 343\u2013348 (1999). \nhttps:\/\/doi.org\/10.1109\/DAC.1999.781339","key":"67_CR18","DOI":"10.1109\/DAC.1999.781339"},{"doi-asserted-by":"publisher","unstructured":"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\u2013184 (2000). \nhttps:\/\/doi.org\/10.1109\/ASPDAC.2000.835093","key":"67_CR19","DOI":"10.1109\/ASPDAC.2000.835093"},{"issue":"2","key":"67_CR20","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B Kernighan","year":"1970","unstructured":"Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"doi-asserted-by":"publisher","unstructured":"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\u2013751 (1990). \nhttps:\/\/doi.org\/10.1109\/ICSI.1990.138741","key":"67_CR21","DOI":"10.1109\/ICSI.1990.138741"},{"doi-asserted-by":"publisher","unstructured":"Leland, R., Hendrickson, B.: An empirical study of static load balancing algorithms. In: Proceedings of the Scalable High-Performance Computing Conference, pp. 682\u2013685 (1994). \nhttps:\/\/doi.org\/10.1109\/SHPCC.1994.296707","key":"67_CR22","DOI":"10.1109\/SHPCC.1994.296707"},{"doi-asserted-by":"publisher","unstructured":"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\u2013744 (2014). \nhttps:\/\/doi.org\/10.1109\/FSKD.2014.6980928","key":"67_CR23","DOI":"10.1109\/FSKD.2014.6980928"},{"unstructured":"MLPart: Hypergraph partitioning survey. \nhttp:\/\/web.eecs.umich.edu\/~imarkov\/pubs\/book\/part_survey.pdf","key":"67_CR24"},{"unstructured":"Narayan, A.: BDD partitioning for formal verification and synthesis of digital systems. Ph.D. thesis, University of California, Berkeley (1998)","key":"67_CR25"},{"unstructured":"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)","key":"67_CR26"},{"key":"67_CR27","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-42024-5_9","volume-title":"VLSI Design and Test","author":"S Pawanekar","year":"2013","unstructured":"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\u201373. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-42024-5_9"},{"key":"67_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-540-30494-4_28","volume-title":"Formal Methods in Computer-Aided Design","author":"D Sahoo","year":"2004","unstructured":"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\u2013413. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30494-4_28"},{"key":"67_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-540-30182-0_79","volume-title":"Computer and Information Sciences - ISCIS 2004","author":"A Trifunovic","year":"2004","unstructured":"Trifunovic, A., Knottenbelt, W.J.: Parkway 2.0: a parallel multilevel hypergraph partitioning tool. In: Aykanat, C., Dayar, T., K\u00f6rpeo\u011flu, \u0130. (eds.) ISCIS 2004. LNCS, vol. 3280, pp. 789\u2013800. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30182-0_79"},{"issue":"1","key":"67_CR30","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/S0036144502409019","volume":"47","author":"B Vastenhouw","year":"2005","unstructured":"Vastenhouw, B., Bisseling, R.: A two-dimensional data distribution method for parallel sparse matrix-vector multiplication. SIAM Rev. 47(1), 67\u201395 (2005). \nhttps:\/\/doi.org\/10.1137\/S0036144502409019","journal-title":"SIAM Rev."},{"doi-asserted-by":"publisher","unstructured":"Yang, H., Wong, D.: Efficient network flow based min-cut balanced partitioning. In: IEEE\/ACM International Conference on Computer-Aided Design, pp. 50\u201355 (1994). \nhttps:\/\/doi.org\/10.1109\/ICCAD.1994.629743","key":"67_CR31","DOI":"10.1109\/ICCAD.1994.629743"},{"doi-asserted-by":"publisher","unstructured":"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\u201332. ACM, New York (2001). \nhttps:\/\/doi.org\/10.1145\/502585.502591","key":"67_CR32","DOI":"10.1145\/502585.502591"}],"container-title":["Communications in Computer and Information Science","VLSI Design and Test"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-7470-7_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T18:48:08Z","timestamp":1513795688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-7470-7_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811074691","9789811074707"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-7470-7_67","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}