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 language | English |
|---|---|
| Title of host publication | Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002 |
| Publisher | IEEE |
| Pages | 217-224 |
| Number of pages | 8 |
| ISBN (Electronic) | 0769515738, 9780769515731 |
| DOIs | |
| Publication status | Published - 1 Jan 2002 |
| Event | 16th International Parallel and Distributed Processing Symposium, IPDPS 2002 - Ft. Lauderdale, United States Duration: 15 Apr 2002 → 19 Apr 2002 |
Conference
| Conference | 16th International Parallel and Distributed Processing Symposium, IPDPS 2002 |
|---|---|
| Country/Territory | United States |
| City | Ft. Lauderdale |
| Period | 15/04/02 → 19/04/02 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Modelling and Simulation
Fingerprint
Dive into the research topics of 'On the dynamic allocation of mobile agents by on-line task scheduling'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver