Optimization of FCFS based Resource provisioning

algorithms for Cloud Computing
Guided by Prof. Lakshmi Kurup
Aditya Marphatia

Aditi Muhnot

Dept. of Computer Engineering
Mumbai, India

Dept. of Computer Engineering
Mumbai, India

Tanveer Sachdeva

Esha Shukla

Dept. of Computer Engineering
Mumbai, India

Dept. of Computer Engineering
Mumbai, India

Abstract— In our project, we propose an optimized version of
the FCFS scheduling algorithm addresses these major challenges
of task scheduling in cloud. The incoming tasks are grouped on
the basis of task requirement like minimum execution time or
minimum cost and prioritized (FCFS manner). Resource
selection is done on the basis of task constraints using a greedy
approach. The proposed model will be implemented and tested
on simulation toolkit. We intend to create a module depicting the
normal FCFS algorithm in comparison to our optimized version
algorithm for resource provisioning in the cloud.
Index Terms—Cloud computing, FCFS, module, resource,

efficiently and to their best capacity so that resource
potential is not left unused.
Much of the research so far has been focused on Cloud
security and data protection aspects, therefore the efficient
provisioning of resources and necessity of cloud services to
be cost effective is often neglected. In our project, we
propose an optimized version of the FCFS scheduling
algorithm which addresses these major challenges of task


scheduling in cloud. The incoming tasks are grouped on the

Cloud computing has emerged as a popular computing

basis of task requirement like minimum execution time or

model to support on demand services. It is a style of

minimum cost and prioritized (FCFS manner). Resource



selection is done on the basis of task constraints using a

delivered as a service to external customers using Internet

greedy approach. The proposed model will be implemented

technologies. Scheduling in cloud is responsible for

and tested on simulation toolkit. We intend to create a

selection of best suitable resources for task execution, by


taking some static and dynamic parameters and restrictions

comparison to our optimized version algorithm for resource

of tasks’ into consideration. The users’ perspective of

provisioning in the cloud.





efficient scheduling may be based on parameters like task
completion time or task execution cost etc. Service
providers like to ensure that resources are utilized







reduces the cost-communication ratio. who are accustomed to working with a fixed set of resources they own. they are given more priority in scheduling sequence. will be using various While current cloud systems are beginning to offer current resource provisioning strategies. constraint which can be deadline or minimum with the privacy of the databases being stored on cost. In the proposed framework tasks are grouped on the basis of Cloud security has been a major issue uptil now. This. however. minimum time constraint first. The effectiveness and tasks. By task grouping in cloud it is meant budget constraints and the implementation of the that tasks of similar type can be grouped together cloud on a large-scale is a very costly affair. if employed to combine several the cloud being under threat. PROPOSED SYSTEM The different resource provisioning algorithms task profit in descending order. Cost Constrained developers and users. Prioritization: Priority determines the importance of the element with which it is from those of traditional architectures. Hence. This is mentioned have certain flaws on which work could appreciable as tasks with higher profit can be be done in this direction to extract the advantageous executed on minimum cost based machine to points of these algorithms and come up with a better give maximum profit. PROBLEM DEFINITION WITH SCOPE OF PROJECT • The algorithm devised by us. Outline of the Proposed Algorithm: Resource cost is an important consideration while using cloud resources for scientific computing as • • 1. it There can be better more-costly implementable determines the order of task scheduling based on resource provisioning algorithms such as the the parameters undertaken for its computation.II. The cost based tasks are prioritized on the basis of III. In terms of task scheduling. is a new and 1. There are the two ways of choosing the deciding parameters for the utility-like provisioning of services. components on the basis of certain behaviour or Resource provisioning algorithms have certain attribute. In probability dependent priority used by Ye Hu over the present framework. 3. Grouping. provisioning of resources has to be controlled by implementation of the proposed algorithm: the end users. well. Greedy Allocation: Greedy algorithm is suitable for dynamic heterogeneous resource environment connected to the scheduler through . However it with tasks arranged in ascending order of requires many more factors to be considered and deadline in order to execute the task with the cost rises up. • Task Grouping: Grouping means collection of associated. efficiency of traditional protection mechanisms are being reconsidered as the characteristics of this innovative deployment model can differ widely 2. and then scheduled collectively. Deadline Constrained unfamiliar paradigm for computer application 2. solution that tries to minimize the drawbacks of resultant algorithm. the task list is rearranged the preference of the FCFS scheduling.

Flexibility . Operational Feasibility: The algorithm that is proposed should have a considerable positive impact on the resource provisioning to both parties i. easy-to- cloud component. the client and the cloud service provider. feasibility to on maximising the utilisation of computing greedy algorithm is used with aim of minimizing ii. But still this should not be a major concern.homogeneous communication environment. Efficiency – The underlying technology focuses power and disk storage resulting in less wasted resource. risks and gaps. High availability – designed to the highest On cloud side. . FEASABILITY OF PROPOSED SYSTEM issues minimise and when it is needed. 3. specifications Different Parameters for Greedy Approach 2. We will to solve the job scheduling problem. a fundamental Greedy algorithms look for simple. provide the most obvious benefit. Minimum Cost Based: The resource with minimum cost is selected and tasks are scheduled on it until its capacity is supported. Deadline Constrained Based: To improve the for downtime enabling SLA based services to be Realization i. Economic Feasibility: Economics of this project need to be understood from the development of the cloud environment perspective. this project can face obstructions as it deals with interfacing with heterogeneous environments.Customers need only to buy what they require today rather than buying an IT solution that they will have to grow into overtime and then provision extra resource as This being a cloud computing project. multi-step identifies benefits. determine what hardware and applications can be optimized through virtualization. doesn’t consider the larger problem as a whole. resiliency delivered to the customer. The Algorithm can be implemented using Java. The ACID properties of the cloud database need to be satisfied. Comprehensive analysis not only implement solutions to complex. completion time of tasks the turnaround task of individual tasks. the major will be in the efficient implementation of the cloud environment and in the simulation of the proposed algorithm to have better utilization of available resources. Such algorithms are called greedy because while the The various factors to be kept in mind when studying optimal solution to each smaller instance will the feasibility of the cloud are: provide an immediate output.e. Cloud Feasibility: An understanding of where you Greedy approach is one of the approaches used are and what your objectives mean. the algorithm 1. Technological and System feasibility: An error-free simulation analysis is very important point that needs to be considered IV. but also determines problems by deciding which next step will the financial impact on the project.

of Computer Engineering for providing us with the resources and infrastructure to undertake this project..SNASEL. V.. APPLYING DOUBLE-SIDED COMBINATIONALAUCTIONS TO RESOURCE ALLOCATION IN CLOUDCOMPUTING .. A. • IEEE 10TH ANNUAL INTERNATIONAL SYMPOSIUM ONAPPLICATIONS AND THE INTERNET. LADANI.. JAVA AGENT DEVELOPMENT FRAMEWORK. RAHMANI. IZAKIAN. A. K... 2009. M.IT existing cloud environments. M. [17]S. ASSUMPTION Our work is based on the assumption that finegrained allocation and pricing of resources is possible for each virtual environment.. 2012. MOVAGHAR.FUTURE GNERATION COMPUTER SYSTEMS VOL 26 . B. D. ON GRID COMPUTING (GRID 2008) • 85-94. CONF. DAS. ACKNOWLEDGMENT We wish to thank Prof.. pp 7-12. “AUCTIONBASED RESOURCE ALLOCATION PROTOCOLS IN GRIDS”. ZAMANIFAR. TEYMOURI.. 29-35. but is consistent with WU AT LA. • [12] IZAKIAN. REFERENCES • IEEE/ACM INT. H.[11]GROSU.PP 228–.T. AN The CloudSim toolkit supports both system and behavior modeling of Cloud system components such as data centers. Narendra Shekokar and our guide Prof.. International Journal of Applicationvol 43. virtual machines (VMs) and resource provisioning policies. 16TH IASTED INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING AND SYSTEMS. Computer . “A CONTINUOUS DOUBLE AUCTION METHOD FORRESOURCE ALLOCATION IN COMPUTATIONAL GRIDS”. IEEESYMPOSIUM ON COMPUTATIONAL INTELLIGENCE INSCHEDULING. BEIGY. 2004. • [16] ADABI. PP. The user of an instance can request for a different CPU cycle percentage or memory allocation at any point during its execution. FUJIWARA .ABRAHAM. Additionally. RAHMANI. • [13]H. “A CONTINUES DOUBLEAUCTION METHOD FOR RESOURCE ALLOCATION IN ECONOMIC • Grids”.. Thus. 2012. 2010 . CLOUD COMPUTING RESOURCEALLOCATION MECHANISM RESEARCH BASED ON REVERSEAUCTION . S.HTTP://JADE. The different resource provisioning algorithms are compared using this simulator software and it is proved that the proposed algorithm is better in resource utilization than other algorithms. 2009. and recent research points to the progression of clouds in such a direction. A. AUCTION FOR RESOURCE ALLOCATION IN COMPUTATIONAL GRIDS . 2012. A. 2011. while evaluating the efficiency of the proposed algorithm in comparison with other algorithms assumes that he jobs arrival is Uniformly Randomly Distributed to get generalized scenario. TORK LADANI .. • [20] JADE..MARKET-BASED GRID RESOURCE ALLOCATION USING NEW NEGOTIATION MODEL”. V. ABRAHAM. we assume that CPU cycles and memory can be shared in a fine-grained fashion between different instances. Lakshmi Kurup for their continued encouragement and support and the Dept. B. A. 2004.PP 736–741 the utility vision of computing. . A. JOURNAL OF NETWORK ANDCOMPUTER APPLICATIONS. H. 2008.CSELT. 2011 . ENERGY PROCEDIA VOL 13.. This is not true for the • XIAOHONG • [15] I.Currently there is an existing toolkit that depicts the different resource provisioning algorithms called as CloudSim: an extensible simulation toolkit that enables modeling and simulation of Cloud computing systems and application provisioning environments.