{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T19:08:38Z","timestamp":1791400118553,"version":"4.3.3"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/cluster.2013.6702666","type":"proceedings-article","created":{"date-parts":[[2014,1,10]],"date-time":"2014-01-10T20:05:37Z","timestamp":1389384337000},"page":"1-8","source":"Crossref","is-referenced-by-count":19,"title":["Communication and topology-aware load balancing in Charm++ with TreeMatch"],"prefix":"10.1109","author":[{"given":"Emmanuel","family":"Jeannot","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Esteban","family":"Meneses","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guillaume","family":"Mercier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francois","family":"Tessier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gengbin","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/SHPCC.1994.296682"},{"key":"22","first-page":"17","article-title":"An o (? (v) e) algorithm for finding a maximum matching in general graphs","author":"micali","year":"1980","journal-title":"Proc Ann IEEE Symp Found Comput Sci"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2012.9"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2012.41"},{"key":"15","article-title":"Massively parallel cosmological simulations with ChaNGa","author":"jelley","year":"2008","journal-title":"Proceedings of IEEE International Parallel and Distributed Processing Symposium 2008"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626408003569"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1177\/109434209601000401"},{"key":"14","author":"mehta","year":"2004","journal-title":"Leanmd A charm++ framework for high performance molecular dynamics simulation on large parallel machines"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.42"},{"key":"12","first-page":"175","article-title":"Charm++: Parallel programming with message-driven objects","author":"kale","year":"1996","journal-title":"Parallel Programming Using C++"},{"key":"21","author":"pellegrini","year":"2008","journal-title":"SCOTCH and LIBSCOTCH 5 1 User's Guide ScAIApplix Project INRIA Bordeaux - Sud-ouest ENSEIRB & LaBRl UMR CNRS 5800"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1002\/9780470558027.ch13"},{"key":"20","author":"karypis","year":"1995","journal-title":"Metis - Unstructured Graph Partitioning and Sparse Matrix Ordering System Version 2 0"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/165854.165874"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0107"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1643"},{"key":"7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-3-642-24449-0_7","article-title":"Improving MPI applications performance on multicore clusters with rank reordering","volume":"6960","author":"mercier","year":"2011","journal-title":"EuroMPI Ser Lecture Notes in Computer Science"},{"key":"6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-642-15291-7_20","article-title":"Near-optimal placement of mpi processes on hierarchical numa architectures","author":"jeannot","year":"2010","journal-title":"Euro-par 2010-parallel Processing"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1183401.1183451"},{"key":"4","article-title":"Rank reordering for MPI communication optimization","author":"brandfass","year":"2012","journal-title":"Computer & Fluids"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1995896.1995909"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2010.67"}],"event":{"name":"2013 IEEE International Conference on Cluster Computing (CLUSTER)","location":"Indianapolis, IN, USA","start":{"date-parts":[[2013,9,23]]},"end":{"date-parts":[[2013,9,27]]}},"container-title":["2013 IEEE International Conference on Cluster Computing (CLUSTER)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6689497\/6702603\/06702666.pdf?arnumber=6702666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T05:50:23Z","timestamp":1498110623000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6702666\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/cluster.2013.6702666","relation":{},"subject":[],"published":{"date-parts":[[2013,9]]}}}