On the Dynamic Allocation of Mobile Agents by On-Line Task Scheduling

Authors:
Xinfeng Yang;Weimin Ma;Jane You;James Liu
Affiliations:
-;-;-;-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 7
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Competitive algorithms for on-line problems

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Programming and Deploying Java Mobile Agents Aglets

Programming and Deploying Java Mobile Agents Aglets
Design Issues in Mobile-Agent Programming Systems

IEEE Concurrency
A Hands-On Look at Java Mobile Agents

IEEE Internet Computing
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts

WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Utility Driven Mobile-Agent Scheduling

Utility Driven Mobile-Agent Scheduling

Quantified Score

Hi-index	0.00

Visualization

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.