Priority based dynamic resource allocation in Cloud computing with modified waiting queue
- 1 March 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 311-316
Abstract
Today Cloud computing is on demand as it offers dynamic flexible resource allocation, for reliable and guaranteed services in pay-as-you-use manner, to Cloud service users. So there must be a provision that all resources are made available to requesting users in efficient manner to satisfy their needs. This resource provision is done by considering the Service Level Agreements (SLA) and with the help of parallel processing. Recent work considers various strategies with single SLA parameter. Hence by considering multiple SLA parameter and resource allocation by preemption mechanism for high priority task execution can improve the resource utilization in Cloud. In this paper we propose an algorithm which considered Preemptable task execution and multiple SLA parameters such as memory, network bandwidth, and required CPU time. An obtained experimental results show that in a situation where resource contention is fierce our algorithm provides better utilization of resources.Keywords
This publication has 18 references indexed in Scilit:
- Resource Planning for Parallel Processing in the Cloud2011
- Multi-dimensional SLA-Based Resource Allocation for Multi-tier Cloud Computing Systems2011
- SLA-Aware Application Deployment and Resource Allocation in Clouds2011
- Towards Knowledge Management in Self-Adaptable Clouds2010
- Dynamic Scaling of Web Applications in a Virtualized Cloud Computing Environment2009
- Effective load balancing for cluster-based servers employing job preemptionPerformance Evaluation, 2008
- A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systemsParallel Computing, 2005
- Load balancing a cluster of web servers: using distributed packet rewriting2002
- Dynamic load balancing on Web-server systemsIEEE Internet Computing, 1999
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical ProcessorsJournal of the ACM, 1977