scholarly journals Cluster-Based Prediction for Batteries in Data Centers

Energies ◽  
2020 ◽  
Vol 13 (5) ◽  
pp. 1085
Author(s):  
Syed Naeem Haider ◽  
Qianchuan Zhao ◽  
Xueliang Li

Prediction of a battery’s health in data centers plays a significant role in Battery Management Systems (BMS). Data centers use thousands of batteries, and their lifespan ultimately decreases over time. Predicting battery’s degradation status is very critical, even before the first failure is encountered during its discharge cycle, which also turns out to be a very difficult task in real life. Therefore, a framework to improve Auto-Regressive Integrated Moving Average (ARIMA) accuracy for forecasting battery’s health with clustered predictors is proposed. Clustering approaches, such as Dynamic Time Warping (DTW) or k-shape-based, are beneficial to find patterns in data sets with multiple time series. The aspect of large number of batteries in a data center is used to cluster the voltage patterns, which are further utilized to improve the accuracy of the ARIMA model. Our proposed work shows that the forecasting accuracy of the ARIMA model is significantly improved by applying the results of the clustered predictor for batteries in a real data center. This paper presents the actual historical data of 40 batteries of the large-scale data center for one whole year to validate the effectiveness of the proposed methodology.

Author(s):  
Syed Naeem Haider ◽  
Qianchuan Zhao ◽  
Xueliang Li

This paper proposes an ARIMA approach to battery health forecasting with accuracy improvement by K shape-based clustered predictors. The health prediction of the battery pack is an important function of a battery management system in data centers. Accurate forecasting of battery life turns out to be very difficult without failure data to train a good forecasting model in real life. The conventional ARIMA model is compared with total and clustered predictors for battery health forecasting. Results show that the forecasting accuracy of the ARIMA model significantly improved by utilizing the results of the clustered predictors for 40 batteries in a real data center. One year of actual historical data of 40 batteries of large scale datacenter is presented to validate the effectiveness of the proposed methodology.


2021 ◽  
Vol 25 (1) ◽  
pp. 27-50
Author(s):  
Tsung-Lin Li ◽  
◽  
Chen-An Tsai ◽  

Time series forecasting is a challenging task of interest in many disciplines. A variety of techniques have been developed to deal with the problem through a combination of different disciplines. Although various researches have proved successful for hybrid models, none of them carried out the comparisons with solid statistical test. This paper proposes a new stepwise model determination method for artificial neural network (ANN) and a novel hybrid model combining autoregressive integrated moving average (ARIMA) model, ANN and discrete wavelet transformation (DWT). Simulation studies are conducted to compare the performance of different models, including ARIMA, ANN, ARIMA-ANN, DWT-ARIMA-ANN and the proposed method, ARIMA-DWT-ANN. Also, two real data sets, Lynx data and cabbage data, are used to demonstrate the applications. Our proposed method, ARIMA-DWT-ANN, outperforms other methods in both simulated datasets and Lynx data, while ANN shows a better performance in the cabbage data. We conducted a two-way ANOVA test to compare the performances of methods. The results showed a significant difference between methods. As a brief conclusion, it is suggested to try on ANN and ARIMA-DWT-ANN due to their robustness and high accuracy. Since the performance of hybrid models may vary across data sets based on their ARIMA alike or ANN alike natures, they should all be considered when encountering a new data to reach an optimal performance.


Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Yiwen Zhang ◽  
Yuanyuan Zhou ◽  
Xing Guo ◽  
Jintao Wu ◽  
Qiang He ◽  
...  

The K-means algorithm is one of the ten classic algorithms in the area of data mining and has been studied by researchers in numerous fields for a long time. However, the value of the clustering number k in the K-means algorithm is not always easy to be determined, and the selection of the initial centers is vulnerable to outliers. This paper proposes an improved K-means clustering algorithm called the covering K-means algorithm (C-K-means). The C-K-means algorithm can not only acquire efficient and accurate clustering results but also self-adaptively provide a reasonable numbers of clusters based on the data features. It includes two phases: the initialization of the covering algorithm (CA) and the Lloyd iteration of the K-means. The first phase executes the CA. CA self-organizes and recognizes the number of clusters k based on the similarities in the data, and it requires neither the number of clusters to be prespecified nor the initial centers to be manually selected. Therefore, it has a “blind” feature, that is, k is not preselected. The second phase performs the Lloyd iteration based on the results of the first phase. The C-K-means algorithm combines the advantages of CA and K-means. Experiments are carried out on the Spark platform, and the results verify the good scalability of the C-K-means algorithm. This algorithm can effectively solve the problem of large-scale data clustering. Extensive experiments on real data sets show that the accuracy and efficiency of the C-K-means algorithm outperforms the existing algorithms under both sequential and parallel conditions.


2021 ◽  
Vol 12 (1) ◽  
pp. 74-83
Author(s):  
Manjunatha S. ◽  
Suresh L.

Data center is a cost-effective infrastructure for storing large volumes of data and hosting large-scale service applications. Cloud computing service providers are rapidly deploying data centers across the world with a huge number of servers and switches. These data centers consume significant amounts of energy, contributing to high operational costs. Thus, optimizing the energy consumption of servers and networks in data centers can reduce operational costs. In a data center, power consumption is mainly due to servers, networking devices, and cooling systems, and an effective energy-saving strategy is to consolidate the computation and communication into a smaller number of servers and network devices and then power off as many unneeded servers and network devices as possible.


Author(s):  
Burak Kantarci ◽  
Hussein T. Mouftah

Cloud computing aims to migrate IT services to distant data centers in order to reduce the dependency of the services on the limited local resources. Cloud computing provides access to distant computing resources via Web services while the end user is not aware of how the IT infrastructure is managed. Besides the novelties and advantages of cloud computing, deployment of a large number of servers and data centers introduces the challenge of high energy consumption. Additionally, transportation of IT services over the Internet backbone accumulates the energy consumption problem of the backbone infrastructure. In this chapter, the authors cover energy-efficient cloud computing studies in the data center involving various aspects such as: reduction of processing, storage, and data center network-related power consumption. They first provide a brief overview of the existing approaches on cool data centers that can be mainly grouped as studies on virtualization techniques, energy-efficient data center network design schemes, and studies that monitor the data center thermal activity by Wireless Sensor Networks (WSNs). The authors also present solutions that aim to reduce energy consumption in data centers by considering the communications aspects over the backbone of large-scale cloud systems.


2012 ◽  
Author(s):  
Ruhaidah Samsudin ◽  
Puteh Saad ◽  
Ani Shabri

In this paper, time series prediction is considered as a problem of missing value. A model for the determination of the missing time series value is presented. The hybrid model integrating autoregressive intergrated moving average (ARIMA) and artificial neural network (ANN) model is developed to solve this problem. The developed models attempts to incorporate the linear characteristics of an ARIMA model and nonlinear patterns of ANN to create a hybrid model. In this study, time series modeling of rice yield data in Muda Irrigation area. Malaysia from 1995 to 2003 are considered. Experimental results with rice yields data sets indicate that the hybrid model improve the forecasting performance by either of the models used separately. Key words: ARIMA; Box and Jenkins; neural networks; rice yields; hybrid ANN model


Author(s):  
Amip J. Shah ◽  
Van P. Carey ◽  
Cullen E. Bash ◽  
Chandrakant D. Patel

As heat dissipation in data centers rises by orders of magnitude, inefficiencies such as recirculation will have an increasingly significant impact on the thermal manageability and energy efficiency of the cooling infrastructure. For example, prior work has shown that for simple data centers with a single Computer Room Air-Conditioning (CRAC) unit, an operating strategy that fails to account for inefficiencies in the air space can result in suboptimal performance. To enable system-wide optimality, an exergy-based approach to CRAC control has previously been proposed. However, application of such a strategy in a real data center environment is limited by the assumptions inherent to the single-CRAC derivation. This paper addresses these assumptions by modifying the exergy-based approach to account for the additional interactions encountered in a multi-component environment. It is shown that the modified formulation provides the framework necessary to evaluate performance of multi-component data center thermal management systems under widely different operating circumstances.


2017 ◽  
Vol 27 (3) ◽  
pp. 605-622 ◽  
Author(s):  
Marcin Markowski

AbstractIn recent years elastic optical networks have been perceived as a prospective choice for future optical networks due to better adjustment and utilization of optical resources than is the case with traditional wavelength division multiplexing networks. In the paper we investigate the elastic architecture as the communication network for distributed data centers. We address the problems of optimization of routing and spectrum assignment for large-scale computing systems based on an elastic optical architecture; particularly, we concentrate on anycast user to data center traffic optimization. We assume that computational resources of data centers are limited. For this offline problems we formulate the integer linear programming model and propose a few heuristics, including a meta-heuristic algorithm based on a tabu search method. We report computational results, presenting the quality of approximate solutions and efficiency of the proposed heuristics, and we also analyze and compare some data center allocation scenarios.


2021 ◽  
Vol 850 (1) ◽  
pp. 012018
Author(s):  
T Renugadevi ◽  
D Hari Prasanth ◽  
Appili Yaswanth ◽  
K Muthukumar ◽  
M Venkatesan

Abstract Data centers are large-scale data storage and processing systems. It is made up of a number of servers that must be capable of handling large amount of data. As a result, data centers generate a significant quantity of heat, which must be cooled and kept at an optimal temperature to avoid overheating. To address this problem, thermal analysis of the data center is carried out using numerical methods. The CFD model consists of a micro data center, where conjugate heat transfer effects are studied. A micro data center consists of servers aligned with air gaps alternatively and cooling air is passed between the air gaps to remove heat. In the present work, the design of data center rack is made in such a way that the cold air is in close proximity to servers. The temperature and airflow in the data center are estimated using the model. The air gap is optimally designed for the cooling unit. Temperature distribution of various load configurations is studied. The objective of the study is to find a favorable loading configuration of the micro data center for various loads and effectiveness of distribution of load among the servers.


Author(s):  
Cullen Bash ◽  
George Forman

Data center costs for computer power and cooling have been steadily increasing over the past decade. Much work has been done in recent years on understanding how to improve the delivery of cooling resources to IT equipment in data centers, but little attention has been paid to the optimization of heat production by considering the placement of application workload. Because certain physical locations inside the data center are more efficient to cool than others, this suggests that allocating heavy computational workloads onto those servers that are in more efficient places might bring substantial savings. This paper explores this issue by introducing a workload placement metric that considers the cooling efficiency of the environment. Additionally, results from a set of experiments that utilize this metric in a thermally isolated portion of a real data center are described. The results show that the potential savings is substantial and that further work in this area is needed to exploit the savings opportunity.


Sign in / Sign up

Export Citation Format

Share Document