Resource Provisioning Based Scheduling Framework for Execution of Virtual Machine in Heterogeneous Environment in Cloud Computing

2020 ◽  
Vol 37 ◽  
pp. 59-68
Author(s):  
Maheta Ashish ◽  
Samrat V.O. Khanna

Cloud computing is provides resource allocation which facilitates the cloud resource provider responsible to the cloud consumers. The main objective of resource manager is to assign the dynamic resource to the task in the execution and measures response time, execution cost, resource utilization and system performance. The resource manager is optimizing the resource and measure the completion time for assign resource. The resource manager is also measure to execute the resource in the optimal way to complete the task in minimum completion time. The virtualization is techniques mandatory to allocate the dynamic resource depends on the users need. There are also green computing techniques involved for enhanced the no of server. The skewness is basically used to enhance the quality of service using the various parameters. The proposed algorithms are considered to allocate the cloud resource as per the users requirement. The advantage of proposed algorithm is to view the analysis of cpu utilization and also reduced the memory usage.

2019 ◽  
Vol 8 (3) ◽  
pp. 1863-1870 ◽  

Resource allocation (RA) is a significant aspect of Cloud Computing. The Cloud resource manager is responsible to assign available resources to the tasks for execution in an effective way that improves system performance, reduce response time, lessen makespan and utilize resources efficiently. To fulfil these objectives, an effective Tasks Scheduling algorithm is required. The standard Max-Min and Min-Min Task Scheduling algorithms are not able to produce better makespan and effective resource utilization. In this paper, a Resource-Aware Min-Min (RAMM) Algorithm is proposed based on basic Min-Min algorithm. The proposed RAMM Algorithm selects shortest execution time task and assigns it to the resource which takes shortest completion time. If minimum completion time resource is busy, then the RAMM Algorithm selects next minimum completion time resource to reduce waiting time of the task and improve resource utilization. The experiment results show that the proposed RAMM Algorithm produces better makespan and load balance than Max-Min, Min-Min and improved Max-Min Algorithms.


2020 ◽  
Vol 8 (6) ◽  
pp. 3591-3596

One of the biggest challenges cloud computing faces is forecasting correctly the resource use for future demands. Consumption of cloud resources is consistently changing, making it difficult for algorithms to forecast to make precise predictions. Using of the machine learning in cloud computing leads to many benefits. Such as chances of the enhancement in the quality of the service via forecasting future burden of works and responding automatically with dynamic scaling. This motivates the work presented in this paper to predict CPU use of host machines for a single time and multiple times. This paper uses three supervised machine-learning algorithms to classify and predict CPU utilization because of their capability to keep data and predict accurate time series issues. It is tried to forecast CPU usage with better accuracy while comparing to traditional methods


2019 ◽  
Vol 15 (4) ◽  
pp. 13-29
Author(s):  
Harvinder Chahal ◽  
Anshu Bhasin ◽  
Parag Ravikant Kaveri

The Cloud environment is a large pool of virtually available resources that perform thousands of computational operations in real time for resource provisioning. Allocation and scheduling are two major pillars of said provisioning with quality of service (QoS). This involves complex modules such as: identification of task requirement, availability of resource, allocation decision, and scheduling operation. In the present scenario, it is intricate to manage cloud resources, as Service provider aims to provide resources to users on productive cost and time. In proposed research article, an optimized technique for efficient resource allocation and scheduling is presented. The proposed policy used heuristic based, ant colony optimization (ACO) for well-ordered allocation. The suggested algorithm implementation done using simulation, shows better results in terms of cost, time and utilization as compared to other algorithms.


2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Mahfooz Alam ◽  
Mahak ◽  
Raza Abbas Haidri ◽  
Dileep Kumar Yadav

Purpose Cloud users can access services at anytime from anywhere in the world. On average, Google now processes more than 40,000 searches every second, which is approximately 3.5 billion searches per day. The diverse and vast amounts of data are generated with the development of next-generation information technologies such as cryptocurrency, internet of things and big data. To execute such applications, it is needed to design an efficient scheduling algorithm that considers the quality of service parameters like utilization, makespan and response time. Therefore, this paper aims to propose a novel Efficient Static Task Allocation (ESTA) algorithm, which optimizes average utilization. Design/methodology/approach Cloud computing provides resources such as virtual machine, network, storage, etc. over the internet. Cloud computing follows the pay-per-use billing model. To achieve efficient task allocation, scheduling algorithm problems should be interacted and tackled through efficient task distribution on the resources. The methodology of ESTA algorithm is based on minimum completion time approach. ESTA intelligently maps the batch of independent tasks (cloudlets) on heterogeneous virtual machines and optimizes their utilization in infrastructure as a service cloud computing. Findings To evaluate the performance of ESTA, the simulation study is compared with Min-Min, load balancing strategy with migration cost, Longest job in the fastest resource-shortest job in the fastest resource, sufferage, minimum completion time (MCT), minimum execution time and opportunistic load balancing on account of makespan, utilization and response time. Originality/value The simulation result reveals that the ESTA algorithm consistently superior performs under varying of batch independent of cloudlets and the number of virtual machines’ test conditions.


2016 ◽  
Vol 76 (12) ◽  
pp. 14485-14509 ◽  
Author(s):  
Tamal Adhikary ◽  
Amit Kumar Das ◽  
Md. Abdur Razzaque ◽  
Majed Alrubaian ◽  
Mohammad Mehedi Hassan ◽  
...  

There are a huge number of nodes connected to web computing to offer various types of web services to provide cloud clients. Limited numbers of nodes connected to cloud computing have to execute more than a thousand or a million tasks at the same time. So it is not so simple to execute all tasks at the same particular time. Some nodes execute all tasks, so there is a need to balance all the tasks or loads at a time. Load balance minimizes the completion time and executes all the tasks in a particular way.There is no possibility to keep an equal number of servers in cloud computing to execute an equal number of tasks. Tasks that are to be performed in cloud computing would be more than the connected servers. Limited servers have to perform a great number of tasks.We propose a task scheduling algorithm where few nodes perform the jobs, where jobs are more than the nodes and balance all loads to the available nodes to make the best use of the quality of services with load balancing.


Author(s):  
Rajni Aron ◽  
Deepak Kumar Aggarwal

Cloud Computing has become a buzzword in the IT industry. Cloud Computing which provides inexpensive computing resources on the pay-as-you-go basis is promptly gaining momentum as a substitute for traditional Information Technology (IT) based organizations. Therefore, the increased utilization of Clouds makes an execution of Big Data processing jobs a vital research area. As more and more users have started to store/process their real-time data in Cloud environments, Resource Provisioning and Scheduling of Big Data processing jobs becomes a key element of consideration for efficient execution of Big Data applications. This chapter discusses the fundamental concepts supporting Cloud Computing & Big Data terms and the relationship between them. This chapter will help researchers find the important characteristics of Cloud Resource Management Systems to handle Big Data processing jobs and will also help to select the most suitable technique for processing Big Data jobs in Cloud Computing environment.


2019 ◽  
Vol 94 ◽  
pp. 80-96 ◽  
Author(s):  
Célia Ghedini Ralha ◽  
Aldo H.D. Mendes ◽  
Luiz A. Laranjeira ◽  
Aletéia P.F. Araújo ◽  
Alba C.M.A. Melo

Sign in / Sign up

Export Citation Format

Share Document