Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/10755
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorAnand, Christopheren_US
dc.contributor.advisorKahl, Wolframen_US
dc.contributor.advisorSoltys, Michaelen_US
dc.contributor.authorDobrogost, Michalen_US
dc.date.accessioned2014-06-18T16:52:27Z-
dc.date.available2014-06-18T16:52:27Z-
dc.date.created2011-08-04en_US
dc.date.issued2011-10en_US
dc.identifier.otheropendissertations/5780en_US
dc.identifier.other6745en_US
dc.identifier.other2133191en_US
dc.identifier.urihttp://hdl.handle.net/11375/10755-
dc.description.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>en_US
dc.subjectparallelism multicore verification permutation high-performance computingen_US
dc.subjectNumerical Analysis and Scientific Computingen_US
dc.subjectNumerical Analysis and Scientific Computingen_US
dc.titleVerifying Permutation Rewritable Hazard Free Loopsen_US
dc.typethesisen_US
dc.contributor.departmentComputer Scienceen_US
dc.description.degreeMaster of Science (MSc)en_US
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File SizeFormat 
fulltext.pdf
Open Access
627.6 kBAdobe PDFView/Open
Show simple item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue