Journal Article10.1109/TDSC.2009.4
A Large-Scale Study of Failures in High-Performance Computing Systems
Bianca Schroeder,Garth A. Gibson +1 more
906
TL;DR: Analysis of failure data collected at two large high-performance computing sites finds that average failure rates differ wildly across systems, ranging from 20-1000 failures per year, and that time between failures is modeled well by a Weibull distribution with decreasing hazard rate.
read more
Abstract: Designing highly dependable systems requires a good understanding of failure characteristics. Unfortunately, little raw data on failures in large IT installations are publicly available. This paper analyzes failure data collected at two large high-performance computing sites. The first data set has been collected over the past nine years at Los Alamos National Laboratory (LANL) and has recently been made publicly available. It covers 23,000 failures recorded on more than 20 different systems at LANL, mostly large clusters of SMP and NUMA nodes. The second data set has been collected over the period of one year on one large supercomputing system comprising 20 nodes and more than 10,000 processors. We study the statistics of the data, including the root cause of failures, the mean time between failures, and the mean time to repair. We find, for example, that average failure rates differ wildly across systems, ranging from 20-1000 failures per year, and that time between failures is modeled well by a Weibull distribution with decreasing hazard rate. From one system to another, mean repair time varies from less than an hour to more than a day, and repair times are well modeled by a lognormal distribution.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Understanding the Error Behavior of Complex Critical Software Systems through Field Data
Raffaele Della Corte
- 31 Mar 2016
TL;DR: The contribution of the thesis is to provide a methodology that allows understanding the error behavior of complex critical software systems by means of field data generated by the monitoring techniques already implemented in the target system.
1
Component Reliability Importance Measure in Presence of Transient Faults
TL;DR: This paper focuses on the reliability importance analysis in presence of transient faults, and proposes a composite measure for evaluation, and a sample series parallel system is analyzed to illustrate the use of this measure.
1
Simulation-based FDP & FCP analysis with queueing models
Qingpei Hu,Rui Peng,Szu Hui Ng,H.Q. Wang +3 more
- 01 Dec 2008
TL;DR: A general simulation based queueing modeling framework is proposed to describe FDP and FCP, with resource factors from practical software testing incorporated, and release time and debugger staffing issues are investigated with a revised cost model.
1
A scalable runtime fault detection mechanism for high performance computing
TL;DR: This work proposes a scalable runtime fault detection mechanism, namely SRFD, which provides a distributed lightweight service using tree-based fault detection algorithms at runtime, and presents details of the SRFD mechanism, including the implementation of the fault report and analysis algorithms.
1
An effective method of time required to compromise a computer system
S. Brintha Rajakumari
- 01 Jan 2015
TL;DR: The chaos algorithm is used to determine the Time Taken to Compromise (TTC) by using this algorithm the time used for the performing a task in highly decreases, which shows the assumption of the Poisson process model might be suboptimal.
1
References
Introduction to Probability Models.
A. Csenki,Sheldon M. Ross +1 more
TL;DR: Download Introduction to Probability Models Sheldon M Download Pdf octave levenspiel solution manual pdf stochastic processes sheldon m ross pdf.
3.9K
Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level
TL;DR: In this article, the authors provide a plausible physical explanation for the occurrence of self-similarity in local-area network (LAN) traffic, based on convergence results for processes that exhibit high variability and is supported by detailed statistical analyzes of real-time traffic measurements from Ethernet LANs at the level of individual sources.
Self-similarity through high-variability: statistical analysis of ethernet LAN traffic at the source level
Walter Willinger,Murad S. Taqqu,Robert Sherman,Daniel V. Wilson +3 more
- 01 Oct 1995
TL;DR: This paper provides a plausible physical explanation for the occurrence of self-similarity in high-speed network traffic based on convergence results for processes that exhibit high variability and is supported by detailed statistical analyses of real-time traffic measurements from Ethernet LAN's at the level of individual sources.
1.1K
•Proceedings Article
Disk failures in the real world: what does an MTTF of 1,000,000 hours mean to you?
Bianca Schroeder,Garth A. Gibson +1 more
- 13 Feb 2007
TL;DR: In this article, the authors present and analyze field-gathered disk replacement data from a number of large production systems, including high-performance computing sites and internet services sites, and find that in the field, annual disk replacement rates typically exceed 1%, with 2-4% common and up to 13% observed on some systems.
Why do computers stop and what can be done about it
Jim Gray
- 01 Jan 1985
TL;DR: It is pointed out that faults in production software are often soft (transient) and that a ransaction mechanism combined with persistent processpairs provides fault-tolerant execution -- the key to software fault -tolerance.