Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Dryad: Distributed Data-parallel Programs from Sequential Building Blocks

Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrell, and Dennis Fetterly


Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad application combines computational “vertices” with communication “channels” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set of available computers, communicating as appropriate through files, TCP pipes, and shared-memory FIFOs. The vertices provided by the application developer are quite simple and are usually written as sequential programs with no thread creation or locking. Concurrency arises from Dryad scheduling vertices to run simultaneously on multiple computers, or on multiple CPU cores within a computer. The application can discover the size and placement of data at run time, and modify the graph as the computation progresses to make efficient use of the available resources. Dryad is designed to scale from powerful multi-core single computers, through small clusters of computers, to data centers with thousands of computers.


Publication typeInproceedings
Published inProceedings of the 2007 Eurosys Conference
AddressLisbon, Portugal
PublisherAssociation for Computing Machinery, Inc.

Newer versions

Jaliya Ekanayake, Atilla Soner Balkir, Christophe Poulain, Nelson Araujo, Roger Barga, Thilina Gunarathne, and Geoffrey Fox. DryadLINQ for Scientific Analyses, 8 December 2009.

> Publications > Dryad: Distributed Data-parallel Programs from Sequential Building Blocks