A Survey on Failure Prediction of Large-Scale Server Clusters
Authors:
- 1 July 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 733-738
Abstract
As the size and complexity of cluster systems grows, failure rates accelerate dramatically. To reduce the disaster caused by failures, it is desirable to identify the potential failures ahead of their occurrence. In this paper, we survey the state of the art in failure prediction of cluster systems. The characteristic of failures in cluster systems are addressed, and some statistic results are shown. We explore the ways of the collection and preprocessing of data for failure prediction, and suggest a procedure for preprocessing the records in automatically generated log files. Focused on the main idea of five prediction methods, including statistic based threshold, time series analysis, rule-based classification, Bayesian network models and semi-Markov process models, are analyzed respectively. In addition, concerning the accuracy and practicality, we present five metrics for evaluating the failure prediction techniques and compare the five techniques with the five metrics.Keywords
This publication has 25 references indexed in Scilit:
- Finding Frequent Items in Data Streams Using ESBF2007
- Finding frequent items in sliding windows with multinomially-distributed item frequencies2004
- Approximate counts and quantiles over sliding windows2004
- Dynamically maintaining frequent items over a data stream2003
- A simple algorithm for finding frequent elements in streams and bagsACM Transactions on Database Systems, 2003
- Spectral bloom filters2003
- Identifying frequent items in sliding windows over on-line packet streams2003
- Querying and mining data streams2002
- Summary cache: a scalable wide-area Web cache sharing protocolIEEE/ACM Transactions on Networking, 2000
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970