Use of Multiwrite for General Programmability of Search Memories

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Use of Multiwrite for General Programmability of Search Memories

Full text

Pdf (455 KB)

Source

Journal of the ACM (JACM) archive
Volume 13 , Issue 3 (July 1966) table of contents

Pages: 369 - 373

Year of Publication: 1966

ISSN:0004-5411

Author

Sigmund N. Porter

P.O. Box 66188, Los Angeles, California

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 18, Citation Count: 0

Additional Information:

abstract references index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321341.321346 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	EsaIN, G., AND FULLER, R. Mgorithms for content-addressabte memories. Prec. 1963 Pacifio Comput. Conf. (IEEI Pbl. T-147), Mar. 1963, pp. 118-130.
	2	A. D. Falkoff, Algorithms for Parallel-Search Memories, Journal of the ACM (JACM), v.9 n.4, p.488-511, Oct. 1962 [doi>10.1145/321138.321147]
	3	Iwasos, K.E. A Programming Language. John Wiley, New York, 1962.