Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2002.9A.3.341

A Fast Transmission of Mobile Agents Using Binomial Trees  

Cho, Soo-Hyun (Dept.of Computer Science, Graduate School of Kumoh National Institute of Technology)
Kim, Young-Hak (Dept.of Computer Science, Kumoh National Institute of Technology)
Publication Information
The KIPS Transactions:PartA / v.9A, no.3, 2002 , pp. 341-350 More about this Journal
Abstract
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.
Keywords
Binomial Tree; Mobile Agent; Master/slave; Complete Binary Tree; Fault-tolerance;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 D. B. Lange and M. Oshima, 'Programming and deploying Java Mobile Agents with Aglets,' Addison Wesley Press, 1998
2 IBM, 'The Aglets Workbench,' URL : http://www.trl.ibm.co.jp/aglets/
3 C. G. Harrison, D. M. Chess, and A. Kershenbaum, 'Mobile Agents : Are They a Good Idea?,' IBM Watson Research Center, Mar., 1995
4 General Magic Odyssey, URL : http://www.genmagic.com/agents/
5 Concordia, URL : http://www.meitca.com/HLS/Projects/Concordia/
6 Voyager, URL : http://www.objectspace.com/voyager/
7 B. Wilkinson and C. M. Allen, 'Parallel Programming : Techniques and Applications Using Networked Workstations and Parallel Computers,' Prentice Hall, 1998
8 Message Passing Interface Forum, 'MPI-2 : Extensions to the Message-Passing Interface,' URL : http://www.mpiforum.org/docs/mpi-20-html/mpi2-report.html
9 A. Afsahi, 'Design and Evaluation of Communication Latency Hiding-Reduction Techniques for Message-Passing Environments,' Ph. D. Dissertation, University of Victoria, British Columbia, Apr., 2000
10 V. Moorthy, D. K. Panda, and P. Sadayappan, 'Fast Collective Communication Algorithms for Reflective Memory Network Clusters,' CANPC'00, pp.100-114, Jan., 2000   DOI
11 T. L. Williams, 'A General-Purpose Model for Heterogeneous Computation,' Ph. D. Dissertation, University of Central Florida, Orlando, Dec., 2000
12 A. Carzaniga, G. P. Picco, and G. Vigna, 'Designing Distributed Applications with Mobile Code Paradigms,' Proceedings of the 19th International Conference on Software Engineering, Boston, 1997   DOI
13 전병국, 최형근, '이동 에이전트를 위한 효율적인 이주정책의 설계 및 구현', 정보처리학회논문지, 제6권 제7호, Jul., 1999
14 J. Baurnann, 'A Protocol for Orphan Detection and Termination in Mobile Agent Systems,' TR-1997-09, Stuttgart University, Jul., 1997
15 권혁찬, 유우종, 김흥환, 유관종, '데이터 마이닝을 위한 이동 에이전트의 효율적인 이주 전략', 정보처리학회논문지, 제7권 제5호, May, 2000   과학기술학회마을
16 S. L. Johnsson and C. T. Ho, 'Optimum Broadcasting and Personalized Communication in Hypercubes,' IEEE Trans. Computers, Vol.38, No.9, pp.1249-1268, Sep., 1989   DOI   ScienceOn
17 R. Kesavan and D. K. Panda, 'Optimal Multicast with Packetization and Network Interface Support,' Technical Report OSU-CISRC-2/97-TR10, The Ohio State University, 1996
18 M. Straber, J. Baumann, and M. Schwehm, 'An Agent-Based Framework for the Transparent Distribution of Computations,' PDPTA, Vol.1, pp.376-382, 1999
19 M. Starber and M. Schwehm, 'A Performance Model for Mobile Agent Systems,' PDPTA, Vol.II, pp.1132-1140, 1997
20 R. Rabenseifner and A. E. Koniges, 'Effective Communication and File-I/O Bandwidth Benchmarks,' Proceedings of 8th European PVM/MPI Users'Group Meeting, EuroPVM/MPI 2001, pp.24-35, Sep., 2001
21 M. Banikazemi and D. K. Panda, 'Efficient Scatter Communication in Wormhole k-ary n-cubes with Multidestination Message Passing,' Technical Report OSU-CISRC-9/96-TR46, The Ohio State University, 1996
22 N. F. Tzeng and A. Kongmunvattana, 'Distributed Shared Memory Systems with Improved Barrier Synchronization and Data Transfer,' In Proceedings of the 1997 ACM International Conference on Supercomputing, Vienna, Austria, Jul., 1997   DOI