Object based load balancing strategies

1
Object based load balancing strategies

• Laxmikant Kale
• Dept. of Computer Science
• University of Illinois at Urbana-Champaign

2
Object based load balancing 98-99

• Computation decomposed into many objects
• Multiple data-driven objects per processor
• The runtime system supports object migration
• Provides automatic load measurement
• Progress
• Migration strategy for bipartite object graphs
  built
• Applied to Molecular Dynamics program
• NAMD AT partner K. Schulten
• Attained record speedup for this application
• Developed greedy strategy for arbitrary graphs

3
Object-based load balancing plans

• Strategies for arbitrary communication graphs
• Take quantified communication costs in account
• Will develop Greedy strategy variants,
• Optimum-seeking (branch-and-bound) strategies
• Refinement strategies (with least object
  migration)
• Apply to migratable threads
• Web based libraries and documentation
• Current http//charm.cs.uiuc.edu/objbalance