Title
Achieving Co-allocation through Virtualization in Grid Environment
Abstract
A typical grid application requires several processors for execution that may not be fulfilled by single cluster at times. Co-allocation is the concept of aggregating computing resources from more than one cluster to facilitate application execution. It poses great difficulty in implementing as these resources are distributed and managed locally. In this paper, we propose a metascheduling framework that achieves co-allocation using the concept of virtualization. Our approach differs from earlier ones as we create virtual machines to meet the requirements of application thereby utilizing the resources to the fullest possible extent while preserving their autonomy. We used Deviation Based Resource Scheduling algorithm to initiate SLA negotiation with other resources for participating in resource co-allocation. It also supports SLA monitoring and enforcement. Our preliminary results show that this approach achieves greater throughput against conventional scheduling.
Year
DOI
Venue
2009
10.1007/978-3-642-01671-4_22
GPC
Keywords
Field
DocType
grid environment,resource co-allocation,sla monitoring,fullest possible extent,aggregating computing resource,resource scheduling algorithm,application execution,single cluster,sla negotiation,achieving co-allocation,conventional scheduling,typical grid application,virtual machine,grid computing
Virtualization,Grid computing,Virtual machine,Computer science,Scheduling (computing),Computer network,Enforcement,Throughput,Grid,Distributed computing,Negotiation
Conference
Volume
ISSN
Citations 
5529
0302-9743
3
PageRank 
References 
Authors
0.41
10
9