A Dynamic Power Management Schema for Multi-Tier Data Centers

An issue of great concern as it relates to global warming is power consumption and efficient use of computers especially in large data centers. Data centers have an important role in IT infrastructures because of their huge power consumption. This thesis explores the sleep state of data centers' servers under specific conditions such as setup time and identifies optimal number of servers. Moreover, their potential to greatly increase energy efficiency in data centers. We use a dynamic power management policy based on a mathematical model. Our new methodology is based on the optimal number of servers required in each tier while increasing servers' setup time after sleep mode to reduce the power consumption. The Reactive approach is used to prove the validity of the results and energy efficiency by calculating the average power consumption of each server under specific sleep mode and setup time. We introduce a new methodology that uses average power consumption to calculate the Normalized-Performance-Per-Watt in order to evaluate the power efficiency. Our results indicate that the proposed schema is beneficial for data centers with high setup time

Energy Efficient Servers

Computer scienc

Optimization of Sensor Location in Data Center

The increase demand of data center has been increase significantly due to the rapid growth ICT technology. As a result this brings along the “green” issues in data center such as energy consumption, heat generation and cooling requirements. These issues can be addressed by “Green of/by IT” in the context of operating costs as well as the environmental impacts. To accommodate temperature monitoring system in every corner of data center is cost inefficient. Optimized location for sensor placement is needed to be determined, to reduce the monitoring cost. It needs to be decided which locations to observe in order to most effective results, at minimum cost. Furthermore, it is argued that in depth knowledge of the historical data of the data center’s highly dynamic operating condition will lead to a better management of data center resources. Thus, this project aims to create a wireless temperature monitoring system with location optimization algorithm to optimize temperature sensors deployment/locations. Furthermore, real-time temperature data collection and monitoring can be used to predict the next state of the temperature to detect potential anomaly in heat generation in the data center. Thus quick response for cooling can be invoked – Green by IT

Energy Efficient Servers

Computer scienc

Energy and Performance: Management of Virtual Machines: Provisioning, Placement, and Consolidation

Cloud computing is a new computing paradigm that offers scalable storage and compute resources to users on demand through Internet. Public cloud providers operate large-scale data centers around the world to handle a large number of users request. However, data centers consume an immense amount of electrical energy that can lead to high operating costs and carbon emissions. One of the most common and effective method in order to reduce energy consumption is Dynamic Virtual Machines Consolidation (DVMC) enabled by the virtualization technology. DVMC dynamically consolidates Virtual Machines (VMs) into the minimum number of active servers and then switches the idle servers into a power-saving mode to save energy. However, maintaining the desired level of Quality-of-Service (QoS) between data centers and their users is critical for satisfying users’ expectations concerning performance. Therefore, the main challenge is to minimize the data center energy consumption while maintaining the required QoS. This thesis address this challenge by presenting novel DVMC approaches to reduce the energy consumption of data centers and improve resource utilization under workload independent quality of service constraints. These approaches can be divided into three main categories: heuristic, meta-heuristic and machine learning. Our first contribution is a heuristic algorithm for solving the DVMC problem. The algorithm uses a linear regression-based prediction model to detect over-loaded servers based on the historical utilization data. Then it migrates some VMs from the over-loaded servers to avoid further performance degradations. Moreover, our algorithm consolidates VMs on fewer number of server for energy saving. The second and third contributions are two novel DVMC algorithms based on the Reinforcement Learning (RL) approach. RL is interesting for highly adaptive and autonomous management in dynamic environments. For this reason, we use RL to solve two main sub-problems in VM consolidation. The first sub-problem is the server power mode detection (sleep or active). The second sub-problem is to find an effective solution for server status detection (overloaded or non-overloaded). The fourth contribution of this thesis is an online optimization meta-heuristic algorithm called Ant Colony System-based Placement Optimization (ACS-PO). ACS is a suitable approach for VM consolidation due to the ease of parallelization, that it is close to the optimal solution, and its polynomial worst-case time complexity. The simulation results show that ACS-PO provides substantial improvement over other heuristic algorithms in reducing energy consumption, the number of VM migrations, and performance degradations. Our fifth contribution is a Hierarchical VM management (HiVM) architecture based on a three-tier data center topology which is very common use in data centers. HiVM has the ability to scale across many thousands of servers with energy efficiency. Our sixth contribution is a Utilization Prediction-aware Best Fit Decreasing (UP-BFD) algorithm. UP-BFD can avoid SLA violations and needless migrations by taking into consideration the current and predicted future resource requirements for allocation, consolidation, and placement of VMs. Finally, the seventh and the last contribution is a novel Self-Adaptive Resource Management System (SARMS) in data centers. To achieve scalability, SARMS uses a hierarchical architecture that is partially inspired from HiVM. Moreover, SARMS provides self-adaptive ability for resource management by dynamically adjusting the utilization thresholds for each server in data centers.Siirretty Doriast

Evolutionary Approach to Efficient Provisioning and Self-organization in Wireless Sensor Networks (WSN)

Advances in low-power digital integration and microelectro-mechanical systems (MEMS) have paved the way for micro-sensors. These sensors are equipped with data processing capabilities along with sensory circuits. Sensor data are processed on these individual sensors and transmitted to the target (sink). Lowcost integration and small sizes of these sensors have generated special interest in the area of disposable-sensors and large scale platform management. Queries to these sensors are addressed to nodes which have data satisfying the same condition. However, these sensors may be constrained in energy, bandwidth, storage, and processing capabilities. Large number of such sensors along with these constraints creates a sensor-management problem. At the network layer it amounts to setting up the efficient route that transmits the non-redundant data from source to the sink in order to maximize one or more sensor objectives (e.g. battery (and sensor's) life, Sensor-Data yield). This is done while adapting to changing connectivity due to failure of some nodes and new nodes powering up. First part of the thesis propose a reduced-complexity genetic algorithm (GA) for optimization of multi-hop battery-constrained sensor networks. The goal of the system is to generate optimal number of sensor-clusters with cluster-heads. It results in minimization of the power consumption of the sensor system while maximizing the sensor objectives (coverage and exposure). The genetic algorithm is used to adaptively create various components such as cluster-members, cluster-heads, and next-cluster. These components are then used to evaluate the average fitness of the system based on the sequence of communication links towards the sink. We then enhance the genetic algorithm (GA) approach for secure deployment of resource constrained multi-hop sensor networks. The goal in this case is to achieve secure coverage and improve battery life by dynamically optimizing security attributes (Like authentication and encryption). Further, we augment the GA approach for intrusion detection of resource constrained multi-hop sensor networks. Traditional intrusion detection mechanisms have limited applicability to the sensor networks due to scarce battery and processing resources. Therefore, we propose an effective scheme that would offer a power efficient and lightweight approach to identify malicious attacks. We evaluate sensor node attributes by measuring the perceived threat and its suitability to host local monitoring node (LMN) that acts as trusted proxy agent for the sink and capable of securely monitoring its neighbors. Security attributes in conjunction with genetic algorithm jointly optimizes the selection of monitoring nodes (i.e., LMN) by dynamically evaluating node fitness by profiling workloads patterns, packet statistics, utilization data, battery status, and quality-of-service compliance. Second part of the thesis delves into application of Information Technology (and Industrial) Systems and devices where the use of sensor networks can deliver non-intrusive and effective telemetry for group-based server management. These systems (Like Data Centers or Shipment tracking) face major challenges in seamless integration of telemetry and control data that is essential to various autonomic management functions related to power, thermal, reliability, predictability, survivability, locality and adaptability. Such systems that are supported by a dense network of sense-points operating in noisy environment (Metals, Cables) are required to deliver reliable trends, measurements and analysis in a timely fashion. The traditional approaches to provide distributed observability and control using wired solutions are static, expensive, and nonscalable. We apply the proposed GA approach for this unique environment that replaces static wired sensors with dynamically reconfigurable battery-powered wireless sensors. The proposed technique employs machine learning approach to optimize sensor node function assignment, clustering decisions, route establishment and data collection trees for improved throughput that results in effective controls

HPC Cloud for Scientific and Business Applications: Taxonomy, Vision, and Research Challenges

High Performance Computing (HPC) clouds are becoming an alternative to on-premise clusters for executing scientific applications and business analytics services. Most research efforts in HPC cloud aim to understand the cost-benefit of moving resource-intensive applications from on-premise environments to public cloud platforms. Industry trends show hybrid environments are the natural path to get the best of the on-premise and cloud resources---steady (and sensitive) workloads can run on on-premise resources and peak demand can leverage remote resources in a pay-as-you-go manner. Nevertheless, there are plenty of questions to be answered in HPC cloud, which range from how to extract the best performance of an unknown underlying platform to what services are essential to make its usage easier. Moreover, the discussion on the right pricing and contractual models to fit small and large users is relevant for the sustainability of HPC clouds. This paper brings a survey and taxonomy of efforts in HPC cloud and a vision on what we believe is ahead of us, including a set of research challenges that, once tackled, can help advance businesses and scientific discoveries. This becomes particularly relevant due to the fast increasing wave of new HPC applications coming from big data and artificial intelligence.Comment: 29 pages, 5 figures, Published in ACM Computing Surveys (CSUR

Energy and performance-optimized scheduling of tasks in distributed cloud and edge computing systems

Infrastructure resources in distributed cloud data centers (CDCs) are shared by heterogeneous applications in a high-performance and cost-effective way. Edge computing has emerged as a new paradigm to provide access to computing capacities in end devices. Yet it suffers from such problems as load imbalance, long scheduling time, and limited power of its edge nodes. Therefore, intelligent task scheduling in CDCs and edge nodes is critically important to construct energy-efficient cloud and edge computing systems. Current approaches cannot smartly minimize the total cost of CDCs, maximize their profit and improve quality of service (QoS) of tasks because of aperiodic arrival and heterogeneity of tasks. This dissertation proposes a class of energy and performance-optimized scheduling algorithms built on top of several intelligent optimization algorithms. This dissertation includes two parts, including background work, i.e., Chapters 3–6, and new contributions, i.e., Chapters 7–11. 1) Background work of this dissertation. Chapter 3 proposes a spatial task scheduling and resource optimization method to minimize the total cost of CDCs where bandwidth prices of Internet service providers, power grid prices, and renewable energy all vary with locations. Chapter 4 presents a geography-aware task scheduling approach by considering spatial variations in CDCs to maximize the profit of their providers by intelligently scheduling tasks. Chapter 5 presents a spatio-temporal task scheduling algorithm to minimize energy cost by scheduling heterogeneous tasks among CDCs while meeting their delay constraints. Chapter 6 gives a temporal scheduling algorithm considering temporal variations of revenue, electricity prices, green energy and prices of public clouds. 2) Contributions of this dissertation. Chapter 7 proposes a multi-objective optimization method for CDCs to maximize their profit, and minimize the average loss possibility of tasks by determining task allocation among Internet service providers, and task service rates of each CDC. A simulated annealing-based bi-objective differential evolution algorithm is proposed to obtain an approximate Pareto optimal set. A knee solution is selected to schedule tasks in a high-profit and high-quality-of-service way. Chapter 8 formulates a bi-objective constrained optimization problem, and designs a novel optimization method to cope with energy cost reduction and QoS improvement. It jointly minimizes both energy cost of CDCs, and average response time of all tasks by intelligently allocating tasks among CDCs and changing task service rate of each CDC. Chapter 9 formulates a constrained bi-objective optimization problem for joint optimization of revenue and energy cost of CDCs. It is solved with an improved multi-objective evolutionary algorithm based on decomposition. It determines a high-quality trade-off between revenue maximization and energy cost minimization by considering CDCs’ spatial differences in energy cost while meeting tasks’ delay constraints. Chapter 10 proposes a simulated annealing-based bees algorithm to find a close-to-optimal solution. Then, a fine-grained spatial task scheduling algorithm is designed to minimize energy cost of CDCs by allocating tasks among multiple green clouds, and specifies running speeds of their servers. Chapter 11 proposes a profit-maximized collaborative computation offloading and resource allocation algorithm to maximize the profit of systems and guarantee that response time limits of tasks are met in cloud-edge computing systems. A single-objective constrained optimization problem is solved by a proposed simulated annealing-based migrating birds optimization. This dissertation evaluates these algorithms, models and software with real-life data and proves that they improve scheduling precision and cost-effectiveness of distributed cloud and edge computing systems