Studies on Hashing PART-3: MTAC-Mathematical Tabulative Automatic Computing

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 一般社団法人情報処理学会の論文
• 1980-03-30

著者

• Terashima Motoaki

  Dept. Of Computer Science The Univ. Of Electro-communications

• Goto Eiichi

  Dept. Of Information Science Faculty Of Science Univ. Of Tokyo

関連論文

• Associative Data Structures and Their Applications (Mathematical Methods in Software Science and Engineering)
• Studies on Hashing PART-3: MTAC-Mathematical Tabulative Automatic Computing
• Studies on Hashing PART-2: Algorithms and Programming with CAMs

スポンサーリンク