Speculative parallelism in Intel Cilk Plus
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/77032 |
| _version_ | 1811096422712344576 |
|---|---|
| author | Perez, Ruben (Ruben M.) |
| author2 | Charles Leiserson. |
| author_facet | Charles Leiserson. Perez, Ruben (Ruben M.) |
| author_sort | Perez, Ruben (Ruben M.) |
| collection | MIT |
| description | Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012. |
| first_indexed | 2024-09-23T16:43:30Z |
| format | Thesis |
| id | mit-1721.1/77032 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T16:43:30Z |
| publishDate | 2013 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/770322019-04-12T16:10:47Z Speculative parallelism in Intel Cilk Plus Perez, Ruben (Ruben M.) Charles Leiserson. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012. Cataloged from PDF version of thesis. Includes bibliographical references (p. 37). Certain algorithms can be effectively parallelized at the cost of performing some redundant work. One example is searching an unordered tree graph for a particular node. Each subtree can be searched in parallel by a separate thread. Once a single thread is successful, however, the work of the others is unneeded and should be ended. This type of computation is known as speculative parallelism. Typically, an abort command is provided in the programming language to provide this functionality, but some languages do not. This thesis shows how support for the abort command can be provided as a user-level library. A parallel version of the alpha beta search algorithm demonstrates its effectivenesss. by Ruben Perez. M.Eng. 2013-02-14T15:40:25Z 2013-02-14T15:40:25Z 2012 2012 Thesis http://hdl.handle.net/1721.1/77032 825818523 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 37 p. application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Perez, Ruben (Ruben M.) Speculative parallelism in Intel Cilk Plus |
| title | Speculative parallelism in Intel Cilk Plus |
| title_full | Speculative parallelism in Intel Cilk Plus |
| title_fullStr | Speculative parallelism in Intel Cilk Plus |
| title_full_unstemmed | Speculative parallelism in Intel Cilk Plus |
| title_short | Speculative parallelism in Intel Cilk Plus |
| title_sort | speculative parallelism in intel cilk plus |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/77032 |
| work_keys_str_mv | AT perezrubenrubenm speculativeparallelisminintelcilkplus |