{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T23:22:45Z","timestamp":1774308165174,"version":"3.50.1"},"reference-count":29,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2011,3,8]],"date-time":"2011-03-08T00:00:00Z","timestamp":1299542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2011,11]]},"abstract":"<jats:p> Large parallel machines with hundreds of thousands of processors are becoming more prevalent. Ensuring good load balance is critical for scaling certain classes of parallel applications on even thousands of processors. Centralized load balancing algorithms suffer from scalability problems, especially on machines with a relatively small amount of memory. Fully distributed load balancing algorithms, on the other hand, tend to take longer to arrive at good solutions. In this paper, we present an automatic dynamic hierarchical load balancing method that overcomes the scalability challenges of centralized schemes and longer running times of traditional distributed schemes. Our solution overcomes these issues by creating multiple levels of load balancing domains which form a tree. This hierarchical method is demonstrated within a measurement-based load balancing framework in Charm++. We discuss techniques to deal with scalability challenges of load balancing at very large scale. We present performance data of the hierarchical load balancing method on up to 16,384 cores of Ranger (at the Texas Advanced Computing Center) and 65,536 cores of Intrepid (the Blue Gene\/P at Argonne National Laboratory) for a synthetic benchmark. We also demonstrate the successful deployment of the method in a scientific application, NAMD, with results on Intrepid. <\/jats:p>","DOI":"10.1177\/1094342010394383","type":"journal-article","created":{"date-parts":[[2011,3,9]],"date-time":"2011-03-09T01:45:32Z","timestamp":1299635132000},"page":"371-385","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":52,"title":["Periodic hierarchical load balancing for large supercomputers"],"prefix":"10.1177","volume":"25","author":[{"given":"Gengbin","family":"Zheng","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Illinois at Urbana-Champaign, USA."}]},{"given":"Abhinav","family":"Bhatel\u00e9","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Illinois at Urbana-Champaign, USA."}]},{"given":"Esteban","family":"Meneses","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Illinois at Urbana-Champaign, USA."}]},{"given":"Laxmikant V.","family":"Kal\u00e9","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Illinois at Urbana-Champaign, USA."}]}],"member":"179","published-online":{"date-parts":[[2011,3,8]]},"reference":[{"key":"bibr1-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1109\/SUPERC.1990.130116"},{"key":"bibr2-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1145\/504450.504482"},{"key":"bibr3-1094342010394383","author":"Bhatel\u00e9 A","year":"2010","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"bibr4-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1145\/1542275.1542295"},{"key":"bibr5-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536348"},{"key":"bibr6-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370258"},{"key":"bibr7-1094342010394383","first-page":"225","volume-title":"HPC and Grids in Action","volume":"16","author":"Catlett C","year":"2007"},{"key":"bibr8-1094342010394383","doi-asserted-by":"crossref","unstructured":"Corradi A, Leonardi L, Zambonelli F (1999) Diffusive load balancing policies for dynamic applications. IEEE Concurrency 7(1):22\u201331. URL http:\/\/polaris.ing.unimo.it\/Zambonelli\/PDF\/Concurrency.pdf.","DOI":"10.1109\/4434.749133"},{"key":"bibr9-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1016\/j.apnum.2004.08.028"},{"key":"bibr10-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654113"},{"key":"bibr11-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277725"},{"key":"bibr12-1094342010394383","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/99163.99170","author":"Furuichi M","year":"1990","journal-title":"Second ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"},{"key":"bibr13-1094342010394383","first-page":"170","volume-title":"Proc. of 7-th Intl. Conf. on Distributed Computing Systems","author":"Ha'c A","year":"1987"},{"key":"bibr14-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536319"},{"key":"bibr15-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1145\/165854.165874"},{"key":"bibr16-1094342010394383","first-page":"8","volume-title":"Proceedings of the 1988 International Conference on Parallel Processing","author":"Kal\u00e9 LV","year":"1988"},{"key":"bibr17-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0018544"},{"key":"bibr18-1094342010394383","doi-asserted-by":"crossref","unstructured":"Karypis G, Kumar V (1998) Multilevel k-way Partitioning Scheme for Irregular Graphs. Journal of Parallel and Distributed Computing 48: 96\u2013129. URL http:\/\/www-users.cs.umn.edu\/~karypis\/publications\/Papers\/PDF\/mlevel_kparallel.pdf.","DOI":"10.1006\/jpdc.1997.1404"},{"key":"bibr19-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-006-0039-5"},{"key":"bibr20-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.665"},{"key":"bibr21-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-007-0082-x"},{"key":"bibr22-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44520-X_96"},{"key":"bibr23-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2002.10019"},{"key":"bibr24-1094342010394383","first-page":"389","volume-title":"Proceedings of Supercomputing \u201889","author":"Shu WW","year":"1989"},{"key":"bibr25-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1993.262887"},{"key":"bibr26-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1007\/s10509-005-3966-5"},{"key":"bibr27-1094342010394383","doi-asserted-by":"publisher","DOI":"10.1109\/71.243526"},{"key":"bibr28-1094342010394383","unstructured":"Zheng G (2005) Achieving high performance on extremely large parallel machines: performance prediction and load balancing. PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign."},{"key":"bibr29-1094342010394383","unstructured":"Zoltan User's Guide. Zoltan Hierarchical Partitioning. Available at: http:\/\/www.cs.sandia.gov\/Zoltan\/ug_html."}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342010394383","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/1094342010394383","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342010394383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T11:02:21Z","timestamp":1741086141000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342010394383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,8]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["10.1177\/1094342010394383"],"URL":"https:\/\/doi.org\/10.1177\/1094342010394383","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,8]]}}}