J. Mostov and D. Cohen. Automating program speedup by deciding what to cache. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 165-- 172, Aug. 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Department, State University of New York at Stony Brook, Stony Brook, NY 11794. Phone: 631 632 f8463,1627g. Email: fliu,stollerg cs.sunysb.edu. Memoization uses a mechanism that is separate from the original program to save the result of each function call or reduction as the program executes [1, 19, 20, 25, 27, 28, 40, 41, 45, 49, 51]. The idea is to keep a separate table of solutions to subproblems, modify recursive calls to rst look up in the table, and then, if the subproblem has been computed, use the saved result, otherwise, compute it and save the result in the table. This method has two advantages. First, the original ....

D. J. Mostow and D. Cohen. Automating program speedup by deciding what to cache. In Proceedings of the 9th International Joint Conference on Arti cial Intelligence, pages 165-172. Morgan Kaufmann Publishers, San Francisco, Calif., Aug. 1985. 24

....Department, 215 Lindley Hall, Indiana University, Bloomington, IN 47405. Phone: 812 855 f4373,7979g. Email: fliu,stollerg cs.indiana.edu. 1 Memoization uses a mechanism that is separate from the original program to save the result of each function call or reduction as the program executes [1, 19, 20, 25, 27, 28, 40, 41, 45, 49, 51]. The idea is to keep a separate table of solutions to subproblems, modify recursive calls to rst look up in the table, and then, if the subproblem has been computed, use the saved result, otherwise, compute it and save the result in the table. This method has two advantages. First, the original ....

D. J. Mostow and D. Cohen. Automating program speedup by deciding what to cache. In Proceedings of the 9th International Joint Conference on Articial Intelligence, pages 165-172. Morgan Kaufmann Publishers, San Francisco, Calif., Aug. 1985. 24

....calculations. Automatic memoization refers to a method by which an ordinary function can be changed mechanically into one that memoizes or caches its results. We place the decision about which functions to memoize in the hands of the user; this contrasts with the approach of Mostow and Cohen [11], which tries to automatically infer which functions should be memoized. These two approaches to automatic memoization are not incompatible, although as Mostow and Cohen point out, the latter approach is not a practical tool. The principle of memoization and examples of its use in areas as varied ....

Jack Mostow and Donald Cohen. Automating program speedup by deciding what to cache. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 165--172. Morgan Kaufmann Publishers, Inc., 1985.

.... memoization mainly refers to techniques in this class [Par90] 71 In recent years, there has been additional work on general strategies for separate caching. For example, Hughes [Hug85] discusses lazy memo functions that are suitable for use in systems with lazy evaluation. Mostow and Cohen [MC85] discuss some issues for speeding up Interlisp programs by caching in the presence of side effects. Pugh [Pug88a] provides some improved cache replacement strategies for a simple functional language. Two trends seem obvious: studying specialized cache strategies for classes of problems, and ....

D. J. Mostow and D. Cohen. Automating program speedup by deciding what to cache. In Proceedings of the 9th IJCAI, pages 165--172, Los Angeles, August 1985.

....fall into one of the following three classes. In the first class, a global cache separate from a subject program is employed to record values of subcomputations that may be needed later, and certain strategies are chosen for using and managing the cache [28] Work in recent years includes [15, 29, 37]. Two trends seem obvious: studying specialized cache strategies for classes of problems [38] and adding annotations or certain specifications to subject programs [14, 19, 44] A drawback of these methods is that they are based on dynamic methods, which are fundamentally interpretive and are ....

D. J. Mostow and D. Cohen. Automating program speedup by deciding what to cache. In Proceedings of the Ninth IJCAI, pages 165--172, Los Angeles, August 1985.

....of the word memoization mainly refers to techniques in this class [32] In recent years, there has been additional work on general strategies for separate caching. For example, Hughes [15] discusses lazy memo functions that are suitable for use in systems with lazy evaluation. Mostow and Cohen [28] discuss some issues for speeding up Interlisp programs by caching in the presence of side effects. Pugh [36] provides some improved cache replacement strategies for a simple functional language. Two trends seem obvious: studying specialized cache strategies for classes of problems, and adding ....

D. J. Mostow and D. Cohen. Automating program speedup by deciding what to cache. In Proceedings of the Ninth IJCAI, pages 165--172, Los Angeles, August 1985.

....calculations. Automatic memoization refers to a method by which an ordinary function can be changed mechanically into one that memoizes or caches its results. We place the decision about which functions to memoize in the hands of the user; this contrasts with the approach of Mostow and Cohen [11], which tries to automatically infer which functions should be memoized. These two approaches to automatic memoization are not incompatible, although as Mostow and Cohen point out, the latter approach is not a practical tool. Memoization is particularly apt for AI applications. Rapid prototyping ....

....in preparation for a new run. 5 Memoization Failures A major advantage of automatic memoization is its transparency. However, an overly transparent view can lead to problems. While some aspects of these memoization failures have been discussed in the literature (notably by Mostow and Cohen [11]) most have not. Instead, we learned them the hard way in using the the time and experience to do this type of analysis. evolving CLAMP system through the experiences of AI programmers using the facility over the course of several years in developing the SMS system. The most common criticism ....

Jack Mostow and Donald Cohen. Automating program speedup by deciding what to cache. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 165--172. Morgan Kaufmann Publishers, Inc., 1985.

.... [4, 5] Given a straightforward recursion, there are two traditional ways to achieve the effect of dynamic programming [14] memoization [34] and tabulation [5] Memoization uses a mechanism that is separate from the original program to save the result of each function call or reduction [34, 19, 22, 35, 24, 43, 45, 39, 25, 18, 1]. The idea is to keep a separate table of solutions to subproblems, modify This work is supported in part by NSF under Grant CCR 9711253 and ONR under Grant N0014 99 1 0132. recursive calls to first look up in the table, and then, if the subproblem has been computed, use the saved result, ....

D. J. Mostow and D. Cohen. Automating program speedup by deciding what to cache. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, pages 165--172. Morgan Kaufmann Publishers, San Francisco, Calif., Aug. 1985.

.... [4, 5] Given a straightforward recursion, there are two traditional ways to achieve the effect of dynamic programming [13] memoization [32] and tabulation [5] Memoization uses a mechanism that is separate from the original program to save the result of each function call or reduction [32, 18, 21, 33, 23, 41, 43, 37, 17, 1]. The idea is to keep a separate table of solutions to subproblems, modify recursive calls to first look up in the table, and then, if the subproblem has been computed, use the saved result, otherwise, compute it and save the result in the table. This method has two advantages. First, the original ....

D. J. Mostow and D. Cohen. Automating program speedup by deciding what to cache. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, pages 165--172. Morgan Kaufmann Publishers, San Francisco, Calif., Aug. 1985.

No context found.

J. Mostov and D. Cohen. Automating program speedup by deciding what to cache. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 165-- 172, Aug. 1985.

No context found.

J. Mostov and D. Cohen. Automating program speedup by deciding what to cache. In Proceedings of the Ninth Interna- tional Joint Conference on Artificial Intelligence, pages 165-- 172, Aug. 1985.

No context found.

J. Mostov and D. Cohen. Automating program speedup by deciding what to cache. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 165-- 172, Aug. 1985.

No context found.

J. Mostov and D. Cohen. Automating program speedup by deciding what to cache. In Proceedings of the Ninth Interna- tional Joint Conference on Artificial Intelligence, pages 165-- 172, Aug. 1985.

No context found.

Mostow, J., and Cohen, D., "Automating Program Speedup by Deciding What to Cache," Proc. Int. Joint Conf. on Artificial Intelligence (IJCAI-85), pp.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC