Use of Multiwrite for General Programmability of Search Memories
- 1 July 1966
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 13 (3) , 369-373
- https://doi.org/10.1145/321341.321346
Abstract
Multiwrite (selective writing in words which satisfied a previous search) is shown to permit parallel evaluation of any Boolean function (including arithmetic) in a search memory. A general method is given which expresses the Boolean function as a sum of products, searches for these products one at a time and OR8 the results of these searches. An example applying the process to arithmetic given.Keywords
This publication has 1 reference indexed in Scilit:
- Algorithms for Parallel-Search MemoriesJournal of the ACM, 1962