A calculus of loop invariants for dense linear algebra optimization

dc.contributor.advisorVan de Geijn, Robert A.
dc.creatorLow, Tze Mengen
dc.date.accessioned2014-01-29T18:54:32Zen
dc.date.issued2013-12en
dc.date.submittedDecember 2013en
dc.date.updated2014-01-29T18:54:32Zen
dc.descriptiontexten
dc.description.abstractLoop invariants have traditionally been used in proofs of correctness (e.g. program verification) and program derivation. Given that a loop invariant is all that is required to derive a provably correct program, the loop invariant can be thought of as being the essence of a loop. Being the essence of a loop, we ask the question “What other information is embedded within a loop invariant?” This dissertation provides evidence that in the domain of dense linear algebra, loop invariants can be used to determine the behavior of the loops. This dissertation demonstrates that by understanding how the loop invariant describes the behavior of the loop, a goal-oriented approach can be used to derive loops that are not only provably correct, but also have the desired performance behavior.en
dc.description.departmentComputer Sciencesen
dc.format.mimetypeapplication/pdfen
dc.identifier.urihttp://hdl.handle.net/2152/22974en
dc.language.isoen_USen
dc.subjectLoop Invariantsen
dc.subjectLoop optimizationen
dc.subjectDense linear algebraen
dc.subjectGoal-oriented programmingen
dc.titleA calculus of loop invariants for dense linear algebra optimizationen
thesis.degree.departmentComputer Sciencesen
thesis.degree.disciplineComputer Scienceen
thesis.degree.grantorThe University of Texas at Austinen
thesis.degree.levelDoctoralen
thesis.degree.nameDoctor of Philosophyen

Access full-text files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
LOW-DISSERTATION-2013.pdf
Size:
2.02 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
LICENSE.txt
Size:
1.84 KB
Format:
Plain Text
Description: