{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:02:09Z","timestamp":1725566529674},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540231639"},{"type":"electronic","value":"9783540302186"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30218-6_23","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T20:28:21Z","timestamp":1285100901000},"page":"131-138","source":"Crossref","is-referenced-by-count":0,"title":["A Message Ordering Problem in Parallel Programs"],"prefix":"10.1007","author":[{"given":"Bora","family":"U\u00e7ar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Burns, G., Daoud, R., Vaigl, J.: LAM: an open cluster environment for MPI. In: Ross, J.W. (ed.) Proceedings of Supercomputing Symposium 1994, University of Toronto, pp. 379\u2013386 (1994)"},{"issue":"7","key":"23_CR2","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/71.780863","volume":"10","author":"\u00dc.V. Ca\u0327taly\u00fcrek","year":"1999","unstructured":"Ca\u0327taly\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":"23_CR3","doi-asserted-by":"crossref","unstructured":"Ca\u0327taly\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) (April 2001)","DOI":"10.1109\/IPDPS.2001.925093"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Ca\u0327taly\u00fcrek, \u00dc.V., Aykanat, C.: A hypergraph-partitioning approach for coarsegrain decomposition. In: Proceedings of Scientific Computing 2001 (SC 2001), Denver, Colorado, November 2001, pp. 10\u201316 (2001)","DOI":"10.1145\/582034.582062"},{"issue":"10","key":"23_CR5","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":"23_CR6","doi-asserted-by":"crossref","unstructured":"Gropp, W., Lusk, E.: Reproducible measurements of mpi performance characteristics. Tech. Rept. ANL\/MCS-P755-0699, Argonne National Lab. (June 1999)","DOI":"10.1007\/3-540-48158-3_2"},{"key":"23_CR7","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":"23_CR8","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 J. Sci. Comput.\u00a021(6), 2048\u20132072 (2000)","journal-title":"SIAM J. Sci. Comput."},{"key":"23_CR9","unstructured":"Sterling, T., Savarese, D., Becker, D.J., Dorband, J.E., Ranaweke, U.A., Packer, C.V.: BEOWULF: A parallel workstation for scientific computation. In: Proceedings of the 24th International Conference on Parallel Processing (1995)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"U\u00e7ar, B., Aykanat, C.: Minimizing communication cost in fine-grain partitioning of sparse matrices. In: Yaz\u0131c\u0131, A., Se\u0327ner, C. (eds.) Proc. ISCISXVIII-18th Int. Symp. on Computer and Information Sciences, Antalya, Turkey (November 2003)","DOI":"10.1007\/978-3-540-39737-3_115"},{"issue":"6","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1137\/S1064827502410463","volume":"25","author":"B. U\u00e7ar","year":"2004","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.\u00a025(6), 1837\u20131859 (2004)","journal-title":"SIAM J. Sci. Comput."}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Parallel Virtual Machine and Message Passing Interface"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30218-6_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:50:12Z","timestamp":1605761412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30218-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540231639","9783540302186"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30218-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}