Compiler-Directed Cache Polymorphism Array-based Code Algorithms for Cache Polymorphism Exp.pdfVIP

下载本文档

2
0
约7.76千字
约 28页
2017-04-11 发布于江苏
举报
版权申诉

Compiler-Directed Cache Polymorphism Array-based Code Algorithms for Cache Polymorphism Exp.pdf

1、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Compiler-Directed Cache Polymorphism Array-based Code Algorithms for Cache Polymorphism Exp

Compiler-Directed Cache Polymorphism J. S. Hu, M. Kandemir, N. Vijaykrishnan, M. J. Irwin, H. Saputra, W. Zhang Microsystems Design Lab The Pennsylvania State University 2Outline Motivation Compiler-Directed Cache Polymorphism Array-based Code Algorithms for Cache Polymorphism Experiments Results Conclusions Future Work 3Motivation State-of-the-art microprocessors normally employ large cache structures; Fixed cache structures are wasted due to ineffective utilization; Traditional loop optimizations may not be available due to dependences as well as not energy aware; Fixed cache structure may also increases energy consumption; Previous reconfigurable cache architecture lacks software-based direction mechanism. 4Our Approach Compiler-directed cache polymorphism n Compiler analysis based; n No transformation to the original code; n Determines the near-optimal cache configurations for each loop nest; n Dynamically reconfigures caches for different nests at run time. 5Array-based Code Array-based programs n Assumption 1: globally declared arrays; n Assumption 2: same lexical-level nests; n Assumption 3: perfectly-nested nests. Characteristics of array-based code n Computation of nests dominates the execution time of array-based codes; n Cache behavior directly affects the performance energy consumption of nests; n Data locality is the key to improve cache behavior. 6Array References )].()]...[()][([ ,2,1, ifififAR mjjjj rrr .* 2 1 2 1 21 22221 11211 , 2, 1, ?? ? ? ? ? ? ?? ? ? ? ? ? + ?? ? ? ? ? ? ?? ? ? ? ? ? ?? ? ? ? ? ? ?? ? ? ? ? ? = ? ? ? ? ? ? ? ? ? ? ? ? ? ? mnmnmm n n mj j j c c c i i i aaa aaa aaa f f f MM L MOMM L L M .ciAf rrr += (1) (2) (3) : reference subscript vector : access matrix : loop index vector : constant offset vector f r i r c r A 7Compiler-Directed Cache Polymorphism How to analyze reuse properties of a given nest efficiently? How to transform data reuse into real data locality? n Why? à improve performance and energy efficien