ACM Home Page
Please provide us with feedback. Feedback
Dryad: distributed data-parallel programs from sequential building blocks
Full text PdfPdf (498 KB)
Source European Conference on Computer Systems archive
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 table of contents
Lisbon, Portugal
SESSION: Multi-core/multi-processor issues table of contents
Pages: 59 - 72  
Year of Publication: 2007
ISBN ~ ISSN:0163-5980 , 978-1-59593-636-3
Also published in ...
Authors
Michael Isard  Microsoft Research, Silicon Valley
Mihai Budiu  Microsoft Research, Silicon Valley
Yuan Yu  Microsoft Research, Silicon Valley
Andrew Birrell  Microsoft Research, Silicon Valley
Dennis Fetterly  Microsoft Research, Silicon Valley
Sponsor
SIGOPS: ACM Special Interest Group on Operating Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 72,   Downloads (12 Months): 417,   Citation Count: 33
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1272996.1273005
What is a DOI?

ABSTRACT

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 flies, 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. The Dryad execution engine handles all the difficult problems of creating a large distributed, concurrent application: scheduling the use of computers and their CPUs, recovering from communication or computer failures, and transporting data between vertices.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Global grid forum. http://www.gridforum.org/.
 
2
Intel IXP2XXX product line of network processors. http://www.intel.com/design/network/products/npfamily/ixp2xxx.htm.
 
3
Intel platform 2015. http://www.Intel.com/technology/architecture/platform2015/.
 
4
The LINQ project. http://msdn.microsoft.com/netframework/future/linq/.
 
5
Open MPI. http://www.open-mpi.org/.
 
6
SQL Server Integration Services. http://www.microsoft.com/sq1/technologies/integration/default.mspx.
 
7
8
9
10
11
12
13
14
 
15
 
16
 
17
18
 
19
D. C. DiNucci and R. G. Babb II. Design and implementation of parallel programs with LGDF2. In Digest of Papers from Compcon '89, pages 102--107, 1989.
20
21
22
 
23
J. Gray, A. S. Szalay, A. Thakar, P. Kunszt, C. Stoughton, D. Slutz, and J. Vandenberg. Data mining the SDSS SkyServer database. In Distributed Data and Structures 4: Records of the 4th International Meeting, pages 189--210, Paris, France, March 2002. Carleton Scientific, also as MSR-TR-2002-01.
 
24
Jim Gray and Alex Szalay. Science in an exponential world. Nature, 440(23), March 23 2006.
 
25
J.-H. Hwang, M. Balazinska, A. Rasin, U. Çetintemel, M. Stonebraker, and S. Zdonik. A comparison of stream-oriented high-availability algorithms. Technical Report TR-03-17, Computer Science Department, Brown University, September 2003.
 
26
27
 
28
 
29
30
31
 
32
Ken Phillips. SenSage ESA. SC Magazine, March 1 2006.
 
33
34
 
35
36
 
37
 
38

CITED BY  33

Collaborative Colleagues:
Michael Isard: colleagues
Mihai Budiu: colleagues
Yuan Yu: colleagues
Andrew Birrell: colleagues
Dennis Fetterly: colleagues