BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Spread-Spectrum Computation - Derek Murray (University of Cambridg
 e)
DTSTART:20081120T160000Z
DTEND:20081120T170000Z
UID:TALK13713@talks.cam.ac.uk
CONTACT:Eiko Yoneki
DESCRIPTION:We observe that existing methods for failure-tolerance are ine
 fficient in their use of time\, storage and computational resources. We ai
 m to harness the power of idle desktop computers for data-parallel computa
 tions\, 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.\n\nSpread-spectrum computation uses "co
 mputation dispersal algorithms" to add redundancy to computations\, in ord
 er that they may tolerate a particular failure distribution. In this talk\
 , I will introduce computation dispersal algorithms\, providing examples o
 f their implementation and applications. I will describe the system that w
 e have built to demonstrate our techniques\, and also present some prelimi
 nary results.\n
LOCATION:FW26\, Computer Laboratory\, William Gates Builiding
END:VEVENT
END:VCALENDAR