Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/10755
Title: | Verifying Permutation Rewritable Hazard Free Loops |
Authors: | Dobrogost, Michal |
Advisor: | Anand, Christopher Kahl, Wolfram Soltys, Michael |
Department: | Computer Science |
Keywords: | parallelism multicore verification permutation high-performance computing;Numerical Analysis and Scientific Computing;Numerical Analysis and Scientific Computing |
Publication Date: | Oct-2011 |
Abstract: | <p>We present an extension to the language of Atomic Verifiable Operation (AVOp) streams to allow the expression of loops which are rewritable via an arbitrary permutation. Inspired by (and significantly extending) hardware register rotation to data buffers in multi-core programs, we hope to achieve similar performance benefits in expressing software pipelined programs across many cores. By adding loops to AVOp streams, we achieve significant stream compression, which eliminates an impediment to scalability of this abstraction. Furthermore, we present a fast extension to the previous AVOp verification process which ensures that no data hazards are present in the program’s patterns of communication. Our extension to the verification process is to verify loops without completely unrolling them. A proof of correctness for the verification process is presented.</p> |
URI: | http://hdl.handle.net/11375/10755 |
Identifier: | opendissertations/5780 6745 2133191 |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Size | Format | |
---|---|---|---|
fulltext.pdf | 627.6 kB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.