2-1/2D core search memory

Authors:
Philip A. Harding;Michael. W. Rolund
Affiliations:
Bell Telephone Laboratories, Inc., Naperville, Illinois;Bell Telephone Laboratories, Inc., Naperville, Illinois
Venue:
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
Year:
1968

Citing 2
Cited 1

Bit access problems in 2-1/2D 2-wire memories

AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
Associative processing for general purpose computers through the use of modified memories

AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II

Associative processing for general purpose computers through the use of modified memories

AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Usual memories allow addressing of individual word lines with each word line containing an assemblage of bits. Bit detectors which can sense all words are utilized to read the word contents. Associative memories allow bit lines to be addressed, as well as word lines, to determine which set of words match the input bit states. Such memories are useful because they eliminate time consuming word hunting in table look up operations, and because they allow easy access to specific words highlighted by activity or flag bits.