Balancing active objects on a peer to peer infrastructure

We present a contribution on dynamic load balancing for distributed and parallel object-oriented applications. We specially target on peer to peer systems and its capabil-ity to distribute parallel computation, which transfer large amount of data (called intensive-communicated applica-tions) among large number of processors. We explain the relation between active objects and processors load. Using this relation, and defining an order relation among proces-sors, we describe our active object balance algorithm as a dynamic load balance algorithm, focusing on minimizing the time when active objects are waiting for the completion of remote calls. We benchmark a Jacobi parallel applica-tion with several load balancing algorithms. Finally, we study results from these experimentation in order to show that a peer to peer load balancing obtains the best perfor-mance in terms of migration decisions and scalability.