WO2002008901A2 - Partitioned random access memory - Google Patents

Partitioned random access memory Download PDF

Info

Publication number
WO2002008901A2
WO2002008901A2 PCT/US2001/022201 US0122201W WO0208901A2 WO 2002008901 A2 WO2002008901 A2 WO 2002008901A2 US 0122201 W US0122201 W US 0122201W WO 0208901 A2 WO0208901 A2 WO 0208901A2
Authority
WO
WIPO (PCT)
Prior art keywords
memory
memory bank
data read
random access
bank
Prior art date
Application number
PCT/US2001/022201
Other languages
French (fr)
Other versions
WO2002008901A3 (en
Inventor
Ronald Melanson
Gregory Papadopoulos
Renu Raman
Original Assignee
Sun Microsystem, Inc.
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 Sun Microsystem, Inc. filed Critical Sun Microsystem, Inc.
Priority to AU2001280547A priority Critical patent/AU2001280547A1/en
Publication of WO2002008901A2 publication Critical patent/WO2002008901A2/en
Publication of WO2002008901A3 publication Critical patent/WO2002008901A3/en

Links

Classifications

    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C7/00Arrangements for writing information into, or reading information out from, a digital store
    • G11C7/10Input/output [I/O] data interface arrangements, e.g. I/O data control circuits, I/O data buffers
    • G11C7/1006Data managing, e.g. manipulating data before writing or reading out, data bus switches or control circuits therefor
    • G11C7/1012Data reordering during input/output, e.g. crossbars, layers of multiplexers, shifting or rotating
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/08Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G06F11/10Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
    • G06F11/1008Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices
    • G06F11/1064Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices in cache or content addressable memories
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C7/00Arrangements for writing information into, or reading information out from, a digital store
    • G11C7/10Input/output [I/O] data interface arrangements, e.g. I/O data control circuits, I/O data buffers
    • G11C7/1006Data managing, e.g. manipulating data before writing or reading out, data bus switches or control circuits therefor
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C7/00Arrangements for writing information into, or reading information out from, a digital store
    • G11C7/10Input/output [I/O] data interface arrangements, e.g. I/O data control circuits, I/O data buffers
    • G11C7/1051Data output circuits, e.g. read-out amplifiers, data output buffers, data output registers, data output level conversion circuits
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C2207/00Indexing scheme relating to arrangements for writing information into, or reading information out from, a digital store
    • G11C2207/10Aspects relating to interfaces of memory device to external buses
    • G11C2207/104Embedded memory devices, e.g. memories with a processing device on the same die or ASIC memory designs

Definitions

  • the invention relates to error avoidance in random access memory.
  • a typical computer system includes a microprocessor (10) having, among other things, a CPU (12), a load/store unit (14), and an on-board cache memory (16).
  • the microprocessor (10) is connected to an external cache memory (17) and a main memory (18) that both hold data and program instructions to be executed by the microprocessor (10). Internally, execution of program instructions is carried out by the CPU (12). Data needed by the CPU (12) to carry out an instruction are fetched by the load/store unit (14) and loaded into internal registers (15) of the CPU (12).
  • a memory queue (not shown) maintains a list of outstanding memory requests.
  • the load store unit adds requests into the memory queue and also loads registers with values from the memory queue.
  • the load/store unit (14) searches for the data first in the fast on-board cache (16), then in external cache memory (level 2 cache) (17), and final in the slow main memory (18).
  • the level two cache (17) is constructed using static random access memory (SRAM), while the main memory is constructed using dynamic random access memory (DRAM).
  • SRAM static random access memory
  • DRAM dynamic random access memory
  • a random access memory comprises a first memory bank, a second memory bank, an error checking circuit operatively connected to receive data read from the first memory bank, and a multiplexer operatively connected to input data read from both the first memory bank and the second memory bank, wherein input selection of the multiplexer is controlled by an output of the error checking circuit.
  • the first memory bank and second memory bank may comprise static random access memory.
  • the error checking circuit may comprise a parity checking circuit.
  • the parity checking circuit may determine parity of the data read from the first memory bank is correct, the multiplexer may select the input from the first memory bank, and when the parity checking circuit determines parity of the data read from the first memory bank is incorrect, the multiplexer may select the input from the second data bank.
  • the first memory bank, the second memory bank, the error checking circuit, and the multiplexer may be implemented on a single chip.
  • the random access memory may comprise means for writing data simultaneously to the first memory bank and the second memory bank.
  • a partitioned memory system comprises a first memory device, a second memory device, means for writing data to the first and second memory devices in parallel, means for error checking data read from the first memory device and outputting a result indicative thereof, selection means for selecting data read from the first memory device for output to a bus if the result from the error checking means indicates no error and for selecting data read from the second memory device for output to the bus if the result from the error checking means indicates an error.
  • the first memory device and the second memory device may comprise static random access memory.
  • the error checking means may comprise means for checking parity.
  • the selection means may comprise a multiplexer.
  • a method for reducing errors in a memory system comprises writing data into first and second memory banks of the memory system in parallel, reading data from a desired location of the first memory bank, checking the data read from the first memory bank for errors, if no errors are present, outputting the data read from the first memory bank to a bus, and if the data read from the first memory bank contains errors, outputting data read from a parallel location in the second memory bank to the bus.
  • checking the data read from the first memory bank for errors may comprise checking the data for parity.
  • the data read from the first memory bank may be cleared for parity on a byte-by-byte basis. Data from one of the first memory bank and second memory bank may be selected using a multiplexer.
  • a partitioned static random access memory comprises a first static random access memory bank, a second static random access memory bank, the first and second static random access memory banks being configured such that data may be written to parallel locations therein, a parity checking circuit configured to check parity of data read from the first static random access memory bank and to output a result indicative thereof, and a multiplexer configured to receive data read from the parallel locations in the first and second static random access memory banks and to select one of said data depending upon the result output by the parity checking circuit.
  • Figure 1 is a schematic diagram of a prior art computer system.
  • Figure 2 is a schematic diagram of a partitioned random access memory in accordance with one embodiment of the invention.
  • level two cache such as L2 cache (17) shown may be, for example, a 16 Mbit x 18 or 16 Mbit x 36 SRAM.
  • the static random access memory (SRAM) is a form of semiconductor memory based on flip-flops, which retains information so long as there is enough power to run the device. This is distinguished from a dynamic random access memory (DRAM), which stores information in integrated circuits containing capacitors. DRAMs are referred to as "dynamic" because capacitors lose their charge over time, thus necessitating logic to refresh or recharge the DRAM chip continuously.
  • a DRAM is thus slower than a SRAM because it can not be read by the processor while it is being refreshed.
  • the circuitry of a DRAM is more simple and thus can hold up to four times as much data.
  • the SRAM is typically used for cache memory due to its speed.
  • a known drawback of SRAMs is their susceptibility to soft-error upsets due to alpha particles and cosmic rays. Such soft-error upsets may result in catastrophic system failures.
  • level 2 cache (17) an expanded view of level 2 cache (17) is shown wherein the memory has been partitioned into a primary bank (21) and secondary bank
  • the separation between every primary and secondary cell pair should be at least fifty microns.
  • the primary and secondary banks should be configured so as to minimize the possibility of common-mode failures.
  • common-mode failures refers to failures in redundant systems whereby multiple component failures having the same cause defeat the benefits of component duplication.
  • the written data includes an appropriate even or odd parity bit per datum, which may be a byte, word, or other appropriate division of data.
  • a read operation data are read in parallel from identical addresses of both the primary and secondary banks.
  • Data from only the primary bank (21) are applied to a parity checker (25) that checks the read data for parity. Any known mechanism for checking parity may be employed, including even or odd parity. In addition, different and more complex methods of error detection may be employed without departing from the spirit and scope of the invention.
  • the data read from primary bank (21) and secondary bank (23) are also applied to a multiplexer (MUX) (27).
  • MUX multiplexer
  • the output of parity checker (25) is applied to a select input (29) of the MUX (27).
  • MUX (27) causes the data from the primary bank (21) to be output via bus (31). If, on the other hand, the parity of the data read from primary bank (21) is bad, parity checker (25) issues a signal to MUX (27) via select input (29) to cause the MUX to select the data read from secondary bank (23) for output on bus (31).
  • parity checker any known method of error checking may be employed depending upon the acceptable limits of cost and complexity.
  • data read from primary bank (21) will be parity checked on a byte-by-byte or word-by-word basis, less rigorous parity checking is possible, again depending upon the desired results.
  • FIG. 2 has been shown and described in terms of application of the invention to level 2 cache.
  • the invention is not limited thereto, and in fact can be used for any type of memory system, be it in cache or main memory.
  • embodiments of the invention may be implemented using individual components for one or more of the primary bank (21), secondary bank (23), parity checker (25), and MUX (27). Alternatively, they may be incorporated into a single partitioned SRAM chip.
  • the skilled artisan will appreciate that various modifications and applications of the invention are possible and appropriate within the spirit and scope of the invention.
  • the partitioned random access memory of the invention provides a simple and reliable mechanism by which soft-error susceptibility is virtually eliminated through the use of redundant storage and selection of correct data via error checking.
  • the memory of the invention need not employ complex error algorithms, and is efficient in terms of speed, space, and cost.

Abstract

A random access memory includes a first memory bank, a second memory bank, an error checking circuit operatively connected to receive data read from the first memory bank, and a multiplexer operatively connected to input data read from both the first memory bank and the second memory bank, wherein input selection of the multiplexer is controlled by an output of the error checking circuit. A method for reducing errors in a memory system includes writing data into first and second memory banks of the memory system in parallel, reading data from a desired location of the first memory bank, checking the data read from the first memory bank for errors, if no errors are present, outputting the data read from the first memory bank to a bus, and if the data read from the first memory bank contains errors, outputting data read from a parallel location in the second memory bank to the bus. A method for reducing errors in a memory system comprises writing data into first and second memory banks of the memory system in parallel, reading data from a desired location of the first memory bank, checking the data read from the first memory bank for errors, if no errors are present, outputting the data read from the first memory bank to a bus, and if the data read from the first memory bank contains errors, outputting data read from a parallel location in the second memory bank to the bus.

Description

PARTITIONED RANDOM ACCESS MEMORY
FIELD OF INVENTION The invention relates to error avoidance in random access memory.
BACKGROUND Referring to Figure 1, a typical computer system includes a microprocessor (10) having, among other things, a CPU (12), a load/store unit (14), and an on-board cache memory (16). The microprocessor (10) is connected to an external cache memory (17) and a main memory (18) that both hold data and program instructions to be executed by the microprocessor (10). Internally, execution of program instructions is carried out by the CPU (12). Data needed by the CPU (12) to carry out an instruction are fetched by the load/store unit (14) and loaded into internal registers (15) of the CPU (12). A memory queue (not shown) maintains a list of outstanding memory requests. The load store unit adds requests into the memory queue and also loads registers with values from the memory queue. Upon command from the CPU (12), the load/store unit (14) searches for the data first in the fast on-board cache (16), then in external cache memory (level 2 cache) (17), and final in the slow main memory (18).
Typically, the level two cache (17) is constructed using static random access memory (SRAM), while the main memory is constructed using dynamic random access memory (DRAM). In both cases, avoiding corruption of data stored in the memories is vital to proper operation of the computer. An error in even a single bit stored in memory may be sufficient to frustrate execution of a desired instruction by the CPU. Although various error checking mechanisms exist in the prior art, these mechanisms typically introduce undesirable overhead in terms of hardware and/or processing time. In addition, the complexity of these mechanisms may add to the overall complexity and cost of the memory system.
SUMMARY OF INVENTION In general, in one aspect, a random access memory comprises a first memory bank, a second memory bank, an error checking circuit operatively connected to receive data read from the first memory bank, and a multiplexer operatively connected to input data read from both the first memory bank and the second memory bank, wherein input selection of the multiplexer is controlled by an output of the error checking circuit.
In accordance with one or more embodiments, the first memory bank and second memory bank may comprise static random access memory. The error checking circuit may comprise a parity checking circuit. The parity checking circuit may determine parity of the data read from the first memory bank is correct, the multiplexer may select the input from the first memory bank, and when the parity checking circuit determines parity of the data read from the first memory bank is incorrect, the multiplexer may select the input from the second data bank. The first memory bank, the second memory bank, the error checking circuit, and the multiplexer may be implemented on a single chip. The random access memory may comprise means for writing data simultaneously to the first memory bank and the second memory bank.
In general, in one aspect, a partitioned memory system comprises a first memory device, a second memory device, means for writing data to the first and second memory devices in parallel, means for error checking data read from the first memory device and outputting a result indicative thereof, selection means for selecting data read from the first memory device for output to a bus if the result from the error checking means indicates no error and for selecting data read from the second memory device for output to the bus if the result from the error checking means indicates an error. In a accordance with one or more embodiments, the the first memory device and the second memory device may comprise static random access memory. The error checking means may comprise means for checking parity. The selection means may comprise a multiplexer. The first memory device, the second memory device, the error checking means, and the selection means may be implemented on a single chip. In general, in one aspect, a method for reducing errors in a memory system comprises writing data into first and second memory banks of the memory system in parallel, reading data from a desired location of the first memory bank, checking the data read from the first memory bank for errors, if no errors are present, outputting the data read from the first memory bank to a bus, and if the data read from the first memory bank contains errors, outputting data read from a parallel location in the second memory bank to the bus. In accordance with one or more embodiments, checking the data read from the first memory bank for errors may comprise checking the data for parity. The data read from the first memory bank may be cleared for parity on a byte-by-byte basis. Data from one of the first memory bank and second memory bank may be selected using a multiplexer.
In general, in one aspect, a partitioned static random access memory comprises a first static random access memory bank, a second static random access memory bank, the first and second static random access memory banks being configured such that data may be written to parallel locations therein, a parity checking circuit configured to check parity of data read from the first static random access memory bank and to output a result indicative thereof, and a multiplexer configured to receive data read from the parallel locations in the first and second static random access memory banks and to select one of said data depending upon the result output by the parity checking circuit.
Other aspects and advantages of the invention will be apparent from the following description and the appended claims.
BRIEF DESCRIPTION OF DRAWINGS Figure 1 is a schematic diagram of a prior art computer system. Figure 2 is a schematic diagram of a partitioned random access memory in accordance with one embodiment of the invention.
DETAILED DESCRIPTION Various embodiments of the invention will now be described with reference to the accompanying figures. Referring back to Figure 1, level two cache such as L2 cache (17) shown may be, for example, a 16 Mbit x 18 or 16 Mbit x 36 SRAM. The static random access memory (SRAM) is a form of semiconductor memory based on flip-flops, which retains information so long as there is enough power to run the device. This is distinguished from a dynamic random access memory (DRAM), which stores information in integrated circuits containing capacitors. DRAMs are referred to as "dynamic" because capacitors lose their charge over time, thus necessitating logic to refresh or recharge the DRAM chip continuously. A DRAM is thus slower than a SRAM because it can not be read by the processor while it is being refreshed. However, the circuitry of a DRAM is more simple and thus can hold up to four times as much data.
The SRAM is typically used for cache memory due to its speed. However, a known drawback of SRAMs is their susceptibility to soft-error upsets due to alpha particles and cosmic rays. Such soft-error upsets may result in catastrophic system failures.
Referring now to Figure 2, an expanded view of level 2 cache (17) is shown wherein the memory has been partitioned into a primary bank (21) and secondary bank
A(23). The separation between every primary and secondary cell pair should be at least fifty microns. In addition, the primary and secondary banks should be configured so as to minimize the possibility of common-mode failures. The term "common-mode failures" refers to failures in redundant systems whereby multiple component failures having the same cause defeat the benefits of component duplication.
During a write operation, data are written simultaneously to both the primary and secondary banks via a bus (24). The written data includes an appropriate even or odd parity bit per datum, which may be a byte, word, or other appropriate division of data.
During a read operation, data are read in parallel from identical addresses of both the primary and secondary banks. Data from only the primary bank (21) are applied to a parity checker (25) that checks the read data for parity. Any known mechanism for checking parity may be employed, including even or odd parity. In addition, different and more complex methods of error detection may be employed without departing from the spirit and scope of the invention. The data read from primary bank (21) and secondary bank (23) are also applied to a multiplexer (MUX) (27). The output of parity checker (25) is applied to a select input (29) of the MUX (27). Thus, when a read operation occurs, the data read from primary bank (21) are first checked for parity on a byte-by- byte or word-by-word basis. If the parity is good, MUX (27) causes the data from the primary bank (21) to be output via bus (31). If, on the other hand, the parity of the data read from primary bank (21) is bad, parity checker (25) issues a signal to MUX (27) via select input (29) to cause the MUX to select the data read from secondary bank (23) for output on bus (31). As noted above, although the embodiment of the invention described above employs a parity checker, any known method of error checking may be employed depending upon the acceptable limits of cost and complexity. Moreover, while in the above-described embodiment data read from primary bank (21) will be parity checked on a byte-by-byte or word-by-word basis, less rigorous parity checking is possible, again depending upon the desired results.
The embodiment of Figure 2 has been shown and described in terms of application of the invention to level 2 cache. However, the invention is not limited thereto, and in fact can be used for any type of memory system, be it in cache or main memory. In addition, embodiments of the invention may be implemented using individual components for one or more of the primary bank (21), secondary bank (23), parity checker (25), and MUX (27). Alternatively, they may be incorporated into a single partitioned SRAM chip. Thus, the skilled artisan will appreciate that various modifications and applications of the invention are possible and appropriate within the spirit and scope of the invention.
The partitioned random access memory of the invention provides a simple and reliable mechanism by which soft-error susceptibility is virtually eliminated through the use of redundant storage and selection of correct data via error checking. The memory of the invention need not employ complex error algorithms, and is efficient in terms of speed, space, and cost.
While the invention has been described with respect to particular embodiments, the invention is not limited thereto, but is rather is limited only by the scope of the appended claims.

Claims

What is claimed is:
1. A random access memory, comprising: a first memory bank; a second memory bank; an error checking circuit operatively connected to receive data read from the first memory bank; and a multiplexer operatively connected to input data read from both the first memory bank and the second memory bank, wherein input selection of the multiplexer is controlled by an output of the error checking circuit.
2. The random access memory of claim 1, wherein the first memory bank and second memory bank comprise static random access memory.
3. The random access memory of claim 1, wherein the error checking circuit comprises a parity checking circuit.
4. The random access memory of claim 1, wherein when the parity checking circuit determines parity of the data read from the first memory bank is correct, the multiplexer selects the input from the first memory bank, and when the parity checking circuit determines parity of the data read from the first memory bank is incorrect, the multiplexer selects the input from the second memory bank.
5. The random access memory of claim 1, wherein the first memory bank, the second memory bank, the error checking circuit, and the multiplexer are implemented on a single chip.
6. The random access memory of claim 1, further comprising means for writing data simultaneously to the first memory bank and the second memory bank.
7. A partitioned memory system, comprising: a first memory device; a second memory device; means for writing data to the first and second memory devices in parallel; means for error checking data read from the first memory device and outputting a result indicative thereof; and selection means for selecting data read from the first memory device for output to a bus if the result from the error checking means indicates no error and for selecting data read from the second memory device for output to the bus if the result from the error checking means indicates an error.
8. The memory system of claim 7, wherein the first memory device and the second memory device comprise static random access memory.
9. The memory system of claim 7, wherein the error checking means comprises means for checking parity.
10. The memory system of claim 7, wherein the selection means comprises a multiplexer.
11. The memory system of claim 7, wherein the first memory device, the second memory device, the error checking means, and the selection means are implemented on a single chip.
12. A method for reducing errors in a memory system, comprising: writing data into first and second memory banks of the memory system in parallel; reading data from a desired location of the first memory bank; checking the data read from the first memory bank for errors; if no errors are present, outputting the data read from the first memory bank to a bus; and if the data read from the first memory bank contains errors, outputting data read from a parallel location in the second memory bank to the bus.
13. The method to claim 12, wherein checking the data read from the first memory bank for errors comprises checking the data for parity
14. The method of claim 12, wherein the data read from the first memory bank is cleared for parity on a byte-by-byte basis.
15. The method of claim 12, wherein data from one of the first memory bank and second memory bank are selected using a multiplexer.
16. A partitioned static random access memory comprising: a first static random access memory bank; a second static random access memory bank, the first and second static random access memory banks being configured such that data may be written to parallel locations therein; a parity checking circuit configured to check parity of data read from the first static random access memory bank and to output a result indicative thereof; and a multiplexer configured to receive data read from the parallel locations in the first and second static random access memory banks and to select one of said data depending upon the result output by the parity checking circuit.
PCT/US2001/022201 2000-07-14 2001-07-13 Partitioned random access memory WO2002008901A2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2001280547A AU2001280547A1 (en) 2000-07-14 2001-07-13 Partitioned random access memory

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US21834600P 2000-07-14 2000-07-14
US60/218,346 2000-07-14
US09/904,884 2001-07-12
US09/904,884 US6854084B2 (en) 2000-07-14 2001-07-12 Partitioned random access memory

Publications (2)

Publication Number Publication Date
WO2002008901A2 true WO2002008901A2 (en) 2002-01-31
WO2002008901A3 WO2002008901A3 (en) 2002-08-15

Family

ID=26912817

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2001/022201 WO2002008901A2 (en) 2000-07-14 2001-07-13 Partitioned random access memory

Country Status (3)

Country Link
US (1) US6854084B2 (en)
AU (1) AU2001280547A1 (en)
WO (1) WO2002008901A2 (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7676730B2 (en) * 2005-09-30 2010-03-09 Quantum Corporation Method and apparatus for implementing error correction coding in a random access memory
TWI326413B (en) * 2007-02-12 2010-06-21 Nanya Technology Corp Control method for memory access
US9368199B2 (en) * 2014-09-02 2016-06-14 Kabushiki Kaisha Toshiba Memory device
US10552258B2 (en) * 2016-09-16 2020-02-04 Semiconductor Energy Laboratory Co., Ltd. Semiconductor device, electronic device, and driving method thereof
KR102545189B1 (en) * 2018-09-07 2023-06-19 삼성전자주식회사 Storage device, storage system and method of operating storage device

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5916314A (en) * 1996-09-11 1999-06-29 Sequent Computer Systems, Inc. Method and apparatus for cache tag mirroring

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5611042A (en) * 1995-10-10 1997-03-11 Lordi; Angela L. Data error detection and correction for a shared SRAM
US6237124B1 (en) * 1998-03-16 2001-05-22 Actel Corporation Methods for errors checking the configuration SRAM and user assignable SRAM data in a field programmable gate array

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5916314A (en) * 1996-09-11 1999-06-29 Sequent Computer Systems, Inc. Method and apparatus for cache tag mirroring

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"ERROR CORRECTION TECHNIQUE WHICH INCREASES MEMORY BANDWIDTH AND REDUCES ACCESS PENALTIES" IBM TECHNICAL DISCLOSURE BULLETIN, IBM CORP. NEW YORK, US, vol. 31, no. 3, 1 August 1988 (1988-08-01), pages 146-149, XP000715702 ISSN: 0018-8689 *
TURGEON P R ET AL: "TWO APPROACHES TO ARRAY FAULT TOLERANCE IN THE IBM ENTERPRISE SYSTEM/9000 TYPE 9121 PROCESSOR" IBM JOURNAL OF RESEARCH AND DEVELOPMENT, IBM CORPORATION, ARMONK, US, vol. 35, no. 3, 1 May 1991 (1991-05-01), pages 382-388, XP002017227 ISSN: 0018-8646 *

Also Published As

Publication number Publication date
WO2002008901A3 (en) 2002-08-15
US6854084B2 (en) 2005-02-08
AU2001280547A1 (en) 2002-02-05
US20020046383A1 (en) 2002-04-18

Similar Documents

Publication Publication Date Title
US5509132A (en) Semiconductor memory device having an SRAM as a cache memory integrated on the same chip and operating method thereof
US5987628A (en) Method and apparatus for automatically correcting errors detected in a memory subsystem
US5172379A (en) High performance memory system
US5961660A (en) Method and apparatus for optimizing ECC memory performance
US9146811B2 (en) Method and apparatus for repairing high capacity/high bandwidth memory devices
EP0418457A2 (en) Pipelined error checking and correction for cache memories
US5421000A (en) Memory subsystem having a static row memory and a dynamic RAM
EP1255197B1 (en) System and method for correcting soft errors in random access memory devices
KR100245062B1 (en) High density simm or dimm with ras address re-mapping
US20010050866A1 (en) Output circuit for alternating multiple bit line per column memory architecture
WO2018038805A1 (en) Low power data transfer for memory subsystem
US7350018B2 (en) Method and system for using dynamic random access memory as cache memory
US7076610B2 (en) FIFO memory devices having multi-port cache memory arrays therein that support hidden EDC latency and bus matching and methods of operating same
US7093047B2 (en) Integrated circuit memory devices having clock signal arbitration circuits therein and methods of performing clock signal arbitration
US5386387A (en) Semiconductor memory device including additional memory cell block having irregular memory cell arrangement
US6854084B2 (en) Partitioned random access memory
JPH0594377A (en) Parity detecting circuit
US5434871A (en) Continuous embedded parity checking for error detection in memory structures
US6301171B2 (en) Semiconductor memory device capable of reducing data test time in pipeline
Asakura et al. An experimental 1-Mbit cache DRAM with ECC
US5751727A (en) Dynamic latch circuit for utilization with high-speed memory arrays
US5255241A (en) Apparatus for intelligent reduction of worst case power in memory systems
JP2699640B2 (en) Electronic circuit using radiation recognition circuit
US20020147955A1 (en) Internal storage memory with EDAC protection
US20030005211A1 (en) Method and apparatus for accessing banked embedded dynamic random access momory devices

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP