期刊論文
| 學年 | 88 |
|---|---|
| 學期 | 2 |
| 出版（發表）日期 | 2000-02-01 |
| 作品名稱 | Efficient index generation for compiling two-level mappings in data-parallel programs |
| 作品名稱（其他語言） | |
| 著者 | Shih, Kuei-ping; Sheu, Jang-ping; Huang, Chua-huang; Chang, Chih-yung |
| 單位 | 淡江大學資訊工程學系 |
| 出版者 | Maryland Heights: Academic Press |
| 著錄名稱、卷期、頁數 | Journal of Parallel and Distributed Computing 60(2), pp.189-216 |
| 摘要 | This paper presents compilation techniques used to compress holes, which are caused by the nonunit alignment stride in a two-level data-processor mapping. Holes are the memory locations mapped by useless template cells. To fully utilize the memory space, memory holes should be removed. In a two-level data-processor mapping, there is a repetitive pattern for array elements mapped onto processors. We classify blocks into classes and use a class table to record the distribution of each class in the first repetitive data distribution pattern. Similarly, data distribution on a processor also has a repetitive pattern. We use a compression table to record the distribution of each block in the first repetitive data distribution pattern on a processor. By using a class table and a compression table, hole compression can be easily and efficiently achieved. Compressing holes can save memory usage, improve spatial locality and further improve system performance. The proposed method is efficient, stable, and easy to implement. The experimental results do confirm the advantages of our proposed method over existing methods. |
| 關鍵字 | communication set; distributed-memory multicomputers; high performance Fortran; hole compression; two-level data-processor mapping |
| 語言 | en |
| ISSN | 0743-7315 |
| 期刊性質 | |
| 收錄於 | |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | |
| 國別 | USA |
| 公開徵稿 | |
| 出版型式 | |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/59899 ) |