External-Memory and Cache-Oblivious Algorithms Theoretical 外部存储器和高速缓存无视算法的理论.pptVIP

下载本文档

10
0
约1.1万字
约 47页
2018-04-17 发布于江西
举报
版权申诉

External-Memory and Cache-Oblivious Algorithms Theoretical 外部存储器和高速缓存无视算法的理论.ppt

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

External-Memory and Cache-Oblivious Algorithms Theoretical 外部存储器和高速缓存无视算法的理论.ppt

aaaa External-Memory and Cache-Oblivious Algorithms: Theory and Experiments Gerth St?lting Brodal Motivation 1 Datasets get MASSIVE 2 Computer memories are HIERARCHICAL Massive Data Computer Hardware A Typical Computer Customizing a Dell 650 Processor speed 2.4 – 3.2 GHz L3 cache size 0.5 – 2 MB Memory 1/4 – 4 GB Hard Disk 36 GB– 146 GB 7.200 – 15.000 RPM CD/DVD 8 – 48x L2 cache size 256 – 512 KB L2 cache line size 128 Bytes L1 cache line size 64 Bytes L1 cache size 16 KB Pentium? 4 Processor Microarchitecture Memory Access Times Hierarchical Memory Basics A Trivial Program for (i=0; i+dn; i+=d) A[i]=i+d; A[i]=0; for (i=0, j=0; j8*1024*1024; j++) i = A[i]; A Trivial Program — d=1 A Trivial Program — d=1 A Trivial Program — n=224 A Trivial Program Experiments were performed on a DELL 8000, PentiumIII, 850MHz, 128MB RAM, running Linux 2.4.2, and using gcc version 2.96 with optimization -O3 L1 instruction and data caches 4-way set associative, 32-byte line size 16KB instruction cache and 16KB write-back data cache L2 level cache 8-way set associative, 32-byte line size 256KB Algorithmic Problem Modern hardware is not uniform — many different parameters Number of memory levels Cache sizes Cache line/disk block sizes Cache associativity Cache replacement strategy CPU/BUS/memory speed Programs should ideally run for many different parameters by knowing many of the parameters at runtime, or by knowing few essential parameters, or ignoring the memory hierarchies Programs are executed on unpredictable configurations Generic portable and scalable software libraries Code downloaded from the Internet, e.g. Java applets Dynamic environments, e.g. multiple processes Memory Models Hierarchical Memory Model External Memory Model— two parameters Measure number of block transfers between two memory levels Bottleneck in many computations Very successful (simplicity) Limitations Parameters B and M must be known Does not handle multiple memory levels Does no