Market-based resource control for mobile agents
AGENTS '98 Proceedings of the second international conference on Autonomous agents
Condor: a distributed job scheduler
Beowulf cluster computing with Linux
A taxonomy and survey of grid resource management systems for distributed computing
Software—Practice & Experience
Applying NetSolve's Network-Enabled Server
IEEE Computational Science & Engineering
Utilizing the Metaserver Architecture in the Ninf Global Computing System
HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
G-commerce: Market Formulations Controlling Resource Allocation on the Computational Grid
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
A Resource Management Architecture for Metacomputing Systems
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Policy Driven Heterogeneous Resource Co-Allocation with Gangmatching
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
IEEE Internet Computing
Performance Evaluation in Computational Grid Environments
HPCASIA '04 Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference
TM-DG: a trust model based on computer users' daily behavior for desktop grid platform
Proceedings of the 2007 symposium on Component and framework technology in high-performance and scientific computing
Hi-index | 0.00 |
In grid resource management, the scheduling strategy based on selecting resources that are near and owns more bandwidth available has better characteristics. The notion of grid-distance is proposed in this paper, which can be used as the criteria for grid selection taking physical distance, bandwidth available and cost into consideration. A grid resource model and a correlative application model are also presented. Based on this model, the computation of grid distance and the corresponding resource selection algorithm are described. The simulation experiment validates the improvement of the communication cost, stability; job completion time, failure rate of job execution in scheduling and the throughput of the resource exchange.