Exhaustive Exploration of the Failure-oblivious Computing Search Space

by Thomas Durieux, Youssef Hamadi, Zhongxing Yu and Martin Monperrus
Abstract: High-availability of software systems requires automated handling of crashes in presence of errors. Failure-oblivious computing is one technique that aims to achieve high availability. We note that failure-obliviousness has not been studied in depth yet, and there is very few study that helps understand why failure-oblivious techniques work. In order to make failure-oblivious computing to have an impact in practice, we need to deeply understand failure-oblivious behaviors in software. In this paper, we study, design and perform an experiment that analyzes the size and the diversity of the failure-oblivious behaviors. Our experiment consists of exhaustively computing the search space of 16 field failures of large-scale open-source Java software. The outcome of this experiment is a much better understanding of what really happens when failure-oblivious computing is used, and this opens new promising research directions.
 View PDF
Open-access (on archives-ouvertes.fr)
Open-access (on arXiv.org)
Other publications of Martin Monperrus

Cite it:

Exhaustive Exploration of the Failure-oblivious Computing Search Space (, , and ), Technical report 1710.09722, Arxiv, .
Thomas Durieux, Youssef Hamadi, Zhongxing Yu and Martin Monperrus, "Exhaustive Exploration of the Failure-oblivious Computing Search Space", 1710.09722, Arxiv, no. 1710.09722, 2017.

Bibtex Entry:

@techreport{hal-01624988,
 title = {{Exhaustive Exploration of the Failure-oblivious Computing Search Space}},
 author = {Durieux, Thomas and Hamadi, Youssef and Yu, Zhongxing and Monperrus, Martin},
 url = {https://arxiv.org/pdf/1710.09722},
 year = {2017},
 number = {1710.09722},
 institution = {Arxiv},
}
Powered by bibtexbrowser
Tagged as: