Sciweavers

196 search results - page 5 / 40
» Rebuilding for Array Codes in Distributed Storage Systems
Sort
View
GLOBE
2011
Springer
12 years 7 months ago
Hybrid Approaches for Distributed Storage Systems
Abstract. Distributed or peer-to-peer storage solutions rely on the introduction of redundant data to be fault-tolerant and to achieve high reliability. One way to introduce redund...
Júlio Araújo, Frédéric...
LCPC
2000
Springer
13 years 11 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
IESS
2007
Springer
158views Hardware» more  IESS 2007»
14 years 1 months ago
Dynamic Software Update of Resource-Constrained Distributed Embedded Systems
Changing demands, software evolution, and bug fixes require the possibility to update applications as well as system software of embedded devices. Systems that perform updates of ...
Meik Felser, Rüdiger Kapitza, Jürgen Kle...
INFOCOM
2010
IEEE
13 years 6 months ago
Tree-structured Data Regeneration in Distributed Storage Systems with Regenerating Codes
Abstract—Distributed storage systems provide large-scale reliable data storage by storing a certain degree of redundancy in a decentralized fashion on a group of storage nodes. T...
Jun Li, Shuang Yang, Xin Wang, Baochun Li
INFOCOM
2007
IEEE
14 years 2 months ago
Network Coding for Distributed Storage Systems
—Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-pee...
Alexandros G. Dimakis, Brighten Godfrey, Martin J....