Pipelined Parallelogram Tiling and Loop Restructuring Using Chapel Iterators
Date
2016
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Producer
Director
Performer
Choreographer
Costume Designer
Music
Videographer
Lighting Designer
Set Designer
Crew Member
Funder
Rehearsal Director
Concert Coordinator
Advisor
Moderator
Panelist
Alternative Title
Department
Haverford College. Department of Computer Science
Type
Thesis
Original Format
Running Time
File Format
Place of Publication
Date Span
Copyright Date
Award
Language
eng
Note
Table of Contents
Terms of Use
Rights Holder
Access Restrictions
Tri-College users only
Terms of Use
Tripod URL
Identifier
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.