International Research Journal of Engineering and Technology (IRJET) Volume: 04 Issue: 3 | Mar -2017
www.irjet.net
e-ISSN: 2395 -0056 p-ISSN: 2395-0072
RESOURCE ALLOCATION FOR TASK USING FAIR SHARE SCHEDULING ALGORITHM T.Sangeetha1, S.Gowsika2, S.Priyadharshini3, P.Gayathri4 1,2,3,4Department
of Computer Science and Engineering, M. Kumarasamy College of Engineering, Karur. resources to the needed cloud applications over the internet. Cloud resources consist of both physical and virtual resources. The virtualized resources can be requested through various parameters like processing, memory and the disk needs. The hardware and software resources are allocated through on-demand basis to the needed cloud applications.
Abstract-Cloud Computing is a major area where the business people and many organizations are using now-adays. It provides a guaranteed service to the users. The main idea lies behind the cloud computing is that the information about the user is not necessary to be placed locally instead it is stored in the cloud. With the help of internet, the data can be accessed from the cloud whenever it is needed. In SCS algorithm, the resource allocation is performed mainly based on the time, which is based on the requested start and end time. If the time for the particular user is get over, then the remaining task will be allocated to the next resource. The major drawback in SCS algorithm is that overlapping of tasks. If suppose two or more tasks are assigned to the same resource, then the tasks get overlapped. In order to overcome this issue, fair share scheduling algorithm was proposed. In this algorithm, based on the need and the availability of the resource and the user the priority is assigned among the tasks. Keywords: Quality of Service, SCS algorithm, Fair Share Scheduling algorithm
EXISTING SYSTEM Selection of resources and assignment of tasks are the fundamental methods in cloud computing. In Spectral Clustering Scheduling (SCS) algorithm, it is mainly focused on the tasks with fixed but not the strict time requirements as the requested start and end time. In this algorithm, scheduling is done only by taking the start and end time as constraints. The main advantage of this algorithm is that it reduces the overlapping time of tasks mapped to the appropriate resource. But the drawback is that it increases the overlapping time among various tasks assigned to different resources. In order to overcome this issue, fair share scheduling algorithm had been proposed.
INTRODUCTION Cloud computing delivers on demand service to its clients and users. Consumers are able to get the resources and services as their needs. The supplier charges the users according to their usage. Cloud computing is otherwise called “pay as you go model”. Virtualization technology in Cloud Computing is used for sharing resources in the datacenter (DC).Cloud computing lowers the cost by renting the physical infrastructure from third party provider. Due to the elastic nature of cloud, they can rapidly access resources from the cloud providers when they need to develop the business. The remote convenience enables the user to access the cloud services from anywhere at anytime. In cloud computing, generally Resource Allocation is a process of handing over the on hand © 2017, IRJET
|
Impact Factor value: 5.181
PROPOSED SYSTEM The main objective of the proposed system is to overcome the task overlapping and also to minimize the cost of utilization of resource. Resource allocation is the process of assigning available resources to the needed cloud application. In order to reduce resource contention and task overlapping, fair share scheduling algorithm is used. In this algorithm, QoS parameters taken into consideration are the time requirement, that is start |
ISO 9001:2008 Certified Journal
|
Page 563