Skip to Content.
Sympa Menu

charm - Re: [charm] Doubts about the policy of balancing

charm AT lists.cs.illinois.edu

Subject: Charm++ parallel programming system

List archive

Re: [charm] Doubts about the policy of balancing


Chronological Thread 
  • From: Nikhil Jain <nikhil.jain AT acm.org>
  • To: Sabrina Bergoch <sabrinabms AT gmail.com>
  • Cc: Charm Mailing List <charm AT cs.illinois.edu>
  • Subject: Re: [charm] Doubts about the policy of balancing
  • Date: Sun, 7 Sep 2014 09:07:16 -0500
  • List-archive: <http://lists.cs.uiuc.edu/pipermail/charm/>
  • List-id: CHARM parallel programming system <charm.cs.uiuc.edu>

Hi Sabrina,

This link is a good resource:
http://charm.cs.illinois.edu/manuals/html/charm++/20.html

Sections 20.5 - 20.7 should provide answers to your questions, while
earlier sections have more information.

--Nikhil

On Sat, Sep 6, 2014 at 8:34 PM, Sabrina Bergoch
<sabrinabms AT gmail.com>
wrote:
> Hello,
>
> I have some doubts about the policy of load balancing, I've read some
> articles and manuals / documentation and found nothing very specific about
> load balancing ..
>
> For example, in the article "The Virtualization Approach to Parallel
> Programming: Runtime Optimizations and the State for the Art, LV kalé" it is
> said that the CHARM ++ search and saves the information of computational
> load and communication and builds a database,
> and that this information can be used to structure a policy of load
> balancing.
>
> But where (article or documentation) I could find more specific information,
> such as:
> - Where is the information about the load of computing and communication?
> - If the database is the Charm ++ builds?
> - If yes, how to access this information?
>
> hug,
>
> Sabrina
>
> _______________________________________________
> charm mailing list
> charm AT cs.uiuc.edu
> http://lists.cs.uiuc.edu/mailman/listinfo/charm
>



--
Nikhil Jain,
nikhil.jain AT acm.org,
http://charm.cs.uiuc.edu/people/nikhil
Doctoral Candidate @ CS, UIUC





Archive powered by MHonArc 2.6.16.

Top of Page