Utilization Of Virtual Machines Research Articles

Multi-priority scheduling algorithm for scientific workflows in cloud

The public cloud environment has emerged as a promising platform for exe-cuting scientific workflows. These executions involve leasing virtual machines (VMs) from public services for the duration of the workflow. The structure of the workflows significantly impacts the performance of any proposed scheduling approach. A task within a workflow cannot begin its execution before receiving all the required data from its preceding tasks. In this paper, we introduce a multi-priority scheduling approach for executing workflow tasks in the cloud. The key component of the proposed approach is a mechanism that logically or-ders and groups workflow tasks based on their data dependencies and locality. Using the proposed approach, the number of available VMs influences the num-ber of groups (partitions) obtained. Based on the locality of each group’s tasks, the priority of each group is determined to reduce the overall execution delay and improve VM utilization. As the results demonstrate, the proposed approach achieves a significant reduction in both execution costs and time in most scenar-ios

An Efficient Approach of Task Scheduling in Fog Computing

In Cloud systems, Virtual Machines (VMs) are scheduled to hosts according to their instant resource usage (e.g. to hosts with most accessible RAM) without considering their overall and long-term utilization. Also, in many circumstances, the scheduling and placement processes are computationally intensive and impair performance of deployed VMs. In this work, a Cloud VM scheduling algorithm that takes into consideration already existing VM resource usage over time by assessing historical VM utilization levels in order to plan VMs by optimizing performance by utilizing KNN with NB approach. The Cloud management activities, such VM deployment, affect existing deployed systems hence the aim is to avoid such performance degradation. Moreover, overloaded VMs prefer to take resources from neighboring VMs, thus the work maximizes VMs real CPU consumption. The results reveal that our method refines traditional Instant-based physical machine selection as it learns the system behavior as well as it adjusts over time. The notion of VM scheduling according to resource monitoring data taken from prior resource utilizations (VMs). The count of the physical machine gets lowered by four utilizing KNN with NB classifier.

An improved task scheduling algorithm for conflict resolution in cloud environment

The performance of the cloud-based systems is directly associated with the resource utilization. The maximum resource utilization indicates the high performance of cloud computing. Further, effective task scheduling is the primary factor that significantly impacts resource utilization. Various researchers have proposed multiple algorithms to achieve optimum utilization, but a high rejection rate of tasks occurred due to conflict among similar tasks during backfilling. A hybrid approach is proposed for selecting the backfilled tasks using a multicriteria decision-making approach (MCDM), namely Distance-based approach with a traditional task scheduling algorithm. The parameters considered to find the suitable task for backfilling are arrival time, start time, deadline time, duration, size, and the number of virtual machines. The proposed algorithm is implemented on different datasets and compared with other state-of-the-art algorithms. The result shows a significant improvement in virtual machine utilization and task acceptance/rejection rate.

A Task Orchestration Strategy in a Cloud-Edge Environment Based on Intuitionistic Fuzzy Sets

In the context of the burgeoning cloud-edge collaboration paradigm, powered by advancements in the Internet of Things (IoT), cloud computing, and 5G technology, this paper proposes a task orchestrating strategy for cloud-edge collaborative environments based on intuitionistic fuzzy sets. The proposed strategy prioritizes efficient resource utilization, minimizes task failures, and reduces service time. First, WAN bandwidth, edge server virtual machine utilization, delay sensitivity of the task, and task length are used to determine whether the task should be executed on the cloud or edge device. Then, the cloud-edge collaborative decision-making algorithm is used to select the task’s target edge servers (either the local edge servers or the neighboring edge servers). Finally, simulation experiments are conducted to demonstrate the effectiveness and efficacy of the proposed algorithm.

A multi-hierarchy particle swarm optimization-based algorithm for cloud workflow scheduling

In this paper, we consider the market-driven workflow scheduling problem on heterogeneous cloud resources with deadline constraints. The transmission delay between dependent tasks on different virtual machines (VMs) is considered. The objective is to minimize the total monetary cost, which is computed based on the on-demand price structure. Inspired by the heuristic and meta-heuristic algorithms, a multi-hierarchy particle swarm optimization (MHPSO) algorithm is proposed, which mainly consists of three components: (1) the workflow aggregation method to pretreat the workflow structure considering the transmission cost and the VM utilization; (2) the initial population generating method to create a set of initial particles with the given encoding method and the solution generation method; and (3) the hierarchical evolving process where particles are divided into multiple groups and evolved iteratively. We calibrate the parameters and components of the proposal statistically over five well-known workflows with different deadline settings. A comparison of the proposed algorithm to existing methods for the considered problem is carried out. Experimental results demonstrate the proposal is effective for the problem under study.

A task processing efficiency improvement scheme based on Cloud-Edge architecture in computationally intensive scenarios

As Cloud-Edge architecture combines low latency and high-performance computing, it has a wider range of application scenarios. Considering that, how to reasonably allocate tasks to the edge cloud or the center cloud and how to select appropriate virtual machines (VMs) for tasks are two key aspects affecting the efficiency of Cloud-Edge architecture. For the former, the ARDT algorithm is proposed, which dynamically adjusts the optimal threshold by predicting the number of real-time end devices. For the latter, the DBMR algorithm is designed based on the Max-Fit algorithm, in which a structure of the blocking table is put forward to reduce the time complexity of the original algorithm from O(n2) to O(n(n−m)). Experimental results show that the ARDT-DBMR algorithm optimizes the average service time and task failure rate by 30%-40% compared with the baseline algorithms and other advanced algorithms and significantly ameliorates the problem of abnormal fluctuations in VM utilization in computationally intensive scenarios.

LBCC-Hung: A load balancing protocol for cloud computing based on Hungarian method

Cloud Computing can be defined as enabling computing resources to whoever want remotely upon demand. This necessarily requires using virtualization. A virtual machine (VM) is an emulation of a computer that runs in virtualization software. Tasks coming from different users are passed to the virtual machines to be processed. This paper studies the load balancing problem among various VMs; to ensure that the network resources are distributed in a fair way between various clients. This paper proposes solving the load balancing problem using a combinatorial optimization approach named the Hungarian method. The proposed protocol is named LBCC-Hung (Load Balancing Protocol for Cloud Computing Based on Hungarian Method). Using simulation, the performance of LBCC-Hung is measured and compared with two well-known methods; MIN-MIN and First Come First Serve FCFS methods. The simulation results proved that LBCC-Hung overperforms the others two protocols, in terms of both the Makespan and the throughput and the virtual machine utilization deviation.

Time Series-Based Edge Resource Prediction and Parallel Optimal Task Allocation in Mobile Edge Computing Environment

The offloading of computationally intensive tasks to edge servers is indispensable in the mobile edge computing (MEC) environment. Once the tasks are offloaded, the subsequent challenges lie in buffering them and assigning them to edge virtual machine (VM) resources to meet the multicriteria requirement. Furthermore, the edge resources’ availability is dynamic in nature and needs a joint prediction and optimal allocation for the efficient usage of resources and fulfillment of the tasks’ requirements. To this end, this work has three contributions. First, a delay sensitivity-based priority scheduling (DSPS) policy is presented to schedule the tasks as per their deadline. Secondly, based on exploratory data analysis and inferred seasonal patterns in the usage of edge CPU resources from the GWA-T-12 Bitbrains VM utilization dataset, the availability of VM resources is predicted by using a Holt–Winters-based univariate algorithm (HWVMR) and a vector autoregression-based multivariate algorithm (VARVMR). Finally, for optimal and fast task assignment, a parallel differential evolution-based task allocation (pDETA) strategy is proposed. The proposed algorithms are evaluated extensively with standard performance metrics, and the results show nearly 22%, 35%, and 69% improvements in cost and 41%, 52%, and 78% improvements in energy when compared with MTSS, DE, and min–min strategies, respectively.

Empirical analysis of machine learning-based energy efficient cloud load balancing architectures: a quantitative perspective

Design of energy efficient load balancing models in cloud environments requires in-depth analysis of the cloud architecture and nature of requests served by the cloud. Depending upon these parameters, machine learning models are designed which aim at assigning best possible resource combination to serve the given tasks. This assignment varies w.r.t. multiple task and cloud parameters; which include task time, virtual machine (VM) performance, task deadline, energy consumption, etc. In order to perform this task, a wide variety of algorithms are developed by researchers cloud designers. Each of these algorithms aim at optimizing certain load balancing related parameters; for instance, a Genetic Algorithm (GA) designed for optimization of VM utilization might not consider task deadline before task allocation to the VMs. While, algorithms aimed at performing deadline aware load balancing might not provide effective cloud-to-task-mapping before allocation of tasks. Thus, it becomes difficult for researchers to select the best possible algorithms for their cloud deployment. In order to reduce this ambiguity, the underlying text compares different energy efficient cloud load balancing algorithms; and evaluates their performance in terms of computational complexity, and relative energy efficiency. This performance evaluation is further extended via inter architecture comparison; in order to evaluate the most optimum load balancer implementation for a given energy efficient application. Thus, after referring this text, researchers and cloud system designers will be able to select optimum algorithmic implementations for their given deployment. This will assist in reducing cloud deployment delay, and improving application specific load balancer performance.

A multi-objective optimization of resource management and minimum batch VM migration for prioritized task allocation in fog-edge-cloud computing

Network resources and traffic priorities can be utilized to distribute requested tasks across edge nodes at the edge layer. However, due to the variety of tasks, the edge nodes have an impact on data accessibility. Resource management approaches based on Virtual Machine (VM) migration, job prioritization, and other methods were used to overcome this problem. A Minimized Upgrading Batch VM Scheduling (MSBP) has recently been developed, which reduces the number of batches required to complete a system-scale upgrade and assigns bandwidth to VM migration matrices. However, due to poor resource sharing caused by suboptimal VM utilization, the MSBP was unable to effectively ensure the global best solutions. In order to distribute resources and schedule tasks optimally during VM migration, this paper proposes the MSBP with Multi-objective Optimization of Resource Allocation (MORA) method. The major goal of this proposed methodology is to take into account different objectives and solve the Pareto-front problem to enhance lifetime of the fog-edge network. First, it formulates an NP-hard challenge for MSBP by taking into account a variety of factors such as network sustainability, path contention, network delay, and cost-efficiency. The Multi-objective Krill Herd optimization (MoKH) algorithm is then used to address the NP-hard issue using the Pareto optimality rule and produce the best solution. First, it introduces an NP-hard challenge for MSBP by accounting in network sustainability, path contention, network latency, and cost-efficiency. The Pareto optimality rule is then implemented to overcome the NP-hard problem and provide the optimum solution employing the Multi-objective Krill Herd optimization (MoKH) algorithm. This increases network lifetime and improves resource allocation cost efficiency. Finally, the simulation results show that the MSBP-MORA distributes resources more efficiently and hence increases network lifetime when compared to other traditional algorithms.

Energy-Aware VM Scheduler

Cost is the backbone of any business model to sustain and growth in the competitive business market. Considering this, higher energy consumption may affect the operational cost of any industry. Cloud computing is one of the most popular IT business model for service provider and its users. It is observed in many research, that the average cost of the services are highly dependent upon the run time and power consumption. More power consumption effect the environmental things as well. In this review, more than 100 research articles are considered to evaluate the energy consumption methods, issues and challenges from 2009 to 2021. Based on the study, the energy-aware load balancing methods are classified into four major clusters. The most cited methods are compared based on method used, platform where it is deployed, different evaluation parameters like cost, run time, Virtual Machine utilization, Service-level-agreement violation rate, and Quality-of-service QoS. The result of this review is presented as open research issues and challenges for forthcoming research.

Multi-objective prediction-based optimization of power consumption for cloud data centers

The overall development of the cloud paradigm is dominating omnipresence in the industry 4.0 business world. Over the last decade, the control measures for power utilization among the proliferative Hyper-Scale Data Centers (HSDCs) have been elucidated. However, the lack of attention to regulating power in Small and Medium-Scale Data Centers (SMSDCs) has ensued in excessive power drainage in small and medium-scale cloud data centers. The crucial factor for excessive power utilization of SMSDCs encompasses providing excessive resources, high certainty tasks. Majority of the previously reported studies zeroed-in on problems associated with hyper-scale data centers, excluding probes of the issues prevalent in small and medium-scale cloud data centers. This paper proffers a framework for a predictive optimization approach for delivering the data center services to end-users. In the first phase, the Multi-Output (MO) Random Forest Regressor (RFR) (MO-RFR) concurrently predicts the multiple-resource utilization of Virtual Machines (VMs). The predictive framework outcome was utilized by the Multi-Objective Particle Swarm Optimization (MO-PSO) framework in the second phase to resolve the issue in virtual machine placement and to accomplish better physical machine consolidation. The proposed multi-prediction-based MO-PSO to escalate the resource usage, minimizes the power utilization, and curtail the carbon footprint. The efficacy of the proposed approach was appraised via performance metrics and actual workload traces. The acquired result from the proposed method outperforms the baseline approaches.

A New Reliable System For Managing Virtual Cloud Network

Virtual cloud network (VCN) usage is popular today among large and small organizations due to its safety and money-saving. Moreover, it makes all resources in the company work as one unit. VCN also facilitates sharing of files and applications without effort. However, cloud providers face many issues in managing the VCN on cloud computing including these issues: Power consumption, network failures, and data availability. These issues often occur due to overloaded and unbalanced load tasks. In this paper, we propose a new automatic system to manage VCN for executing the workflow. The new system called Multi-User Hybrid Scheduling (MUSH) can solve running issues and save power during workflow execution. It consists of three phases: Initialization, virtual machine allocation, and task scheduling algorithms. The MUSH system focuses on the execution of the workflow with deadline constraints. Moreover, it considers the utilization of virtual machines. The new system can save makespan and increase the throughput of the execution operation.

Cost Effective Optimal Task Scheduling Model in Hybrid Cloud Environment

In today’s world, Cloud Computing (CC) enables the users to access computing resources and services over cloud without any need to own the infrastructure. Cloud Computing is a concept in which a network of devices, located in remote locations, is integrated to perform operations like data collection, processing, data profiling and data storage. In this context, resource allocation and task scheduling are important processes which must be managed based on the requirements of a user. In order to allocate the resources effectively, hybrid cloud is employed since it is a capable solution to process large-scale consumer applications in a pay-by-use manner. Hence, the model is to be designed as a profit-driven framework to reduce cost and make span. With this motivation, the current research work develops a Cost-Effective Optimal Task Scheduling Model (CEOTS). A novel algorithm called Target-based Cost Derivation (TCD) model is used in the proposed work for hybrid clouds. Moreover, the algorithm works on the basis of multi-intentional task completion process with optimal resource allocation. The model was successfully simulated to validate its effectiveness based on factors such as processing time, make span and efficient utilization of virtual machines. The results infer that the proposed model outperformed the existing works and can be relied in future for real-time applications.

Threshold based VM Placement Technique for Load Balanced Resource Provisioning using Priority Scheme in Cloud Computing

The unbalancing load issue is a multi-variation, multi-imperative issue that corrupts the execution and productivity of processing assets. Workload adjusting methods give solutions of load unbalancing circumstances for two bothersome aspects over-burdening and under-stacking. Cloud computing utilizes planning and workload balancing for a virtualized environment, resource partaking in cloud foundation. These two factors must be handled in an improved way in cloud computing to accomplish ideal resource sharing. Henceforth, there requires productive resource, asset reservation for guaranteeing load advancement in the cloud. This work aims to present an incorporated resource, asset reservation, and workload adjusting calculation for effective cloud provisioning. The strategy develops a Priority-based Resource Scheduling Model to acquire the resource, asset reservation with threshold-based load balancing for improving the proficiency in cloud framework. Extending utilization of Virtual Machines through the suitable and sensible outstanding task at hand modifying is then practiced by intensely picking a job from submitting jobs using Priority-based Resource Scheduling Model to acquire resource asset reservation. Experimental evaluations represent, the proposed scheme gives better results by reducing execution time, with minimum resource cost and improved resource utilization in dynamic resource provisioning conditions.

An Efficient Technique for Virtual Machine Clustering and Communications Using Task-Based Scheduling in Cloud Computing

Cloud computing models use virtual machine (VM) clusters for protecting resources from failure with backup capability. Cloud user tasks are scheduled by selecting suitable resources for executing the task in the VM cluster. Existing VM clustering processes suffer from issues like preconfiguration, downtime, complex backup process, and disaster management. VM infrastructure provides the high availability resources with dynamic and on-demand configuration. The proposed methodology supports VM clustering process to place and allocate VM based on the requesting task size with bandwidth level to enhance the efficiency and availability. The proposed clustering process is classified as preclustering and postclustering based on the migration. Task and bandwidth classification process classifies tasks with adequate bandwidth for execution in a VM cluster. The mapping of bandwidth to VM is done based on the availability of the VM in the cluster. The VM clustering process uses different performance parameters like lifetime of VM, utilization of VM, bucket size, and task execution time. The main objective of the proposed VM clustering is that it maps the task with suitable VM with bandwidth for achieving high availability and reliability. It reduces task execution and allocated time when compared to existing algorithms.

Distributed Grey Wolf Optimizer for scheduling of workflow applications in cloud environments

Optimal scheduling of workflows in cloud computing environments is an essential element to maximize the utilization of Virtual Machines (VMs). In practice, scheduling of dependent tasks in a workflow requires distributing the tasks to the available VMs on the cloud. This paper introduces a discrete variation of the Distributed Grey Wolf Optimizer (DGWO) for scheduling dependent tasks to VMs. The scheduling process in DGWO is modeled as a minimization problem for two objectives: computation and data transmission costs. DGWO uses the largest order value (LOV) method to convert the continuous candidate solutions produced by DGWO to discrete candidate solutions. DGWO was experimentally tested and compared to well-known optimization-based scheduling algorithms (Particle Swarm Optimization (PSO), Grey Wolf Optimizer). The experimental results suggest that DGWO distributes tasks to VMs faster than the other tested algorithms. Besides, DGWO was compared to PSO and Binary PSO (BPSO) using WorkflowSim and scientific workflows of different sizes. The obtained simulation results suggest that DGWO provides the best makespan compared to the other algorithms.

AP: Hybrid Task Scheduling Algorithm for Cloud

Resource optimization is cost effective process in cloud. The efficiency of load balancing completely depends on how the infrastructure is utilizing. As per the current study, the resource optimization techniques are very costly and taking more convergence time to execute the task and load distribution among different virtual machines (VM). The objective of this paper is to develop a hybrid optimization algorithm to find the best virtual machine based on their fitness values and schedule different task to the fittest VM so that each task should get complete on time, and system can utilize the VM as well. The proposed algorithm is hybrid version of genetic (GA), ant-colony (Aco), and particle-swarm (Pso) algorithms, which is implemented and tested in amazon web service and compared with existing algorithms based on VM utilization, completion time, and cost. The proposed hybrid system genetic-aco-pso based algorithm (GAP) perform utmost while comparing with the existing systems.

CPU-Memory Aware VM Consolidation for Cloud Data Centers

The unbalanced usage of resources in cloud data centers cause an enormous amount of power consumption. The Virtual Machine (VM) consolidation shuts the underutilized hosts and makes the overloaded hosts as normally loaded hosts by selecting appropriate VMs from the hosts and migrates them to other hosts in such a way to reduce the energy consumption and to improve physical resource utilization. Efficient method is needed for VM selection and destination hosts selection (VM placement). In this paper, a CPU-Memory aware VM placement algorithm is proposed for selecting suitable destination host for migration. The VMs are selected using Fuzzy Soft Set (FSS) method VM selection algorithm. The proposed placement algorithm considers both CPU, Memory, and combination of CPU-Memory utilization of VMs on the source host. The proposed method is experimentally compared with several existing selection and placement algorithms and the results show that the proposed consolidation method performs better than existing algorithms in terms of energy efficiency, energy consumption, SLA violation rate, and number of VM migrations.

Efficient scientific workflow scheduling for deadline-constrained parallel tasks in cloud computing environments

Data centers for cloud computing must accommodate numerous parallel task executions simultaneously. Therefore, data centers have many virtual machines (VMs). Minimizing the scheduling length of parallel task sets becomes a critical requirement in cloud computing systems. In this study, we propose an efficient priority and relative distance (EPRD) algorithm to minimize the task scheduling length for precedence constrained workflow applications without violating the end-to-end deadline constraint. This algorithm consists of two processes. First, a task priority queue is established. Then, a VM is mapped for a task in accordance with its relative distance. The proposed method can effectively improve VM utilization and scheduling performance. Extensive rigorous experiments based on randomly generated and real-world workflow applications demonstrate that the resource reduction rate and scheduling length of the EPRD algorithm significantly surpass those of existing algorithms.