Mobile Agents for Distributed and Dynamically Balanced Optimization Applications

The Mobile Agent paradigm can increase the flexibility in the creation of distributed applications (and the restructuring of sequential applications for distributed systems), and can in particular provide with a robust framework for managing dynamical workload balancing. In this paper we show how the restructuring of a sequential code implementing an irregularly structured application, a combinatorial optimization performed with Branch & Bound (B&B) technique, with adoption of the mobile agent model, allows for yielding a dinamically load-balanced distributed version.