Green Scheduling Algorithm Research Articles

Report on Current Trends and Future Research Challenges in Green Cloud Computing

Abstract: Cloud computing provides computing power and resources as a service to users across the globe. This scheme was introduced as a means to an end for customer’s worldwide, providing high performance at a cheaper cost when compared to dedicated high-performance computing machines. This provision requires huge data-centers to be tightly-coupled with the system, the increasing use of which yields heavy consumption of energy and huge emission of CO2. Since energy has been a prime concern of late, this issue generated the importance of green cloud computing that provides techniques and algorithms to reduce energy wastage by incorporating its reuse. In this survey we discuss key techniques to reduce the energy consumption and CO2 emission that can cause severe health issues. We begin with a discussion on green matrices appropriate for data-centers and then throw light on green scheduling algorithms that facilitate reduction in energy consumption and CO2 emission levels in the existing systems. At the same time the various existing architectures related to green cloud also discussed in this paper with their pros and cons.

A Study on Green Cloud Computing

Abstract: Cloud computing provides computing power and resources as a service to users across the globe. This scheme was introduced as a means to an end for customer’s worldwide, providing high performance at a cheaper cost when compared to dedicated high-performance computing machines. This provision requires huge data-centers to be tightly-coupled with the system, the increasing use of which yields heavy consumption of energy and huge emission of CO2. Since energy has been a prime concern of late, this issue generated the importance of green cloud computing that provides techniques and algorithms to reduce energy wastage by incorporating its reuse. In this survey we discuss key techniques to reduce the energy consumption and CO2 emission that can cause severe health issues. We begin with a discussion on green matrices appropriate for data-centers and then throw light on green scheduling algorithms that facilitate reduction in energy consumption and CO2 emission levels in the existing systems. At the same time the various existing architectures related to green cloud also discussed in this paper with their pros and cons.

A green scheduling algorithm for cloud-based honeynets

Modern businesses leverage cloud architecture to achieve agile and cost-effective technology services. Doing so comes at the expense of the environment though cloud technologies consume large quantities of energy. Cloud energy consumption is concerning in light of global climate trends and dwindling fossil fuel reserves. Consequently, increasing attention is given to sustainable and green cloud computing, which seeks to optimize compute-resource allocation and usage of virtualized systems and services. At the same time, progress toward sustainable and green cloud technology is impeded because as more enterprises deploy services into cloud architecture, cybersecurity threats follow. Unfortunately, cybersecurity technologies are optimized for maximum service overwatch without regard for compute resources and energy. This negates the energy reduction achieved in recent sustainable technology advancements. In this work, a generalized cybersecurity honeynet scheduling algorithm is proposed, in which power, CPU, and network overhead are operationalized to increase sustainability while balancing defensive mechanisms. The work describes both the mathematical foundation for the algorithm and a pseudocode proof of concept.

Novel Thermal-Aware Green Scheduling in Grid Environment

The rising energy consumption of large-scale distributed computing systems raises operational expenses and has a negative impact on the environment (e.g. carbon dioxide emissions). The most expensive operating cost aspect in data centers is the electricity consumption for cooling purposes (DC). Inefficient cooling causes excessive temperatures, which leads to hardware breakdown. To solve this issue, novel thermal-aware green scheduling algorithms were developed to dramatically reduce cooling energy consumption costs while avoiding high thermal stress conditions such as big hotspots and thermal violations while preserving typical competitive performance. As a result of this research, the novel thermal-aware green scheduling algorithms can save cooling electricity usage during job execution when compared to nongreen scheduling methods. Thus, the green scheduling algorithms clearly outperform nongreen scheduling algorithms in terms of cooling power usage effectiveness.

A green scheduling algorithm for the distributed flowshop problem

In recent years, sustainable development and green manufacturing have attracted widespread attention to environmental problems becoming increasingly serious. Meanwhile, affected by the intensification of market competition and economic globalization, distributed manufacturing systems have become increasingly common. This paper addresses the energy-efficient scheduling of the distributed permutation flowshop (EEDPFSP) with the criteria of minimizing both total flow time and total energy consumption. Considering the distributed and multi-objective optimization complexity, an improved NSGAII algorithm (INSGAII) is proposed. First, we analyze the problem-specific characteristics and designed new operators based on the knowledge of the problem. Second, four constructive heuristic algorithms are proposed to produce high-quality initial solutions. Third, inspired by the artificial bee colony algorithm, we propose a new colony generation method using the operators designed. Fourth, a local intensification is designed for exploiting better non-dominated solutions. The influence of parameter settings is investigated by experiments to determine the optimal parameter configuration of the INSGAII. Finally, a large number of computational tests and comparisons have been carried out to verify the effectiveness of the proposed INSGAII in solving EEDPFSP.

Multiobjective Differential Evolution Algorithm for Solving Robotic Cell Scheduling Problem With Batch-Processing Machines

Robotic cell scheduling problem with batch-processing machines (RCSP-BMs) needs to determine the processing sequence and the transferring sequence simultaneously. The buffer size before and after the batch-processing machines has a big influence on the scheduling solution. A big amount of energy is always consumed by batch-processing machines. Hybrid flow shop scheduling has been proven NP-hard, and the features of the batch-processing machines in a flow shop make the hybrid flow shop scheduling more difficult. This study proposes a multiobjective differential evolution (DE) algorithm to address these issues. First, a mathematical optimization model is formulated for the RCSP-BMs to minimize makespan and energy consumption of the batch-processing machines. Second, the multiobjective DE algorithm (MODE) is developed. A green scheduling algorithm is designed to decode the individuals to balance the makespan and energy consumption. A local search method is also presented to help the searching escape from the local optimum. Finally, experiments are carried out, and the results show that the MODE can solve the robotic cell scheduling problem with batch-processing machines effectively and efficiently. Note to Practitioners-This study focuses on the robotic cell scheduling problem with batch-processing machines (RCSP-BMs) and discusses the influence of the buffer sizes and different batching methods on scheduling. In this study, we propose a green scheduling algorithm and a multiobjective differential evolution algorithm to optimize the makespan and the energy consumption of the batch-processing machines simultaneously. In future research, we will address more complicated situations, such as many-objective optimization and many-robot scheduling.

Green scheduling model of shuttle tanker fleet considering carbon tax and variable speed factor

Green scheduling is an important means to achieve sustainable industrial development and enhance the green efficiency of enterprises. Given the characteristics of a modern crude oil supply system, the shuttle tanker fleet green scheduling problem (FGSP) is discussed considering a carbon tax and variable tanker speed factor. To minimize the green operating cost (i.e., sum of general operating cost and carbon tax) of the tanker fleet, an integer programming model for shuttle tanker fleet green scheduling (FGSM) is established. The FGSM optimizes the number and sizes of tankers, the number and positions of floating production storage and offloading units (FPSO) at which to berth and the scheduling plan (i.e., berthing order and sailing speed) of each tanker in the fleet. Based on the column generation algorithm, a shuttle tanker fleet green scheduling algorithm is designed to solve the above model accurately. The experimental results show that considering the speed factor, the green operating cost of an example fleet decreases. For different carbon tax rates, speed optimization is an effective way to reduce the green operating cost of the fleet. The above results also show that the FGSM and algorithm can effectively solve the FGSP, improve the operation level and efficiency, and reduce the green operating cost of oil companies.

Energy-efficient multi-objective scheduling algorithm for hybrid flow shop with fuzzy processing time

Increasing costs of energy and environmental pollution is prompting scholars to pay close attention to energy-efficient scheduling. This study constructs a multi-objective model for the hybrid flow shop scheduling problem with fuzzy processing time to minimize total weighted delivery penalty and total energy consumption simultaneously. Setup times are considered as sequence-dependent, and in-stage parallel machines are unrelated in this model, meticulously reflecting the actual energy consumption of the system. First, an energy-efficient bi-objective differential evolution algorithm is developed to solve this mixed integer programming model effectively. Then, we utilize an Nawaz-Enscore-Ham-based hybrid method to generate high-quality initial solutions. Neighborhoods are thoroughly exploited with a leader solution challenge mechanism, and global exploration is highly improved with opposition-based learning and a chaotic search strategy. Finally, problems in various scales evaluate the performance of this green scheduling algorithm. Computational experiments illustrate the effectiveness of the algorithm for the proposed model within acceptable computational time.

A Hybrid Approach for Enhancing the Metrics in Green Cloud Computing

Cloud computing provides computing power and resources as a service to users across the globe. This scheme was introduced as a means to an end for customer’s worldwide, providing high performance at a cheaper cost when compared to dedicated high-performance computing machines. This provision requires huge data-centers to be tightly-coupled with the system, the increasing use of which yields heavy consumption of energy and huge emission of CO2. Since energy has been a prime concern of late, this issue generated the importance of green cloud computing that provides techniques and algorithms to reduce energy wastage by incorporating its reuse. In this survey we discuss key techniques to reduce the energy consumption and CO2 emission that can cause severe health issues. We begin with a discussion on green matrices appropriate for data-centers and then throw light on green scheduling algorithms that facilitate reduction in energy consumption and CO2 emission levels in the existing systems. At the same time the various existing architectures related to green cloud also discussed in this paper with their pros and cons .PALP algorithm has been presented to predict the load and have energy efficiency in overloaded and under loaded systems

A green scheduling algorithm for flexible job shop with energy-saving measures

We study how to save energy from the viewpoint of operation management. When to turn-on/off machines and which speed level to choose are two measures we employ to save energy. We focus on the flexible job shop scheduling problem. To begin with, a model is formulated for the flexible job shop scheduling problem when the two energy-saving measures are under consideration. An energy consumption model is proposed to compute the energy consumption for a machine in different states. Then, a non-dominated sorted genetic algorithm is developed to solve the problem. In the non-dominated sorted genetic algorithm, a green scheduling heuristic is presented to optimize the makespan, the energy consumption and the numbers of turning-on/off machines simultaneously. Finally, the comprehensive experiment results prove that the proposed model and the algorithm can solve the problem effectively and efficiently.

A Study on Green Cloud Computing

Cloud computing provides computing power and resources as a service to users across the globe. This scheme was introduced as a means to an end for customer’s worldwide, providing high performance at a cheaper cost when compared to dedicated high-performance computing machines. This provision requires huge data-centers to be tightly-coupled with the system, the increasing use of which yields heavy consumption of energy and huge emission of CO2. Since energy has been a prime concern of late, this issue generated the importance of green cloud computing that provides techniques and algorithms to reduce energy wastage by incorporating its reuse. In this survey we discuss key techniques to reduce the energy consumption and CO2 emission that can cause severe health issues. We begin with a discussion on green matrices appropriate for data-centers and then throw light on green scheduling algorithms that facilitate reduction in energy consumption and CO2 emission levels in the existing systems. At the same time the various existing architectures related to green cloud also discussed in this paper with their pros and cons.