Application of Particle Swarm Optimisation-R Factor Optimisation Algorithm for Efficient Resource Allocation and Scheduling in Cloud Environment

2020 ◽  
Vol 17 (4) ◽  
pp. 1990-1998
Author(s):  
R. Valarmathi ◽  
T. Sheela
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Resource Management ◽  
Task Scheduling ◽  
Virtual Machines ◽  
Cost Optimization ◽  
Optimal Solution ◽  
Service Needs ◽  
Cloud Environment ◽  
Efficient Resource

Cloud computing is a powerful technology of computing which renders flexible services anywhere to the user. Resource management and task scheduling are essential perspectives of cloud computing. One of the main problems of cloud computing was task scheduling. Usually task scheduling and resource management in cloud is a tough optimization issue at the time of considering quality of service needs. Huge works under task scheduling focuses only on deadline issues and cost optimization and it avoids the significance of availability, robustness and reliability. The main purpose of this study is to develop an Optimized Algorithm for Efficient Resource Allocation and Scheduling in Cloud Environment. This study uses PSO and R factor algorithm. The main aim of PSO algorithm is that tasks are scheduled to VM (virtual machines) to reduce the time of waiting and throughput of system. PSO is a technique inspired by social and collective behavior of animal swarms in nature and wherein particles search the problem space to predict near optimal or optimal solution. A hybrid algorithm combining PSO and R-factor has been developed with the purpose of reducing the processing time, make span and cost of task execution simultaneously. The test results and simulation reveals that the proposed method offers better efficiency than the previously prevalent approaches.

QoS Based Efficient Resource Allocation and Scheduling in Cloud Computing

2019 ◽  
Vol 15 (4) ◽  
pp. 13-29
Author(s):  
Harvinder Chahal ◽  
Anshu Bhasin ◽  
Parag Ravikant Kaveri
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Resource Provisioning ◽  
Cloud Environment ◽  
Allocation Decision ◽  
Research Article ◽  
Large Pool ◽  
Efficient Resource ◽  
Algorithm Implementation

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.

scholarly journals OLB: A Nature Inspired Approach for Load Balancing in Cloud Computing

2015 ◽  
Vol 15 (4) ◽  
pp. 138-148 ◽  
Author(s):  
B. Mallikarjuna ◽  
P. Venkata Krishna
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Distributed Systems ◽  
Load Balancing ◽  
Virtual Machines ◽  
Simulation Analysis ◽  
Hash Table ◽  
Distributed Hash Table ◽  
Efficient Resource

Abstract Load balancing is treated as one of the important mechanisms for efficient resource allocation in cloud computing. In future there will appear a necessity of fully autonomic distributed systems to address the load balancing issues. With reference to this, we proposed a load balancing mechanism called Osmosis Load Balancing (OLB). OLB works on the principle of osmosis to reschedule the tasks in virtual machines. The solution is based on the Distributed Hash Table (DHT) with a chord overlay mechanism. The Chord overlay is used for managing bio inspired agents and status of the cloud. By simulation analysis, the proposed algorithm has shown better performance in different scenarios, both in heterogeneous and homogeneous clouds.

scholarly journals REVIEW OF TASK SCHEDULING METHODS FOR REAL TIME TASKS IN CLOUD ENVIRONMENT

2020 ◽  
Vol 5 (1) ◽  
pp. 85-89
Author(s):  
Dinkan Patel ◽  
Anjuman Ranavadiya
Keyword(s):  
Cloud Computing ◽  
Real Time ◽  
Task Scheduling ◽  
Virtual Machines ◽  
Dynamic Scheduling ◽  
Scheduling Algorithms ◽  
Minimum Time ◽  
Cloud Environment ◽  
Static Scheduling ◽  
On Demand

Cloud Computing is a type of Internet model that enables convenient, on-demand resources that can be used rapidly and with minimum effort. Cloud Computing can be IaaS, PaaS or SaaS. Scheduling of these tasks is important so that resources can be utilized efficiently with minimum time which in turn gives better performance. Real time tasks require dynamic scheduling as tasks cannot be known in advance as in static scheduling approach. There are different task scheduling algorithms that can be utilized to increase the performance in real time and performing these on virtual machines can prove to be useful. Here a review of various task scheduling algorithms is done which can be used to perform the task and allocate resources so that performance can be increased.

scholarly journals An Attribute-Oriented Task Scheduling Strategy for Improvement of Quality of Service in Cloud Computing

2021 ◽  
Author(s):  
Jianying Miao
Keyword(s):  
Cloud Computing ◽  
Quality Of Service ◽  
Task Scheduling ◽  
Virtual Machines ◽  
Cloud Environment ◽  
Simulation Environment ◽  
Attribute Matching ◽  
Resource Allocation Strategy ◽  
And Task

This thesis describes an innovative task scheduling and resource allocation strategy by using thresholds with attributes and amount (TAA) in order to improve the quality of service of cloud computing. In the strategy, attribute-oriented thresholds are set to decide on the acceptance of cloudlets (tasks), and the provisioning of accepted cloudlets on suitable resources represented by virtual machines (VMs,). Experiments are performed in a simulation environment created by Cloudsim that is modified for the experiments. Experimental results indicate that TAA can significantly improve attribute matching between cloudlets and VMs, with average execution time reduced by 30 to 50% compared to a typical non-filtering policy. Moreover, the tradeoff between acceptance rate and task delay, as well as between prioritized and non-prioritized cloudlets, may be adjusted as desired. The filtering type and range and the positioning of thresholds may also be adjusted so as to adapt to the dynamically changing cloud environment.

scholarly journals Self - Adaptive Load Balancing Using Live Migration of Virtual Machines in Cloud Environment

Webology ◽  
2020 ◽  
Vol 17 (2) ◽  
pp. 735-745
Author(s):  
V. Lavanya ◽  
M. Saravanan ◽  
E.P. Sudhakar
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Virtual Machines ◽  
Cloud Environment ◽  
Live Migration ◽  
Management Activity ◽  
Cloud Computing Environment ◽  
Efficient Resource ◽  
Server Overload ◽  
Self Adaptive

In this paper, a self-adaptive load balancing technique is proposed using live migration of heterogeneous virtual machines (VM) in a Hyper-V based cloud environment. A cloud supported plugin as a management activity within the infrastructure as a service strategy. It is proposed to assist the load balancing process in such a way so that all hypervisors are almost equally loaded once the overload status gets triggered. In the cloud computing environment, load balancing plays a major role if the large number of events triggered has a high impact on the performance of the system. The efficiency of cloud computing is based on the efficient load balancing having a self-adjustable technique using live migration of VMs across clusters of nodes. The proposed load balancing model is efficient in performance improvement by efficient resource utilization and also it helps to avoid the situation occurrence of server hanging by the cause of server overload within the infrastructure of multiple Microsoft Hyper-V hypervisors environment.

scholarly journals User Utility Oriented Queuing Model for Resource Allocation in Cloud Environment

2015 ◽  
Vol 2015 ◽  
pp. 1-8
Author(s):  
Zhe Zhang ◽  
Ying Li
Keyword(s):  
Resource Allocation ◽  
Task Scheduling ◽  
Virtual Machines ◽  
Programming Model ◽  
Cost Utility ◽  
Cloud Environment ◽  
Queuing Model ◽  
Total Utility ◽  
Proposed Model ◽  
Cloud Server

Resource allocation is one of the most important research topics in servers. In the cloud environment, there are massive hardware resources of different kinds, and many kinds of services are usually run on virtual machines of the cloud server. In addition, cloud environment is commercialized, and economical factor should also be considered. In order to deal with commercialization and virtualization of cloud environment, we proposed a user utility oriented queuing model for task scheduling. Firstly, we modeled task scheduling in cloud environment as anM/M/1 queuing system. Secondly, we classified the utility into time utility and cost utility and built a linear programming model to maximize total utility for both of them. Finally, we proposed a utility oriented algorithm to maximize the total utility. Massive experiments validate the effectiveness of our proposed model.

scholarly journals Benchmarking and Performance Evaluations on Various Configurations of Virtual Machine and Containers for Cloud-Based Scientific Workloads

2021 ◽  
Vol 11 (3) ◽  
pp. 993
Author(s):  
Syed Asif Raza Shah ◽  
Ahmad Waqas ◽  
Moon-Hyun Kim ◽  
Tae-Hyung Kim ◽  
Heejun Yoon ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Scientific Community ◽  
Virtual Machines ◽  
Resource Provisioning ◽  
Performance Evaluations ◽  
Cloud Environment ◽  
Computational Power ◽  
Efficient Resource ◽  
Benchmark Suite ◽  
And Performance

Cloud computing manages system resources such as processing, storage, and networking by providing users with multiple virtual machines (VMs) as needed. It is one of the rapidly growing fields that come with huge computational power for scientific workloads. Currently, the scientific community is ready to work over the cloud as it is considered as a resource-rich paradigm. The traditional way of executing scientific workloads on cloud computing is by using virtual machines. However, the latest emerging concept of containerization is growing more rapidly and gained popularity because of its unique features. Containers are treated as lightweight as compared to virtual machines in cloud computing. In this regard, a few VMs/containers-associated problems of performance and throughput are encountered because of middleware technologies such as virtualization or containerization. In this paper, we introduce the configurations of VMs and containers for cloud-based scientific workloads in order to utilize the technologies to solve scientific problems and handle their workloads. This paper also tackles throughput and efficiency problems related to VMs and containers in the cloud environment and explores efficient resource provisioning by combining four unique methods: hyperthreading (HT), vCPU cores selection, vCPU affinity, and isolation of vCPUs. The HEPSCPEC06 benchmark suite is used to evaluate the throughput and efficiency of VMs and containers. The proposed solution is to implement four basic techniques to reduce the effect of virtualization and containerization. Additionally, these techniques are used to make virtual machines and containers more effective and powerful for scientific workloads. The results show that allowing hyperthreading, isolation of CPU cores, proper numbering, and allocation of vCPU cores can improve the throughput and performance of virtual machines and containers.

scholarly journals An Enhanced Discrete Symbiotic Organism Search Algorithm for Optimal Task Scheduling in the Cloud

Algorithms ◽  
2021 ◽  
Vol 14 (7) ◽  
pp. 200
Author(s):  
Suleiman Sa’ad ◽  
Abdullah Muhammed ◽  
Mohammed Abdullahi ◽  
Azizol Abdullah ◽  
Fahrul Hakim Ayob
Keyword(s):  
Cloud Computing ◽  
Response Time ◽  
Task Scheduling ◽  
Large Scale ◽  
Virtual Machines ◽  
Search Algorithm ◽  
Search Space ◽  
Cloud Environment ◽  
Nature Inspired Algorithm ◽  
Symbiotic Organism Search

Recently, cloud computing has begun to experience tremendous growth because government agencies and private organisations are migrating to the cloud environment. Hence, having a task scheduling strategy that is efficient is paramount for effectively improving the prospects of cloud computing. Typically, a certain number of tasks are scheduled to use diverse resources (virtual machines) to minimise the makespan and achieve the optimum utilisation of the system by reducing the response time within the cloud environment. The task scheduling problem is NP-complete; as such, obtaining a precise solution is difficult, particularly for large-scale tasks. Therefore, in this paper, we propose a metaheuristic enhanced discrete symbiotic organism search (eDSOS) algorithm for optimal task scheduling in the cloud computing setting. Our proposed algorithm is an extension of the standard symbiotic organism search (SOS), a nature-inspired algorithm that has been implemented to solve various numerical optimisation problems. This algorithm imitates the symbiotic associations (mutualism, commensalism, and parasitism stages) displayed by organisms in an ecosystem. Despite the improvements made with the discrete symbiotic organism search (DSOS) algorithm, it still becomes trapped in local optima due to the large size of the values of the makespan and response time. The local search space of the DSOS is diversified by substituting the best value with any candidate in the population at the mutualism phase of the DSOS algorithm, which makes it worthy for use in task scheduling problems in the cloud. Thus, the eDSOS strategy converges faster when the search space is larger or more prominent due to diversification. The CloudSim simulator was used to conduct the experiment, and the simulation results show that the proposed eDSOS was able to produce a solution with a good quality when compared with that of the DSOS. Lastly, we analysed the proposed strategy by using a two-sample t-test, which revealed that the performance of eDSOS was of significance compared to the benchmark strategy (DSOS), particularly for large search spaces. The percentage improvements were 26.23% for the makespan and 63.34% for the response time.

Sign in / Sign up

Export Citation Format

Share Document