Erasure codes are nowadays used extensively in\ud
distributed storage systems that handle big data, since they\ud
offer significant fault tolerance with low storage overhead. Even\ud
though erasure coded systems are space efficient, these involve\ud
higher network bandwidth and computational complexity in their\ud
operations. In this paper, we present RAPID, a protocol for fast\ud
data updates, which works by choosing a subset of code blocks\ud
for updates and adapts the strength of the subset based on the\ud
predicted number of failures. The proposal uses a prediction\ud
based heuristic in which the set of failures that may happen in\ud
the near future is represented as a function of past failures. A\ud
hybrid protocol that uses both locking and buffering mechanisms\ud
is adopted in the solution to maintain the consistency on the data\ud
and code blocks updates. Our experimental results demonstrate\ud
improvement in the performance of data updates by 30% and\ud
the failure prediction mechanism proposed shows an accuracy of\ud
80%
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.