article · 2008

Abstract Implicit Parallelism with Ordered Transactions

Christoph Von Praun, Luis Ceze

Cited by 0Abstract and details only

Abstract

Implicit Parallelism with Ordered Transactions (IPOT) is an extension of sequential or explicitly parallel programming models to support speculative parallelization. The key idea is to specify opportunities for parallelization in a sequential program using annotations similar to transactions. Unlike explicit parallelism, IPOT annotations do not require the absence of data dependence, since the parallelization relies on runtime support for speculative execution. IPOT as a parallel programming model is determinate, i.e., program semantics are independent of the thread scheduling. For optimization, non-determinism can be introduced selectively. We describe the programming model of IPOT and an online tool that recommends boundaries of ordered transactions by observing a sequential execution. On three example HPC workloads we demonstrate that our method is effective in identifying opportunities for fine-grain parallelization. Using the automated task recommendation tool, we were able to perform the parallelization of each program within a few hours.

Cite this paper

APA 7

Von Praun, C., & Ceze, L. (2008). Abstract Implicit Parallelism with Ordered Transactions.

MLA 9

Von Praun, Christoph, and Luis Ceze. “Abstract Implicit Parallelism with Ordered Transactions.” 2008.

Chicago

Von Praun, Christoph, and Luis Ceze. 2008. “Abstract Implicit Parallelism with Ordered Transactions.”

Harvard

Von Praun, C. and Ceze, L. (2008) ‘Abstract Implicit Parallelism with Ordered Transactions’.

BibTeX

@article{vonpraun2008abstract,
  title = {{Abstract Implicit Parallelism with Ordered Transactions}},
  author = {Von Praun, Christoph and Ceze, Luis},
  year = {2008}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.