Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Matrix computations (3rd ed.)
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
A Practical Analysis of Low-Density Parity-Check Erasure Codes for Wide-Area Storage Applications
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Distributed computing in practice: the Condor experience: Research Articles
Concurrency and Computation: Practice & Experience - Grid Performance
CoMon: a mostly-scalable monitoring system for PlanetLab
ACM SIGOPS Operating Systems Review
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Fixing the embarrassing slowness of OpenDHT on PlanetLab
WORLDS'05 Proceedings of the 2nd conference on Real, Large Distributed Systems - Volume 2
Dryad: distributed data-parallel programs from sequential building blocks
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
Algorithm-Based Fault Tolerance for Matrix Operations
IEEE Transactions on Computers
Spread spectrum storage with mnemosyne
Future directions in distributed computing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Efficient encoding of low-density parity-check codes
IEEE Transactions on Information Theory
Proceedings of the second ACM SIGCOMM workshop on Networking, systems, and applications on mobile handhelds
Reliable data-center scale computations
Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware
| Hi-index | 0.00 |
We observe that existing methods for failure-tolerance are inefficient in their use of time, storage and computational resources. We aim to harness the power of idle desktop computers for data-parallel computations, which are particularly sensitive to failure, and propose spreadspectrum computation as a suite of techniques to mitigate failures in an internet-scale distributed system. Spread-spectrum computation will use computation dispersal algorithms to add redundancy to computations, in order that they may tolerate a particular failure distribution. In this position paper, we introduce computation dispersal algorithms, providing examples of their implementation and applications.