Method and system for using dynamic random access memory as cache memory

Information

  • Patent Grant
  • 7917692
  • Patent Number
    7,917,692
  • Date Filed
    Tuesday, February 12, 2008
    16 years ago
  • Date Issued
    Tuesday, March 29, 2011
    13 years ago
Abstract
A cache memory system and method includes a DRAM having a plurality of banks, and it also includes 2 SRAMs each having a capacity that is equal to the capacity of each bank of the DRAM. In operation, data read from a bank of the DRAM are stored in one of the SRAMs so that repeated hits to that bank are cached by reading from the SRAM. In the event of a write to a bank that is being refreshed, the write data are stored in one of the SRAMs. After the refresh of the bank has been completed, the data stored in the SRAM are transferred to the DRAM bank. A subsequent read or write to a second DRAM bank undergoing refresh and occurring during the transfer of data from an SRAM to the DRAM is stored in either the second bank or the other SRAM.
Description
TECHNICAL FIELD

The present invention is directed memory devices, and, more particularly, to a system and method for allowing dynamic random access memory devices to be used as cache memory.


BACKGROUND OF THE INVENTION

Memory devices are used in a wide variety of applications, including computer systems. Computer systems and other electronic devices containing a microprocessor or similar device typically include system memory, which is generally implemented using dynamic random access memory (“DRAM”). The primary advantage of DRAM is that it uses relatively few components to store each bit of data, and is thus relatively inexpensive to provide relatively high capacity system memory. A disadvantage of DRAM, however, is that their memory cells must be periodically refreshed. While a memory cell is being refreshed, read and write accesses to other rows in the memory array are blocked. The need to refresh memory cells does not present a significant problem in most applications, but it can prevent their use in applications where immediate access to memory cells is required or highly desirable.


Also included in many computer systems and other electronic devices is a cache memory. The cache memory stores instructions and/or data (collectively referred to as “data”) that is frequently accessed by the processor or similar device, and may be accessed substantially faster than data can be accessed in system memory. It is important for the processor or similar device to be able to access the cache memory as needed. If the cache memory cannot be accessed for a period, the operation of the processor or similar device must be halted during this period. Cache memory is typically implemented using static random access memory (“SRAM”) because such memory need not be refreshed and is thus always accessible for a write or a read memory access. However, a significant disadvantage of SRAM is that each memory cell requires a relatively large number of components, thus making SRAM data storage relatively expensive. It would be desirable to implement cache memory using DRAM because high capacity cache memories could then be provided at relatively little cost. However, a cache memory implemented using DRAMs would be inaccessible at certain times during a refresh of the memory cells in the DRAM. For example, during refresh of a row of memory cells, it would be impossible to read data from or write data to other rows of memory cells. As a result of these problems, DRAMs have not generally been considered acceptable for use as cache memory or for other applications requiring immediate access to memory.


Attempts have been made to use DRAM as cache memory, but these attempts have not been entirely successful in solving the refresh problem so that these prior art devices are not always available for a memory access. These prior art devices have attempted to “hide” memory refreshes by including a small SRAM to store one or more rows of DRAM data during refresh of a row being addressed. However, in practice, there are still some memory access situations in which these prior art devices may not be accessed, thus suspending the operation of a processor or similar device.


There is therefore a need for a DRAM that effectively hides memory refresh under all memory access situations so that the DRAM may provide relatively inexpensive, high capacity cache memory.


SUMMARY OF THE INVENTION

A method of caching data and a cache system that may be used in a computer system includes a DRAM having a plurality of refresh blocks and a pair of SRAMs having a capacity of at least the capacity of the refresh blocks. If a block of the DRAM to which data is attempting to be written is being refreshed, the data is instead written to one of the SRAMs. When the refresh of that block has been completed, the data is transferred from the SRAM to a block of the DRAM to which data was attempted to be written. If a block to which data is attempting to be written is being refreshed and data is being transferred from the one SRAM to a block of the DRAM, the data is instead written to the other SRAM. As a result, there is always one SRAM available into which data may be written if a refresh block to which the write was directed is being refreshed.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram of a computer system containing a cache memory in accordance with one embodiment of the invention.



FIG. 2 is a block diagram of a cache system that may be used as a cache memory in the computer system of FIG. 2 in accordance with one embodiment of the invention.



FIG. 3, is a diagram conceptually illustrating a DRAM and SRAM arrays shown in the cache system of FIG. 2.



FIG. 4 is a block diagram showing two pairs of complementary input/output lines coupled to respective blocks of a bank of memory according to one embodiment of the invention.





DETAILED DESCRIPTION OF THE INVENTION


FIG. 1 is a block diagram of a computer system 10 that includes a processor 12 for performing various computing functions by executing software to perform specific calculations or tasks. The processor 12 is coupled to a processor bus 14 that normally includes an address bus, a control bus, and a data bus (not separately shown). In addition, the computer system 10 includes a system memory 16, which is typically dynamic random access memory (“DRAM”). As mentioned above, using DRAM at the system memory 16 provides relatively high capacity at relatively little expense. The system memory 16 is coupled to the processor bus 14 by a system controller 20 or similar device, which is also coupled to an expansion bus 22, such as a Peripheral Component Interface (“PCI”) bus. A bus 26 coupling the system controller 20 to the system memory 16 also normally includes an address bus, a control bus, and a data bus (not separately shown), although other architectures can be used. For example, the data bus of the system memory 16 may be coupled to the data bus of the processor bus 14, or the system memory 16 may be implemented by a packetized memory (not shown), which normally does not include a separate address bus and control bus.


The computer system 10 also includes one or more input devices 34, such as a keyboard or a mouse, coupled to the processor 12 through the expansion bus 22, the system controller 20, and the processor bus 14. Also typically coupled to the expansion bus 22 are one or more output devices 36, such as a printer or a video terminal. One or more data storage devices 38 are also typically coupled to the expansion bus 22 to allow the processor 12 to store data or retrieve data from internal or external storage media (not shown). Examples of typical storage devices 38 include hard and floppy disks, tape cassettes, and compact disk read-only memories (CD-ROMs).


The processor 12 is also typically coupled to cache memory 40 through the processor bus 14. In the past, the cache memory 40 was normally implemented using static random access memory (“SRAM”) because such memory is relatively fast, and does not require refreshing and may thus always be accessed. However, as explained above, using SRAM for the cache memory 40 is a relatively expensive means for providing a relatively high capacity because of the large number of components making up each SRAM storage cell compared to the number of components in each DRAM storage cell.


According to one embodiment of the invention, the cache memory 40 shown in FIG. 1 is implemented using a cache system 50, an example of which is shown in FIG. 2. The cache system 50 includes components normally found in a DRAM, including an address decoder 52 receiving addresses through an address bus 53, a row driver circuit 54 adapted to receive row addresses from the address decoder 52, and a column driver circuit 56 adapted to receive column addresses from the address decoder 52. The row driver circuit 54 is coupled to word lines (not shown) in a memory array 60, and the column driver circuit 56 is coupled to digit lines (not shown) in the memory array 60. As shown in FIG. 2, the memory array 60 is either physically or logically divided into a plurality of banks 60a-n. Each bank 60a-n is divided into one or more refresh blocks, each containing a plurality of rows that are contemporaneously refreshed. The column driver 56 is also coupled to a sense amplifier/write driver circuit 64 to route write data and read data from and to, respectively, a data input/output buffer 66 through an internal data bus 68. The data input/output buffer 66 is, in turn, coupled to an external data bus 70. As in conventional DRAMs, the cache system 50 also includes a control circuit 72 that includes a command buffer 74 receiving command signals through a command bus 76 and generating appropriate control signals for controlling the operation of the cache system 50. The control circuit 72 also includes a refresh controller 78 for refreshing the DRAM array 60 one refresh block at a time.


Unlike conventional DRAMs, the cache system 50 also includes two SRAM arrays 80, 84 that are each coupled to the sense amplifier/write driver circuit 64 to access data in the DRAM array 60. The SRAM arrays 80, 84 are also coupled to the refresh controller 78. The refresh controller 78 receives addresses from the address decoder 52, and it applies addressing and control signals to the row driver 54.


The operation of the command buffer 74, refresh controller 78 and the SRAM arrays 80, 84 in relation to the other components of the cache system 50 will now be explained with reference to the diagram of FIG. 3, which conceptually illustrates the DRAM array 60 and the SRAM arrays 80, 84 shown in FIG. 2. As mentioned above, the DRAM array is divided into a plurality of refresh blocks. The refresh blocks may be part of the same or different banks 60a-n of DRAM memory, or physically different DRAM devices. In the embodiment shown in FIG. 3, each of the refresh blocks 61a-n has a capacity of Y bits, and each of the SRAM arrays 80, 84 also has a capacity of Y bits. Each of the refresh blocks 61a-n may be individually refreshed under control of the refresh controller 78 (FIG. 2). As shown in FIG. 4, the DRAM array 60 has twice the normal number of complementary input/output (“I/O”) line pairs 62, which are configured so that two blocks can be simultaneously accessed. More specifically, a first pair 62a of complementary I/O lines may be coupled to one block 61a of the DRAM array 60 while a second pair 62b of I/O lines may be coupled to another block 61b of the DRAM array 60. As a result, it is possible for data to be read from or written to one refresh block 61a-n of the DRAM array 60 at the same time data are being transferred from one of the SRAM arrays 80, 84 to another block 61a-n of the DRAM array 60.


In operation, a read from a refresh block 61a-n that is not being refreshed is read in a conventional manner. Similarly, a write to a block 61a-n that is not being refreshed is accomplished in a conventional manner. Thus, no problem is presented in either writing to or reading from a refresh block 61a-n that is not being refreshed. In either of these cases, data access to the cache system 50 does not require any wait, thus allowing the cache system 50 to be used as a cache memory in place of a typically used SRAM without any performance limitations.


The potential problem in accessing the cache system 50 is in the event of a read or a write to a refresh block 61a-n being refreshed, and, in particular, to a different row than the row in that block that is being refreshed. The cache system 50, preferably the refresh controller 78, may check each memory command prior to initiating a refresh in a block 61a-n to determine if the memory command is a read. If a read command directed to a block 61a-n that is about to be refreshed is received, then the refresh is not initiated. In this regard, it is assumed that the duration of a refresh is shorter than the duration of a memory read operation. Each time a read is executed, the read data are written to one of the SRAMs 80, 84. As a result, the read data are subsequently accessible in one of the SRAMs 80, 84, thereby allowing the portion of the block 61a-n that stored such data to be refreshed despite subsequent reads from that that portion. In the case of sequential reads from the rows of a block 61a-n, the reads will refresh the rows.


In the event a memory access is a write to a block 61a-n being refreshed, the write data is instead written to one of the SRAM arrays 80, 84. When the refresh of the block to which the write was directed has been completed, the refresh controller 78 starts a refresh of another block 61a-n of the DRAM array 60. While this subsequent refresh is occurring, the data that had been written to one of the SRAM arrays 80, 84 is transferred to the block 61a-n to which the earlier write was directed. If, during refresh of the second block 61a-n, a read or a write is directed toward that block 61a-n, then that data is instead stored in the other one of the SRAM arrays 80, 84. By the time the refresh of the second block 61a-n has been completed, transfer of the data from first one of the SRAM arrays 80, 84 to the first block 61a-n will have been completed, and that SRAM array 80, 84 will be available to store write data that is subsequently directed to any other block 61a-n that is being refreshed. Therefore, an SRAM array 80, 84 is always available to store write data that is directed to a refresh block 61a-n of the memory array 60 that is being refreshed. As a result, data may always be read from or written to the cache system 50 without the need for to wait for the completion of a refresh of any block 61a-n the cache system 50. The cache system 50 may therefore be used as a cache memory in place of an SRAM that is typically used, thereby providing high capacity caching at relatively little cost.


From the foregoing it will be appreciated that, although specific embodiments of the invention have been described herein for purposes of illustration, various modifications may be made without deviating from the spirit and scope of the invention. Accordingly, the invention is not limited except as by the appended claims.

Claims
  • 1. A method of caching memory in a processor-based system, comprising: refreshing each of a plurality of memory blocks of a primary memory one at a time;if a first data is directed to be written into a first memory block of the plurality of memory blocks when the first memory block is being refreshed, storing the first data in a second memory; andafter the first memory block has been refreshed, transferring the first data stored in the second memory to the first memory block.
  • 2. The method of claim 1, further comprising storing the first data in a third memory if the second memory is storing a second data or the second data is being written to or read from the second memory when the first memory block is being refreshed during an attempt to write the first data into the first memory block; and after the first memory block has been refreshed, transferring the first data stored in the third memory to the first memory block.
  • 3. The method of claim 1 wherein the primary memory comprises a dynamic random access memory (“DRAM”) device.
  • 4. The method of claim 1 wherein the second memory comprises a static random access memory (“SRAM”) device.
  • 5. The method of claim 1 wherein the second memory comprises a second memory having a capacity at least as large as the capacity of each of the plurality of memory blocks of the primary memory.
  • 6. A method of storing data, comprising: periodically refreshing at least a portion of a first memory;receiving a request to write first data to an address in either the first memory or a second memory;if the received request is a request to write the first data to an address in the first memory when at least a portion the first memory is being refreshed, storing the first data in the second memory; andafter at least a portion the first memory has been refreshed, transferring the first data from the second memory to the first memory and storing the first data in the first memory.
  • 7. The method of claim 6, further comprising: storing the first data in a third memory if second data are being written to or read from the second memory when the request to write the first data in the first memory is received and at least a portion the first memory is being refreshed; andafter at least a portion the first memory has been refreshed, transferring the first data from the third memory to the first memory and storing the first data in the first memory.
  • 8. The method of claim 6 wherein the first memory comprises a dynamic random access memory (“DRAM”) device.
  • 9. The method of claim 6 wherein the second memory comprises a static random access memory (“SRAM”) device.
  • 10. The method of claim 6 wherein the second memory has a capacity at least as large as the capacity of the first memory.
  • 11. A method of storing data in a first memory having a plurality of locations, at least some of which may be inaccessible at times, the method comprising: receiving a request to write first data to a first location in the first memory;if the request is a request to write the first data to the first location in the first memory that is currently inaccessible, storing the first data in the second memory; andwhen the first location in the first memory is no longer inaccessible, transferring the first data from the second memory to the first memory and storing the first data in the first location in the first memory.
  • 12. The method of claim 11, further comprising: storing the first data in a third memory if second data are being written to or read from the second memory when the request to write the first data in the first location in the first memory is received and the first location in the first memory is currently inaccessible; andwhen the first location in the first memory is no longer inaccessible, transferring the first data from the third memory to the first memory and storing the first data in the first location in the first memory.
  • 13. The method of claim 11 wherein the first memory comprises a dynamic random access memory (“DRAM”) device.
  • 14. The method of claim 11 wherein the second memory comprises a static random access memory (“SRAM”) device.
  • 15. The method of claim 11 wherein the second memory has a capacity at least as large as the capacity of the first memory.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a divisional of U.S. patent application Ser. No. 11/595,370, filed Nov. 8, 2006, issued as U.S. Pat. No. 7,350,018, which is a continuation of U.S. patent application Ser. No. 11/230,836, filed Sep. 19, 2005, issued as U.S. Pat. No. 7,155,561, which is a continuation of U.S. patent application Ser. No. 10/815,877, filed Mar. 30, 2004, issued as U.S. Pat. No. 6,948,027, which is a continuation of U.S. patent application Ser. No. 09/642,546, filed Aug. 17, 2000, issued as U.S. Pat. No. 6,862,654.

US Referenced Citations (60)
Number Name Date Kind
4829484 Arimoto et al. May 1989 A
5287481 Lin Feb 1994 A
5359722 Chan et al. Oct 1994 A
5421000 Fortino et al. May 1995 A
5471601 Gonzales Nov 1995 A
5473770 Vrba Dec 1995 A
5509132 Matsuda et al. Apr 1996 A
5577223 Tanoi et al. Nov 1996 A
5677878 Shirley et al. Oct 1997 A
5699317 Sartore et al. Dec 1997 A
5721862 Sartore et al. Feb 1998 A
5777942 Dosaka et al. Jul 1998 A
5787457 Miller et al. Jul 1998 A
5829026 Leung et al. Oct 1998 A
5829036 Klein Oct 1998 A
5831924 Nitta et al. Nov 1998 A
5835401 Green et al. Nov 1998 A
5875451 Joseph Feb 1999 A
5875452 Katayama et al. Feb 1999 A
5943681 Ooishi Aug 1999 A
5991851 Alwais et al. Nov 1999 A
5999474 Leung et al. Dec 1999 A
6002625 Ahn Dec 1999 A
6023428 Tran Feb 2000 A
6061759 Guo May 2000 A
6088760 Walker et al. Jul 2000 A
6128700 Hsu et al. Oct 2000 A
6131140 Rodgers et al. Oct 2000 A
6151269 Dosaka et al. Nov 2000 A
6151664 Borkenhagen et al. Nov 2000 A
6170036 Konishi et al. Jan 2001 B1
6172893 Ryan Jan 2001 B1
6172927 Taylor Jan 2001 B1
6173356 Rao Jan 2001 B1
6178133 Manning Jan 2001 B1
6189073 Pawlowski Feb 2001 B1
6215497 Leung Apr 2001 B1
6226755 Reeves May 2001 B1
6256707 Ooishi Jul 2001 B1
6289413 Rogers et al. Sep 2001 B1
6335896 Wahlstrom Jan 2002 B1
6339817 Maesako et al. Jan 2002 B1
6347063 Dosaka et al. Feb 2002 B1
6360292 Manning Mar 2002 B1
6415353 Leung Jul 2002 B1
6438016 Keeth et al. Aug 2002 B1
6445636 Keeth et al. Sep 2002 B1
6466507 Ryan Oct 2002 B2
6477073 Keeth et al. Nov 2002 B1
6477631 Martin et al. Nov 2002 B1
6563758 Shau May 2003 B2
6564284 Christenson May 2003 B2
6587918 Christenson Jul 2003 B1
6601141 Ooishi Jul 2003 B2
6629188 Minkin et al. Sep 2003 B1
6697909 Wang et al. Feb 2004 B1
6779076 Shirley Aug 2004 B1
6965536 Shirley Nov 2005 B2
20020006071 Ikeda et al. Jan 2002 A1
20020069325 Pong et al. Jun 2002 A1
Related Publications (1)
Number Date Country
20080177943 A1 Jul 2008 US
Divisions (1)
Number Date Country
Parent 11595370 Nov 2006 US
Child 12069812 US
Continuations (3)
Number Date Country
Parent 11230836 Sep 2005 US
Child 11595370 US
Parent 10815877 Mar 2004 US
Child 11230836 US
Parent 09642546 Aug 2000 US
Child 10815877 US