As network environments have been improved and the use of internet has been increased, mobile agent technologies are widely used in the fields of information retrieval, network management, electronic commerce, and parallel/distributed processing. Recently, a lot of researchers have studied the concepts of parallel/distributed processing based on mobile agents. SPMD is the parallel processing method which transmits a program to all the computers participated in parallel environment, and performs a work with different data. Therefore, to transmit fast a program to all the computers is one of important factors to reduce total execution time. In this paper, we consider the parallel environment consisting of mobile agents system, and propose a new method which transmits fast a mobile agent code to all the computers using binomial trees in order to efficiently perform the SPMD parallel processing. The proposed method is compared with another ones through experimental evaluation on the IBM`s Aglets, and gets greatly better performance. Also this paper deals with fault tolerances which can be occurred in transmitting a mobile agent using binomial trees.
[1]
Giovanni Vigna,et al.
Designing Distributed Applications with Mobile Code Paradigms
,
1997,
Proceedings of the (19th) International Conference on Software Engineering.
[2]
Dhabaleswar K. Panda,et al.
Fast Collective Communication Algorithms for Reflective Memory Network Clusters
,
2000,
CANPC.
[3]
S. Lennart Johnsson,et al.
Optimum Broadcasting and Personalized Communication in Hypercubes
,
1989,
IEEE Trans. Computers.
[4]
Nian-Feng Tzeng,et al.
Distributed shared memory systems with improved barrier synchronization and data transfer
,
1997,
ICS '97.