{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:43:04Z","timestamp":1784180584925,"version":"3.55.0"},"reference-count":45,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1016\/s0167-8191(00)00043-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:32:20Z","timestamp":1027593140000},"page":"1555-1581","source":"Crossref","is-referenced-by-count":63,"title":["Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM"],"prefix":"10.1016","volume":"26","author":[{"given":"Ralf","family":"Diekmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Preis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Schlimbach","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chris","family":"Walshaw","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(00)00043-0_BIB1","series-title":"Network Flows \u2013 Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"issue":"2","key":"10.1016\/S0167-8191(00)00043-0_BIB2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/cpe.4330060203","article-title":"Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems","volume":"6","author":"Barnard","year":"1994","journal-title":"Concurrency: Practice and Experience"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB3","doi-asserted-by":"crossref","unstructured":"S. Blazy, W. Borchers, U. Dralle, Parallelization methods for a characteristic's pressure correction scheme, in: E.H. Hirschel (Ed.), Flow Simulation with High-Performance Computers II Notes on Numerical Fluid Mechanics, 1995","DOI":"10.1007\/978-3-322-89849-4_23"},{"issue":"4","key":"10.1016\/S0167-8191(00)00043-0_BIB4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/cpe.4330020403","article-title":"Load balancing and poisson equation in a graph","volume":"2","author":"Boillat","year":"1990","journal-title":"Concurrency: Practice and Experience"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB5","doi-asserted-by":"crossref","unstructured":"J.H. Bramble, J.E. Pasciac, A.H. Schatz, The construction of preconditioners for elliptic problems by substructuring i. and ii., Math. Comput. 47+49, (1986+1987)","DOI":"10.1090\/S0025-5718-1987-0890250-4"},{"issue":"2","key":"10.1016\/S0167-8191(00)00043-0_BIB6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02579448","article-title":"Graph bisection algorithms with good average case behaviour","volume":"7","author":"Bui","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB7","doi-asserted-by":"crossref","unstructured":"N. Chrisochoides, C.E. Houstis, E.N. Houstis, S.K. Kortesis, J.R. Rice, Automatic load balanced partitioning strategies for PDE computations, in: Proceedings of the ACM International Conference on Supercomputing, 1989, pp. 99\u2013107","DOI":"10.1145\/318789.318801"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0743-7315(89)90021-X","article-title":"Load balancing for distributed memory multiprocessors","volume":"7","author":"Cybenko","year":"1989","journal-title":"J. Par. Distr. Comput."},{"key":"10.1016\/S0167-8191(00)00043-0_BIB9","doi-asserted-by":"crossref","unstructured":"R. Diekmann, U. Dralle, F. Neugebauer, T. R\u00f6mke. Padfem: A portable parallel FEM-tool, in: HPCN, LNCS 1067, 1996, pp. 580\u2013585","DOI":"10.1007\/3-540-61142-8_599"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB10","doi-asserted-by":"crossref","unstructured":"R. Diekmann, A. Frommer, B. Monien, Efficient schemes for nearest neighbor load balancing, in: G. Bilardi et al., (Ed.), 6th European Symposium an Algorithms (ESA'98), LNCS 1461, 1998, pp. 429\u2013440","DOI":"10.1007\/3-540-68530-8_36"},{"issue":"1","key":"10.1016\/S0167-8191(00)00043-0_BIB11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/(SICI)1096-9128(199801)10:1<53::AID-CPE288>3.0.CO;2-W","article-title":"Parallel decomposition of unstructured FEM-meshes","volume":"10","author":"Diekmann","year":"1998","journal-title":"Concurrency: Practice and Experience"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB12","doi-asserted-by":"crossref","unstructured":"R. Diekmann, B. Monien, R. Preis, Using helpful sets to improve graph bisections, in: Hsu et al. (Ed.), Interconnection Networks and Mapping and Scheduling Parallel Computations, DIMACS Disc. Math. Theory Com. Sci. 21 (1995) 57\u201373AMS","DOI":"10.1090\/dimacs\/021\/06"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB13","doi-asserted-by":"crossref","unstructured":"R. Diekmann, S. Muthukrishnan, M.V. Nayakkankuppam, Engineering diffusive load balancing algorithms using experiments, In: G. Bilardi et al. (Ed.), IRREGULAR'97, LNCS 1253, 1997, pp. 111\u2013122","DOI":"10.1007\/3-540-63138-0_11"},{"issue":"5","key":"10.1016\/S0167-8191(00)00043-0_BIB14","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0045-7949(88)90004-1","article-title":"A simple and efficient automatic FEM domain decomposer","volume":"28","author":"Farhat","year":"1988","journal-title":"Computers and Structures"},{"issue":"1","key":"10.1016\/S0167-8191(00)00043-0_BIB15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0956-0521(94)00024-G","article-title":"Top\/domdec \u2013 a software tool for mesh partitioning and parallel processing","volume":"6","author":"Farhat","year":"1995","journal-title":"J. Comput. Syst. Engrg."},{"key":"10.1016\/S0167-8191(00)00043-0_BIB16","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1002\/nme.1620380608","article-title":"Mesh partitioning for implicit computations via iterative domain decomposition: Impact and optimization of the subdomain aspect ratio","volume":"38","author":"Farhat","year":"1995","journal-title":"Int. J. Numer. Methods Engrg."},{"key":"10.1016\/S0167-8191(00)00043-0_BIB17","doi-asserted-by":"crossref","unstructured":"C.M. Fiduccia, R.M. Mattheyses, A linear-time heuristic for improving network partitions, in: Proceedings of the 19th IEEE Design Automation Conference, 1982, pp. 175\u2013181","DOI":"10.1109\/DAC.1982.1585498"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB18","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB19","doi-asserted-by":"crossref","unstructured":"B. Ghosh, S. Muthukrishnan, M.H. Schultz, First and second order diffusive methods for rapid, coarse, distributed load balancing, In: Proc. ACM-SPAA'96, 1996, pp. 72\u201381","DOI":"10.1145\/237502.237509"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB20","unstructured":"T. Goehring, Y. Saad. Heuristic algorithms for automatic graph partitioning, Technical Report UMSI 94-29, University of Minnesota Supercomputer Institute, 1994"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB21","doi-asserted-by":"crossref","unstructured":"B. Hendrickson, R. Leland, The Chaco user's guide: Version 2.0. Technical Report SAND94-2692, SNL, Albuquerque, NM, Oct 1994","DOI":"10.2172\/10106339"},{"issue":"2","key":"10.1016\/S0167-8191(00)00043-0_BIB22","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0916028","article-title":"An improved spectral graph partitioning algorithm for mapping parallel computations","volume":"16","author":"Hendrickson","year":"1995","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0167-8191(00)00043-0_BIB23","doi-asserted-by":"crossref","unstructured":"B. Hendrickson, R. Leland, A multilevel algorithm for partitioning graphs, in: Proc. Supercomputing '95. ACM, Dec 1995","DOI":"10.1145\/224170.224228"},{"issue":"6","key":"10.1016\/S0167-8191(00)00043-0_BIB24","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1002\/(SICI)1096-9128(199805)10:6<467::AID-CPE325>3.0.CO;2-A","article-title":"An optimal migration algorithm for dynamic load balancing","volume":"10","author":"Hu","year":"1998","journal-title":"Concurrency: Practice and Experience"},{"issue":"6","key":"10.1016\/S0167-8191(00)00043-0_BIB25","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: An experimental evaluation; part 1, graph partitioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB26","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1137\/S106482759528065X","article-title":"Parallel algorithms for adaptive mesh refinement","volume":"18","author":"Jones","year":"1997","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0167-8191(00)00043-0_BIB27","unstructured":"G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, Technical Report 95-035, CS Dept., University of Minnesota, 1995 (to appear in SIAM J. Sci. Comput.)"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB28","doi-asserted-by":"crossref","unstructured":"B.W. Kernighan, S. Lin, An effective heuristic procedure for partitioning graphs, The Bell Syst. Tech. J. Feb 1970, 291\u2013308","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB29","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/TCOM.1980.1094577","article-title":"An algorithm for vector quantizer design","volume":"COM-28","author":"Linde","year":"1980","journal-title":"IEEE Trans. Communications"},{"issue":"2","key":"10.1016\/S0167-8191(00)00043-0_BIB30","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1006\/jpdc.1998.1469","article-title":"Plum: Parallel load balancing for adaptive unstructured meshes","volume":"52","author":"Oliker","year":"1998","journal-title":"J. Par. Dist. Comput."},{"key":"10.1016\/S0167-8191(00)00043-0_BIB31","doi-asserted-by":"crossref","unstructured":"F. Pellegrini, J. Roman, Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs, in: HPCN, Apr 1996, pp. 493\u2013498","DOI":"10.1007\/3-540-61142-8_588"},{"issue":"3","key":"10.1016\/S0167-8191(00)00043-0_BIB32","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","article-title":"Partitioning sparse matrices with eigenvectors of graphs","volume":"11","author":"Pothen","year":"1990","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0167-8191(00)00043-0_BIB33","doi-asserted-by":"crossref","unstructured":"R. Preis and R. Diekmann, Party \u2013 a software library for graph partitioning, in: B.H.V. Topping (Ed.), Advances in Computational Mechanics with Parallel and Distributed Processing, 1997, pp. 63\u201371","DOI":"10.4203\/ccp.45.3.1"},{"issue":"3","key":"10.1016\/S0167-8191(00)00043-0_BIB34","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1137\/0721042","article-title":"Mesh refinement processes based on the generalized bisection of simplices","volume":"21","author":"Rivara","year":"1984","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0167-8191(00)00043-0_BIB35","unstructured":"Youcef Saad, Iterative Methods for Sparse Linear Systems. PWS Publ. Co., 1996"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB36","unstructured":"Frank Schlimbach, Load-Balancing Heuristics optimising Subdomain Aspect Ratios for Adaptive Finite Element Simulations, Ph.D. Thesis, School of Computing and Math. Sciences, The University of Greenwich, London, 1999"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB37","doi-asserted-by":"crossref","unstructured":"K. Schloegel, G. Karypis, V. Kumar, Multilevel diffusion schemes for repartitioning of adaptive meshes, J. Par. Dist. Comput. 47(2) (1997) 109\u2013124","DOI":"10.1006\/jpdc.1997.1410"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB38","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0956-0521(91)90014-V","article-title":"Partitioning of unstructured problems for parallel processing","volume":"2","author":"Simon","year":"1991","journal-title":"Comput. Syst. Engrg."},{"key":"10.1016\/S0167-8191(00)00043-0_BIB39","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0045-7825(96)01024-9","article-title":"A retrofit based methodology for the fast generation and optimization of large-scale mesh partitions: Beyond the minimum interface size criterion","volume":"133","author":"Vanderstraeten","year":"1996","journal-title":"Comput. Meth. Appl. Mech. Engrg."},{"key":"10.1016\/S0167-8191(00)00043-0_BIB40","unstructured":"D. Vanderstraeten, R. Keunings, C. Farhat, Beyond conventional mesh partitioning algorithms and the minimum edge cut criterion: Impact on realistic applications, in: Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1995, pp. 611\u2013614"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB41","series-title":"A Review of a posteriori Error Estimation and Adaptive Mesh-Refinement","author":"Verf\u00fcrth","year":"1996"},{"key":"10.1016\/S0167-8191(00)00043-0_BIB42","unstructured":"C. Walshaw, M. Cross, R. Diekmann, F. Schlimbach, Multilevel mesh partitioning for optimising domain shape. Tech. Rep. 98\/IM\/38, Univ. Greenwich, London SE18 6PF, UK, July 1998 (to appear in Int. J. High Performance Comput. Appl.)"},{"issue":"4","key":"10.1016\/S0167-8191(00)00043-0_BIB43","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1177\/109434209500900403","article-title":"A localised algorithm for optimising unstructured mesh partitions","volume":"9","author":"Walshaw","year":"1995","journal-title":"Int. J. Supercomput. Appl."},{"issue":"2","key":"10.1016\/S0167-8191(00)00043-0_BIB44","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1006\/jpdc.1997.1407","article-title":"Parallel dynamic graph partitioning for adaptive unstructured meshes","volume":"47","author":"Walshaw","year":"1997","journal-title":"J. Par. Dist. Comput."},{"key":"10.1016\/S0167-8191(00)00043-0_BIB45","series-title":"The Finite Element Method","author":"Zienkiewicz","year":"1989"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819100000430?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819100000430?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T06:11:09Z","timestamp":1578550269000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819100000430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":45,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["S0167819100000430"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(00)00043-0","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}