← Back to Patent Explorer
US3685020A Expired / Lapsed US ⏱️ 0.0 years remaining

Compound and multilevel memories

Assignee: Cogar Corp
•
Filing: 1970-05-25
•
Granted: 1972-08-15
•
Expires: 1990-05-25
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Multilevel memory systems and compound memories. A compound memory includes a random access array with an associative array as part of its accessing means. A match in the associative array between an effective address, identifying an addressed information block, and an associative array word directly energizes corresponding random access array locations which contain the addressed information block. Multilevel memory systems include embodiments such as a compound buffer memory with a backing memory, a compound transformation memory, nested memories with more than two levels, and multilevel control memories.

Inventors

  • 👤 Robert M Meade

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-22 19:51
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0893; G06F12/0897; G11; G11C; G11C15/00; G11C15/04

Claims Analysis

Total Claims: 18
Claim 1
Independent Claim 88 words
In an information processing system, a compound memory comprising a random access memory array comprising storage locations for the storage of blocks of words, and an associative memory array comprising storage locations for the storage of a plurality of words with each of said plurality of word storage locations being directly connected to a corresponding storage location defining a block of words in said random access array whereby access to the random access array is achieved using the associate array without the necessity for an intervening addressing element.
Claim 2
Dependent Claim 88 words
In an information processing system, a compound memory comprising a random access memory array comprising storage locations for the storage of blocks of words, and an associative memory array comprising storage locations for the storage of a plurality of words with each of said plurality of word storage locations being directly connected to a corresponding storage location defining a block of words in said random access array whereby access to the random access array is achieved using the associate array without the necessity for an intervening addressing element.
Claim 3
Dependent Claim 139 words
A memory hierarchy comprising at least two levels of memories, at least one of said two levels of memories including a compound memory comprising a random access memory array comprising storage locations for the storage of blocks of words, and an associative memory array comprising storage locations for the storage of a plurality of words with each of said plurality of word storage locations being directly connected to a corresponding storage location defining a block of words in said random access array whereby access to the random access array is achieved using the associate array without the necessity for an intervening addressing element; and addressing means connected to said two levels of memories for addressing the other level of said two levels of memories when an addressed block of words is not accessed from said one level of memory.
Claim 4
Dependent Claim 139 words
A memory hierarchy comprising at least two levels of memories, at least one of said two levels of memories including a compound memory comprising a random access memory array comprising storage locations for the storage of blocks of words, and an associative memory array comprising storage locations for the storage of a plurality of words with each of said plurality of word storage locations being directly connected to a corresponding storage location defining a block of words in said random access array whereby access to the random access array is achieved using the associate array without the necessity for an intervening addressing element; and addressing means connected to said two levels of memories for addressing the other level of said two levels of memories when an addressed block of words is not accessed from said one level of memory.
Claim 5
Dependent Claim 130 words
An information processing system including a control section having control memories providing control words and a data section having a data memory providing data words connected to said control section and controlled by said control words, said control section comprises, a first control memory comprising storage locations having stored therein a number of blocks of control words; a backup control memory comprising an additional number of storage locations having stored therein blocks of control words; addressing means for directly providing the same addresses to said first control memory and said backup control memory independently of said data section when an addressed block of words is not contained in said first control memory; and means for transferring blocks of control words from said backup control memory to said first control memory.
Claim 6
Dependent Claim 130 words
An information processing system including a control section having control memories providing control words and a data section having a data memory providing data words connected to said control section and controlled by said control words, said control section comprises, a first control memory comprising storage locations having stored therein a number of blocks of control words; a backup control memory comprising an additional number of storage locations having stored therein blocks of control words; addressing means for directly providing the same addresses to said first control memory and said backup control memory independently of said data section when an addressed block of words is not contained in said first control memory; and means for transferring blocks of control words from said backup control memory to said first control memory.
Claim 7
Dependent Claim 124 words
A multilevel memory hierarchy comprising, first, second, and third memories, each of said memories having common addresses for accessing corresponding blocks of words and each said memory operating at a different speed; addressing means connected to each said memory for addressing said blocks of words in parallel; first transfer means for transferring addressed information blocks of words of a first size between said first and second memories; and second transfer means for transferring addressed information blocks of words of a second size between said second and third memories, whereby a block of words desired from said first memory is transferred to said first memory from either the second or third memory when such desired block of words is not contained in said first memory.
Claim 8
Dependent Claim 124 words
A multilevel memory hierarchy comprising, first, second, and third memories, each of said memories having common addresses for accessing corresponding blocks of words and each said memory operating at a different speed; addressing means connected to each said memory for addressing said blocks of words in parallel; first transfer means for transferring addressed information blocks of words of a first size between said first and second memories; and second transfer means for transferring addressed information blocks of words of a second size between said second and third memories, whereby a block of words desired from said first memory is transferred to said first memory from either the second or third memory when such desired block of words is not contained in said first memory.
Claim 9
Independent Claim 89 words
A method of accessing data words contained in a randomly addressed memory array comprising comparing an address word defining the location of one of said data words against a number of words within an associative memory array so as to detect identity and non-identity; and directly selecting a block of data words in said randomly addressed memory array corresponding to the word within said associative memory array that is identical to at least a portion of said address word, said block of data words being defined by storage locations.
Claim 10
Independent Claim 89 words
A method of accessing data words contained in a randomly addressed memory array comprising comparing an address word defining the location of one of said data words against a number of words within an associative memory array so as to detect identity and non-identity; and directly selecting a block of data words in said randomly addressed memory array corresponding to the word within said associative memory array that is identical to at least a portion of said address word, said block of data words being defined by storage locations.
Claim 11
Dependent Claim 147 words
A compound memory comprising a random memory access array comprising a plurality of storage locations for the storage of blocks of words and including a plurality of accessing means, one for each block of words; asSociative memory array means including a plurality of storage locations for the storage of associative words wherein one associative word is provided for each one of said plurality of blocks of words and including a plurality of match identifier elements wherein there is one match identifier element for each associative word, one of said match identifier elements being energized when the bits of an input address are identical to the bits of its corresponding associative word; and means directly connecting each of said match identifier elements to a corresponding one of said accessing means to permit an energized one of said match identifier elements to directly access the corresponding block of words.
Claim 12
Dependent Claim 147 words
A compound memory comprising a random memory access array comprising a plurality of storage locations for the storage of blocks of words and including a plurality of accessing means, one for each block of words; asSociative memory array means including a plurality of storage locations for the storage of associative words wherein one associative word is provided for each one of said plurality of blocks of words and including a plurality of match identifier elements wherein there is one match identifier element for each associative word, one of said match identifier elements being energized when the bits of an input address are identical to the bits of its corresponding associative word; and means directly connecting each of said match identifier elements to a corresponding one of said accessing means to permit an energized one of said match identifier elements to directly access the corresponding block of words.
Claim 13
Dependent Claim 149 words
An information processing system comprising a main memory having physical memory storage locations providing words of data; means for generating addresses comprising a number of bits, said addresses defining data contained in said main memory; means for changing the addresses generated by said address generating means into different addresses representing physical memory storage locations of said main memory, said address changing means comprising a compound memory; said compound memory comprising a random access memory array comprising storage locations for the storage of blocks of words, and an associative memory array comprising storage locations for the storage of a plurality of words with each of said plurality of word storage locations being directly connected to a corresponding storage location defining a block of words in said random access array whereby access to the random access array is achieved using the associate array without the necessity for an intervening addressing element.
Claim 14
Dependent Claim 149 words
An information processing system comprising a main memory having physical memory storage locations providing words of data; means for generating addresses comprising a number of bits, said addresses defining data contained in said main memory; means for changing the addresses generated by said address generating means into different addresses representing physical memory storage locations of said main memory, said address changing means comprising a compound memory; said compound memory comprising a random access memory array comprising storage locations for the storage of blocks of words, and an associative memory array comprising storage locations for the storage of a plurality of words with each of said plurality of word storage locations being directly connected to a corresponding storage location defining a block of words in said random access array whereby access to the random access array is achieved using the associate array without the necessity for an intervening addressing element.
Claim 15
Independent Claim 149 words
A method of accessing information in a data processing system having a plurality of directly connected memories comprising the steps of, generating an address of a block of words stored within a plurality of random access arrays of said data processing system, said block of words being defined by storage locations; interrogating a first associative array of said system with said address so as to directly access said block of words from a first random access memory array of said system when said first associative array includes a word identical to at least a portion of said address; and interrogating a second associative array of said system with at least a portion of said address when said block of words is not accessed in said first random access memory array so as to directly access said block of words from a second random access memory array of said system.
Claim 16
Independent Claim 149 words
A method of accessing information in a data processing system having a plurality of directly connected memories comprising the steps of, generating an address of a block of words stored within a plurality of random access arrays of said data processing system, said block of words being defined by storage locations; interrogating a first associative array of said system with said address so as to directly access said block of words from a first random access memory array of said system when said first associative array includes a word identical to at least a portion of said address; and interrogating a second associative array of said system with at least a portion of said address when said block of words is not accessed in said first random access memory array so as to directly access said block of words from a second random access memory array of said system.
Claim 17
Dependent Claim 114 words
A data processing system comprising a main memory comprising a random access memory array comprising storage locations for the storage of blocks of words, and an associative memory array comprising storage locations for the storage of a plurality of words with each of said plurality of word storage locations being directly connected to a corresponding storage location defining a block of words in said random access array whereby access to the random access array is achieved using the associate array without the necessity for an intervening addressing element; means for generating addresses for accessing blocks of words in said main memory; and data utilization means for utilizing the data contained in said main memory.
Claim 18
Dependent Claim 114 words
A data processing system comprising a main memory comprising a random access memory array comprising storage locations for the storage of blocks of words, and an associative memory array comprising storage locations for the storage of a plurality of words with each of said plurality of word storage locations being directly connected to a corresponding storage location defining a block of words in said random access array whereby access to the random access array is achieved using the associate array without the necessity for an intervening addressing element; means for generating addresses for accessing blocks of words in said main memory; and data utilization means for utilizing the data contained in said main memory.

References Cited (Backward Citations)

US26624A Cited
US3275991A Cited
US3349375A Cited
US3402399A Cited
US3387272A Cited
US3387274A Cited
US3456243A Cited
US3540002A Cited
US3566358A Cited
US3553659A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1975-08-15 1976-02-14 1976-08-15 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1979-08-15 1980-02-14 1980-08-15 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1983-08-15 1984-02-14 1984-08-15 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag