Mobile agent-based distributed job workflow execution requires the use of execution coordination techniques to ensure that an agent executing a subjob can locate its predecessors' execution results. This paper des...
详细信息
Mobile agent-based distributed job workflow execution requires the use of execution coordination techniques to ensure that an agent executing a subjob can locate its predecessors' execution results. This paper describes the classification, implementation, and evaluation of execution coordination techniques in the mobile agent-based distributed job workflow execution system. First, a classification of the existing execution coordination techniques is developed for mobile agent systems. Second, to put the discussion into perspective, our framework for mobile agent-based distributed job workflow execution over the Grid (that is, MCCF: Mobile Code Collaboration Framework) is described. How the existing coordination techniques can be applied in the MCCF is also discussed. Finally. a performance study has been conducted to evaluate three coordination techniques using real and simulated jobworkflows. The results are presented and discussed in the paper. (C) 2008 Elsevier B.V. All rights reserved.
This paper is concerned with the design, implementation, and evaluation of algorithms for communication partner identification in mobile agent-based distributed job workflow execution. We first describe a framework fo...
详细信息
This paper is concerned with the design, implementation, and evaluation of algorithms for communication partner identification in mobile agent-based distributed job workflow execution. We first describe a framework for distributed job workflow execution over the Grid: the Mobile Code Collaboration Framework (MCCF). Based on the study of agent communications during a jobworkflowexecution on MCCF, we identify the unnecessary agent communications that degrade the system performance. Then, we design a novel subjob grouping algorithm for preprocessing the jobworkflow's static specification in MCCF. The obtained information is used in both static and dynamic algorithms to identify partners for agent communication. The mobile agent dynamic location and communication based on this approach is expected to reduce the agent communication overhead by removing unnecessary communication partners during the dynamic jobworkflowexecution. The proof of the dynamic algorithm's correctness and effectiveness are elaborated. Finally, the algorithms are evaluated through a comparison study using simulated jobworkflows executed on a prototype implementation of the MCCF on a LAN environment and an emulated WAN setup. The results show the scalability and efficiency of the algorithms as well as the advantages of the dynamic algorithm over the static one. (C) 2007 Elsevier Inc. All fights reserved.
jobworkflow systems automate the execution of scientific applications, however they may hide how the results are achieved (i.e., the provenance information of the jobworkflowexecution). This paper describes the dev...
详细信息
ISBN:
(纸本)9783540725831
jobworkflow systems automate the execution of scientific applications, however they may hide how the results are achieved (i.e., the provenance information of the jobworkflowexecution). This paper describes the development and evaluation of a decentralized recording and collection scheme for jobworkflow provenance in mobile agent-based distributed job workflow execution. A performance study was conducted to evaluate our approach against the one using a centralized provenance server. The results are discussed in the paper.
Mobile agent based distributed job workflow execution is a promising paradigm for data intensive collaborative scientific computations over the Grid. In this paper a Mobile Code Collaboration Framework (MCCF)for distr...
详细信息
ISBN:
(纸本)0769523285
Mobile agent based distributed job workflow execution is a promising paradigm for data intensive collaborative scientific computations over the Grid. In this paper a Mobile Code Collaboration Framework (MCCF)for distributed job workflow execution over the Grid is described and an algorithm to identify partners for agent communication in MCCF is presented. Previous work of mobile agent communication focuses mainly on agent location and communication. Little work has been done on communication partner identification. In MCCF a novel subjob grouping algorithm for preprocessing the jobworkflow's static specification is developed. The obtained information will then be used during runtime to identify partners for agent communication. The mobile agent dynamic location and communication based on this approach will limit the number of agents required for communication during the dynamic jobworkflowexecution. The algorithm is evaluated through a comparison study using simulated jobworkflows executed on a prototype implementation of the MCCF. The results show that the algorithm is scalable and efficient.
暂无评论