US4244033A - Method and system for operating an associative memory - Google Patents

Method and system for operating an associative memory Download PDF

Info

Publication number
US4244033A
US4244033A US05/967,591 US96759178A US4244033A US 4244033 A US4244033 A US 4244033A US 96759178 A US96759178 A US 96759178A US 4244033 A US4244033 A US 4244033A
Authority
US
United States
Prior art keywords
information
address
associative memory
module
block information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
US05/967,591
Other languages
English (en)
Inventor
Akira Hattori
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fujitsu Ltd
Original Assignee
Fujitsu Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Fujitsu Ltd filed Critical Fujitsu Ltd
Application granted granted Critical
Publication of US4244033A publication Critical patent/US4244033A/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0864—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches using pseudo-associative means, e.g. set-associative or hashing

Definitions

  • the present invention relates to a method and system for operating an associative memory which is provided for storing information.
  • the method includes the steps of extracting necessary information by access to said associative memory and updating the information retained in said associative memory.
  • the conventional associative memory system such as a cache memory
  • a cache memory such that information stored in the main memory is previously transferred to an associative memory (hereinafter called "buffer memory") and, then, an associated processor operates by providing access to said buffer memory. If the necessary information is absent in the buffer memory, the necessary information stored in the main memory is loaded in block format into the buffer memory. That is, updating of information in the buffer memory is carried out.
  • the capacity of such associative memory or buffer memory depends upon parameters, such as the set number, the associative level, and the block size of information stored in block format.
  • the associative level is increased, for the following reason. While usually, a change in the number of sets or in the block size greatly affects the overall processing system, the value of the associative level need not be increased by a power of 2, namely, twice, four times, . . . 2 n times, but can be increased sequentially by twice, thrice, . . . .
  • a method and system for operating an associative memory which is provided for storing information.
  • the method includes the steps of extracting necessary information by access to said associative memory, and updating the information in said associative memory, said associative memory comprising a data portion for storing a plurality of block information units as one module, an address array portion for storing a module address corresponding to data of one said module, and a valid information portion arranged in conjunction with said module address for indicating which of said block information units constituting said one module is valid, whereby updating of information in said data portion is carried out in the block information units referred to above.
  • FIG. 1 is a block diagram illustrating the structure of a conventional buffer memory
  • FIG. 2 is a block diagram illustrating an example of the conventional processing system for buffer memory
  • FIG. 3 is a block diagram illustrating the flow of information in the conventional buffer memory
  • FIG. 4 including FIGS. 4a and 4b is a block diagram illustrating one embodiment of the processing system for buffer memory according to the present invention
  • FIG. 5 is a block diagram illustrating the flow of information according to the method and system of the present invention.
  • FIG. 6 is a diagram illustrating the format of information in the address array portion according to the system of the present invention.
  • FIG. 7 is a diagram illustrating the format of the access address according to the system of the present invention.
  • FIG. 8 is a diagram illustrating the relationship in memory capacity between the data array portion and the address array portion.
  • a conventional buffer memory comprises an address array portion 1 and a data portion 2, as illustrated in FIG. 1.
  • Usually one block information unit 3 is transferred to the data portion 2 from the main memory and stored therein, while simultaneously a block address 4 is stored in the address array portion 2, which block address 4 corresponds to said block information unit 3 thus transferred and stored.
  • Access address information is provided for access to said block information unit in the associative memory by a processor, not shown.
  • Logically when said address array portion 1 is retrieved, and when a block address 4 which also corresponds to said access address information is present in said portion 1, a corresponding block unit of data or information 3 is read out from said data portion 2.
  • FIG. 2 illustrates a conventional buffer memory processing system, in which numerals 1-0 through 1-(n-1) each denote one associative unit as a component of the address array portion 1 of FIG. 1, and numerals 2-0 through 2-(n-1) each denote one associative unit as a component of the data portion 2 of FIG. 1.
  • the numeral 5 denotes an address register in which access address information is set, 6-0 through 6-(n-1) each denote a comparator circuit, 7-0 through 7-(n-1) each denote a block information unit corresponding to a block unit 3 illustrated in FIG. 1 and, 8-0 through 8-(n-1) each correspond to a block address 4 in FIG.
  • 1, 9 denotes a replace circuit for extracting, during an updating process, one block unit out of the block information units least accessed in the last or a recent access operation
  • 10 denotes a selecting circuit for extracting one of the block information units read out in parallel from the associative units 2-0 through 2-(n-1) of the data portion, according to an agreement signal from the comparator circuits 6-0 through 6-(n-1).
  • the upper address portion of said access address information set in the access address register 5 is input to each of comparator circuits 6-0 through 6-(n-1), and each of said comparator circuits compares between inputs, and produces an output indicating agreement if and when the inputs agree with each other.
  • the block information units 7-0 through 7-(n-1) are also all simultaneously read out from the data portion associative units 2-0 through 2-(n-1) in said access operation, and are delivered to the selecting circuit 10. If we suppose that the comparator circuit 6-0 produces an agreement output, the selecting circuit 10 as a result selects a block information unit 7-0 and transfers it to a processsor, not illustrated.
  • the replace circuit 9 carries out updating of information so that the block unit 7-0 is of highest priority. If said access operation indicates that the desired block information unit is not present, a block information unit least recently used in the access operation is deleted from the buffer memory by the replace circuit 9, in accordance with an LRU (least recently used) algorithm for instance, and a necessary block information unit is transferred to the buffer memory from the main memory.
  • LRU least recently used
  • FIG. 3 illustrates the flow of information through the conventional system for processing information in a block information unit.
  • numerals 1, 1-0 through 1-3, 2, 2-0 through 2-3, 3 and 4 correspond to identical numerals in FIG. 1 and FIG. 2.
  • Reference numeral 11 denote the main memory, V valid information, and B 0 , B 1 . . . ; B m , B m+1 , . . . block information units.
  • Information stored in main memory 11 is treated in block units, such as B 0 , B 1 , . . . ; B m , B m+1 , . . . .
  • a Set Associative System when block information units B 0 , B 1 , . . . , belonging to the zero set position of the main memory 11 are transferred to the buffer memory, they are transferred to and retained in the zero set position of the data portion of said buffer memory.
  • block information unit B 0 is transferred to the associative unit 2-0 of the data portion 2, while block information unit B m is transferred to the associative unit 2-1 thereof.
  • the block address "0 0" of the block information unit B 0 has its upper address portion "0" written into the associative unit 1-0 of the address array portion 1
  • the block address "1 0" of block information unit B m has its upper address portion "1” is written into the associative unit 1-1 of the address array portion 1.
  • Respective units of valid information V are written in the address array portion 1 for indicating whether the block information units B 0 , B m , etc. transferred into the buffer memory are valid. That is, if the valid information V indicates a logical output "0", the corresponding block information unit, B 0 for instance, is processed as invalid.
  • a plurality of block information units are stored in the data portion as a single information unit. This corresponds to an increased block size as described with reference to FIG. 1.
  • a block unit corresponding to a plurality of block information units as mentioned above will hereinafter be called “a module” or “module information unit” in the present invention.
  • numerals 21-0 through 21-(n-1) indicate an associative unit as a component of an address array portion corresponding to that of FIG. 1
  • 22-0 through 22-(n-1) each indicate to an associative unit as a component of a data portion corresponding to that of FIG. 1
  • 22-0-0, 22-0-1 through 22-(n-1)-0, 22-(n-1)-1 each represent a block information unit as a component of a module information unit corresponding to the block information unit 3 of FIG. 1.
  • reference numeral 25 denotes an address register in which access address information is set
  • 26-0 through 26-(n-1) denote comparator circuits
  • 28-0 through 28-(n-1) indicate module addresses
  • 29 represents a replace circuit
  • 31-0 through 31-(n-1) denote and 32-0 through 32-(n-1) selecting circuits
  • 33-0 through 33-(n-1) represent gate circuits.
  • module addresses 28-0 through 28-(n-1) are simultaneously read out by virtue of said access operation, and are delivered to the respective comparator circuits 26-0 through 26-(n-1).
  • the upper address 25a set in the address register 25 has been input to each of the comparator circuits 26-0 through 26-(n-1).
  • Each comparator circuit compares its respective module address with the upper address 25a, and produces an output to indicate agreement if said two addresses agree with each other.
  • the output from the comparator circuit is used to detect agreement relative to a block address in the module with the valid information, and the agreement output is delivered to the selecting circuit 30 (FIG. 4 b).
  • the module information units 22-0 through 22-(n-1) are all read out simultaneously, and a selected block information unit, which is selected in the module information units 22-0 through 22-(n-1), is applied to the selecting circuit 30.
  • the selecting circuit 30 selects a block information unit and transfers it to a processor, not illustrated.
  • FIG. 5 illustrates the flow of the information processed in a module unit by virtue of the method and system according to the present invention.
  • block information units B 0 , B 1 , or the block information unit B 0 alone are transferred to the associative unit 22-0 of the data array portion 22, and that the upper address array portion of the module address information corresponding to the module information unit including said block units B 0 , B 1 is written into the corresponding associative unit 21-0 in address array portion 21.
  • the block information units B 0 , B 1 are both proper and valid
  • the valid information V 0 , V 1 are both shown by logical outputs "1" for instance, to indicate the validity of the block information units B 0 , B 1 .
  • FIG. 6 is an illustration in detail of the information written in the address array portion 21 (FIG. 5).
  • Numeral 42 (FIG. 6) indicates information written in the address array portion 1 (FIG. 3) in the case where the buffer memory handles information in block unit (that is, the conventional art), in which the numeral 4 denotes a block address, and the symbol V denotes valid information.
  • Numeral 43 indicates information written in the address array portion 21 (FIG. 5) in the case where the buffer memory handles two block information units as one module, in which the numeral 28 indicates a module address corresponding to two block information units, and the symbols V 0 , V 1 indicate units of valid information corresponding to said respective block information units.
  • the buffer memory can have a capacity twice as large as that of the conventional buffer memory with the same address array portion as the conventional buffer memory.
  • Reference numeral 44 indicates information written in the address array portion 21 (FIG. 5) in the case where the buffer memory handles four block information units as one module, in which numeral 28 denotes a module address corresponding to four block information units, and V 0 , V 1 , V 2 and V 3 denote units of valid information corresponding to respective block information units.
  • the buffer memory can have a capacity four times as large as that of the conventional buffer memory with the same address array portion as the convention buffer memory.
  • Numeral 45 (FIG.
  • numeral 28 denotes a module address corresponding to two block information units
  • V 0 and V 1 indicate units of valid information corresponding to respective block information units
  • C 0 indicates a unit of change information which indicates that a block information unit (i.e., B 0 in the present case) corresponding to the information V 0 has been written
  • C 1 denotes another unit of change information indicating that a block information unit (i.e., B 1 ) corresponding to the information V 1 has been written.
  • FIG. 7 illustrates a manner in which access is carried out with reference to the access address information set in the address register 25 illustrated in FIG. 4.
  • reference numeral 46 indicates access address information, 47 an upper address portion, 48 a lower address portion, 49 a decoder, and the bit with an asterisk FIG. 7(B) a bit for selecting a block information unit.
  • FIG. 7(A) illustrates a manner in which access is carried out in the case where the buffer memory handles a block unit individually (that is, per the prior art method and system).
  • access to each of the associative units 1-0 through 1-(n-1) of the address array portion is achieved in the same manner as illustrated in FIG. 2, with reference to the lower address portion 48 of the access address information 46.
  • the information 42 indicated in FIG. 6 is read out from each associative unit.
  • the block address 4 is compared with the upper address 47. Only when they agree with each other, and when the valid information V indicates validity, does the associated comparator circuit produce an agreement output.
  • FIG. 7(B) illustrates a manner in which access is achieved in the case where the buffer memory handles two block information units as one so as to double the buffer memory capacity.
  • access to each of the associative units 21-0 through 21-(n-1) of the address array portion 21 is achieved as illustrated in FIG. 4, with reference to the lower address portion 48 of the access address information 46.
  • the information 43 indicated in FIG. 6 is read out from each associative unit.
  • the module address 28 and the upper address portion 47 illustrated in FIG. 7(B) are compared with each other. If the bit with the asterisk indicates a logical output "0", a check is carried out as to whether the valid information V 0 in the information 43 indicated in FIG. 6 indicates validity.
  • FIG. 7(C) illustrates a manner of access in the case where the buffer memory handles four block information units as one module so as to have a quadrupled capacity.
  • access to each of the associative units 21-0 through 21-(n-1) of the address array portion 21 is carried out in the same manner as illustrated in FIG. 4, with reference to the lower address portion 48 of the access address information 46. Consequently, the information 44 indicated in FIG. 6 is read out from each associative unit, followed by a comparison between the module address 28 and the upper address portion 47 of FIG. 7.
  • the corresponding comparator circuit 26-0, 26-(n-1) produce an agreement output signal.
  • this information will be hereinafter referred to.
  • the module information unit least accessed in the last access operation is extracted and deleted from the buffer memory by using the replace circuit 29 indicated in FIG. 4.
  • a mass of data which was required in said access operation is supplied from the main memory 11 (FIG. 5) and loaded into the buffer memory.
  • only one block information unit is loaded into the buffer memory instead of loading one whole module information unit thereinto at one time, so as to keep the buffer memory in a less busy (memory busy) state. More specifically, in the case illustrated in FIG. 5 for instance, suppose that the module information 23-0, 24-0 have been deleted, and that other module information units 23-k, 24-k (not shown) containing a block information unit B k1 (not shown) are to be loaded. In such case, the required block information unit B k alone is loaded into the associative unit 22-0 of the data portion 22 illustrated in FIG. 5.
  • the upper address "k" of the module address 28-k is written into the associative unit 21-0 of the address array portion 21.
  • said block information unit B k1 is located in a block unit which corresponds to the valid information V 1 with respect to the module information units 23-k, 24-k, the valid information V 1 is set to indicate validity, whereas the other valid information V 0 is set to indicate invalidity.
  • said block information unit B k0 is loaded into the associative unit 22-0 of the data portion 22, and the valid information V 0 is set to indicate validity. It should, of course, be understood that said loading of the other block information unit B k0 can be effected only when access to the main memory 11 (FIG. 5) is temporarily interrupted.
  • the frequency of the memory busy states can be largely decreased.
  • process control is achieved based on a control table (not shown in the drawing). That is, if a block information unit identical to said invalid block information unit has been supplied from the main memory, two or more identical block information units do not exist together in the data portion.
  • the above-mentioned problem with this system can be settled by providing change information C 0 , C 1 , etc. among the information written in the address array portion 1, such being indicated as information 45 in FIG. 6.
  • the change information Ci is updated to provide a logical value "1" (for instance), indicating the block information unit, the data of which has been exchanged.
  • a logical value "1" for instance
  • the module addresses 28 written in the address array portion 21 indicate the presence of a plurality of block information units 23-0, 24-0, etc., and the valid information V 0 , V 1 indicate whether the plural block information units 23-0, 24-0, etc. are actually present.
  • the module addresses have a smaller number of bits. Thus, there is no change in the capacity of the address array portion 21 (FIG. 8).

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Memory System Of A Hierarchy Structure (AREA)
  • Multi Processors (AREA)
US05/967,591 1977-12-27 1978-12-08 Method and system for operating an associative memory Expired - Lifetime US4244033A (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP52/158223 1977-12-27
JP15822377A JPS5489444A (en) 1977-12-27 1977-12-27 Associative memory processing system

Publications (1)

Publication Number Publication Date
US4244033A true US4244033A (en) 1981-01-06

Family

ID=15666965

Family Applications (1)

Application Number Title Priority Date Filing Date
US05/967,591 Expired - Lifetime US4244033A (en) 1977-12-27 1978-12-08 Method and system for operating an associative memory

Country Status (5)

Country Link
US (1) US4244033A (ko)
JP (1) JPS5489444A (ko)
DE (1) DE2856133C2 (ko)
FR (1) FR2413751B1 (ko)
GB (1) GB2011137B (ko)

Cited By (44)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4491932A (en) * 1981-10-01 1985-01-01 Yeda Research & Development Co. Ltd. Associative processor particularly useful for tomographic image reconstruction
EP0184774A2 (de) * 1984-12-14 1986-06-18 Alcatel N.V. Speicheranordnung und eine Speicheranordnung enthaltende Koppelstufe zum Herstellen von dynamisch zugeordneten Verbindungswegen
EP0251056A2 (en) * 1986-06-27 1988-01-07 Hewlett-Packard Company Cache tag lookaside
US4780855A (en) * 1984-06-21 1988-10-25 Nec Corporation System for controlling a nonvolatile memory having a data portion and a corresponding indicator portion
US4876646A (en) * 1984-12-24 1989-10-24 Hitachi, Ltd. Data processor having multilevel address translation tables
US4879687A (en) * 1986-06-13 1989-11-07 Matsushita Electric Industrial Co., Ltd. Memory device having valid bit storage units to be reset in batch
US5014240A (en) * 1986-08-01 1991-05-07 Fujitsu Limited Semiconductor memory device
US5279564A (en) * 1992-09-11 1994-01-18 Edward Weck Incorporated Cannula retention device
US5317708A (en) * 1990-06-29 1994-05-31 Digital Equipment Corporation Apparatus and method for an improved content addressable memory
WO1996017299A1 (en) * 1994-12-01 1996-06-06 Cray Research, Inc. Scalar data cache for a vector processor
US5809535A (en) * 1995-04-14 1998-09-15 Nec Corporation Cache memory control apparatus utilizing a bit as a second valid bit in a tag in a first mode and as an additional address bit in a second mode
US6137707A (en) * 1999-03-26 2000-10-24 Netlogic Microsystems Method and apparatus for simultaneously performing a plurality of compare operations in content addressable memory device
US6148364A (en) * 1997-12-30 2000-11-14 Netlogic Microsystems, Inc. Method and apparatus for cascading content addressable memory devices
US6219748B1 (en) 1998-05-11 2001-04-17 Netlogic Microsystems, Inc. Method and apparatus for implementing a learn instruction in a content addressable memory device
US6240485B1 (en) 1998-05-11 2001-05-29 Netlogic Microsystems, Inc. Method and apparatus for implementing a learn instruction in a depth cascaded content addressable memory system
US6324087B1 (en) 2000-06-08 2001-11-27 Netlogic Microsystems, Inc. Method and apparatus for partitioning a content addressable memory device
US6381673B1 (en) 1998-07-06 2002-04-30 Netlogic Microsystems, Inc. Method and apparatus for performing a read next highest priority match instruction in a content addressable memory device
US6418042B1 (en) 1997-10-30 2002-07-09 Netlogic Microsystems, Inc. Ternary content addressable memory with compare operand selected according to mask value
US20020129198A1 (en) * 1999-09-23 2002-09-12 Nataraj Bindiganavale S. Content addressable memory with block-programmable mask write mode, word width and priority
US6460112B1 (en) 1999-02-23 2002-10-01 Netlogic Microsystems, Llc Method and apparatus for determining a longest prefix match in a content addressable memory device
US20020161969A1 (en) * 1999-09-23 2002-10-31 Nataraj Bindiganavale S. Content addressable memory with programmable word width and programmable priority
US6499081B1 (en) 1999-02-23 2002-12-24 Netlogic Microsystems, Inc. Method and apparatus for determining a longest prefix match in a segmented content addressable memory device
US6539455B1 (en) 1999-02-23 2003-03-25 Netlogic Microsystems, Inc. Method and apparatus for determining an exact match in a ternary content addressable memory device
US6542391B2 (en) 2000-06-08 2003-04-01 Netlogic Microsystems, Inc. Content addressable memory with configurable class-based storage partition
US6567340B1 (en) 1999-09-23 2003-05-20 Netlogic Microsystems, Inc. Memory storage cell based array of counters
US6574702B2 (en) 1999-02-23 2003-06-03 Netlogic Microsystems, Inc. Method and apparatus for determining an exact match in a content addressable memory device
US6687785B1 (en) 2000-06-08 2004-02-03 Netlogic Microsystems, Inc. Method and apparatus for re-assigning priority in a partitioned content addressable memory device
US6751701B1 (en) 2000-06-14 2004-06-15 Netlogic Microsystems, Inc. Method and apparatus for detecting a multiple match in an intra-row configurable CAM system
US6754766B1 (en) * 2002-02-14 2004-06-22 Altera Corporation Emulation of content-addressable memories
US6757779B1 (en) 1999-09-23 2004-06-29 Netlogic Microsystems, Inc. Content addressable memory with selectable mask write mode
US6763425B1 (en) 2000-06-08 2004-07-13 Netlogic Microsystems, Inc. Method and apparatus for address translation in a partitioned content addressable memory device
US6795892B1 (en) 2000-06-14 2004-09-21 Netlogic Microsystems, Inc. Method and apparatus for determining a match address in an intra-row configurable cam device
US6799243B1 (en) 2000-06-14 2004-09-28 Netlogic Microsystems, Inc. Method and apparatus for detecting a match in an intra-row configurable cam system
US20040193741A1 (en) * 1999-09-23 2004-09-30 Pereira Jose P. Priority circuit for content addressable memory
US6892272B1 (en) 1999-02-23 2005-05-10 Netlogic Microsystems, Inc. Method and apparatus for determining a longest prefix match in a content addressable memory device
US7110407B1 (en) 1999-09-23 2006-09-19 Netlogic Microsystems, Inc. Method and apparatus for performing priority encoding in a segmented classification system using enable signals
US7110408B1 (en) 1999-09-23 2006-09-19 Netlogic Microsystems, Inc. Method and apparatus for selecting a most signficant priority number for a device using a partitioned priority index table
US7185141B1 (en) 2001-12-27 2007-02-27 Netlogic Microsystems, Inc. Apparatus and method for associating information values with portions of a content addressable memory (CAM) device
US7401180B1 (en) 2001-12-27 2008-07-15 Netlogic Microsystems, Inc. Content addressable memory (CAM) device having selectable access and method therefor
US7487200B1 (en) 1999-09-23 2009-02-03 Netlogic Microsystems, Inc. Method and apparatus for performing priority encoding in a segmented classification system
US7848129B1 (en) 2008-11-20 2010-12-07 Netlogic Microsystems, Inc. Dynamically partitioned CAM array
US7920399B1 (en) 2010-10-21 2011-04-05 Netlogic Microsystems, Inc. Low power content addressable memory device having selectable cascaded array segments
US8073005B1 (en) 2001-12-27 2011-12-06 Cypress Semiconductor Corporation Method and apparatus for configuring signal lines according to idle codes
US8467213B1 (en) 2011-03-22 2013-06-18 Netlogic Microsystems, Inc. Power limiting in a content search system

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5567987A (en) * 1978-11-09 1980-05-22 Hitachi Ltd Memory control system
DE2934771C3 (de) * 1979-08-28 1982-03-25 Siemens AG, 1000 Berlin und 8000 München Speichervorrichtung.
JPS57167188A (en) * 1981-04-06 1982-10-14 Nippon Telegr & Teleph Corp <Ntt> Buffer memory controlling system
US4504902A (en) * 1982-03-25 1985-03-12 At&T Bell Laboratories Cache arrangement for direct memory access block transfer
JP5231867B2 (ja) * 2008-05-23 2013-07-10 株式会社東芝 キャッシュメモリシステム

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3868642A (en) * 1971-08-25 1975-02-25 Siemens Ag Hierrarchial associative memory system
US4063081A (en) * 1976-06-08 1977-12-13 Honeywell Computer apparatus

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3588829A (en) * 1968-11-14 1971-06-28 Ibm Integrated memory system with block transfer to a buffer store
US3735360A (en) * 1971-08-25 1973-05-22 Ibm High speed buffer operation in a multi-processing system
US3967247A (en) * 1974-11-11 1976-06-29 Sperry Rand Corporation Storage interface unit

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3868642A (en) * 1971-08-25 1975-02-25 Siemens Ag Hierrarchial associative memory system
US4063081A (en) * 1976-06-08 1977-12-13 Honeywell Computer apparatus

Cited By (69)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4491932A (en) * 1981-10-01 1985-01-01 Yeda Research & Development Co. Ltd. Associative processor particularly useful for tomographic image reconstruction
US4780855A (en) * 1984-06-21 1988-10-25 Nec Corporation System for controlling a nonvolatile memory having a data portion and a corresponding indicator portion
EP0184774A2 (de) * 1984-12-14 1986-06-18 Alcatel N.V. Speicheranordnung und eine Speicheranordnung enthaltende Koppelstufe zum Herstellen von dynamisch zugeordneten Verbindungswegen
US4656626A (en) * 1984-12-14 1987-04-07 Itt Corporation Apparatus and method for providing dynamically assigned switch paths
EP0184774A3 (de) * 1984-12-14 1988-09-21 Alcatel N.V. Speicheranordnung und eine Speicheranordnung enthaltende Koppelstufe zum Herstellen von dynamisch zugeordneten Verbindungswegen
US4876646A (en) * 1984-12-24 1989-10-24 Hitachi, Ltd. Data processor having multilevel address translation tables
US4879687A (en) * 1986-06-13 1989-11-07 Matsushita Electric Industrial Co., Ltd. Memory device having valid bit storage units to be reset in batch
EP0251056A3 (en) * 1986-06-27 1989-10-18 Hewlett-Packard Company Cache tag lookaside
EP0251056A2 (en) * 1986-06-27 1988-01-07 Hewlett-Packard Company Cache tag lookaside
US5014240A (en) * 1986-08-01 1991-05-07 Fujitsu Limited Semiconductor memory device
US5317708A (en) * 1990-06-29 1994-05-31 Digital Equipment Corporation Apparatus and method for an improved content addressable memory
US5806083A (en) * 1990-06-29 1998-09-08 Digital Equipment Corporation Apparatus and method for an improved content addressable memory using a random access memory to generate match information
US5279564A (en) * 1992-09-11 1994-01-18 Edward Weck Incorporated Cannula retention device
EP1202180A1 (en) * 1994-12-01 2002-05-02 Silicon Graphics, Inc. Scalar data cache for a vector processor
WO1996017299A1 (en) * 1994-12-01 1996-06-06 Cray Research, Inc. Scalar data cache for a vector processor
US5717895A (en) * 1994-12-01 1998-02-10 Cray Research, Inc. Associative scalar data cache with write-through capabilities for a vector processor
US5809535A (en) * 1995-04-14 1998-09-15 Nec Corporation Cache memory control apparatus utilizing a bit as a second valid bit in a tag in a first mode and as an additional address bit in a second mode
US6961810B2 (en) 1997-10-30 2005-11-01 Netlogic Microsystems, Inc. Synchronous content addressable memory
US20060010284A1 (en) * 1997-10-30 2006-01-12 Varadarajan Srinivasan Synchronous content addressable memory
US6697911B2 (en) 1997-10-30 2004-02-24 Netlogic Microsystems, Inc. Synchronous content addressable memory
US6418042B1 (en) 1997-10-30 2002-07-09 Netlogic Microsystems, Inc. Ternary content addressable memory with compare operand selected according to mask value
US6678786B2 (en) 1997-10-30 2004-01-13 Netlogic Microsystems, Inc. Timing execution of compare instructions in a synchronous content addressable memory
US20040139276A1 (en) * 1997-10-30 2004-07-15 Varadarajan Srinivasan Synchronous content addressable memory
US6148364A (en) * 1997-12-30 2000-11-14 Netlogic Microsystems, Inc. Method and apparatus for cascading content addressable memory devices
US6219748B1 (en) 1998-05-11 2001-04-17 Netlogic Microsystems, Inc. Method and apparatus for implementing a learn instruction in a content addressable memory device
US6240485B1 (en) 1998-05-11 2001-05-29 Netlogic Microsystems, Inc. Method and apparatus for implementing a learn instruction in a depth cascaded content addressable memory system
US6564289B2 (en) 1998-07-06 2003-05-13 Netlogic Microsystems, Inc. Method and apparatus for performing a read next highest priority match instruction in a content addressable memory device
US6381673B1 (en) 1998-07-06 2002-04-30 Netlogic Microsystems, Inc. Method and apparatus for performing a read next highest priority match instruction in a content addressable memory device
US6499081B1 (en) 1999-02-23 2002-12-24 Netlogic Microsystems, Inc. Method and apparatus for determining a longest prefix match in a segmented content addressable memory device
US6539455B1 (en) 1999-02-23 2003-03-25 Netlogic Microsystems, Inc. Method and apparatus for determining an exact match in a ternary content addressable memory device
US6892272B1 (en) 1999-02-23 2005-05-10 Netlogic Microsystems, Inc. Method and apparatus for determining a longest prefix match in a content addressable memory device
US6460112B1 (en) 1999-02-23 2002-10-01 Netlogic Microsystems, Llc Method and apparatus for determining a longest prefix match in a content addressable memory device
US6574702B2 (en) 1999-02-23 2003-06-03 Netlogic Microsystems, Inc. Method and apparatus for determining an exact match in a content addressable memory device
US6137707A (en) * 1999-03-26 2000-10-24 Netlogic Microsystems Method and apparatus for simultaneously performing a plurality of compare operations in content addressable memory device
US6934795B2 (en) 1999-09-23 2005-08-23 Netlogic Microsystems, Inc. Content addressable memory with programmable word width and programmable priority
US6944709B2 (en) 1999-09-23 2005-09-13 Netlogic Microsystems, Inc. Content addressable memory with block-programmable mask write mode, word width and priority
US7487200B1 (en) 1999-09-23 2009-02-03 Netlogic Microsystems, Inc. Method and apparatus for performing priority encoding in a segmented classification system
US7272027B2 (en) 1999-09-23 2007-09-18 Netlogic Microsystems, Inc. Priority circuit for content addressable memory
US7246198B2 (en) 1999-09-23 2007-07-17 Netlogic Microsystems, Inc. Content addressable memory with programmable word width and programmable priority
US7143231B1 (en) 1999-09-23 2006-11-28 Netlogic Microsystems, Inc. Method and apparatus for performing packet classification for policy-based packet routing
US7110408B1 (en) 1999-09-23 2006-09-19 Netlogic Microsystems, Inc. Method and apparatus for selecting a most signficant priority number for a device using a partitioned priority index table
US6757779B1 (en) 1999-09-23 2004-06-29 Netlogic Microsystems, Inc. Content addressable memory with selectable mask write mode
US7110407B1 (en) 1999-09-23 2006-09-19 Netlogic Microsystems, Inc. Method and apparatus for performing priority encoding in a segmented classification system using enable signals
US6567340B1 (en) 1999-09-23 2003-05-20 Netlogic Microsystems, Inc. Memory storage cell based array of counters
US20050262295A1 (en) * 1999-09-23 2005-11-24 Nataraj Bindiganavale S Content addressable memory with programmable word width and programmable priority
US20020129198A1 (en) * 1999-09-23 2002-09-12 Nataraj Bindiganavale S. Content addressable memory with block-programmable mask write mode, word width and priority
US20040193741A1 (en) * 1999-09-23 2004-09-30 Pereira Jose P. Priority circuit for content addressable memory
US20020161969A1 (en) * 1999-09-23 2002-10-31 Nataraj Bindiganavale S. Content addressable memory with programmable word width and programmable priority
US7230840B2 (en) 2000-06-08 2007-06-12 Netlogic Microsystems, Inc. Content addressable memory with configurable class-based storage partition
US6542391B2 (en) 2000-06-08 2003-04-01 Netlogic Microsystems, Inc. Content addressable memory with configurable class-based storage partition
US6831850B2 (en) 2000-06-08 2004-12-14 Netlogic Microsystems, Inc. Content addressable memory with configurable class-based storage partition
US6687785B1 (en) 2000-06-08 2004-02-03 Netlogic Microsystems, Inc. Method and apparatus for re-assigning priority in a partitioned content addressable memory device
US20030123270A1 (en) * 2000-06-08 2003-07-03 Pereira Jose P. Content addressable memory with configurable class-based storage partition
US20050063241A1 (en) * 2000-06-08 2005-03-24 Pereira Jose P. Content addressable memory with configurable class-based storage partition
US6324087B1 (en) 2000-06-08 2001-11-27 Netlogic Microsystems, Inc. Method and apparatus for partitioning a content addressable memory device
US6763425B1 (en) 2000-06-08 2004-07-13 Netlogic Microsystems, Inc. Method and apparatus for address translation in a partitioned content addressable memory device
US6711041B2 (en) 2000-06-08 2004-03-23 Netlogic Microsystems, Inc. Content addressable memory with configurable class-based storage partition
US20040100811A1 (en) * 2000-06-08 2004-05-27 Pereira Jose P. Content addressable memory with configurable class-based storage partition
US6795892B1 (en) 2000-06-14 2004-09-21 Netlogic Microsystems, Inc. Method and apparatus for determining a match address in an intra-row configurable cam device
US6751701B1 (en) 2000-06-14 2004-06-15 Netlogic Microsystems, Inc. Method and apparatus for detecting a multiple match in an intra-row configurable CAM system
US6799243B1 (en) 2000-06-14 2004-09-28 Netlogic Microsystems, Inc. Method and apparatus for detecting a match in an intra-row configurable cam system
US7185141B1 (en) 2001-12-27 2007-02-27 Netlogic Microsystems, Inc. Apparatus and method for associating information values with portions of a content addressable memory (CAM) device
US7401180B1 (en) 2001-12-27 2008-07-15 Netlogic Microsystems, Inc. Content addressable memory (CAM) device having selectable access and method therefor
US8073005B1 (en) 2001-12-27 2011-12-06 Cypress Semiconductor Corporation Method and apparatus for configuring signal lines according to idle codes
US6754766B1 (en) * 2002-02-14 2004-06-22 Altera Corporation Emulation of content-addressable memories
US7848129B1 (en) 2008-11-20 2010-12-07 Netlogic Microsystems, Inc. Dynamically partitioned CAM array
US7920399B1 (en) 2010-10-21 2011-04-05 Netlogic Microsystems, Inc. Low power content addressable memory device having selectable cascaded array segments
US8467213B1 (en) 2011-03-22 2013-06-18 Netlogic Microsystems, Inc. Power limiting in a content search system
US9025354B2 (en) 2011-03-22 2015-05-05 Broadcom Corporation Power limiting in a content search system

Also Published As

Publication number Publication date
JPS5489444A (en) 1979-07-16
DE2856133A1 (de) 1979-06-28
JPS5712222B2 (ko) 1982-03-09
GB2011137B (en) 1982-05-12
FR2413751A1 (fr) 1979-07-27
GB2011137A (en) 1979-07-04
FR2413751B1 (fr) 1985-09-13
DE2856133C2 (de) 1987-02-12

Similar Documents

Publication Publication Date Title
US4244033A (en) Method and system for operating an associative memory
US4426682A (en) Fast cache flush mechanism
US3699533A (en) Memory system including buffer memories
EP0009938B1 (en) Computing systems having high-speed cache memories
US5109496A (en) Most recently used address translation system with least recently used (LRU) replacement
US3938100A (en) Virtual addressing apparatus for addressing the memory of a computer utilizing associative addressing techniques
EP0019358B1 (en) Hierarchical data storage system
US3949369A (en) Memory access technique
JP2603476B2 (ja) データ取り出し方法
US5537571A (en) Control device for a buffer memory with reconfigurable partitioning
US5668972A (en) Method and system for efficient miss sequence cache line allocation utilizing an allocation control cell state to enable a selected match line
US7054994B2 (en) Multiple-RAM CAM device and method therefor
US4550367A (en) Data processing system having hierarchical memories
US10877902B2 (en) Cuckoo caching
US3949368A (en) Automatic data priority technique
US5313602A (en) Multiprocessor system and method of control over order of transfer of data between buffer storages
US5717916A (en) Method for providing an improved fully associative cache memory having a finite state machine and linked list structure
US4942521A (en) Microprocessor with a cache memory in which validity flags for first and second data areas are simultaneously readable
US5136702A (en) Buffer storage control method and apparatus
US4802125A (en) Memory access control apparatus
US4424564A (en) Data processing system providing dual storage of reference bits
JPS6015971B2 (ja) 緩衝記憶装置
US6496903B1 (en) Cache memory device
JP3028620B2 (ja) アドレス変換緩衝回路
JPS6049949B2 (ja) アドレス履歴装置