Back to search

McMaster University

Verifying Permutation Rewritable Hazard Free Loops

Abstract

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>

Degree

thesis:*
Department dc:contributor.department
Computer Science
Year dc:date.issued
2011

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Dobrogost, Michal
Advisors dc:contributor.advisor
  • Anand, Christopher
  • Kahl, Wolfram
  • Soltys, Michael

Subjects

dc:subject × 2

Identifiers

dc:identifier.*
Dc Identifier Other
opendissertations/5780
6745
2133191

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Dobrogost, Michal. Verifying Permutation Rewritable Hazard Free Loops. 2011. http://hdl.handle.net/11375/10755