{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:27:41Z","timestamp":1760819261389},"reference-count":26,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0167-739x(00)00107-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:55:17Z","timestamp":1027612517000},"page":"601-623","source":"Crossref","is-referenced-by-count":50,"title":["Multilevel mesh partitioning for heterogeneous communication networks"],"prefix":"10.1016","volume":"17","author":[{"given":"C.","family":"Walshaw","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Cross","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0167-739X(00)00107-2_BIB1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/cpe.4330060203","article-title":"A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems","volume":"6","author":"Barnard","year":"1994","journal-title":"Concurrency: Pract. Experience"},{"key":"10.1016\/S0167-739X(00)00107-2_BIB2","unstructured":"T.N. Bui, C. Jones, A heuristic for reducing fill-in in sparse matrix factorization, in: R.F. Sincovec, et al. (Eds.), Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1993, pp. 445\u2013452."},{"key":"10.1016\/S0167-739X(00)00107-2_BIB3","doi-asserted-by":"crossref","unstructured":"R.E. Burkard, E. Cela, P.M. Pardalos, L.S. Pitsoulis, The quadratic assignment problem, SFB-Report 126, Inst. Mathematik B, Tech. Univ. Graz, Austria, 1998.","DOI":"10.1007\/978-1-4613-0303-9_27"},{"issue":"4","key":"10.1016\/S0167-739X(00)00107-2_BIB4","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","article-title":"QAPLIB\u2014a quadratic assignment problem library","volume":"10","author":"Burkard","year":"1997","journal-title":"J. Global Optim."},{"issue":"2","key":"10.1016\/S0167-739X(00)00107-2_BIB5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(84)90231-5","article-title":"A thermodynamically motivated simulation procedure for combinatorial optimization problems","volume":"17","author":"Burkard","year":"1984","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0167-739X(00)00107-2_BIB6","unstructured":"J. Chen, V. Taylor, Mesh partitioning for distributed systems: exploring optimal number of partitions with local and remote communication, in: B. Hendrickson et al. (Eds.), Proc. 9th SIAM Conference on Parallel Processing and Scientific Computing, SIAM, Philadelphia, 1999. CD-rom."},{"key":"10.1016\/S0167-739X(00)00107-2_BIB7","doi-asserted-by":"crossref","unstructured":"J. Chen, V. Taylor, ParaPART: parallel mesh partitioning for distributed systems, in: Proc. Irregular\u201998: Solving Irregularly Structured Problems in Parallel, San Juan, Puerto Rico, Lecture Notes in Computer Science, Vol. 1586, Springer, Berlin, 1999.","DOI":"10.1007\/BFb0097984"},{"key":"10.1016\/S0167-739X(00)00107-2_BIB8","unstructured":"M. Dormanns, H.-U. Heiss, Mapping large-scale FEM-graphs to highly parallel computers with grid-like topology by self-organization, Technical Report, Dept. Informatics, Univ. Karlsruhe, D-76128 Karlsruhe, Germany, February 1994."},{"key":"10.1016\/S0167-739X(00)00107-2_BIB9","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, IEEE, Piscataway, NJ, 1982, pp. 175\u2013181.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"10.1016\/S0167-739X(00)00107-2_BIB10","doi-asserted-by":"crossref","unstructured":"E. Gabriel, M. Resch, T. Beisel, R. Keller, Distributed computing in a heterogeneous computing environment, in: Proceedings of the Euro PVM\/MPI\u201998, Liverpool, 1998.","DOI":"10.1007\/BFb0056574"},{"issue":"1\/2","key":"10.1016\/S0167-739X(00)00107-2_BIB11","first-page":"171","article-title":"Fast and effective algorithms for graph partitioning and sparse matrix reordering","volume":"41","author":"Gupta","year":"1996","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/S0167-739X(00)00107-2_BIB12","doi-asserted-by":"crossref","unstructured":"B. Hendrickson, T.G. Kolda, Graph partitioning models for parallel computing, Parallel Comput. 26 (2000) 1519\u20131534.","DOI":"10.1016\/S0167-8191(00)00048-X"},{"key":"10.1016\/S0167-739X(00)00107-2_BIB13","doi-asserted-by":"crossref","unstructured":"B. Hendrickson, R. Leland, A multilevel algorithm for partitioning graphs, in: S. Karin (Ed.), Proceedings of the Supercomputing\u201995, San Diego, ACM, New York, 1995.","DOI":"10.1145\/224170.224228"},{"key":"10.1016\/S0167-739X(00)00107-2_BIB14","doi-asserted-by":"crossref","unstructured":"B. Hendrickson, R. Leland, R. Van Driessche, Enhancing data locality by using terminal propagation, in: Proceedings of the 29th Hawaii International Conference on System Science, 1996.","DOI":"10.1109\/HICSS.1996.495507"},{"key":"10.1016\/S0167-739X(00)00107-2_BIB15","unstructured":"B. Hendrickson, R. Leland, R. Van Driessche, Skewed graph partitioning, in: M. Heath, et al. (Eds.), Proc. 8th SIAM Conf. on Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1997, CD-rom."},{"issue":"1","key":"10.1016\/S0167-739X(00)00107-2_BIB16","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","article-title":"A fast and high quality multilevel scheme for partitioning irregular graphs","volume":"20","author":"Karypis","year":"1998","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0167-739X(00)00107-2_BIB17","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"10.1016\/S0167-739X(00)00107-2_BIB18","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1177\/109434200001400203","article-title":"A scalable strategy for the parallelization of multiphysics unstructured mesh-iterative codes on distributed-memory systems","volume":"14","author":"McManus","year":"2000","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"10.1016\/S0167-739X(00)00107-2_BIB19","unstructured":"K. McManus, C. Walshaw, M. Cross, P. Leggett, S. Johnson, Evaluation of the JOSTLE mesh partitioning code for practical multiphysics applications, in: A. Ecer, et al. (Eds.), Parallel Computational Fluid Dynamics: Implementations and Results Using Parallel Computers, Elsevier, Amsterdam, 1996, pp. 673\u2013680 (Proc. Parallel CFD\u201995, Pasadena, 1995)."},{"key":"10.1016\/S0167-739X(00)00107-2_BIB20","unstructured":"F. Pellegrini, J. Roman, Experimental analysis of the dual recursive bipartitioning algorithm for static mapping, TR 1038-96, LaBRI, URA CNRS 1304, Univ. Bordeaux I, 351, Cours de la Lib\u00e9ration, 33405 Talence, France, 1996."},{"key":"10.1016\/S0167-739X(00)00107-2_BIB21","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: H. Liddell, et al. (Eds.), High-performance Computing and Networking, Proc. HPCN\u201996, Brussels, Lecture Notes in Computer Science, Vol. 1067, Springer, Berlin, 1996, pp. 493\u2013498.","DOI":"10.1007\/3-540-61142-8_588"},{"key":"10.1016\/S0167-739X(00)00107-2_BIB22","unstructured":"K. Schloegel, G. Karypis, V. Kumar, Graph partitioning for high performance scientific simulations, in: J. Dongarra, et al. (Eds.), CRPC Parallel Computing Handbook, Morgan Kaufmann, Los Altos, CA, in press."},{"key":"10.1016\/S0167-739X(00)00107-2_BIB23","doi-asserted-by":"crossref","unstructured":"J.D. Teresco, M.W. Beall, J.E. Flaherty, M.S. Shephard, A hierarchical partition model for adaptive finite element computation, Comput. Meth. Appl. Mech. Eng. 184 (2000) 269\u2013285.","DOI":"10.1016\/S0045-7825(99)00231-5"},{"key":"10.1016\/S0167-739X(00)00107-2_BIB24","doi-asserted-by":"crossref","unstructured":"C. Walshaw, M. Cross, Parallel optimisation algorithms for multilevel mesh partitioning, Parallel Comput. 26 (2000) 1635\u20131660. (originally published as Univ. Greenwich Tech. Rep. 99\/IM\/44).","DOI":"10.1016\/S0167-8191(00)00046-6"},{"key":"10.1016\/S0167-739X(00)00107-2_BIB25","doi-asserted-by":"crossref","unstructured":"C. Walshaw, M. Cross, Mesh partitioning: a multilevel balancing and refinement algorithm, SIAM J. Sci. Comput. 22 (1) (2000) 63\u201380 (originally published as Univ. Greenwich Tech. Rep. 98\/IM\/35).","DOI":"10.1137\/S1064827598337373"},{"key":"10.1016\/S0167-739X(00)00107-2_BIB26","doi-asserted-by":"crossref","unstructured":"C. Walshaw, M. Cross, M. Everett, S. Johnson, K. McManus, Partitioning and mapping of unstructured meshes to parallel machine topologies, in: A. Ferreira, J. Rolim (Eds.), Proceedings of the Irregular\u201995 on Parallel Algorithms for Irregularly Structured Problems, Lecture Notes in Computer Science, Vol. 980, Springer, Berlin, 1995, pp. 121\u2013126.","DOI":"10.1007\/3-540-60321-2_10"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X00001072?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X00001072?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T15:04:41Z","timestamp":1579100681000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X00001072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0167739X00001072"],"URL":"https:\/\/doi.org\/10.1016\/s0167-739x(00)00107-2","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}