Spread-Spectrum Computation

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

• Derek Murray (University of Cambridge)
• Thursday 20 November 2008, 16:00-17:00
• FW26, Computer Laboratory, William Gates Builiding.

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.

This talk is included in these lists:

• All Talks (aka the CURE list)
• CL's SRG seminar
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Computer Laboratory Systems Research Group Seminar
• Department of Computer Science and Technology talks and seminars
• FW26, Computer Laboratory, William Gates Builiding
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.