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.
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.
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.
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
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
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.
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.
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 |
Number | Date | Country | |
---|---|---|---|
20080177943 A1 | Jul 2008 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11595370 | Nov 2006 | US |
Child | 12069812 | US |
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 |