University of Cambridge > Talks.cam > Computer Laboratory Systems Research Group Seminar > Spread-Spectrum Computation

Spread-Spectrum Computation

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Eiko Yoneki.

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 “spread-spectrum computation” as a suite of techniques to mitigate failures in an internet-scale distributed system.

Spread-spectrum computation uses “computation dispersal algorithms” to add redundancy to computations, in order that they may tolerate a particular failure distribution. In this talk, I will introduce computation dispersal algorithms, providing examples of their implementation and applications. I will describe the system that we have built to demonstrate our techniques, and also present some preliminary results.

This talk is part of the Computer Laboratory Systems Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2020 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity