Automating Program Speedup by Deciding What to Cache
Automating Program Speedup by Deciding What to Cache
复制标题
通过决定缓存内容来自动加速程序
DOI：
--
复制
发表时间：
1985
期刊：
影响因子：
--
通讯作者：
D. Cohen
中科院分区：
文献类型：
--
作者：
Jack Mostow;D. Cohen
一种常见的程序优化策略是通过缓存和重用结果来消除重新计算。我们分析了自动化此策略所涉及的问题：决定缓存哪些计算是安全的，转换程序的其余部分以使其安全，选择最经济有效的计算来缓存，以及维护优化的代码。通过考虑副作用、共享数据结构、程序编辑以及由缓存引起的行为更改的可接受性，该分析扩展了先前关于缓存的工作。本文探讨了解决这些问题的各种技术，并试图明确它们所依赖的假设。一个实验原型包含了许多这些技术。
A common program optimization strategy is to eliminate recomputation by caching and reusing results. We analyze the problems involved in automating this strategy: deciding which computations are safe to cache, transforming the rest of the program to make them safe, choosing the most cost-effective ones to cache, and maintaining the optimized code. The analysis extends previous work on caching by considering side effects, shared data structures, program edits, and the acceptability of behavior changes caused by caching. The paper explores various techniques for solving these problems and attempts to make explicit the assumptions on which they depend. An experimental prototype incorporates many of these techniques.