A Policy Service for GRID Computing
GRID '02 Proceedings of the Third International Workshop on Grid Computing
XML-Based Policy Engine Framework for Usage Policy Management in Grids
GRID '02 Proceedings of the Third International Workshop on Grid Computing
End-to-End Provision of Policy Information for Network QoS
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Enabling the Co-Allocation of Grid Data Transfers
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Lognormal and Pareto distributions in the Internet
Computer Communications
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
WOSP '08 Proceedings of the 7th international workshop on Software and performance
A Two Level Approach for Managing Resource and Data Intensive Tasks in Grids
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
Hi-index | 0.00 |
The problem of efficient assignment of resources to perform a given bag-of-tasks in a distributed computing environment has been extensively studied by research communities. To develop an efficient resource assignment mechanism, this paper focuses on a particular type of resource intensive tasks and presents a bi-level decision-making architecture in a grid computing environment. In the proposed architecture, the higher decision-making module has the responsibility to select a partition of resources for each of the tasks. The lower decision-making module uses Integer Linear Programming based algorithm to actually assign resources from this selected partition to a particular task from the given set of tasks. This paper analyzes the performance of the proposed architecture at various workload conditions. This architecture can be extended for other types of tasks using the concepts presented.