{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T10:21:14Z","timestamp":1773224474542,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540204091","type":"print"},{"value":"9783540397373","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39737-3_115","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T21:46:47Z","timestamp":1283982407000},"page":"926-933","source":"Crossref","is-referenced-by-count":4,"title":["Minimizing Communication Cost in Fine-Grain Partitioning of Sparse Matrices"],"prefix":"10.1007","author":[{"given":"Bora","family":"U\u00e7ar","sequence":"first","affiliation":[]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"115_CR1","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/43.828555","volume":"19","author":"C.J. Alpert","year":"2000","unstructured":"Alpert, C.J., Caldwell, A.E., Kahng, A.B., Markov, I.L.: Hypergraph partitioning with fixed vertices. IEEE Transactions on Computer-Aided Design\u00a019(2), 267\u2013272 (2000)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"115_CR2","unstructured":"Burns, G., Daoud, R., Vaigl, J.: LAM: an open cluster environment for MPI. In: John, W., Ross (eds.) Proceedings of Supercomputing Symposium 1994, University of Toronto, pp. 379\u2013386 (1994)"},{"key":"115_CR3","unstructured":"\u00c7ataly\u00fcrek, \u00dc.V.: Hypergraph Models for Sparse Matrix Partitioning and Reordering. PhD thesis, Bilkent Univ., Computer Eng. and Information Sci. (November 1999)"},{"issue":"7","key":"115_CR4","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/71.780863","volume":"10","author":"\u00dc.V. \u00c7ataly\u00fcrek","year":"1999","unstructured":"\u00c7ataly\u00fcrek, \u00dc.V., Aykanat, C.: Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication. IEEE Transactions on Parallel and Distributed Systems\u00a010(7), 673\u2013693 (1999)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"115_CR5","unstructured":"\u00c7ataly\u00fcrek, \u00dc.V., Aykanat, C.: PaToH: A multilevel hypergraph partitioning tool, ver. 3.0. Tech. Rep. BU-CE-9915, Computer Eng. Dept., Bilkent Univ. (1999)"},{"key":"115_CR6","unstructured":"\u00c7ataly\u00fcrek, \u00dc.V., Aykanat, C.: A fine-grain hypergraph model for 2d decomposition of sparse matrices. In: Proceedings of International Parallel and Distributed Processing Symposium (IPDPS), 8th International Workshop on Solving Irregularly structured Problems in Parallel, Irregular 2001 (April 2001)"},{"key":"115_CR7","doi-asserted-by":"crossref","unstructured":"\u00c7ataly\u00fcrek, \u00dc.V., Aykanat, C.: A hypergraph-partitioning approach for coarse-grain decomposition. In: AH-WS 2001, SC 2001, and OHS 2001, pp. 10\u201316. Denver, Colorado (2001)","DOI":"10.1145\/582034.582062"},{"issue":"10","key":"115_CR8","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1002\/(SICI)1096-9128(199710)9:10<915::AID-CPE277>3.0.CO;2-C","volume":"9","author":"J.J. Dongarra","year":"1997","unstructured":"Dongarra, J.J., Dunigan, T.H.: Message-passing performance of various computers. Concurrency\u2014Practice and Experience\u00a09(10), 915\u2013926 (1997)","journal-title":"Concurrency\u2014Practice and Experience"},{"key":"115_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/BFb0018541","volume-title":"Solving Irregularly Structured Problems in Parallel","author":"B. Hendrickson","year":"1998","unstructured":"Hendrickson, B.: Graph partitioning and parallel solvers: has the emperor no clothes? In: Ferreira, A., Rolim, J.D.P., Teng, S.-H. (eds.) IRREGULAR 1998. LNCS, vol.\u00a01457, pp. 218\u2013225. Springer, Heidelberg (1998)"},{"key":"115_CR10","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/S0167-8191(00)00048-X","volume":"26","author":"B. Hendrickson","year":"2000","unstructured":"Hendrickson, B., Kolda, T.G.: Graph partitioning models for parallel computing. Parallel Computing\u00a026, 1519\u20131534 (2000)","journal-title":"Parallel Computing"},{"issue":"6","key":"115_CR11","doi-asserted-by":"publisher","first-page":"2048","DOI":"10.1137\/S1064827598341475","volume":"21","author":"B. Hendrickson","year":"2000","unstructured":"Hendrickson, B., Kolda, T.G.: Partitioning rectangular and structurally unsymmetric sparse matrices for parallel processing. SIAM Journal on Scientific Computing\u00a021(6), 2048\u20132072 (2000)","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"1","key":"115_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1142\/S0129053395000051","volume":"7","author":"B. Hendrickson","year":"1995","unstructured":"Hendrickson, B., Leland, R., Plimpton, S.: An efficient parallel algorithm for matrix-vector multiplication. Int. J. High Speed Comput.\u00a07(1), 73\u201388 (1995)","journal-title":"Int. J. High Speed Comput."},{"key":"115_CR13","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Multilevel algorithms for multi-constraint hypergraph partitioning. Tech. Rep. 99-034, University of Minnesota, Dept. Computer Science\/ Army HPC Research Center, Minneapolis, MN 55455 (November 1998)","DOI":"10.1109\/SC.1998.10018"},{"key":"115_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. Wiley\u2013 Teubner, Chichester (1990)"},{"key":"115_CR15","doi-asserted-by":"crossref","unstructured":"Lewis, J.G., Payne, D.G., van de Geijn, R.A.: Matrix-vector multiplication and conjugate gradient algorithms on distributed memory computers. In: Proceedings of the Scalable High Performance Computing Conference (1994)","DOI":"10.1109\/SHPCC.1994.296689"},{"key":"115_CR16","doi-asserted-by":"crossref","unstructured":"Ogielski, T., Aiello, W.: Sparse matrix computations on parallel processor arrays. SIAM Journal on Numerical Analysis (1993)","DOI":"10.1137\/0914033"},{"key":"115_CR17","unstructured":"U\u00e7ar, B., Aykanat, C.: Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies. Siam J. Sci. Comput (2002) (to submitted)"}],"container-title":["Lecture Notes in Computer Science","Computer and Information Sciences - ISCIS 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39737-3_115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T11:43:16Z","timestamp":1591875796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39737-3_115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204091","9783540397373"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39737-3_115","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}