Patent BE520780A successfully refreshed from Google Patents.
Patent US5479640A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5479640A Expired / Lapsed US ⏱️ 0.0 years remaining

Memory access system including a memory controller with memory redrive circuitry

Assignee: International Business Machines Corp
•
Filing: 1993-06-30
•
Granted: 1995-12-26
•
Expires: 2013-06-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A memory access system for improving memory access when addressing dynamic random access modules (DRAMs). The memory access system includes a main memory and a memory controller. To improve memory access, both the memory controller and the main memory hardware remember the row address of the last access. Macro operation commands for fetch and store contain the last row address. The main memory hardware redrives that row address to the DRAMs after completion of an access, so that the memory controller need not provide a row address to the memory for each command of a command sequence.

Inventors

  • 👤 Frank P. Cartman
  • 👤 Brian W. Curran
  • 👤 Matthew A. Krygowski
  • 👤 Tin-Chee Lo
  • 👤 Sandy N. Luu
  • 👤 Sanjay B. Patel
  • 👤 William W. Shen

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 00:48
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/0215; G11; G11C; G11C11/00; G11C11/21; G11C11/34; G11C11/40; G11C11/401; G11C11/4063; G11C11/407; G11C11/408; G11C8/00

Claims Analysis

Total Claims: 13
Claim 1
Independent Claim 256 words
A memory access system, comprising: a. memory means for storing data, said memory means having a plurality of storage locations, each of said location being specified by a row and column address; b. a memory controller for performing a macro operation, said memory controller receiving a first row address of said row address and a first column address of said column address and executing a predetermined plurality of commands utilizing said first row address and column address, wherein said first row address and said first column address are reused during the macro operation for commands subsequent to a first command of said plurality of commands; wherein each of said commands including a command code, and said macro operation including a macro code; and said plurality of commands including fetch and store commands to fetch and store data to and from said memory means: said memory controller comprising: 1) a system timing unit for controlling the system timing; 2) a row and column address strobes generating means, coupled to the system timing unit, for generating a row address strobe (RAS) and a column address strobe (CAS), using said first row address and first column address; 3) special code detector, coupled to said system timing unit, for loading a predetermined count into said system timing means, when a predetermined condition exists. as determined by said special code detector; said system timing unit starts counting at said predetermined count and whereby said RAS is immediately activated, wherein said predetermined condition is when a command code match said macro code.
Claim 2
Dependent Claim 256 words
A memory access system, comprising: a. memory means for storing data, said memory means having a plurality of storage locations, each of said location being specified by a row and column address; b. a memory controller for performing a macro operation, said memory controller receiving a first row address of said row address and a first column address of said column address and executing a predetermined plurality of commands utilizing said first row address and column address, wherein said first row address and said first column address are reused during the macro operation for commands subsequent to a first command of said plurality of commands; wherein each of said commands including a command code, and said macro operation including a macro code; and said plurality of commands including fetch and store commands to fetch and store data to and from said memory means: said memory controller comprising: 1) a system timing unit for controlling the system timing; 2) a row and column address strobes generating means, coupled to the system timing unit, for generating a row address strobe (RAS) and a column address strobe (CAS), using said first row address and first column address; 3) special code detector, coupled to said system timing unit, for loading a predetermined count into said system timing means, when a predetermined condition exists. as determined by said special code detector; said system timing unit starts counting at said predetermined count and whereby said RAS is immediately activated, wherein said predetermined condition is when a command code match said macro code.
Claim 3
Dependent Claim 26 words
A memory access system as in claim 1 wherein said row address strobe is inactive until said means controller a command of said plurality of commands.
Claim 4
Dependent Claim 24 words
A memory access system as in claim 1 wherein said plurality of commands includes a COMP-RECOMP command sequence for detecting and correcting data errors.
Claim 5
Dependent Claim 40 words
A memory access system as in claim 3 wherein said COMP-RECOMP command sequence includes a first set of atomically coupled macro commands including a first fetch retry, a first store retry, a second fetch retry, and a second store retry.
Claim 6
Dependent Claim 18 words
A memory access system as in claim 4 wherein said COMP-RECOMP command sequence fixes a vector buffer error.
Claim 7
Dependent Claim 20 words
A memory access system as in claim 5, wherein operations are performed on a double line basis using double words.
Claim 8
Dependent Claim 124 words
A memory access system as in claim 6, wherein said first fetch retry command detects double word errors and directs loading of said double words from said storage locations to a fetch buffer; said first store retry commands directs unloading of said double words from said fetch buffer to said storage location, wherein said double words are inverted if said double word error is detected by said first fetch retry command; said second fetch retry command directs loading of words from said storage locations to a fetch buffer and corrects double words which have errors as detected by said first fetch retry command; and said second store retry command directs unloading of error free double words from said fetch buffer to said storage locations.
Claim 9
Dependent Claim 27 words
A memory access system as in claim 1 wherein said plurality of commands includes a HAMT SCRUB command sequence for detecting errors in said memory access system.
Claim 10
Dependent Claim 41 words
A memory access system as in claim 8 wherein said HAMT SCRUB command sequence includes a second set of atomically coupled macro commands including a first fetch scrub, a third store retry, a second fetch scrub, and a fourth store retry.
Claim 11
Dependent Claim 25 words
A memory access system as in claim 9 wherein said HAMT SCRUB command sequence counts the number of errors detected in the memory access system.
Claim 12
Dependent Claim 20 words
A memory access system as in claim 10, wherein operations are performed on a double line basis using double words.
Claim 13
Dependent Claim 118 words
A memory access system as in claim 11, wherein said first fetch scrub command directs loading of said double words from said storage locations to a fetch buffer; said third store retry commands directs unloading of said double words in an inverted form from said fetch buffer to said storage locations, wherein said double words remain intact in said fetch buffer; said second fetch scrub command directs comparing of said double words in said fetch buffer with said double words in said storage locations and increments a hard error counter for each memory access system error detected; and said fourth store retry command directs unloading of error free double words from said fetch buffer to said storage locations.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1998-12-25 1999-06-26 1999-12-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2002-12-25 2003-06-26 2003-12-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2006-12-25 2007-06-26 2007-12-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag