Automating Program Speedup by Deciding What to Cache
Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 165-171.
Abstract
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 .
@inproceedings{ijcai1985p30,
title = {Automating Program Speedup by Deciding What to Cache},
author = {Mostow, Jack and Cohen, Donald},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {165--171},
year = {1985},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1985/30},
}
TY - CPAPER TI - Automating Program Speedup by Deciding What to Cache AU - Mostow, Jack AU - Cohen, Donald T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 165 EP - 171 UR - https://ijcai.org/proceedings/1985/30 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
