Communication partner identification in distributed job workflow execution over the grid

Y. Feng, W. Cai, Jiannong Cao

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

41 Citations (Scopus)

Abstract

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 job workflow's static specification is developed. The obtained information is then used during runtime to identify partners for agent communication. The mobile agent dynamic location and communication based on this approach limits the number of agents required for communication during the dynamic job workflow execution. The algorithm is evaluated through a comparison study using simulated job workflows executed on a prototype implementation of the MCCF. The results show that the algorithm is scalable and efficient.
Original languageEnglish
Title of host publication25th IEEE International Conference on Distributed Computing Systems Workshops, 2005, 6-10 June 2005
PublisherIEEE
Pages587-593
Number of pages7
ISBN (Print)0769523285
DOIs
Publication statusPublished - 2005
EventInternational Conference on Distributed Computing Systems [ICDCS] -
Duration: 1 Jan 2005 → …

Conference

ConferenceInternational Conference on Distributed Computing Systems [ICDCS]
Period1/01/05 → …

Keywords

  • Distributed programming
  • Grid computing
  • Mobile agents

Cite this