Associative memory
First Claim
1. An associative memory having a first control bus arrangement (any-- type, Vr, cpb, set.s, match, r/w.s, r/w.b, r/w.r, Wand.a, Wand.b, Wor, s.a, reset.b, mode.a mode.a*, prech, ba, mode.b, grant.b, prio etc) for external control, a second memory bus arrangement (t1, t2, id, env, v0, v1, v2, v3) for data comprising:
- several storage cells (1) connected to said memory bus arrangement for storing a composed information, all of said storage cells being simultaneously controllable by said control bus arrangement in accordance with an operation to be performed, means (LAZY,
8) in each of said storage cells for storing at least one mark, said mark(s) indicating at least select state(s) or non select state(s) for said storage cell,means internal to the associative memory for making search operations through the memory bus among said cells to set at least one mark, andmeans (11) in each storage cell for communicating with said buses and to control said storage cells to take part in an actual logical operation by setting a priority request state for said storage cells when said operation requests selection, said priority request state being based on said mark(s) in said means (8) in each of said storage cells, anda priority decoder (2) to which all said storage cells are coupled which selects one out of several of said storage cells by reading said priority request state from the means (11) setting said priority request state in all storage cells and simultaneously returning an individual signal to each storage cell in the memory indicating said select of non select state(s).
1 Assignment
0 Petitions
Accused Products
Abstract
An associative memory is provided having a first control bus arrangement (any type, Vr, cpb, set.s, match, r/w.s, r/w.b, r/w.r, Wand.a, Wand.b, Wor, s.a, reset.b, mode.a mode.a*, prech, ba, mode.b, grant.b, prio etc) for external control and a second memory bus arrangement (t1, t2, id, anv, v0, v1, v2, v3) for data. The memory includes several storage cells (1) for storing a composed information. Each storage cell stores at least one mark, which indicates at least select state(s) or non select state(s) for said storage cell. The mark(s) are set by search operations among said cells. A priority decoder (2) is provided to which all said storage cells are coupled and which selects one out of several of said storage cells. At least one global bus (4, 5) is provided for making logical operations of the type AND and OR between said storage cells. A closure head (11) is provided in each storage cell for communicating with said buses and to control said storage cell to take part in an actual logical operation. Each storage cell includes a number of data object storage fields (IDENTITY, ENVIRONMENT, VALUE/DES.0, VALUE/DES.1, VALUE/DES.2, VALUE/DES.3), which are able to store a data word and at least one of said marks, being in form of tags.
-
Citations
23 Claims
-
1. An associative memory having a first control bus arrangement (any-- type, Vr, cpb, set.s, match, r/w.s, r/w.b, r/w.r, Wand.a, Wand.b, Wor, s.a, reset.b, mode.a mode.a*, prech, ba, mode.b, grant.b, prio etc) for external control, a second memory bus arrangement (t1, t2, id, env, v0, v1, v2, v3) for data comprising:
-
several storage cells (1) connected to said memory bus arrangement for storing a composed information, all of said storage cells being simultaneously controllable by said control bus arrangement in accordance with an operation to be performed, means (LAZY,
8) in each of said storage cells for storing at least one mark, said mark(s) indicating at least select state(s) or non select state(s) for said storage cell,means internal to the associative memory for making search operations through the memory bus among said cells to set at least one mark, and means (11) in each storage cell for communicating with said buses and to control said storage cells to take part in an actual logical operation by setting a priority request state for said storage cells when said operation requests selection, said priority request state being based on said mark(s) in said means (8) in each of said storage cells, and a priority decoder (2) to which all said storage cells are coupled which selects one out of several of said storage cells by reading said priority request state from the means (11) setting said priority request state in all storage cells and simultaneously returning an individual signal to each storage cell in the memory indicating said select of non select state(s). - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23)
-
Specification