Memory optimization in codelet execution model on many-core architectures
| Author(s) | Wu, Yao | |
| Date Accessioned | 2015-03-16T12:51:30Z | |
| Date Available | 2015-03-16T12:51:30Z | |
| Publication Date | 2014 | |
| Abstract | The upcoming exa-scale era requires a parallel program execution model capable of achieving scalability, productivity, energy efficiency, and resiliency. The codelet model is a fine-grained dataflow-inspired execution model which is the focus of several tera-scale and exa-scale studies such as DARPA's UHPC, DOE's X-Stack, and the European TERAFLUX projects. Current codelet implementations aim to making fully use of computation resources by balancing their workload in the multi-core and many-core systems. The performance is improved by this method. However, by making use of the features of the codelet model the memory optimization can be also implemented to improve the performance as well as energy efficiency. In this thesis, we focus on the memory optimization on memory workload balance and locality exploitation in the codelet model. As a case study, various versions of FFT algorithms are implemented on IBM Cyclops-64 - a many-core system to demonstrate that the fine-grain codelet execution model is able to execute the codelets that involve different workload on the memory bandwidth in an appropriate order to reduce memory contention and thus improve performance. The experiment result shows that our fine-grain guided algorithm achieves up to 46% performance improvement comparing to a coarse-grain implementation on Cyclops-64. To automatically exploit locality in codelet execution, we provide three optimal or nearly optimal scheduling algorithms based on static information of codelet graph and locality. They have different trade-offs in algorithmic complexity, locality exploitation, program execution time, and energy efficiency. We test and analyze the three algorithms on various applications on an emulation platform of Cyclops-64. The experiment result shows that our algorithms reduce up to 59.7% of global memory access by using local memory to buffer intermediate data between two adjacent codelets on the same core and thus improve up to 68.1% performance improvement and 40.7% energy saving comparing to the dynamic codelet scheduling approach. | en_US |
| Advisor | Gao, Guang R. | |
| Degree | M.E.E. | |
| Department | University of Delaware, Department of Electrical and Computer Engineering | |
| Unique Identifier | 904958900 | |
| URL | http://udspace.udel.edu/handle/19716/16691 | |
| Publisher | University of Delaware | en_US |
| URI | http://search.proquest.com/docview/1564756419?accountid=10457 | |
| dc.subject.lcsh | Computer algorithms. | |
| dc.subject.lcsh | IBM computers. | |
| dc.subject.lcsh | Computer programs -- Execution. | |
| Title | Memory optimization in codelet execution model on many-core architectures | en_US |
| Type | Thesis | en_US |