Sciweavers

362 search results - page 4 / 73
» Using Erasure Codes Efficiently for Storage in a Distributed...
Sort
View
WDAG
2005
Springer
88views Algorithms» more  WDAG 2005»
14 years 1 months ago
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
We analyze the problem of efficient distributed storage of information in a message-passing environment where both less than one third of the servers, as well as an arbitrary num...
Christian Cachin, Stefano Tessaro
TIT
2010
124views Education» more  TIT 2010»
13 years 2 months ago
Storage coding for wear leveling in flash memories
NAND flash memories are currently the most widely used type of flash memories. In a NAND flash memory, although a cell block consists of many pages, to rewrite one page, the whole ...
Anxiao Jiang, Robert Mateescu, Eitan Yaakobi, Jeho...
TC
2008
13 years 7 months ago
STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures
Proper data placement schemes based on erasure correcting code are one of the most important components for a highly available data storage system. For such schemes, low decoding ...
Cheng Huang, Lihao Xu
AICT
2006
IEEE
101views Communications» more  AICT 2006»
14 years 1 months ago
Erasure Codes for Increasing the Availability of Grid Data Storage
In this paper, we describe the design of a highlyavailable Grid data storage system. Increased availability is ensured by data redundancy and file striping. Redundant data is com...
Mikko Pitkänen, Rim Moussa, D. Martin Swany, ...
SRDS
2008
IEEE
14 years 2 months ago
Dynamically Quantifying and Improving the Reliability of Distributed Storage Systems
In this paper, we argue that the reliability of large-scale storage systems can be significantly improved by using better reliability metrics and more efficient policies for rec...
Rekha Bachwani, Leszek Gryz, Ricardo Bianchini, Ce...