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 dynamically load-balanced distributed version.
The application of the mobile agent model is discussed, with respect to the solutions adopted for knowledge sharing, communication, load balancing, and termination condition.
KeywordsMobile Agent Optimization Application Workload Balance Utilization Time Coordinator Agent
Unable to display preview. Download preview PDF.
- 1.R. Aversa, B. Di Martino, N. Mazzocca, “Restructuring Irregular Computations for Distributed Systems using Mobile Agents”, Proc. of PARA 2000, Int. Workshop on Applied Parallel Computing, Bergen, Norway, June 18–21, 2000.Google Scholar
- 2.T. Drashansky, E. Houstis, N. Ramakrishnan, J. Rice, “Networked Agents for Scientific Computing”, Communications of the ACM, vol. 42,n. 3, March 1999.Google Scholar
- 3.Gray R., Kotz D., Nog S., Rus D., Cybenko G., “Mobile agents: the next generation in distributed computing” Proc. of Int. Symposium on Parallel Algorithms/Architecture Synthesis, 1997.Google Scholar
- 4.H. Kuang, L.F. Bic, M. Dillencourt, “Paradigm-oriented distributed computing using mobile agents”, Proc. of. 20th Int. Conf. on Distributed Computing Systems, 2000.Google Scholar
- 6.D. Lange and M. Oshima, Programming and Deploying Java Mobile Agents with Aglets, Addison-Wesley, Reading (MA), 1998.Google Scholar
- 7.D. Lange and M. Oshima, “Seven good reasons for Mobile Agents”, Communications of the ACM, vol. 42,n. 3, March 1999.Google Scholar
- 9.C. Ribeiro, “Parallel Computer Models and Combinatorial Algorithms”, Annals of Discrete Mathematics, North-Holland, pp. 325–364, 1987.Google Scholar
- 10.H.W.J. Trienekens, “Parallel Branch&Bound Algorithms”, Ph.D. Thesis at Erasmus Universiteit-Rotterdam, Nov. 1990.Google Scholar