![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Derek Murray (University of Cambridge)
Thursday 20 November 2008, 16:00-17:00
Spread-Spectrum Computation
- đ¤ Speaker: Derek Murray (University of Cambridge)
- đ Date & Time: Thursday 20 November 2008, 16:00 - 17:00
- đ Venue: FW26, Computer Laboratory, William Gates Builiding
Abstract
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.
Series This talk is part of the Computer Laboratory Systems Research Group Seminar series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- Chris Davis' list
- CL's SRG seminar
- Computer Laboratory Systems Research Group Seminar
- Department of Computer Science and Technology talks and seminars
- FW26, Computer Laboratory, William Gates Builiding
- Interested Talks
- ndk22's list
- ob366-ai4er
- rp587
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.