BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Naiad: Iterative and Incremental Data-Parallelism using Differenti
 al Dataflow - Derek Murray\, Microsoft Research Silicon Valley
DTSTART:20111214T140000Z
DTEND:20111214T150000Z
UID:TALK35025@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:Naiad is a new framework for data-parallel computing\, based o
 n potentially-cyclic dataflow graphs. Naiad’s execution model is based o
 n processing successive differences between collections\, which naturally 
 enables efficient support for iterative algorithms and programs where the 
 inputs change incrementally. In this talk\, I will motivate and introduce 
 our “differential dataflow” model\, and describe the language (NaiadLI
 NQ) and prototypical multithreaded implementation (NaiadMP) that we have d
 eveloped. We implemented our current proof of concept for a single shared-
 memory machine\, and I will present some preliminary results from this set
 ting. We are currently investigating how the Naiad model can be extended t
 o a cluster setting\, and I will discuss some of the challenges and trade-
 offs that we are facing in that regard.\n\nThis is joint work with Frank M
 cSherry\, Rebecca Isaacs and Michael Isard.
LOCATION:Small lecture theatre\, Microsoft Research Ltd\, 7 J J Thomson Av
 enue (Off Madingley Road)\, Cambridge
END:VEVENT
END:VCALENDAR