The gap between processor speed and memory access performance increases continuingly. In order to improve performance degradation due to memory accesses, we can reduce memory block accesses by improving data locality. In this research, we focus on optimizing data locality in loops. We adopt an iterative greedy algorithm. It iteratively perform loop fission and loop fusion by moving strongly-connected components among loops subject to data dependence constraints. It evaluates data locality change of each move and decide if accept such move. Subsequently loops can be improved gradually forward optimal result.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0911108-205400 |
| Date | 11 September 2008 |
| Creators | Luo, Yong-En |
| Contributors | Chia-Hsiung Kao, Tsung Lee, Chih-Chien Chen |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0911108-205400 |
| Rights | withheld, Copyright information available at source archive |
Page generated in 0.0021 seconds