Journal of Parallel and Distributed Computing - Special issue on parallel evolutionary computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
IEEE Transactions on Parallel and Distributed Systems
A Benefit Function Mapping Heuristic for a Class of Meta-Tasks in Grid Environments
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Resource Co-allocation for Parallel Tasks in Computational Grids
CLADE '03 Proceedings of the 1st International Workshop on Challenges of Large Applications in Distributed Environments
A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Dynamic, Competitive Scheduling of Multiple DAGs in a Distributed Heterogeneous Environment
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
A Framework for Mapping with Resource Co-Allocation in Heterogeneous Computing Systems
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Resource Co-Allocation in Computational Grids
HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Hi-index | 0.00 |
Resource co-allocation is one of the crucial problems affecting the utility of the grid. Because the numbers of the application tasks and amounts of required resources are enormous and quick responses to the requirements of users are necessary in the real grid environment, real-time resource co-allocation may be large-scale. A parallel resource co-allocation algorithm based on the framework for mapping with resource co-allocation is proposed in this paper. Through the result of experiments, it is concluded that the parallel method reduces the execution time of the resource co-allocation algorithm significantly, and makes the overall response time to the end-users small.