Search

Research on resource management focuses on optimizing system performance and energy efficiency by distributing shared resources like processor cores, caches, and main memory among competing applications. This research spans a wide range of applications, including those from high-performance computing, machine learning, and mobile computing. Existing research frameworks often simplify research by concentrating on specific characteristics, such as the architecture of the computing nodes, resource monitoring, and representative workloads. For instance, this is typically the case with cloud systems, which introduce additional complexity regarding hardware and software requirements. To avoid this complexity during research, experimental frameworks are being developed. Nevertheless, proposed frameworks often fail regarding the types of nodes included, virtualization support, and management of critical shared resources. This paper presents Stratus, an experimental framework that overcomes these limitations. Stratus includes different types of nodes, a comprehensive virtualization stack, and the ability to partition the major shared resources of the system. Even though Stratus was originally conceived to perform cloud research, its modular design allows Stratus to be extended, broadening its research use on different computing domains and platforms, matching the complexity of modern cloud environments, as shown in the case studies presented in this paper. [ABSTRACT FROM AUTHOR]

Scheduling tasks in the cloud system is the main issue that needs to be addressed in order to improve customer satisfaction and system performance. This paper proposes DCOHHOTS, a novel multi-objective task scheduling algorithm based on a modified Harris hawks optimizer. In overall, this paper has two main stages. As the first step, DCOHHO is introduced as a new version of Harris Hawks Optimizer. Using the Differential Evolution algorithm, an optimal configuration is selected from the chaotic map, the opposition-based learning, and the ratio of the population. In order to improve the performance of the Harris Hawks Optimizer, this optimal configuration is applied to initialize the hawk's position. In the second stage, DCOHHOTS, a DCOHHO-based Task Scheduling algorithm, is proposed. Multi-objective behavior in the proposed task scheduling algorithm optimizes resource utilization to decrease the makespan, energy consumption, and execution cost. Moreover, prioritizing tasks before submitting them to the scheduler is done using the hierarchical process in the DCOHHOTS algorithm. For the purpose of investigating the performance of the proposed DCOHHO algorithm, a number of experiments are conducted using 20 standard functions and twelve algorithms. The experimental results demonstrate that the DCOHHO algorithm is superior at determining the optimal test function solutions. Additionally, makespan, execution cost, resource utilization, and energy efficiency of DCOHHOTS task scheduling algorithms are analyzed. Compared to existing algorithms, the proposed algorithm saves up to 16% energy in heavy loads. Additionally, resource utilization has increased by 17%. Compared to the conventional algorithm, the proposed algorithm reduced makepan and execution cost by 26% and 8%, respectively. [ABSTRACT FROM AUTHOR]

A mechanism of fog computing environment is employed in order to enhance the cloud computing services toward the edge devices in a range of locations with low latency. A fog computing environment is effective when compared to cloud computing for providing communication between various edge devices such as smart devices and mobile devices used by users in the same location. Even though fog servicing extends the best services of cloud computing, it also suffers from a set of security threats like authentication, key management, data privacy and trust management. Authentication with effective key management between edge devices is the most pressing security issue in fog computing. This paper proposes an effective two-way authentication between edge devices with key management in fog computing environments (TAKM-FC). The edge nodes are the user's mobile devices and set of smart devices controlled by the fog server. To improve the proposed authentication system, we have made use of techniques like fuzzy extractor and one-way hash with cryptographic primitives. The proposed TAKM-FC scheme is validated mathematically based on the ROR model and then verified using the ProVerif tool. The TAKM-FC scheme has been evaluated using iFogSim to measure the performance parameters like throughput, end-to-end delay, packet loss, energy consumption and network usage. The overhead analysis of the proposed scheme is carried out and shows that the computation cost, communication cost and storage cost are improved by 11–21%, 8–19% and 6–13%, respectively, compared to existing schemes. [ABSTRACT FROM AUTHOR]

Big data frameworks such as Storm, Spark and Hadoop are widely deployed in commercial and research applications, the energy consumption of cloud data centers that support big data processing platforms is becoming more and more prominent. However, job scheduling is a complex problem in the presence of various service level agreement (SLA) goals, such as cost reduction and job performance improvement. The highly heterogeneous nature of clusters and the variability of resource requirements acrossworkloads make energy-efficient scheduling on big data platforms extremely complex under SLA constraints. Existing performance-based models and heuristic scheduling methods rely excessively on historical data and are difficult to optimize or modify for changes in load and clusters. In this paper, we construct an energy consumption model based on resource utilization and a reinforcement learning model for energy-efficient scheduling under SLA constraints for Spark clusters, and design two Deep Reinforcement Learning (DRL) algorithms. The cluster scheduler designed and implemented based on this model can automatically capture different load characteristics and inherent cluster characteristics, find the appropriate executor creation policy for resource allocation, and reduce cluster energy consumption under the constraint of job execution time. Experimental results show that the DRL scheduler proposed in this paper saves a maximum energy of about 33% under different load characteristics. [ABSTRACT FROM AUTHOR]

Cloud computing is a commercial and economic paradigm that has gained traction since 2006 and is presently the most significant technology in IT sector. From the notion of cloud computing to its energy efficiency, cloud has been the subject of much discussion. The energy consumption of data centres alone will rise from 200 TWh in 2016 to 2967 TWh in 2030. The data centres require a lot of power to provide services, which increases CO2 emissions. In this survey paper, software-based technologies that can be used for building green data centers and include power management at individual software level has been discussed. The paper discusses the energy efficiency in containers and problem-solving approaches used for reducing power consumption in data centers. Further, the paper also gives details about the impact of data centers on environment that includes the e-waste and the various standards opted by different countries for giving rating to the data centers. This article goes beyond just demonstrating new green cloud computing possibilities. Instead, it focuses the attention and resources of academia and society on a critical issue: long-term technological advancement. The article covers the new technologies that can be applied at the individual software level that includes techniques applied at virtualization level, operating system level and application level. It clearly defines different measures at each level to reduce the energy consumption that clearly adds value to the current environmental problem of pollution reduction. This article also addresses the difficulties, concerns, and needs that cloud data centres and cloud organisations must grasp, as well as some of the factors and case studies that influence green cloud usage. [ABSTRACT FROM AUTHOR]

As users have higher and higher requirements for the quality of experience, traditional cloud computing is gradually unable to meet the needs of user equipments. Hence mobile edge computing networks mounted by unmanned aerial vehicles are introduced to improve user experience and reduce energy consumption. However, most current work is based on neural networks, which require large amounts of labeled data or long training times. Given these challenges, this paper proposes an energy-efficient multi-stage alternating optimization scheme to reduce the weighted energy consumption of the entire network. We analyze the energy consumption of each device and formulate a non-convex optimization problem. Considering the impact of task offloading, resource allocation, and path planning on network energy consumption, we transform the energy consumption problem into three subproblems. And use the coordinate descent algorithm, interior point method, and successive convex approximation method to optimize them alternately. The simulation results show that the proposed optimization scheme can significantly reduce the network's total energy consumption. [ABSTRACT FROM AUTHOR]

The cloud-computing paradigm based on containers has progressively grown in recent years as a flexible strategy that has proven to be energy efficient. The increasing usage of the container as a service technology in data centers (DCs) among cloud providers highlights the necessity of the container installation design phase in cloud environments. Cloud providers attempt to enhance resource utilization and reduce energy consumption by employing various VM selection and placement policies. This procedure for placement acquires a new aspect, with containers now being deployed on virtual machines (VMs) and those guest VMs being installed on physical machines (PMs). The intricacy of this issue increases when the variety of the containers, VMs, and PMs is taken into account. In this paper, an optimal placement strategy for containers is proposed based on the bio-inspired algorithms. The firefly algorithm has been modified to use discretization strategy (Discrete Firefly Algorithm, DFF) and has also used local search mechanism (Discrete Firefly with Local Search Mechanism, DFFLSM). The proposed versions of firefly algorithm are compared with first fit, first fit decreasing, random algorithm and ant colony algorithm. The comparison is done based on average energy consumption, average active VM, average active PM and average overall service-level agreement violations in the DC. The results show that DFFLSM performs better than all pre-existing container placement algorithms in terms of energy efficiency. It reduces average energy consumption of DC by 9.32% and 40.85% and average active PM by 18.30% and 21.89% in homogenous and heterogeneous environment, respectively. [ABSTRACT FROM AUTHOR]

The process of remapping virtual machines (VMs) to host machines (HMs), which is defined as VM replacement, affects cloud data centers (DCs) performance. To enhance the performance, optimal replacement of VMs regarding conflicting objectives has been proposed in some research, most of which use the non-dominance method to compare generated solutions. Although the non-dominance approach reaches acceptable results, it is not desirable in the VM replacement problem since we need only one mapping of VMs to HMs as the optimal solution to this problem. Indeed, in this method, a solution is considered better if it outperforms another solution regarding all parameters otherwise, two solutions are considered equally good. Also, a solution can be better even though it demonstrates poor performance regarding some parameters. In this paper, we propose two enhanced multi-objective algorithms, Fuzzy-RLVMrB and Fuzzy-MOVMrB, to address the mentioned problems of the non-dominance algorithm. The proposed algorithms aim to balance the horizontal and vertical load between PMs in terms of processor, bandwidth, and memory. We simulated all algorithms using the CloudSim simulator and compared them in terms of horizontal and vertical load balance, energy consumption, and execution time. The simulation results depict that Fuzzy-RLVMrB and Fuzzy-MOVMrB algorithms outperform other algorithms in terms of vertical load balancing and horizontal load balancing. In addition, Fuzzy-RLVMrB surpasses other approaches in terms of energy consumption. [ABSTRACT FROM AUTHOR]

Reducing the energy consumption while guaranteeing the quality of service (QoS) in the cloud data centers is challenge task for cloud providers. Dynamic virtual machine (VM) consolidation technology is regarded as a promising approach to satisfy goals. Considering dynamic workload of physical machine (PM) results in VM migration and high resources utilization of PM results in resources contention among VMs that affects working performance of VMs. Hence, it is vital to provide an efficient approach for dynamic VM placement during the consolidation to achieve the objectives while alleviating resources contention among VMs in the data centers. In this paper, the proposed strategy called LBVMP aims to build a novel conception consisting of a balancing flat surface of a PM in terms of CPU, RAM, bandwidth (BW) and another proportion flat surface that the remaining resources capacity of the targeted PM was divided by the request resources (CPU, RAM and BW) of a VM. Then LBVMP calculates the distance between two plats to evaluate VM allocation solutions. Extensive experimental results based on the CloudSim simulator demonstrate that compared with the state-of-the-art algorithm BCAVMP, the proposed strategy enables to reduce the cloud data centers of energy consumption, the number of migrations, SLAV, ESV by an average of 3.50%, 9.40%, 78.40%, 79.91%, respectively. [ABSTRACT FROM AUTHOR]

Fog computing contains resource-constrained devices closer to user proximity, which are insufficient for compute-intensive and large workloads. Cloud computing can help to address this limitation by transparently integrating fog and cloud data centers. However, the existing state-of-the-art does not integrate cloud and fog resources for maintaining application performance by dynamically offloading the tasks to the cloud while minimizing the cost. This paper introduces a new workload/job placement method that performs two-way offloading between cloud and fog to efficiently utilize the fog resources while minimizing the cost of using cloud resources to serve the workload. Our proposed solution is evaluated on various setups, including small-scale and large-scale data centers having homogeneous and heterogeneous physical machines (PMs) with different job batches, and compared with the existing state-of-the-art baseline method. Overall, the proposed solution outperforms the baseline method by utilizing 40.87 % more fog resources while reducing × 1.68 times cloud cost. [ABSTRACT FROM AUTHOR]

Energy efficiency is a critical issue in the management and operation of cloud data centers, which form the backbone of cloud computing. Virtual machine (VM) placement has a significant impact on energy-efficiency improvement for virtualized data centers. Among various methods to solve the VM-placement problem, the genetic algorithm (GA) has been well accepted for the quality of its solution. However, GA is also computationally demanding, particularly in the computation of its fitness function. This limits its application in large-scale systems or specific scenarios where a fast VM-placement solution of good quality is required. Our analysis in this paper reveals that the execution time of the standard GA is mostly consumed in the computation of its fitness function. Therefore, this paper designs a data structure extended from a previous study to reduce the complexity of the fitness computation from quadratic to linear one with respect to the input size of the VM-placement problem. Incorporating with this data structure, an alternative fitness function is proposed to reduce the number of instructions significantly, further improving the execution-time performance of GA. Experimental studies show that our approach achieves 11 times acceleration of GA computation for energy-efficient VM placement in large-scale data centers with about 1500 physical machines in size. [ABSTRACT FROM AUTHOR]

Workflow applications are a popular tool used by scientists to model and run applications on cloud computing. With the rise of multi-core parallel systems and cloud computing high-performance computing is becoming more accessible to scientists, but it also presents new challenges. One pressing issue is the energy consumption of these systems, both for environmental and financial reasons. To minimize energy usage in cloud computing, methods such as energy-efficient scheduling are gaining attention. However, current scheduling solutions have limitations, or failing to address the problem as a multi-objective optimization balancing performance and energy. This problem is considered complex and NP-complete. Many researchers have attempted to resolve it using heuristic and meta-heuristic methods. Although these methods may not always provide optimal results, they are still a subject of active research. This paper proposes a new multi-objective optimization algorithm that combines the Heterogeneous Earliest Finish Time and BAT algorithm to optimize multiple conflicting objectives for energy, cost, makespan, and resource utilization. The results are verified using the Analysis of Variance statistical tool, and the proposed algorithm is shown to be superior to existing contemporary algorithms. [ABSTRACT FROM AUTHOR]

The sustainable development and intelligent transformation of the manufacturing industry have become inevitable trends. As a typical example of the intelligent transformation, the networked manufacturing mode has been widely applied through sharing and utilizing manufacturing resources all over the world. Existing research on energy-saving use of manufacturing equipment mainly focuses on internal workshop of enterprises. However, it is also important to consider how to improve the energy efficiency in a networked manufacturing environment. Compared to traditional manufacturing mode, the networked manufacturing mode faces energy-saving challenges such as machining devices are numerous and scattered, manufacturing services are driven by customer orders, and significant random uncertainty occurs in manufacturing processes. This paper proposes a framework to select and schedule equipment resources for energy-saving in a networked manufacturing environment for different stages of manufacturing. First, to increase energy efficiency in the customer orders demand stage, a fuzzy multi-objective decision-making model is developed. This model considers economy, energy consumption, technology, and inter-enterprise collaboration. Second, to balance the competitive interests between customer orders, and to reduce manufacturing energy consumption, costs, and delivery dates in the manufacturing tasks implementation stage, an energy-saving scheduling model for equipment resources based on non-cooperative game theory is established. Then, to deal with random disturbance in a networked manufacturing, a scheduling model based on random chance constraint programming is built to optimize energy, economy, and production efficiency at the active preventive stage. Finally, a cloud platform implementation method of the proposed framework is summarized. The proposed framework helps provide theoretical analysis that is significant to energy-saving allocation of the equipment resources in the networked manufacturing mode. [ABSTRACT FROM AUTHOR]

Cloud computing is seen as a more promising technology than any other traditional information technology computing paradigm in today's world. It essentially functions as an on-demand resource provisioning platform that requires no active user participation. The resource provisioning strategies necessitate proper load distribution management across the cloud network, without which the cloud would experience biased workload performance. Today virtualization is the cornerstone of cloud computing, allowing data dissemination and administration via deploying virtual machines. Modern applications contain data that need to be stored into a scheme called polyglot persistence (combining SQL and NoSQL data-stores). However, these services are tailored to specific storage requirements, necessitating aggregating them from several heterogeneous clouds or migrating data from one cloud to another. Data migration can be done offline where the database is independent of the application, or otherwise, the application has to be down for the migration period. This paper developed a middleware in.NET Core facilitating the live migration of persistent polyglot data in heterogeneous clouds. This paper presents the proof of concept for live migration of the database layer of an application hosted on any supported clouds to any implemented cloud's data-store. Our suggested technique performs better in migration time, energy usage, and throughput aspects as compared with the offline migration scenario. In our experimentation, we found that while migrating data in offline mode from SQL to mongo and vice versa there is a marginal increase of 29% and 11%, respectively, in latency time. This increase is acceptable and tolerable while considering the live data migration scenario. [ABSTRACT FROM AUTHOR]

VMP (Virtual Machine Placement) is a crucial technology for energy consumption optimization of the cloud data center. Existing works mainly focus on virtual machine consolidation to increase resource utilization and reduce computing energy consumption. However, existing studies usually ignore the thermal effect that an intensive workload on IT (Information Technology) equipment can raise energy consumption by cooling systems and generate hotspots. In addition, an excessive number of virtual machine migrations increases migration costs and risks violating the SLA (Service Level Agreement) signed with users. In this paper, we present a comprehensive system model and formulate the problem as a constrained multi-objective optimization. We propose a novel thermal-aware VMP strategy to solve the problem by jointly considering virtual machines' migration cost, energy consumption, and heat recirculation around server racks. Our strategy makes placement decisions using MOPFGA (Multi-objective algorithm based on Pathfinder Algorithm and Genetic Algorithm) that combines classic MOPFA and GA enhanced by OBL (Opposition Based Learning) for fast convergence and avoidance of local optimum. Extensive experiments based on CloudSim using real data center workload data from PlanetLab show that our algorithm overcomes the defects of the MOPFA (multi-objective pathfinder algorithm) and GA (genetic algorithm) and significantly improves the overall efficiency of a data center. Compared with several state-of-the-art algorithms, MOPFGA on average reduces virtual machine migrations by 77.52%, increases CRAC (Computer Room Air Conditioner) supply temperature by 1.24%, and reduces cooling energy consumption by 24.78% and computational energy consumption by 23.62%. [ABSTRACT FROM AUTHOR]

The evolution of cloud computing results in the development of numerous huge data-centers. These data-centers use large quantities of electrical energy, which in turn results in high operating cost and high emissions of CO 2 . The grounds for this excessive usage of energy is the inefficient usage of data-center resources (hosts). The resources in the data-center can be in either peak or idle or sleep state. It has been experimentally proven that hosts in the idle state consumes more energy than hosts in sleep state. Through an efficient and optimal VM placement strategy, an energy efficient resource utilization can be achieved, thereby reducing the number of idle hosts in the data-center. This paper introduces two energy efficient VM placement algorithms based on bin packing heuristics considering the physical machine's energy efficiency, Energy Efficient VM Placement (EEVMP) and Modified Energy Efficient VM Placement (MEEVMP), that can reduce the overall energy usage in the data-center. The EEVMP algorithm when compared with the default VM placement algorithm Power-Aware Best-Fit Decreasing algorithm (PABFD) of CloudSim, it reduces the energy consumption by 53%, average SLA violation by 3.5% and number of VM migrations by 64.47%. Further, we have performed MEEVMP algorithm where we achieve a reduction in energy consumption by 54.24%, average SLA violation by 4.39% and number of VM migrations by 67.713 % as compared to PABFD. [ABSTRACT FROM AUTHOR]

The rapid development of internet of things (IoT) gadgets and the increase in the rate of sending requests from these devices to cloud data centers resulted in congestion and consequently service provisioning delays in the cloud data centers. Accordingly, fog computing emerged as a new computing model to address this challenge. In fogging, services are provisioned at the edge of the network using devices with computing and storage capabilities, which are located through the way to connect IoT devices to cloud data centers. Fog computing aims to alleviate the computing load in data centers and cut the delay of requests down, notably real-time and delay-sensitive requests. To achieve these goals, vitally important challenges such as scheduling requests, balancing the load, and reducing energy consumption, which affects performance and reliability in the edge-fog-cloud computing architecture, should be considered into account. In this paper, a reinforcement learning fog scheduling algorithm is proposed to address these challenges. The experimental results indicate that the proposed algorithm raises the load balance and diminishes the response time compared to the existing scheduling algorithms. Additionally, the proposed algorithm outperforms other approaches in terms of the number of used devices. [ABSTRACT FROM AUTHOR]

Cloud Computing is a paradigm allowing access to physical and application resources online via the Internet. These resources are virtualized using virtualization software to make them available to users as a service. Virtual machines (VMs) migration technique provided by virtualization technology impacts the performance of the cloud. It is a significant concern in this environment. When allocating resources, the distribution of VMs is unbalanced, and their movement from one server to another can increase energy consumption and network overhead, necessitating an improvement in VM migrations. This paper addresses the VMs migration issue by applying a machine learning model to reduce the VMs migration number and energy consumption. The proposed algorithm (named VMLM) is based on improving VM's migration process and selection. It has been benchmarked with JVCMMD and EVSP solutions. The simulation results demonstrate the efficiency of our proposal, which includes two phases the machine learning preparing stage and the VMs migration stage. [ABSTRACT FROM AUTHOR]

In recent years, cloud computing can be considered an emerging technology that can share resources with users. Because cloud computing is on-demand, efficient use of resources such as memory, processors, bandwidth, etc., is a big challenge. Despite the advantages of cloud computing, sometimes it is not a proper choice due to its delay in responding appropriately to existing requests, which led to the need for another technology called fog computing. Fog computing reduces traffic and time lags by expanding cloud services to the network and closer to users. It can schedule resources with higher efficiency and utilize them to impact the user's experience dramatically. This paper aims to survey some studies that have been done in the field of scheduling in fog/cloud computing environments. The focus of this survey is on published studies between 2015 and 2021 in journals or conferences. We selected 71 studies in a systematic literature review (SLR) from four major scientific databases based on their relation to our paper. We classified these studies into five categories based on their traced parameters and their focus area. This classification comprises 1—performance 2—energy efficiency, 3—resource utilization, 4—performance and energy efficiency, and 5—performance and resource utilization simultaneously. 42.3% of the studies focused on performance, 9.9% on energy efficiency, 7.0% on resource utilization, 21.1% on both performance and energy efficiency, and 19.7% on both performance and resource utilization. Finally, we present challenges and open issues in the resource scheduling methods in fog/cloud computing environments. [ABSTRACT FROM AUTHOR]

The internet is expanding its viewpoint into each conceivable part of the cutting-edge economy. Unshackled from our web programs today, the internet is characterizing our way of life, regardless of whether it's sitting in front of the TV or driving an independent auto. The enchantment of the internet appears to be relatively unbounded. In any case, with each new spell there comes an ever-increasing amount of data, and interest for computational power. Cloud computing which is an on-request conveyance of computing power, applications, database storage, and other IT assets by means of the Internet has violently expanded our computerized lives. Though, there have been critical improvements as far as accessibility, fluctuation, time and quality in administrations are concerned; the unbounded development of our computerized way of life requires monstrous measures of power, especially for the data centers that fill in as the mind of the advanced economy. Data organizations foresee a decrease in the quantity of data centers, as more businesses close their little data centers and move towards cloud computing. All things considered, the move by clients towards cloud, will increase the general energy utilization significantly, exceeding any energy productivity increase; which has recorded for over 70% of data center development in 2018. Many research advancements are already made in this domain for minimizing the energy utilization of the computing types of gear included; for efficient power energy consumption, decrease of carbon impression and e-squander. These procedures are supporters of green cloud computing, which are focused on planning and advancing energy-proficient activities to contain inordinate energy utilization in data centers. This paper discusses different mechanisms for lowering the power utilization in data centers. It provides in depth detail about the various mechanisms that can be employed at the hardware component level so that the utilization of energy by component can be reduced. Techniques that can be applied at network, cluster of servers' level along with the various dynamic power management measures that can be employed at the hardware or firmware level and can lead to energy efficient or green data centers are also studied in detail. The paper concludes with the research challenges for building the green data centers. [ABSTRACT FROM AUTHOR]

Because the traditional computing model can no longer meet the particularity of Internet of Vehicles tasks, aiming at its characteristics of high bandwidth, low latency and high reliability, this paper proposes a resource allocation strategy for Internet of Vehicles using reinforcement learning in edge cloud computing environment. First, a multi-layer resource allocation model for Internet of Vehicles is proposed, which uses the cooperation mode of edge cloud computing servers and roadside units to dynamically coordinate edge computing and content caching. Then, based on the construction of communication model, calculation model and cache model, make full use of idle resources in Internet of Vehicles to minimize network delay under the condition of limited energy consumption. Finally, the optimization goal is solved by two-layer deep Q network model, and the best resource allocation plan is obtained. The simulation results based on the Internet of Vehicles model show that the computational energy consumption and system delay of proposed strategy do not exceed 400 J and 600 ms, respectively. Besides, the overall effect of resource allocation is better than other comparison strategies and it has certain application prospects. [ABSTRACT FROM AUTHOR]

Cloud computing, which is distributed, stored and managed, is drawing attention as data generation and storage volumes increase. In addition, research on green computing, which increases energy efficiency, is also widely studied. An index is constructed to retrieve huge dataset efficiently, and the layer-based indexing methods are widely used for efficient query processing. These methods construct a list of layers, so that only one layer is required for information retrieval instead of the entire dataset. The existing layer-based methods construct the layers using a convex hull algorithm. However, the execution time of this method is very high, especially in large, high-dimensional datasets. Furthermore, if the total number of layers increases, the query processing time also increases, resulting in efficient, but slow, query processing. In this paper, we propose an unbalanced-hierarchical layer method, which hierarchically divides the dimensions of input data to increase the total number of layers and reduce the index building time. We demonstrate that the proposed procedure significantly increases the total number of layers and reduces the index building time, compared to existing methods through the various experiments. [ABSTRACT FROM AUTHOR]

In recent times, energy related issues have become challenging with the increasing size of data centers. Energy related issues problems are becoming more and more serious with the growing size of data centers. Green cloud computing (GCC) becomes a recent computing platform which aimed to handle energy utilization in cloud data centers. Load balancing is generally employed to optimize resource usage, throughput, and delay. Aiming at the reduction of energy utilization at the data centers of GCC, this paper designs an energy efficient resource scheduling using Cultural emperor penguin optimizer (CEPO) algorithm, called EERS-CEPO in GCC environment. The proposed model is aimed to distribute work load amongst several data centers or other resources and thereby avoiding overload of individual resources. The CEPO algorithm is designed based on the fusion of cultural algorithm (CA) and emperor penguin optimizer (EPO), which boosts the exploitation capabilities of EPO algorithm using the CA, shows the novelty of the work. The EERS-CEPO algorithm has derived a fitness function to optimally schedule the resources in data centers, minimize the operational and maintenance cost of the GCC, and thereby decrease the energy utilization and heat generation. To ensure the improvised performance of the EERS-CEPO algorithm, a wide range of experiments is performed and the experimental outcomes highlighted the better performance over the recent state of art techniques. [ABSTRACT FROM AUTHOR]

For many years, job scheduling in cloud computing has been researched to improve and optimize the environment. Although many researchers have worked on the issue of job scheduling, however, a comprehensive approach still misses out on various fronts like consideration of multi objective functions, handling the problem of local minima, and best resource utilization. An attempt has been made in the paper to present a reliable and comprehensive scheduling approach based on the meta-heuristic for the cloud computing environment. The proposed algorithm imitates the behavior of Rock Hyrax optimization for scheduling the jobs in a dynamic and heterogeneous cloud environment by considering the quality of service parameters like makespan time and energy consumption of data centers. The result establishes the claim that the proposal presented in this paper can schedule jobs in a dynamic environment on the virtual machine by keeping energy consumption low. The proposal is implemented through an experimental setup in the CloudSim environment and considered for variable jobs. The proposed algorithm for scheduling in the cloud environment is evaluated both qualitatively and quantitatively by considering both jobs and virtual machines statically and dynamically. The proposed algorithm is also compared with the prevalent approaches proposed in the past and shows better results. Our results indicate that the proposed meta-heuristic algorithm based on Rock Hyrax has lowered the makespan time by 5–15% and reduces energy consumption by 4–12%. [ABSTRACT FROM AUTHOR]

Fog computing is widely used as a mediation layer to fill the gap between Internet of Things (IoT) nodes and cloud datacenters. The fog layer can provide higher availability and better response time to IoT applications with its distributed and near-to-user nature. This paper proposes an end-to-end architecture to integrate IoT, fog, and cloud layers with higher availability, better resource utilization, and response time for time-sensitive applications. Two major flows in the proposed architecture are a) the clustering and b) the scheduling. The clustering flow involves performing dynamic and fully decentralized clustering of IoT nodes to increase the manageability of mobile IoT nodes, decrease the energy consumption in resource-constrained nodes, and improve network traffic throughput. The novel multiobjective decentralized clustering algorithm used in the clustering flow is based on fuzzy logic to allow fast execution of the algorithm on IoT nodes with limited computing power. The scheduling flow is in charge of resource scheduling in fog and cloud layers to provide time-sensitive IoT applications with an acceptable completion time by the firefly algorithm. The simulation results prove that two major flows of the proposed architecture outperform energy consumption, network throughput, success rate, and performance of IoT applications with time constraints compared to the two recent methods. [ABSTRACT FROM AUTHOR]

In a cloud environment, reducing energy consumption while ensuring diverse quality of service (QoS) guarantees is challenging for task schedulers. Specifically, the energy-efficient scheduling for real-time tasks is more complicated because such tasks have strict time constraints. In this paper, we propose a two-stage scheduling method for deadline-constrained tasks. In the first stage, Enhanced Ant Colony Optimization (EACO) is a global scheduler that allocates incoming cloud tasks to suitable virtual machines (VMs). It can minimize makespan and energy consumption while guaranteeing strict deadline constraints. In the second stage, the Modified Backfilling (MBF) algorithm reorders VM's waiting queue to improve the task completion rate. We conduct two experiment series on synthetic and real trace datasets using the Cloudsim toolkit. Extensive experiments show that compared with other well-known task scheduling methods, our method can effectively reduce makespan by 25.28% and energy consumption by 23% on average. The task completion rate can be increased by 6.27%. The proposed method has a significant improvement compared with other well-known algorithms. [ABSTRACT FROM AUTHOR]

Problems with task distribution in cloud data centers persist despite earlier research in cloud computing (CC). Particularly in the infrastructure-as-a-service (IaaS) cloud paradigm. In cloud data centers, effective task allocation is essential due to the restricted availability of resources and virtual machines (VMs). IaaS is one of the main CC models since it controls the backend, which includes VMs and data centers. Cloud service providers can ensure satisfactory service delivery performance in these models by preventing situations of host underutilization or overloading. This is because both results increase network execution time and lead to VM failure. To solve these problems, an improved load balancing approaches was proposed in this work. Therefore, this paper suggested an enhanced load balancing approaches to address these issues. The Artificial Bee Colony (ABC) method and the Bat algorithm are combined to create the balancing technique known as the Hybrid BAT and ABC (HBABC) algorithm, which dynamically distributes resources. The suggested HBABC method was assessed using CloudSim and standard workload format (SWF) data sets, which had file sizes of 200 KB and 400 KB. The evaluation was conducted on even workloads ranging from 200 to 20,000, and the performance of the HBABC method was compared with other state-of-the-art algorithms. The implementation of the suggested HBABC method resulted in a reduction of the Makespan (energy level) within the data center and showed improved accuracy in task allocation for VMs in a cloud data center. The ANOVA comparison test revealed a 1.98 percent enhancement in VM accuracy and task distribution, as well as a 0.98 percent decrease in the Makespan or energy level of the cloud data center. The outcomes are in line with various services broker rules that are employed during process of simulating the suggested algorithm in a cloud datacenter. The suggested method will be employed in subsequent studies as a prediction strategy for the resource management system in cloud datacenters. [ABSTRACT FROM AUTHOR]

Due to the big data exchange on the Internet of Things, proper routing and selecting the best routes for fast data transmission improve network performance. There are major challenges, like high delay, when cloud computing is used. Therefore, one solution is to use other schemes, such as fog computing. In fog computing, all data is not sent to the cloud and the fog nodes close to objects are used for data processing. This reduces the network delay. In this paper, we propose an overlapping clustering method called MFCT-IoT to select the best cluster head nodes to guarantee the fast data transfer from objects to fog nodes. The selected cluster head nodes are responsible for sending the collected data to the closest fog nodes in the network edge. Upon receiving the data, the fog nodes process it, and if a response is ready, they respond immediately to the object. Otherwise, they merge and transmit the data to the cloud servers, which are considered as the root node of the proposed hierarchical tree. After processing, the merged data is sent to the object. We compare the proposed scheme with two schemes, including ERGID and EECRP. These schemes are evaluated based on various criteria, including the response time, packet delivery ratio, end-to-end delay, network lifetime, and energy consumption. The results indicate that the proposed method outperforms others in terms of all criteria. [ABSTRACT FROM AUTHOR]

The combination of cloud computing with the Internet of Things has made fundamental changes in areas from industry, healthcare, traffic, and transportation to home appliances and even personal lives. Billions of devices and users are connected through these platforms disseminating enormous amounts of data leading to performance degradation, which has generated a demand for prior application placement planning. This paper focuses on the minimization of application delay and network usage by proposing a genetic-based service placement algorithm in fog-cloud environments. Throughout this work, a penalty-based approach to target both the delay and the number of time-consuming cloud placements is introduced, which explores the solution pool as a function of generations. This helps in exploring a wider space at the beginning and gradually intensifying the effect of penalty in the next generations. In a separate phase, the proximity of the applications to the users is taken into account as well. This is done through the chromosome selection process by using a priority value that identifies the proximity of dependent modules. The results of simulations demonstrate that the proposed algorithm achieved improvements regarding delay, network usage, energy consumption, and cost. [ABSTRACT FROM AUTHOR]

This paper proposes a framework named Dynamic Access and Integration Services (DAIS) framework. The framework provides on-demand and large scale integrated data access in cloud computing environment. The sole motivation of this research paper is to enhance the performance of Cloud-Oriented Storage (COS) systems. DAIS framework consists of two basic modules namely (1) Adjacency COS Overlay Topology (ACOT) and (2) Cloud Storage Resource Discovery (CSRD). ACOT introduces a self-organizing well balanced m-way tree which removes the necessity of centralized approaches and adopts dynamic and scalable data access in cloud computing environment. CSRD module provides data integration mechanism and efficient resource discovery from geographically distributes COS systems. In this paper, Hadoop test-bed setup has been deployed for experiment and results analysis. All input and output data have been collected in the Hadoop Distributed File System (HDFS). In the experiments, performance, bandwidth and energy efficiency of the proposed DAIS framework have been demonstrated and compared with three different approaches like, Static DAIS, P2P and DSSM. To make it energy efficient, measurement unit and its mathematical model have been defined. Energy efficiency results have been compared with two popular approaches HBase and Hadoop-MR, and found better in most of the cases. [ABSTRACT FROM AUTHOR]

Cloud computing is very popular because of its unique features such as scalability, elasticity, on-demand service, and security. A large number of tasks are performed simultaneously in a cloud system, and an effective task scheduler is needed to achieve better efficiency of the cloud system. Task scheduling algorithm should determine a sequence of execution of tasks to meet the requirements of the user in terms of Quality of Service (QoS) factors (e.g., execution time and cost). The key issue in recent task scheduling is energy efficiency since it reduces cost and satisfies the standard parameter in green computing. The most important aim of this paper is a comparative analysis of 67 scheduling methods in the cloud system to minimize energy consumption during task scheduling. This work allows the reader to choose the right scheduling algorithm that optimizes energy properly, given the existing problems and limitations. In addition, we have divided the algorithms into three categories: heuristic-based task scheduling, meta-heuristic-based task scheduling, and other task scheduling algorithms. The advantages and disadvantages of the proposed algorithms are also described, and finally, future research areas and further developments in this field are presented. [ABSTRACT FROM AUTHOR]

The remarkable growth of cloud computing applications has caused many data centers to encounter unprecedented power consumption and heat generation. Cloud providers share their computational infrastructure through virtualization technology. The scheduler component decides which physical machine hosts the requested virtual machine. This process is virtual machine placement (VMP) which, affects the power distribution, and thereby the energy consumption of the data centers. Due to the heterogeneity and multidimensionality of resources, this task is not trivial, and many studies have tried to address this problem using different methods. However, the majority of such studies fail to consider the cooling energy, which accounts for almost 30% of the energy consumption in a data center. In this paper, we propose a metaheuristic approach based on the binary version of gravitational search algorithm to simultaneously minimize the computational and cooling energy in the VMP problem. In addition, we suggest a self-adaptive mechanism based on fuzzy logic to control the behavior of the algorithms in terms of exploitation and exploration. The simulation results illustrate that the proposed algorithm reduced energy consumption by 26% in the PlanetLab Dataset and 30% in the Google cluster dataset relative to the average of compared algorithms. The results also indicate that the proposed algorithm provides a much more thermally reliable operation. [ABSTRACT FROM AUTHOR]

This paper presents a Power and Resource Utilization-Aware Virtual Machine Scheduling (PRUVMS) algorithm for strengthening resource utilization and diminishing the energy consumption of servers in the cloud environment. The PRUVMS algorithm enhances the resource utilization by migrating the VMs from the underloaded/overloaded servers to a normal server, and it reduces the energy consumption by shutting down the underloaded servers after migrating the VMs. For selecting the suitable server for the VM placement, the ranking of the available servers is evaluated. An illustrative example is presented to validate the PRUVMS algorithm. Further, the PRUVMS algorithm is tested on the PlanetLab workload using the CloudSim simulator. The proposed PRUVMS algorithm improves resource utilization by 68.22% and 37.53% and decreases the energy consumption by 35.53% and 31.34% in comparison with PABFD and CAVMP algorithms, respectively. The improvement in computational results shows the acceptability of the proposed scheduling algorithm in the cloud environment. [ABSTRACT FROM AUTHOR]

In cloud computing, virtual machine placement (VMP) is an important process that identifies the most appropriate physical machine to host the virtual machines (VMs). Nevertheless, determining how to place VMs within the data center to provide high availability and good performance is a difficult challenge for cloud providers. In this paper, with the goal of optimizing the availability and the energy consumption of the cloud data center, an improved genetic algorithm (I-GA) is proposed to solve VMP problem. This new algorithm presents a virtual hierarchy architecture model to combine with the genetic algorithm. The model is able to achieve a near-optimal solution in resolving the availability and energy consumption concerns by innovating the initial population generation step of the I-GA. Finite element analysis is applied as background and CloudSim is used as the experiment simulation. The simulated results demonstrate the significant improvement of the data center's energy efficiency and the successful maintenance of its high availability. The results are also highly competitive compared to the benchmark results of other VMP algorithms. [ABSTRACT FROM AUTHOR]

Big data processing, scientific calculations, and multimedia operations are some applications that require very complex time-consuming computations which cannot be performed on personal computers. Utilizing powerful cloud resources is a common method to address this problem. The amount of energy consumption of cloud data centers is an important challenge in these complex calculations, and reducing the energy consumption of cloud data centers is one of the most important goals of the researches in this area. The proposed method of this paper, called multi-agent deep Q-network with coral reefs optimization (MDQ-CR), combines the coral reefs optimization algorithm and multi-agent deep Q-network to reduce the energy consumption of data centers and cloud resources using the dynamic voltage and frequency scaling (DVFS) technique. The MDQ-CR has two main phases. The first phase exploits coral reefs optimization algorithm with a short-term view, and the second phase uses deep Q-network with a long-term view. The Markov game model is used to lead the learning agents to converge to the global optimal solution. Since processors consume the highest amount of energy of cloud compared to the other resources, the proposed method focuses on reducing the processors' energy consumption. Reducing the voltage and frequency of processors, considering expiration times of their tasks, can reduce their energy consumption significantly. The empirical experiments show that the proposed method can save energy about 89% compared to completely randomized methods, and about 20% compared to the two recent methods of the literature. [ABSTRACT FROM AUTHOR]

Efficient Scheduling of tasks is essential in cloud computing to provision the virtual resources to the tasks, effectively by minimizing makespan and maximizing resource utilization in cloud computing. Existing scheduling algorithms talks about makespan and resource utilization, but very few authors addressed the issues named as migration time, energy consumption, total power cost in datacenters. These three mentioned metrics are essential in the view of cloud provider, as by minimizing migration time, energy consumption and total power cost in datacenters cloud provider will be directly benefited. This paper introduces task scheduling by using Cat Swarm Optimization algorithm, which addresses the parameters makespan, migration time, Energy Consumption and Total Power Cost at Datacenters. Scheduling of tasks were done by calculating priorities of tasks at task level, and calculating priorities of VMs at VM level to schedule appropriate mapping of tasks onto VMs. It is implemented by using cloudsim simulator and input to the algorithm is generated randomly from the cloudsim for total power cost, we have used HPC2N and NASA workloads, which are parallel workload archives, which were given as an input to the algorithm. Proposed algorithm is compared against existing algorithms like PSO and CS. From the simulation results, we have observed that we got a significant improvement in different parameters when we used HPC2N and NASA workloads. Makespan is improved by 16%, 10%, 27%, 20% by using HPC2N and NASA workload over PSO and CS algorithms, respectively. Energy Consumption is minimized by 22%, 12%, 31%, 21% by using HPC2N and NASA workload over PSO and CS algorithms, respectively. Total Power cost is minimized by 31% and 39% over PSO and CS algorithms, respectively. Migration time is minimized by 34%, 29%, 20%, 14% by using HPC2N and NASA workloads over PSO and CS algorithms, respectively. [ABSTRACT FROM AUTHOR]

The unprecedented growth of energy consumption in data centers created critical concern in recent years for both the research community and industry. Besides its direct associated cost; high energy consumption also results in a large amount of CO2 emission and incurs extra cooling expenditure. The foremost reason for overly energy consumption is the underutilization of data center resources. In modern data centers, virtualization provides a promising approach to improve the hardware utilization level. Virtual machine placement is a process of mapping a group of virtual machines (VMs) onto a set of physical machines (PMs) in a data center with the aim of maximizing resource utilization and minimizing the total power consumption by PMs. An optimal virtual machine placement algorithm substantially contributes to cutting down the power consumption through assigning the input VMs to a minimum number of PMs and allowing the dispensable PMs to be turned off. However, VM Placement Problem is a complex combinatorial optimization problem and known to be NP-Hard problem. This paper presents an extensive review of virtual machine placement problem along with an overview of different approaches for solving virtual machine placement problem. The aim of this paper is to illuminate challenges and issues for current virtual machine placement techniques. Furthermore, we present a taxonomy of virtual machine placement based on various aspects such as methodology, number of objectives, operation mode, problem objectives, resource demand type and number of clouds. The state-of-the-art VM Placement techniques are classified in single objectives and multi-objective groups and a number of prominent works are reviewed in each group. Eventually, some open issues and future trends are discussed which serve as a platform for future research work in this domain. [ABSTRACT FROM AUTHOR]

The rapid development of cloud computing technology has resulted in a great energy consumption, but the utilization rate of resources in the data centers is often relative low. Therefore, if the virtual machines in operation are integrated into several servers and the idle servers are switched to low-power modes, the power consumption of data centers can be greatly reduced. The traditional research on the integration of virtual machines is mainly based on the current load of the host to set a high load threshold or periodically perform the migration. However, the accuracy of these approaches on time series prediction is very limited. To solve this issue, this paper synthetically considers the influence of a multi-order Markov model and the CPU state at different times and proposes a novel K-order mixed Markov model for predicting the CPU load of the host for a period of time. By conducting large-scale data experiments on the CloudSim simulation platform, the host load forecasting method proposed in this paper is compared with some conventional approaches, and it verifies that the proposed model greatly reduces the number of virtual machine migrations and the data center energy consumption. Additionally, the violation of the SLA is at an acceptable level. [ABSTRACT FROM AUTHOR]

Since scientific workflow scheduling becomes a major energy contributor in clouds, much attention has been paid to reduce the energy consumed by workflows. This paper considers a multi-objective workflow scheduling problem with the budget constraint. Most existing works of budget-constrained workflow scheduling cannot always satisfy the budget constraint and guarantee the feasibility of solutions. Instead, they discuss the success rate in the experiments. Only a few works can always figure out feasible solutions. These methods work, but they are too complicated. In workflow scheduling, it has been a trend to consider more than one objective. However, the weight selection is usually ignored in these works. The inappropriate weights will reduce the quality of solutions. In this paper, we propose an energy-aware multi-objective reinforcement learning (EnMORL) algorithm. We design a much simpler method to ensure the feasibility of solutions. This method is based on the remaining cheapest budget. Reinforcement learning based on the Chebyshev scalarization function is a new framework, which is effective in solving the weight selection problem. Therefore, we design EnMORL based on it. Our goal is to minimize the makespan and energy consumption of the workflow. Finally, we compare EnMORL with two state-of-the-art multi-objective meta-heuristics in the case of four different workflows. The results show that our proposed EnMORL outperforms these existing methods. [ABSTRACT FROM AUTHOR]

Fog computing and the Internet of Things (IoT) have revolutionized healthcare monitoring systems, enabling real-time health data collection and transmission while overcoming cloud computing limitations. However, efficiently selecting fog nodes for application modules with varying deadline requirements and ensuring adherence to quality of service (QoS) criteria pose significant challenges due to resource constraints and device limitations. In this paper, we present a novel two-layered hierarchical design for fog devices, leveraging cluster aggregation to optimize the selection of fog nodes for healthcare applications. We introduce three efficient algorithms to minimize system latency and reduce energy consumption in fog computing environments. Our proposed model is rigorously evaluated using the iFogSim toolkit and compared with cloud-based and latency-aware model [Mahmud R, Ramamohanarao K, Buyya R in ACM Transactions on Internet Technology.19, 2018, 10.1145/3186592]. In four distinct network topologies, our model exhibits an average latency reduction of at least 87% and energy consumption reduction of at least 76% when compared to the Cloud-based model. Similarly, when compared to the Latency-aware model proposed in [Mahmud R, Ramamohanarao K, Buyya R in ACM Transactions on Internet Technology. 19, 2018, 10.1145/3186592], our model showcases a minimum reduction of 43% in average latency and 27% in energy consumption. Our contribution lies in addressing the complexity of selecting fog nodes for application modules with diverse deadline requirements, while ensuring QoS. This work advances the field of real-time healthcare monitoring systems, promising substantial improvements in efficiency and effectiveness. [ABSTRACT FROM AUTHOR]

On a cloud platform, the user requests are managed through workload units called cloudlets which are assigned to virtual machines through cloudlet scheduling mechanism that mainly aims at minimizing the request processing time by producing effective small length schedules. The efficient request processing, however, requires excessive utilization of high-performance resources which incurs large overhead in terms of monetary cost and energy consumed by physical machines, thereby rendering cloud platforms inadequate for cost-effective green computing environments. This paper proposes a power-aware cloudlet scheduling (PACS) algorithm for mapping cloudlets to virtual machines. The algorithm aims at reducing the request processing time through small length schedules while minimizing energy consumption and the cost incurred. For allocation of virtual machines to cloudlets, the algorithm iteratively arranges virtual machines (VMs) in groups using weights computed through optimization and rescaling of parameters including VM resources, cost of utilization of resources, and power consumption. The experiments performed with a diverse set of configurations of cloudlets and virtual machines show that the PACS algorithm achieves a significant overall performance improvement factor ranging from 3.80 to 23.82 over other well-known cloudlet scheduling algorithms.. [ABSTRACT FROM AUTHOR]

The cloud computing environments rely heavily on virtualization that enables the physical hardware resources to be shared among cloud users by creating virtual machines (VMs). With an overloaded physical machine, the resource requests by virtual machines may not be fulfilled, which results in Service Level Agreement (SLA) violations. Moreover, the high performance servers in cloud data centers consume large amount of energy. The dynamic VM consolidation techniques use live migration of virtual machines to optimize resource utilization and minimize energy consumption. An excessive migration of virtual machines may however deteriorate application performance due to the overhead incurring at runtime. In this paper, we propose a normalization-based VM consolidation (NVMC) strategy that aims at placing virtual machines in an online manner while minimizing energy consumption, SLA violations, and the number of VM migrations. The proposed strategy uses resource parameters for determining over-utilized hosts in a virtualized cloud environment. The comparative capacity of virtual machines and hosts is incorporated for determining over-utilized hosts, while the cumulative available-to-total ratio (CATR) is used to find under-utilized hosts. For migrating virtual machines to appropriate hosts, the VM placement uses a criteria based on normalized resource parameters of hosts and virtual machines. For evaluating the performance of VM consolidation, we have performed experimentation with a large number of virtual machines using traces from the PlanetLab workloads. The results show that the NVMC approach outperforms other well-known approaches by achieving a significant improvement in energy consumption, SLA violations, and number of VM migrations. [ABSTRACT FROM AUTHOR]

Cloud service providers employ virtualization technologies in order to deliver energy efficiency and optimize resource utilization in cloud datacenters. In this way, Virtual Machine (VM) consolidation is an efficient technique for reducing energy related costs and environmental concerns. This technique consists of placing as much as possible VMs on as less as possible Physical Machines (PM)s by means of live VM migration. However, VM consolidation approaches bring advantages, they cannot efficiently guarantee performance isolation of co-located VMs resulting in operational interference issues. Therefore, it is necessary to be aware of workload performance degradation issues during VMs consolidation in a datacenter. In this paper, we propose a novel joint profit and interference-aware scheduling scheme (PIAS) to efficiently consolidate VMs that host multi-tier application workloads in Infrastructure-as-a-Service (IaaS) cloud datacenter. The PIAS scheme considers profit and cost of power consumption, operational interference of VMs, resource utilization, and service level agreements (SLA)s as well as amount of transferred memory pages during live VM migration for consolidating VMs. In this regard, a stochastic dynamic programming is introduced to model the operational behavior of VM. Also, an optimization problem is introduced to maximize provider's profit and minimize the overall execution cost of application workloads. We simulate a series of experiments based on real workloads traces for different IaaS cloud datacenter configurations. The PIAS scheme on average provides better results than other competitors and the results demonstrate how our approach at least improves profit, energy efficiency, and service down time by 40%, 29%, and 35%, respectively. [ABSTRACT FROM AUTHOR]

The cloud computing systems are sorts of shared collateral structure which has been in demand from its inception. In these systems, clients are able to access existing services based on their needs and without knowing where the service is located and how it is delivered, and only pay for the service used. Like other systems, there are challenges in the cloud computing system. Because of a wide array of clients and the variety of services available in this system, it can be said that the issue of scheduling and, of course, energy consumption is essential challenge of this system. Therefore, it should be properly provided to users, which minimizes both the cost of the provider and consumer and the energy consumption, and this requires the use of an optimal scheduling algorithm. In this paper, we present a two-step hybrid method for scheduling tasks aware of energy and time called Genetic Algorithm and Energy-Conscious Scheduling Heuristic based on the Genetic Algorithm. The first step involves prioritizing tasks, and the second step consists of assigning tasks to the processor. We prioritized tasks and generated primary chromosomes, and used the Energy-Conscious Scheduling Heuristic model, which is an energy-conscious model, to assign tasks to the processor. As the simulation results show, these results demonstrate that the proposed algorithm has been able to outperform other methods. [ABSTRACT FROM AUTHOR]

The growing demand for cloud computing adoption presents more challenges for researchers to make cloud computing more efficient and affordable for infrastructure providers and end users. The management of cloud computing involves investing in IT infrastructure in the first phase and investing in energy, maintenance and space costs in the second phase. However, energy costs account for a large portion of cloud management costs, and saving energy consumption can significantly reduce overall cloud management costs. Server consolidation is a strategy to improve data center energy efficiency and resource utilization. Virtual machine (VM) placement is considered one of the main problems with VM consolidation. The VM placement problem aims to reduce the number of active physical machines in data center to reduce data center power consumption and maintenance costs. However, the waste of data center resources has a significant impact on the energy efficiency of the data center, so it should be considered in the VM placement strategy. This paper proposes a new method based on the Monarch Butterfly Optimization algorithm (MBO) called MBO-VM for new virtual machine placement, designed to maximize packaging efficiency and reduce the number of active physical servers. CloudSim toolkit is used to test the efficiency of the proposed MBO-VM approach under real cloud workloads as well as synthetic workloads. Simulation results show that MBO-VM produces significantly better results compared with known VM placement techniques. The proposed MBO-VM can reduce the number of active servers more effectively and maximize the packaging efficiency. [ABSTRACT FROM AUTHOR]

Recently, the demand for features such as shrinkable sizes, and the concurrent need to pack increasing numbers of transistors into a single chip, have led to the utilization of hundreds of CMPs as processer elements for significant data processing, such as cloud computing systems with high performance and minimum latency-power consumption. A 3D NoC is introduced as a promising solution for the next generations of CMPs. However, there are different design issues, as selecting an efficient routing algorithm is a process which still faces some challenges. In this paper, to handle the deficiencies of the selection of the optimal routing algorithms, artificial intelligence technology is used to predict the efficient routing algorithm with higher throughput and lower power consumption. Experimental results based on the 3D NOXIM simulator are presented, and illustrate that the performance of the proposed system can predict, with high accuracy, optimal routing algorithms by switching between existing 3D routing algorithms, depending on the traffic load rate for the NoC system. The NN-prediction approach is tested under PARSEC workloads to validate the effectiveness of 3D NoC throughput, energy consumption and hotspot distribution metrics. [ABSTRACT FROM AUTHOR]

Nowadays, cloud computing is known as an internet-based modern area among emerging technologies that brings up an environment, in which computing resources such as hardware, software, storage, etc. can be rented by cloud users based on a pay per use model. Since the size of cloud computing is widely expanding and the number of cloud users is also increasing day by day, high energy consumption becomes a serious concern in the operation of complex cloud data centers. In this regards, Virtual Machine (VM) consolidation plays a vital role in utilizing cloud resources in an efficient manner. It migrates the running VMs from overloaded Physical Machines (PMs) to other PMs considering multiple factors, such as migration overhead, energy consumption, resource utilization, and migration time. Since the VM consolidation issue is known as an NP-hard problem, various nature‐inspired meta-heuristic algorithms aiming to solve this problem have been utilized in recent years. However, a lack of systematic and detailed survey study in this field is obvious. Therefore, this gap motivated us to provide the current paper aiming to highlight the role of nature-inspired meta-heuristic algorithms in the VM consolidation problem, review the existing approaches, offer a detailed comparison of approaches based on important factors, and finally, outline the future directions. [ABSTRACT FROM AUTHOR]

Energy consumption in data centers grows rapidly in recent years. As a widely-applied energy-efficient method, workload consolidation also has its own limitations that may bring some negative effects, such as performance degradation, QoS violation, localized hotspots and so on, which is especially true when optimal objectives are inherently conflict. In this paper, we present a power and thermal-aware VM management framework called PTM-ML, which relies on machine learning technique to find optimal host configuration based on workload characteristics and cooling system's working state. Based on such an optimal host configuration, it then makes VM migration and consolidation decisions by enforcing an efficient load-balancing policy, with aiming at achieving a better trade-off between energy efficiency and performance. The prototype of PTM-ML framework is deployed and evaluated in a real-world cloud data center. Extensive experiments are conducted by using different workload traces with distinctive characteristics, and the results are compared with four similar approaches in terms of total energy consumption, real-time power consumption, average latency and etc. Experimental results show that the proposed PTM-ML outperforms the existing approaches in terms of multiple metrics, and it also exhibits better robustness and adaptability in presence of dynamic workloads. [ABSTRACT FROM AUTHOR]

The demand of cloud-based services is growing rapidly due to the high scalability and cost-effective nature of cloud infrastructure. As a result, the size of the data center is increasing drastically, so is the cost of maintenance in terms of resource management and energy consumption. Hence, it is important to develop a proper resource management plan to maximize the profit by reducing the overhead of operational cost. In this paper, we propose a multi-step-ahead workload prediction approach using Machine learning techniques and allocate the resources based on this prediction in a way that allows the resources to be utilized more efficiently and thereby, reducing the data center's overall energy consumption. We evaluate the effectiveness of our framework based on real workload trace of Bitbrains. Experimental results show that our framework outperforms other state-of-the-art approaches for predicting workload over a long-run and significantly improves resource utilization while enabling substantial energy savings. [ABSTRACT FROM AUTHOR]

Energy optimization has become an emerging concern for cloud service providers. Existing methods focus on reducing the energy consumption of either server inside the data center or data transmission between data centers. Moreover, most of the works are based on assumptions that servers and workloads are homogeneous. This is not in accordance with the fact that modern data centers are built from various classes of servers. In this paper, we consider the joint energy optimization of intra- and inter-data center in both homo- and heterogeneous cases. We first propose an optimization model to minimize the joint energy cost of servers and network sides. To tackle the time-coupling constraint of carbon emission, we apply the Lyapunov optimization framework to transform the original problem into a well-studied queue stability problem. For better scalability of time complexity, we derive a distributed solution by using generalized benders decomposition. Then, we extend the model to deal with the situation where requests and data centers are heterogeneous as data centers are typically built from servers with different specifications. To better deal with the dynamic of the network (e.g., the occurrence of faults), we leverage a deep Q-network (DQN) and propose a fault-tolerant DQN-based solution. Finally, the simulation results show the high efficiency of our proposal in cost-saving and performance-enhancing. [ABSTRACT FROM AUTHOR]