charm AT lists.siebelschool.illinois.edu
Subject: Charm++ parallel programming system
List archive
- From: "Kale, Laxmikant V" <kale AT illinois.edu>
- To: "charm AT lists.cs.illinois.edu" <charm AT lists.cs.illinois.edu>
- Subject: [charm] Load balancing framework revamp
- Date: Mon, 11 Feb 2019 22:43:06 +0000
- Accept-language: en-US
- Authentication-results: illinois.edu; spf=pass smtp.mailfrom=kale AT illinois.edu; dkim=pass header.d=uillinoisedu.onmicrosoft.com header.s=selector1-illinois-edu; dmarc=pass header.from=illinois.edu
We are planning on changing the way load balancing is implemented in Charm++. The main reasons for these changes are to allow for more sophisticated load balancing scenarios such as node level load balancing, improved performance, and cleanup of years of accumulated cruft.
Part of this effort involves removing many of the current load balancers, instead focusing on a smaller set of well maintained and generally applicable load balancers.
Please respond if you think the list below should be expanded to include other load balancers, as well as with other relevant suggestions on the new forum topic: https://charm.discourse.group/t/cleanup-the-set-of-load-balancing-strategies/34
We intend to keep at least the following set: DistributedLB DummyLB GreedyLB GreedyRefineLB MetisLB/ScotchLB/ZoltanLB RandomLB RefineLB (and TempAwareRefineLB variant) RotateLB
Laxmikant (Sanjay) Kale Paul and Cynthia Saylor Professor of Computer Science 201 N. Goodwin Avenue http://charm.cs.uiuc.edu Urbana, IL 61801-2302 Ph: (217) 244-0094
|
- [charm] Load balancing framework revamp, Kale, Laxmikant V, 02/11/2019
Archive powered by MHonArc 2.6.19.