On the dynamic allocation of mobile agents by on-line task scheduling

Xinfeng Yang, Weimin Ma, Jia You, J. Liu

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

3 Citations (Scopus)

Abstract

This paper presents a new approach to the dynamic allocation of mobile agents by on-line task scheduling for high performance in Internet computing. In contrast to the existing approaches, which apply predefined task scheduling schemes to allocate computing resources, we introduce a new on-line competitive algorithm to achieve flexibility. A guided allocation scheme based on the system competitive ratio is developed to optimize the allocation of mobile agents. The proposed system combines push-based technology with an innovative on-line task-scheduling scheme to speed up system response time and minimize system overheads. The system analysis and simulation demonstrate the feasibility and effectiveness of our approach to mobile agent-based Internet computing.
Original languageEnglish
Title of host publicationProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002
PublisherIEEE
Pages217-224
Number of pages8
ISBN (Electronic)0769515738, 9780769515731
DOIs
Publication statusPublished - 1 Jan 2002
Event16th International Parallel and Distributed Processing Symposium, IPDPS 2002 - Ft. Lauderdale, United States
Duration: 15 Apr 200219 Apr 2002

Conference

Conference16th International Parallel and Distributed Processing Symposium, IPDPS 2002
Country/TerritoryUnited States
CityFt. Lauderdale
Period15/04/0219/04/02

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Modelling and Simulation

Cite this