Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
T. Drashansky, E. Houstis, N. Ramakrishnan, J. Rice, “Networked Agents for Scientific Computing”, Communications of the ACM, vol. 42,n. 3, March 1999.
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.
H. Kuang, L.F. Bic, M. Dillencourt, “Paradigm-oriented distributed computing using mobile agents”, Proc. of. 20th Int. Conf. on Distributed Computing Systems, 2000.
H.T. Lai and S. Sahni, “Anomalies in Parallel Branch & Bound Algorithms”, Communications of the ACM, vol. 27,n. 6, pp. 594–602, Jun. 1984.
D. Lange and M. Oshima, Programming and Deploying Java Mobile Agents with Aglets, Addison-Wesley, Reading (MA), 1998.
D. Lange and M. Oshima, “Seven good reasons for Mobile Agents”, Communications of the ACM, vol. 42,n. 3, March 1999.
V.A. Pham, A. Karmouch, “Mobile software agents: an overview”, IEEE Communications Magazine, Vol. 36(7), July 1998, pp. 26–37.
C. Ribeiro, “Parallel Computer Models and Combinatorial Algorithms”, Annals of Discrete Mathematics, North-Holland, pp. 325–364, 1987.
H.W.J. Trienekens, “Parallel Branch&Bound Algorithms”, Ph.D. Thesis at Erasmus Universiteit-Rotterdam, Nov. 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aversa, R., Di Martino, B., Mazzocca, N., Venticinque, S. (2001). Mobile Agents for Distributed and Dynamically Balanced Optimization Applications. In: Hertzberger, B., Hoekstra, A., Williams, R. (eds) High-Performance Computing and Networking. HPCN-Europe 2001. Lecture Notes in Computer Science, vol 2110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48228-8_17
Download citation
DOI: https://doi.org/10.1007/3-540-48228-8_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42293-8
Online ISBN: 978-3-540-48228-4
eBook Packages: Springer Book Archive