Achieving Co-allocation through Virtualization in Grid Environment

  • Authors:
  • Thamarai Selvi Somasundaram;Balachandar R. Amarnath;Balakrishnan Ponnuram;Kumar Rangasamy;Rajendar Kandan;Rajiv Rajaian;Rajesh Britto Gnanapragasam;Mahendran Ellappan;Madusudhanan Bairappan

  • Affiliations:
  • CARE, Department of Information Technology, Madras Institute of Technology, Anna University, Chennai, India;CARE, Department of Information Technology, Madras Institute of Technology, Anna University, Chennai, India;CARE, Department of Information Technology, Madras Institute of Technology, Anna University, Chennai, India;CARE, Department of Information Technology, Madras Institute of Technology, Anna University, Chennai, India;CARE, Department of Information Technology, Madras Institute of Technology, Anna University, Chennai, India;CARE, Department of Information Technology, Madras Institute of Technology, Anna University, Chennai, India;CARE, Department of Information Technology, Madras Institute of Technology, Anna University, Chennai, India;CARE, Department of Information Technology, Madras Institute of Technology, Anna University, Chennai, India;CARE, Department of Information Technology, Madras Institute of Technology, Anna University, Chennai, India

  • Venue:
  • GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.