{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:24:58Z","timestamp":1725470698711},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540391104"},{"type":"electronic","value":"9783540391128"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11846802_42","type":"book-chapter","created":{"date-parts":[[2006,9,16]],"date-time":"2006-09-16T06:27:41Z","timestamp":1158388061000},"page":"293-302","source":"Crossref","is-referenced-by-count":4,"title":["What MPI Could (and Cannot) Do for Mesh-Partitioning on Non-homogeneous Networks"],"prefix":"10.1007","author":[{"given":"Guntram","family":"Berti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper Larsson","family":"Tr\u00e4ff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2\u20133","key":"42_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.apnum.2004.08.028","volume":"52","author":"K.D. Devine","year":"2005","unstructured":"Devine, K.D., Boman, E.G., Heaphy, R.T., Hendrickson, B.A., Teresco, J.D., Faik, J., Flaherty, J.E., Gervasio, L.G.: New challenges in dynamic load balancing. Appl. Numer. Math.\u00a052(2\u20133), 133\u2013152 (2005)","journal-title":"Appl. Numer. Math."},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: 19th ACM\/IEEE Design Automation Conference (DAC), pp. 175\u2013181 (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"issue":"3","key":"42_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theoretical Computer Science\u00a01(3), 237\u2013267 (1976)","journal-title":"Theoretical Computer Science"},{"key":"42_CR4","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"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: A multi-level algorithm for partitioning graphs. In: Proceedings of the 1995 ACM\/IEEE Supercomputing Conference (1995)","DOI":"10.1145\/224170.224228"},{"key":"42_CR6","unstructured":"Hendrickson, B., Leland, R., Driessche, R.V.: Skewed graph partitioning. In: Proc. 8th SIAM Conference on Parallel Processing for Scientific Computing (1997)"},{"key":"42_CR7","unstructured":"Karypis, G.: METIS, \n                    \n                      http:\/\/www-users.cs.umn.edu\/~karypis\/metis\/"},{"key":"42_CR8","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal\u00a049, 291\u2013307 (1970)","journal-title":"Bell System Technical Journal"},{"key":"42_CR9","unstructured":"Moulitsas, I., Karypis, G.: Architecture aware partitioning algorithms. Technical Report DCT Research Report 2006\/02, Digital Technology Center, University of Minnesota (January 2006)"},{"key":"42_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-61142-8_588","volume-title":"High-Performance Computing and Networking","author":"F. Pellegrini","year":"1996","unstructured":"Pellegrini, F., Roman, J.: SCOTCH: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P.M.A. (eds.) HPCN-Europe 1996. LNCS, vol.\u00a01067, pp. 493\u2013498. Springer, Heidelberg (1996)"},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0743-7315(91)90074-J","volume":"13","author":"J.E. Savage","year":"1991","unstructured":"Savage, J.E., Wloka, M.G.: Parallelism in graph-partitioning. Journal of Parallel and Distributed Computing\u00a013, 257\u2013272 (1991)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"42_CR12","volume-title":"The MPI Core","author":"M. Snir","year":"1998","unstructured":"Snir, M., Otto, S., Huss-Lederman, S., Walker, D., Dongarra, J.: MPI \u2013 The Complete Reference. In: The MPI Core, 2nd edn., vol.\u00a01. MIT Press, Cambridge (1998)","edition":"2"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Tr\u00e4ff, J.L.: Implementing the MPI process topology mechanism. In: Supercomputing (2002), \n                    \n                      http:\/\/www.sc-2002.org\/paperpdfs\/pap.pap122.pdf","DOI":"10.1109\/SC.2002.10045"},{"key":"42_CR14","unstructured":"Tr\u00e4ff, J.L.: SMP-aware message passing programming. In: Eigth International Workshop on High-level Parallel Programming Models and Supportive Environments (HIPS 2003), pp. 56\u201365 (2003)"},{"key":"42_CR15","unstructured":"Valcke, S., Declat, D., Redler, R., Ritzdorf, H., Vogelsang, R., Bourcier, P.: The PRISM coupling and I\/O system. In: Proceedings of VECPAR 2004 (2004)"},{"issue":"5","key":"42_CR16","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/S0167-739X(00)00107-2","volume":"17","author":"C. Walshaw","year":"2001","unstructured":"Walshaw, C., Cross, M.: Multilevel mesh partitioning for heterogeneous communication networks. Future Generation Comput. Syst.\u00a017(5), 601\u2013623 (2001)","journal-title":"Future Generation Comput. Syst."},{"key":"42_CR17","unstructured":"Zoltan: Data-management services for parallel applications, \n                    \n                      http:\/\/www.cs.sandia.gov\/Zoltan\/"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Parallel Virtual Machine and Message Passing Interface"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11846802_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:07:21Z","timestamp":1558285641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11846802_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540391104","9783540391128"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11846802_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}