{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T19:42:23Z","timestamp":1736538143872,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377832"},{"type":"electronic","value":"9783540377849"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11823285_24","type":"book-chapter","created":{"date-parts":[[2006,9,5]],"date-time":"2006-09-05T18:04:04Z","timestamp":1157479444000},"page":"232-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Parallel Shape Optimizing Load Balancer"],"prefix":"10.1007","author":[{"given":"Henning","family":"Meyerhenke","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Schamberger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0743-7315(89)90021-X","volume":"7","author":"G. Cybenko","year":"1989","unstructured":"Cybenko, G.: Dynamic load balancing for distributed memory multiprocessors. Parallel and Distributed Computing\u00a07(2), 279\u2013301 (1989)","journal-title":"Parallel and Distributed Computing"},{"issue":"7","key":"24_CR2","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/S0167-8191(99)00018-6","volume":"25","author":"R. Diekmann","year":"1999","unstructured":"Diekmann, R., Frommer, A., Monien, B.: Efficient schemes for nearest neighbor load balancing. Parallel Computing\u00a025(7), 789\u2013812 (1999)","journal-title":"Parallel Computing"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1016\/S0167-8191(00)00043-0","volume":"26","author":"R. Diekmann","year":"2000","unstructured":"Diekmann, R., Preis, R., Schlimbach, F., Walshaw, C.: Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM. J. Parallel Computing\u00a026, 1555\u20131581 (2000)","journal-title":"J. Parallel Computing"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s00224-002-1056-4","volume":"35","author":"R. Els\u00e4sser","year":"2002","unstructured":"Els\u00e4sser, R., Monien, B., Preis, R.: Diffusion schemes for load balancing on heterogeneous networks. Theory of Computing Systems\u00a035, 305\u2013320 (2002)","journal-title":"Theory of Computing Systems"},{"key":"24_CR5","volume-title":"Parallel Computing Works!","author":"G. Fox","year":"1994","unstructured":"Fox, G., Williams, R., Messina, P.: Parallel Computing Works! Morgan Kaufmann, San Francisco (1994)"},{"key":"24_CR6","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":"24_CR7","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: A multi-level algorithm for partitioning graphs. In: Supercomputing 1995 (1995)","DOI":"10.1145\/224170.224228"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/3-540-54345-7_64","volume-title":"Mathematical Foundations of Computer Science 1991","author":"J. Hromkovic","year":"1991","unstructured":"Hromkovic, J., Monien, B.: The bisection problem for graphs of degree 4. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol.\u00a0520, pp. 211\u2013220. Springer, Heidelberg (1991)"},{"issue":"4","key":"24_CR9","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/S0167-8191(99)00002-2","volume":"25","author":"Y.F. Hu","year":"1999","unstructured":"Hu, Y.F., Blake, R.F.: An improved diffusion algorithm for dynamic load balancing. Parallel Computing\u00a025(4), 417\u2013444 (1999)","journal-title":"Parallel Computing"},{"issue":"1-2","key":"24_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0377-0427(88)90358-5","volume":"24","author":"E.F. Kaasschieter","year":"1988","unstructured":"Kaasschieter, E.F.: Preconditioned conjugate gradients for solving singular systems. J. of Computational and Applied Mathematics\u00a024(1-2), 265\u2013275 (1988)","journal-title":"J. of Computational and Applied Mathematics"},{"key":"24_CR11","unstructured":"Karypis, G., Kumar, V.: MeTis: A Software Package for Partitioning Unstrctured Graphs, Partitioning Meshes, [...], Version 4.0 (1998)"},{"key":"24_CR12","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 for partitioning graphs. Bell Systems Technical Journal\u00a049, 291\u2013308 (1970)","journal-title":"Bell Systems Technical Journal"},{"key":"24_CR13","first-page":"281","volume-title":"Proc. of 5th Berkeley Symposium on Mathematical Statistics and Probability","author":"J.B. MacQueen","year":"1967","unstructured":"MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proc. of 5th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281\u2013297. University of California Press, Berkeley (1967)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Meyerhenke, H., Monien, B., Schamberger, S.: Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid. In: Proc. 20th IEEE Intern. Parallel and Distributed Processing Symposium (IPDPS 2006), p. 57. IEEE Computer Society, Los Alamitos (2006) (CD)","DOI":"10.1109\/IPDPS.2006.1639295"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/11549468_26","volume-title":"Euro-Par 2005 Parallel Processing","author":"H. Meyerhenke","year":"2005","unstructured":"Meyerhenke, H., Schamberger, S.: Balancing parallel adaptive fem computations by solving systems of linear equations. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol.\u00a03648, pp. 209\u2013219. Springer, Heidelberg (2005)"},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1006\/jpdc.1998.1469","volume":"52","author":"L. Oliker","year":"1998","unstructured":"Oliker, L., Biswas, R.: PLUM: Parallel load balancing for adaptive unstructured meshes. J. Par. Dist. Comp.\u00a052(2), 150\u2013177 (1998)","journal-title":"J. Par. Dist. Comp."},{"key":"24_CR17","unstructured":"Schamberger, S.: Graph partitioning with the Party library: Helpful-sets in practice. In: Comp. Arch. and High Perf. Comp., pp. 198\u2013205 (2004)"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Schamberger, S.: On partitioning FEM graphs using diffusion. In: HPGC, Intern. Par. and Dist. Processing Symposium, IPDPS 2004, p. 277 (2004) (CD)","DOI":"10.1109\/IPDPS.2004.1303358"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/11535294_23","volume-title":"Parallel Computing Technologies","author":"S. Schamberger","year":"2005","unstructured":"Schamberger, S.: A shape optimizing load distribution heuristic for parallel adaptive FEM computations. In: Malyshkin, V.E. (ed.) PaCT 2005. LNCS, vol.\u00a03606, pp. 263\u2013277. Springer, Heidelberg (2005)"},{"issue":"2","key":"24_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/jpdc.1997.1410","volume":"47","author":"K. Schloegel","year":"1997","unstructured":"Schloegel, K., Karypis, G., Kumar, V.: Multilevel diffusion schemes for repartitioning of adaptive meshes. J. Par. Dist. Comp.\u00a047(2), 109\u2013124 (1997)","journal-title":"J. Par. Dist. Comp."},{"key":"24_CR21","unstructured":"Walshaw, C.: The parallel JOSTLE library user guide: Version 3.0 (2002)"},{"issue":"12","key":"24_CR22","doi-asserted-by":"publisher","first-page":"1635","DOI":"10.1016\/S0167-8191(00)00046-6","volume":"26","author":"C. Walshaw","year":"2000","unstructured":"Walshaw, C., Cross, M.: Parallel optimisation algorithms for multilevel mesh partitioning. J. Parallel Computing\u00a026(12), 1635\u20131660 (2000)","journal-title":"J. Parallel Computing"},{"issue":"4","key":"24_CR23","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1177\/109434209500900403","volume":"9","author":"C. Walshaw","year":"1995","unstructured":"Walshaw, C., Cross, M., Everett, M.G.: A Localised Algorithm for Optimising Unstructured Mesh Partitions. Intl. J. Supercomputer Appl.\u00a09(4), 280\u2013295 (1995)","journal-title":"Intl. J. Supercomputer Appl."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2006 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11823285_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T19:26:39Z","timestamp":1736537199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11823285_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377832","9783540377849"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11823285_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}