{"id":"https://openalex.org/W45747765","doi":null,"title":"Parallel Multilevel Diffusion Algorithms for Repartitioning of Adaptive Meshes","display_name":"Parallel Multilevel Diffusion Algorithms for Repartitioning of Adaptive Meshes","alternate_titles":[],"publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W45747765","mag":"45747765"},"language":"en","primary_location":{"id":"pmh:oai:conservancy.umn.edu:11299/215296","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/11299/215296","pdf_url":null,"source":{"id":"https://openalex.org/S4306402521","display_name":"University of Minnesota Digital Conservancy (University of Minnesota)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I130238516","host_organization_name":"University of Minnesota","host_organization_lineage":["https://openalex.org/I130238516"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Report"},"parent_works":[],"lineage":["https://openalex.org/W45747765"],"child_works_count":0,"type":"report","is_traditional":false,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11299/215296","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000401588","display_name":"Kirk Schloegel","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kirk Schloegel","raw_affiliation_strings":["University of\u00a0Minnesota"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of\u00a0Minnesota","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082384108","display_name":"George Karypis","orcid":"https://orcid.org/0000-0003-2753-1437","observed_orcids":["https://orcid.org/0000-0003-2753-1437"]},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"George Karypis","raw_affiliation_strings":["University of\u00a0Minnesota"],"raw_orcid":"https://orcid.org/0000-0003-2753-1437","affiliations":[{"raw_affiliation_string":"University of\u00a0Minnesota","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040319974","display_name":"Vipin Kumar","orcid":"https://orcid.org/0000-0003-4736-7582","observed_orcids":["https://orcid.org/0000-0003-4736-7582"]},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vipin Kumar","raw_affiliation_strings":["University of\u00a0Minnesota"],"raw_orcid":"https://orcid.org/0000-0003-4736-7582","affiliations":[{"raw_affiliation_string":"University of\u00a0Minnesota","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":29,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.2280000001192093,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.2280000001192093,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.22450000047683716,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.13259999454021454,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mesh-adaptation","display_name":"mesh adaptation","score":0.7770000100135803},{"id":"https://openalex.org/keywords/edge-cut-minimization","display_name":"edge cut minimization","score":0.7269999980926514},{"id":"https://openalex.org/keywords/data-migration","display_name":"data migration","score":0.9409999847412109},{"id":"https://openalex.org/keywords/load-balancing","display_name":"load balancing","score":0.9359999895095825},{"id":"https://openalex.org/keywords/irregular-meshes","display_name":"irregular meshes","score":0.5799999833106995},{"id":"https://openalex.org/keywords/mesh-refinement","display_name":"mesh refinement","score":0.5569999814033508},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"parallel computing","score":0.3050000071525574}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7763367295265198},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.7436913251876831},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.7118434309959412},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6610981822013855},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6598631143569946},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6162319183349609},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6105738878250122},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.5422088503837585},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5370067358016968},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5067601799964905},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4887792766094208},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4828353524208069},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.46074286103248596},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45349064469337463},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.43016162514686584},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3004057705402374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14212173223495483},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:conservancy.umn.edu:11299/215296","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/11299/215296","pdf_url":null,"source":{"id":"https://openalex.org/S4306402521","display_name":"University of Minnesota Digital Conservancy (University of Minnesota)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I130238516","host_organization_name":"University of Minnesota","host_organization_lineage":["https://openalex.org/I130238516"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Report"},{"id":"mag:45747765","doi":null,"is_oa":false,"landing_page_url":"https://conservancy.umn.edu/handle/11299/215296","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.6057","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.6057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.umn.edu/dept/users/kumar/mlevel_diffuse_parallel.ps","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:conservancy.umn.edu:11299/215296","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/11299/215296","pdf_url":null,"source":{"id":"https://openalex.org/S4306402521","display_name":"University of Minnesota Digital Conservancy (University of Minnesota)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I130238516","host_organization_name":"University of Minnesota","host_organization_lineage":["https://openalex.org/I130238516"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Report"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G3149497373","display_name":"Highly Parallel Direct Solvers for Sparse Linear Systems","funder_award_id":"9423082","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W45747765.pdf","grobid_xml":"https://content.openalex.org/works/W45747765.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1500549759","https://openalex.org/W1998658698","https://openalex.org/W2001937942","https://openalex.org/W2004951603","https://openalex.org/W2070232376","https://openalex.org/W2093692968","https://openalex.org/W2118953734","https://openalex.org/W2124200646","https://openalex.org/W2160772806","https://openalex.org/W7004797046"],"related_works":["https://openalex.org/W7095426075","https://openalex.org/W1998658698","https://openalex.org/W1827250755","https://openalex.org/W222412013","https://openalex.org/W2110473889","https://openalex.org/W7100200353","https://openalex.org/W2160054891","https://openalex.org/W2149240810","https://openalex.org/W7100866187"],"abstract_inverted_index":{"Graph":[0],"partitioning":[1,23,37,292],"has":[2,86],"been":[3],"shown":[4],"to":[5,10,75,87,90,96,101,109,116,127,138,160,190,239,288],"be":[6,88,151,158,176,309,324],"an":[7,16,38,171,191],"effective":[8],"way":[9],"divide":[11],"a":[12,56,111,183,221,263,296,327,333],"large":[13,57],"computation":[14,35,74],"over":[15],"arbitrary":[17],"number":[18,48],"of":[19,33,49,59,65,72,194,210,218,250,256,265,335],"processors.":[20,197],"A":[21],"good":[22,92],"can":[24,143,175,308,323],"ensure":[25,91],"load":[26,93],"balance":[27],"and":[28,153,179,224,254],"minimize":[29,117,128,225],"the":[30,34,47,53,63,66,73,76,80,83,121,129,164,230,247],"communication":[31,118],"overhead":[32,119],"by":[36,52],"irregular":[39,60],"mesh":[40,61,85,166],"into":[41,253],"p":[42],"equal":[43],"parts":[44],"while":[45,300],"minimizing":[46],"edges":[50],"cut":[51],"partition.":[54],"For":[55],"class":[58],"applications,":[62],"structure":[64],"graph":[67,81,173,298],"changes":[68],"from":[69,135,168,291,293],"one":[70,136,258],"phase":[71],"next.":[77],"Eventually,":[78],"as":[79],"evolves,":[82],"adapted":[84,165],"repartitioned":[89,325],"balance.":[94],"Failure":[95],"do":[97],"so":[98],"will":[99,180,188],"lead":[100,189],"higher":[102],"parallel":[103,204,234,271],"run":[104,146],"time.":[105,147],"This":[106],"repartitioning":[107,280,307],"needs":[108,126],"maintain":[110],"low":[112,184],"edge-cut":[113],"in":[114,120,182,220,331],"order":[115],"follow-on":[122],"computation.":[123],"It":[124],"also":[125],"time":[130,142],"for":[131,206,279],"physically":[132],"migrating":[133],"data":[134,195,226,244,251,301],"processor":[137],"another":[139],"since":[140,155],"this":[141,199],"dominate":[144],"overall":[145],"Finally,":[148],"it":[149,156,187],"must":[150],"fast":[152],"scalable":[154],"may":[157],"necessary":[159],"repartition":[161],"frequently.":[162],"Partitioning":[163],"again":[167],"scratch":[169,294],"with":[170,295,318],"existing":[172],"partitioner":[174],"done":[177,310],"quickly":[178],"result":[181],"edge-cut.":[185,231],"However,":[186],"excessive":[192],"migration":[193,302],"among":[196],"In":[198],"paper,":[200],"we":[201],"present":[202],"new":[203],"algorithms":[205,215,274],"robustly":[207],"computing":[208],"repartitionings":[209],"adaptively":[211],"refined":[212],"meshes.":[213,282],"These":[214],"perform":[216],"diffusion":[217,273],"vertices":[219,322],"multilevel":[222,272],"framework":[223],"movement":[227],"without":[228],"compromising":[229],"Furthermore,":[232,306],"our":[233,270],"repartitioners":[235],"include":[236],"parameterized":[237],"heuristics":[238],"specifically":[240],"optimize":[241],"edge--cut,":[242],"total":[243],"migration,":[245],"or":[246],"maximum":[248],"amount":[249],"migrated":[252],"out":[255],"any":[257],"processor.":[259],"Our":[260,313],"results":[261],"on":[262,326],"variety":[264],"synthetic":[266],"meshes":[267,317],"show":[268,315],"that":[269,316],"are":[275,286],"highly":[276],"robust":[277],"schemes":[278],"adaptive":[281],"The":[283],"resulting":[284,290],"edge-cuts":[285],"close":[287],"those":[289],"state-of-the-art":[297],"partitioner,":[299],"is":[303],"substantially":[304],"reduced.":[305],"very":[311],"fast.":[312],"experiments":[314],"around":[319],"eight":[320],"million":[321],"256-processor":[328],"Cray":[329],"T3D":[330],"only":[332],"couple":[334],"seconds.":[336]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W45747765","counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
