Sciweavers

9 search results - page 1 / 2
» Efficient Byzantine-Tolerant Erasure-Coded Storage
Sort
View
DSN
2004
IEEE
13 years 8 months ago
Efficient Byzantine-Tolerant Erasure-Coded Storage
This paper describes a decentralized consistency protocol for survivable storage that exploits local data versioning within each storage-node. Such versioning enables the protocol...
Garth R. Goodson, Jay J. Wylie, Gregory R. Ganger,...
ICPP
2009
IEEE
13 years 2 months ago
Heterogeneity-Aware Erasure Codes for Peer-to-Peer Storage Systems
Peer-to-peer (P2P) storage systems rely on data redundancy to obtain high levels of data availability. Among the existing data redundancy schemes, erasure coding is a widely adopte...
Lluis Pamies-Juarez, Pedro García Ló...
HOTDEP
2008
168views Hardware» more  HOTDEP 2008»
13 years 7 months ago
A Spin-Up Saved Is Energy Earned: Achieving Power-Efficient, Erasure-Coded Storage
Storage accounts for a significant amount of a data center's ever increasing power budget. As a consequence, energy consumption has joined performance and reliability as a do...
Kevin M. Greenan, Darrell D. E. Long, Ethan L. Mil...
DSN
2005
IEEE
13 years 10 months ago
Using Erasure Codes Efficiently for Storage in a Distributed System
Marcos Kawazoe Aguilera, Ramaprabhu Janakiraman, L...
DSN
2009
IEEE
13 years 9 months ago
An efficient XOR-scheduling algorithm for erasure codes encoding
In large storage systems, it is crucial to protect data from loss due to failures. Erasure codes lay the foundation of this protection, enabling systems to reconstruct lost data w...
Jianqiang Luo, Lihao Xu, James S. Plank