Efficient memo-table management strategies (Q582879): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
A large, automatically detectable class of nonlinear functions is defined and their evaluation graphs are characterized. These results are then used to develop space-efficient implementation of memo-functions. We generate a variant of memo-functions which can be used to linearize the time cost of calls of a nonlinear function to itself whilst executing in bounded space. These memo-functions dynamically garbage collect (or reuse) memo-table entries when it is known that such entries will not be useful again. For each nonlinear function a function called the ''table- manager'' function is synthesized by a static analysis of the definition of the nonlinear function. The table-managers delete (or reuse) entries that are guaranteed to be obsolete as a result of any insertion into the memo-tables. In this way they ensure that the size of the tables is minimized. Furthermore, the sizes of the tables for these memo-functions are guaranteed not to exceed a compile-time constant found by the same static analysis which synthesizes the table-managers. The applicability of the method also includes many problems which have been previously solved by applying dynamic programming techniques. An implementation of these memo-functions for the functional language HOPE is also outlined. | |||
Property / review text: A large, automatically detectable class of nonlinear functions is defined and their evaluation graphs are characterized. These results are then used to develop space-efficient implementation of memo-functions. We generate a variant of memo-functions which can be used to linearize the time cost of calls of a nonlinear function to itself whilst executing in bounded space. These memo-functions dynamically garbage collect (or reuse) memo-table entries when it is known that such entries will not be useful again. For each nonlinear function a function called the ''table- manager'' function is synthesized by a static analysis of the definition of the nonlinear function. The table-managers delete (or reuse) entries that are guaranteed to be obsolete as a result of any insertion into the memo-tables. In this way they ensure that the size of the tables is minimized. Furthermore, the sizes of the tables for these memo-functions are guaranteed not to exceed a compile-time constant found by the same static analysis which synthesizes the table-managers. The applicability of the method also includes many problems which have been previously solved by applying dynamic programming techniques. An implementation of these memo-functions for the functional language HOPE is also outlined. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68P05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68N15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C39 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4131634 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
memo-functions | |||
Property / zbMATH Keywords: memo-functions / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
memo-table | |||
Property / zbMATH Keywords: memo-table / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
dynamic programming | |||
Property / zbMATH Keywords: dynamic programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
functional language HOPE | |||
Property / zbMATH Keywords: functional language HOPE / rank | |||
Normal rank |
Revision as of 19:13, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient memo-table management strategies |
scientific article |
Statements
Efficient memo-table management strategies (English)
0 references
1990
0 references
A large, automatically detectable class of nonlinear functions is defined and their evaluation graphs are characterized. These results are then used to develop space-efficient implementation of memo-functions. We generate a variant of memo-functions which can be used to linearize the time cost of calls of a nonlinear function to itself whilst executing in bounded space. These memo-functions dynamically garbage collect (or reuse) memo-table entries when it is known that such entries will not be useful again. For each nonlinear function a function called the ''table- manager'' function is synthesized by a static analysis of the definition of the nonlinear function. The table-managers delete (or reuse) entries that are guaranteed to be obsolete as a result of any insertion into the memo-tables. In this way they ensure that the size of the tables is minimized. Furthermore, the sizes of the tables for these memo-functions are guaranteed not to exceed a compile-time constant found by the same static analysis which synthesizes the table-managers. The applicability of the method also includes many problems which have been previously solved by applying dynamic programming techniques. An implementation of these memo-functions for the functional language HOPE is also outlined.
0 references
memo-functions
0 references
memo-table
0 references
dynamic programming
0 references
functional language HOPE
0 references