Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp018k71nh21b
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | August, David I | en_US |
dc.contributor.author | Kim, Hanjun | en_US |
dc.contributor.other | Computer Science Department | en_US |
dc.date.accessioned | 2013-09-16T17:27:07Z | - |
dc.date.available | 2013-09-16T17:27:07Z | - |
dc.date.issued | 2013 | en_US |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/dsp018k71nh21b | - |
dc.description.abstract | While clusters of commodity servers and switches are the most popular form of large-scale parallel computers, many programs are not easily parallelized for clusters due to high inter-node communication cost and lack of globally shared memory. Speculative Decoupled Software Pipelining (Spec-DSWP) is a promising automatic parallelization technique for clusters that speculatively partitions a loop into multiple threads that communicate in a pipelined manner. Speculation can complement conservative static analysis, making automatic parallelization more robust and applicable. Pipelining allows Spec-DSWP to speculate only rarely occurring dependences while respecting the other dependences through communication among threads. Acyclic communication patterns in pipelining make the parallelized programs tolerant of high communication latency of clusters. However, since Spec-DSWP partitions a loop iteration (a transaction) into multiple sub-transactions across multiple threads according to the pipeline stages, a special runtime system is required that supports multi-threaded transactions (MTXs). This dissertation proposes the Automatic Speculative Acyclic Parallelization (ASAP) system that enables Spec-DSWP for clusters without any hardware modification. The ASAP system supports various speculation techniques that require different validation and communication costs, and automatically parallelizes sequential loops using the Spec-DSWP transformation with the optimal application of the speculation techniques. The ASAP system efficiently supports MTXs to correctly execute the speculatively transformed programs on clusters. With synergistic combination of speculation, acyclic communication, and runtime system support, this approach achieves or demonstrates a path to achieve scalable performance speedup up to 109x for a wide range of applications on clusters without any hardware modification. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Princeton, NJ : Princeton University | en_US |
dc.relation.isformatof | The Mudd Manuscript Library retains one bound copy of each dissertation. Search for these copies in the <a href=http://catalog.princeton.edu> library's main catalog </a> | en_US |
dc.subject | Automatic parallelization | en_US |
dc.subject | Compiler | en_US |
dc.subject | Speculation | en_US |
dc.subject | Transactional memory | en_US |
dc.subject.classification | Computer science | en_US |
dc.title | ASAP: Automatic Speculative Acyclic Parallelization for Clusters | en_US |
dc.type | Academic dissertations (Ph.D.) | en_US |
pu.projectgrantnumber | 690-2143 | en_US |
Appears in Collections: | Computer Science |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Kim_princeton_0181D_10623.pdf | 1.7 MB | Adobe PDF | View/Download |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.