Applying conflict management strategies in BDI agents for resource management in computational grids
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
JATLite: A Java Agent Infrastructure with Message Routing
IEEE Internet Computing
Performance Evaluation of an Agent-Based Resource Management Infrastructure for Grid Computing
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Matchmaking: Distributed Resource Management for High Throughput Computing
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
Resource Management through Multilateral Matchmaking
HPDC '00 Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing
Condor-G: A Computation Management Agent for Multi-Institutional Grids
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Extending JADE for Agent Grid Applications
WETICE '04 Proceedings of the 13th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises
Agent support for a grid-based high energy physics application
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Scalable middleware environment for agent-based internet applications
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
| Hi-index | 0.00 |
A computational Grid, as an emerging framework for providing globally distributed computing resources to our desktop, has been established as a new programming environment. In particular, a new Grid research for utilizing a large number of busy computers is indispensable for further development of Grid. In this paper, we concentrate on Grid scheduling problem. To cope with unstable availability, low reliability, and mixed operation policies that are still serious problems in metascheduling, we propose ASF, Agent-based Scheduling Framework whose idea is dual to the conventional metascheduling. ASF is composed of a single discreet metascheduler and a collection of autonomous agents attached to each computing resource manager. Each agent autonomously finds jobs to be processed, instead of being assigned a job to by a omnipotent metascheduler. We implement a prototype of ASF, and prove its effectiveness. Our experiment shows that the total elapsed time of job processing is reduced by 11%.