Table-lookup approach for compiling two-level data-processor mappings in HPF

doi:10.1007/BFb0032682

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 會議論文 > Item 987654321/73283

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/73283

題名:	Table-lookup approach for compiling two-level data-processor mappings in HPF
作者:	石貴平;Shih, Kuei-ping;Sheu, Jang-ping;Huang, Chua-huang
貢獻者:	淡江大學資訊工程學系
關鍵詞:	Active Element;Array Element;Array Statement;Virtual Processor;Local Array
日期:	1997-08
上傳時間:	2011-10-24 11:43:01 (UTC+8)
摘要:	This paper presents some compilation techniques to compress holes. Holes are the memory locations mapped by useless template cells and are caused by the non-unit alignment stride in a two-level dataprocessor mapping. In a two-level data-processor mapping, there is a repeated pattern for array elements mapped onto processors. We classify blocks into classes and use a class table to record the attributes of classes for the data distribution. Similarly, data distribution on a processor also has a repeated pattern. We use compression table to record the attributes of the first data distribution pattern on that processor. By using class table and compression table, hole compression can be easily and efficiently achieved. Compressing holes can save memory usage, improve spatial locality and further increase system performance. The proposed method is efficient, stable and easy implement. The experimental results do confirm the advantages of our proposed method over existing methods.
關聯:	International Workshop on Languages and Compilers for Parallel Computing (LCPC), Minnesota, USA
DOI:	10.1007/BFb0032682
顯示於類別:	[資訊工程學系暨研究所] 會議論文

文件中的檔案:

沒有與此文件相關的檔案.

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章

資料載入中.....