http://swrc.ontoware.org/ontology#Article
Studies on Hashing PART-3: MTAC-Mathematical Tabulative Automatic Computing
en
Dept. of Information Science Faculty of Science Univ. of Tokyo
Dept. of Computer Science The Univ. of Electro-Communications
Eiichi Goto
Motoaki Terashima
Tabulation vs. recomputation of mathematical function is a typical space vs. time tradeoff problem in computing. Two principles (P1) ondemand tabulation and (P2) reclaimable tabulation are proposed to widen the range of applicability of tabulation. For some cases these principles are shown to be similar in effect to recursion elimination. The results of software implementation of these principles are given. Another MTAC(Mathematical Tabulative Architecture for Computers) that relates to Babbage's difference engine to hardware hashing and to a modified buffer (cache) register is also discussed.
Tabulation vs. recomputation of mathematical function is a typical space vs. time tradeoff problem in computing. Two principles, (P1) ondemand tabulation and (P2) reclaimable tabulation, are proposed to widen the range of applicability of tabulation. For some cases these principles are shown to be similar in effect to recursion elimination. The results of software implementation of these principles are given. Another MTAC(Mathematical Tabulative Architecture for Computers) that relates to Babbage's difference engine, to hardware hashing, and to a modified buffer (cache) register is also discussed.
AA00700121
Journal of Information Processing
3
1
23-30
1980-03-30
1882-6652