Sciweavers

175 search results - page 22 / 35
» Decentralized Erasure Codes for Distributed Networked Storag...
Sort
View
ICDCS
2000
IEEE
15 years 4 months ago
Highly Concurrent Shared Storage
1 Switched system-area networks enable thousands of storage devices to be shared and directly accessed by end hosts, promising databases and filesystems highly scalable, reliable ...
Khalil Amiri, Garth A. Gibson, Richard A. Golding
95
Voted
IPPS
2008
IEEE
15 years 6 months ago
On utilization of contributory storage in desktop grids
Modern desktop grid environments and shared computing platforms have popularized the use of contributory resources, such as desktop computers, as computing substrates for a variet...
Chreston Miller, Ali Raza Butt, Patrick Butler
NSDI
2004
15 years 1 months ago
Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...
Venugopalan Ramasubramanian, Emin Gün Sirer
INFOCOM
2009
IEEE
15 years 6 months ago
Rateless Coding with Feedback
The erasure resilience of rateless codes, such as Luby-Transform (LT) codes, makes them particularly suitable to a wide variety of loss-prone wireless and sensor network applicati...
Andrew Hagedorn, Sachin Agarwal, David Starobinski...
CIKM
2009
Springer
15 years 6 months ago
Collaborative filtering using random neighbours in peer-to-peer networks
Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized contex...
Arno Bakker, Elth Ogston, Maarten van Steen