ific computations, and partitioning
software for the static case is widely available. 
In this paper, we present a new hypergraph model for the dynamic 
case, where we minimize the sum of communication in
the application plus the migration cost to move data, 
thereby reducing total execution time.
The new model can be solved using hypergraph partitioning
with fixed vertices.
We describe an implementation of a parallel multilevel repartitioning algorithm
within the Zoltan load-balancing toolkit, which to our