Institutional Scholarship

Pipelined Parallelogram Tiling and Loop Restructuring Using Chapel Iterators

Show simple item record

dc.contributor.advisor Wonnacott, David G.
dc.contributor.author Rush, Blair
dc.date.accessioned 2016-07-19T18:11:47Z
dc.date.available 2016-07-19T18:11:47Z
dc.date.issued 2016
dc.identifier.uri http://hdl.handle.net/10066/18677
dc.description.abstract We are often interested in improving the performance of our programs in any way we can. Loop reconstruction is a common tool for improving performance. There are many different types of loop restructuing techniques depending on the problem that is given. We attempt to look at how to implement some of these techniques in Chapel. Specifically using Chapel's iterator method. After implementation we will attempt to test to see how efficient these implementations were in improving performance. Also we will attempt to see if Chapel is as fast, in terms of performance, as the current benchmarks in C when implementing similar code.
dc.description.sponsorship Haverford College. Department of Computer Science
dc.language.iso eng
dc.rights.uri http://creativecommons.org/licenses/by-nc/4.0/
dc.title Pipelined Parallelogram Tiling and Loop Restructuring Using Chapel Iterators
dc.type Thesis
dc.rights.access Tri-College users only


Files in this item

This item appears in the following Collection(s)

Show simple item record

http://creativecommons.org/licenses/by-nc/4.0/ Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by-nc/4.0/

Search


Browse

My Account