US 7,599,205 B2Grant
Methods and apparatus of stacking DRAMs
Issue Date:2009-10-06
•32 Claims
•16 Drawing Sheets
Abstract
Large capacity memory systems are constructed using stacked memory integrated circuits or chips. The stacked memory chips are constructed in such a way that eliminates problems such as signal integrity while still meeting current and future memory standards.
Metadata
Assignee
- MetaRAM, Inc.
Inventor
- Suresh N. Rajan
Application Information
Application Number:US 12/055,107
Filing Date:2008-03-25
Priority Date:2005-09-02
Art Unit:2827
Classifications
IPC:
G11C5/06
Patent Drawings (16 sheets)
Description
Cross-References to Related Applications
[0001] This patent application is a continuation of U.S. patent application entitled “Methods and Apparatus of Stacking DRAMs,” Ser. No. 11/515,406 filed on Sep. 1, 2006, now U.S. Pat. No. 7,379,316 which, in turn, claims the benefit to U.S. Provisional Patent Application entitled “Methods and Apparatus of Stacking DRAMs,” Ser. No, 60/173,815, filed on Sep. 2, 2005, which are incorporated herein by reference.
Background of the Invention
[0002] 1. Field of the Invention
[0003] The present invention is directed toward the field of building custom memory systems cost-effectively for a wide range of markets.
[0004] 2. Art Background
[0005] Dynamic Random Access Memory (DRAM) is the most popular type of volatile memory and is widely used in a number of different markets. The popularity of DRAMs is mostly due to their cost-effectiveness (Mb/$). The PC main memory market has traditionally been the largest consumer of DRAMs.
[0006] The DRAM interface speed in several important markets is increasing rapidly. For example, the PC market today uses 667 MHz DDR2 SDRAMs. The industry is on track to use 800 MHz DDR2 SDRAMs in 2006. Effort is also underway in developing DDR3 SDRAMs that are expected to have interface speeds ranging from 800 MHz to 1600 MHz.
[0007] Signal integrity becomes increasingly challenging as the interface speed increases. At higher speeds, the number of loads on a memory channel must be decreased in order to ensure clean signals. For example, when the PC desktop segment used 133 MHz SDRAMs, three DIMM slots per memory channel (or bus or interface) was the norm when using unbuffered modules. When this market segment adopted DDR SDRAMs and now DDR2 SDRAMs, the number of DIMM slots per memory channel dropped to two. At DDR3 speeds, it is predicted that only one DIMM slot will be possible per memory channel. This obviously places an upper limit on the maximum memory capacity of the system.
[0008] Clearly there is a need for an invention that increases the memory capacity of a system in a manner that is both cost-effective and compatible with existing and future standards while solving various technical problems like signal integrity.
Summary of the Invention
[0009] In one embodiment, large capacity memory systems are constructed using stacked memory integrated circuits or chips. The stacked memory chips are constructed in such a way that eliminates problems like signal integrity while still meeting current and future memory standards.
Brief Description of the Drawings
[0010] FIG. 1 illustrates one embodiment for a FB-DIMM.
[0011] FIG. 2A includes the FB-DIMMs of FIG. 1 with annotations to illustrate latencies between a memory controller and two FB-DIMMs.
[0012] FIG. 2B illustrates latency in accessing an FB-DIMM with DRAM stacks, where each stack contains two DRAMs.
[0013] FIG. 3 is a block diagram illustrating one embodiment of a memory device that includes multiple memory core chips.
[0014] FIG. 4 is a block diagram illustrating one embodiment for partitioning a high speed DRAM device into asynchronous memory core chip and an interface chip.
[0015] FIG. 5 is a block diagram illustrating one embodiment for partitioning a memory device into a synchronous memory chip and a data interface chip.
[0016] FIG. 6 illustrates one embodiment for stacked memory chips.
[0017] FIG. 7 is a block diagram illustrating one embodiment for interfacing a memory device to a DDR2 memory bus.
[0018] FIG. 8 a is a block diagram illustrating one embodiment for stacking memory chips on a DIMM module.
[0019] FIG. 8 b is a block diagram illustrating one embodiment for stacking memory chips with memory sparing.
[0020] FIG. 8 c is a block diagram illustrating operation of a working pool of stack memory.
[0021] FIG. 8 d is a block diagram illustrating one embodiment for implementing memory sparing for stacked memory chips.
[0022] FIG. 8 e is a block diagram illustrating one embodiment for implementing memory sparing on a per stack basis.
[0023] FIG. 9 a is a block diagram illustrating memory mirroring in accordance with one embodiment.
[0024] FIG. 9 b is a block diagram illustrating one embodiment for a memory device that enables memory mirroring.
[0025] FIG. 9 c is a block diagram illustrating one embodiment for a mirrored memory to system with stacks of memory.
[0026] FIG. 9 d is a block diagram illustrating one embodiment for enabling memory mirroring simultaneously across all stacks of a DIMM.
[0027] FIG. 9 e is a block diagram illustrating one embodiment for enabling memory mirroring on a per stack basis.
[0028] FIG. 10 a is a block diagram illustrating a stack of memory chips with memory RAID capability during execution of a write operation.
[0029] FIG. 10 b is a block diagram illustrating a stack of memory chips with memory RAID capability during a read operation.
[0030] FIG. 11 illustrates conventional impedance loading as a result of adding DRAMs to a high-speed memory bus.
[0031] FIG. 12 illustrates impedance loading as a result of adding DRAMs to a high-speed memory bus in accordance with one embodiment.
[0032] FIG. 13 is a block diagram illustrating one embodiment for adding low-speed memory chips using a socket.
[0033] FIG. 14 illustrates a PCB with a socket located on top of a stack,
[0034] FIG. 15 illustrates a PCB with a socket located on the opposite side from the stack.
[0035] FIG. 16 illustrates an upgrade PCB that contains one or more memory chips.
[0036] FIG. 17 is a block diagram illustrating one embodiment for stacking memory chips.
[0037] FIG. 18 is a timing diagram for implementing memory RAID using a datamask (“DM”) signal in a three chip stack composed of 8 bit wide DDR2 SDRAMS.
Detailed Description
[0038] The disclosure of U.S. Provisional Patent Application Ser. No, 60/713,815, entitled “Methods and Apparatus of Stacking DRAMs”, filed on Sep. 2, 2005, is hereby expressly incorporated herein by reference.
[0039] There are market segments such as servers and workstations that require very large memory capacities. One way to provide large memory capacity is to use Fully Buffered DIMMs (FB-DIMMs), wherein the DRAMs are electrically isolated from the memory channel by an Advanced Memory Buffer (AMB). The FB-DIMM solution is expected to be used in the server and workstation market segments. An AMB acts as a bridge between the memory channel and the DRAMs, and also acts as a repeater. This ensures that the memory channel is always a point-to-point connection. FIG. 1 illustrates one embodiment of a memory channel with FB-DIMMs. FB-DIMMs 100 and 150 include DRAM chips (110 and 160) and AMBs 120 and 170. A high-speed bi-directional link 135 couples a memory controller 130 to FB-DIMM 100. Similarly, FB-DIMM 100 is coupled to FB-DIMM 150 via high-speed bi-directional link 140. Additional FB-DIMMs may be added in a similar manner.
[0040] The FB-DIMM solution has some drawbacks, the two main ones being higher cost and higher latency (i.e. lower performance). Each AMB is expected to cost $10-$15 in volume, a substantial additional fraction of the memory module cost. In addition, each AMB introduces a substantial amount of latency (˜5 ns). Therefore, as the memory capacity of the system increases by adding more FB-DIMMs, the performance of the system degrades due to the latencies of successive AMBs.
[0041] An alternate method of increasing memory capacity is to stack DRAMs on top of each other. This increases the total memory capacity of the system without adding additional distributed loads (instead, the electrical load is added at almost a single point). In addition, stacking DRAMs on top of each other reduces the performance impact of AMBs since multiple FB-DIMMs may be replaced by a single FE-DIMM that contains stacked DRAMs. FIG. 2A includes the FB-DIMMs of FIG. 1 with annotations to illustrate latencies between a memory controller and two FB-DIMMs. The latency between memory controller 130 and FB-DIMM 100 is the sum of t1 and tc1, wherein t1 is the delay between memory channel interface of the AMB 120 and the DRAM interface of AMB 120 (i.e., the delay through AMB 120 when acting as a bridge), and tc1 is the signal propagation delay between memory controller 130 and FB-DIMM 100. Note that t1 includes the delay of the address/control signals through AMB 120 and optionally that of the data signals through AMB 120. Also, tc1 includes the propagation delay of signals from the memory controller 130 to FB-DIMM 100 and optionally, that of the signals from FB-DIMM 100 to the memory controller 130. As shown in FIG. 2A , the latency between memory controller 130 and FB-DIMM 150 is the sum of t2+t1+tc1+tc2, wherein t2 is the delay between input and output memory channel interfaces of AMB 120 (i.e. when AMB 120 is operating as a repeater) and tc2 is a signal propagation delay between FB-DIMM 100 and FB-DIMM 150. t2 includes the delay of the signals from the memory controller 130 to FB-DIMM 150 through AMB 120, and optionally that of the signals from FB-DIMM 150 to memory controller 130 through AMB 120. Similarly, tc2 represents the propagation delay of signals from FB-DIMM 100 to FB-DIMM 150 and optionally that of signals from FB-DIMM 150 and FB-DIMM 100. t1 represents the delay of the signals through an AMB chip that is operating as a bridge, which in this instance, is AMB 170.
[0042] FIG. 2B illustrates latency in accessing an FB-DIMM with DRAM stacks, where each stack contains two DRAMs. In some embodiments, a “stack” comprises at least one DRAM chip. In other embodiments, a “stack” comprises an interface or buffer chip with at least one DRAM chip. FB-DIMM 210 includes three stacks of DRAMs (220, 230 and 240) and AMB 250 accessed by memory controller 200. As shown in FIG. 2B , the latency for accessing the stacks of DRAMs is the sum of t1 and tc1. It can be seen from FIGS. 2A and 2B that the latency is less in a memory channel with an FB-DIMM that contains 2-DRAM stacks than in a memory channel with two standard FB-DIMMs (i.e. FB-DIMMs with individual DRAMs). Note that FIG. 2B shows the case of 2 standard FB-DIMMs vs. an FB-DIMM that uses 2-DRAM stacks as an example. However, this may be extended to n standard FB-DIMMs vs. an FB-DIMMM that uses n-DRAM stacks.
[0043] Stacking high speed DRAMs on top of each other has its own challenges. As high speed DRAMs are stacked, their respective electrical loads or input parasitics (input capacitance input inductance, etc.) add up, causing signal integrity and electrical loading problems and thus limiting the maximum interface speed at which a stack may operate. In addition, the use of source synchronous strobe signals introduces an added level of complexity when stacking high speed DRAMs.
[0044] Stacking low speed DRAMs on top of each other is easier than stacking high speed DRAMs on top of each other. Careful study of a high speed DRAM will show that it consists of a low speed memory core and a high speed interface. So, if we may separate a high speed DRAM into two chips—a low speed memory chip and a high speed interface chip, we may stack multiple low speed memory chips behind a single high speed interface chip. FIG. 3 is a block diagram illustrating one embodiment of a memory device that includes multiple memory core chips. Memory device 320 includes a high speed interface chip 300 and a plurality of low speed memory chips 310 stacked behind high speed interface chip 300. One way of partitioning is to separate a high speed DRAM into a low speed, wide asynchronous memory core and a high speed interface chip. FIG. 4 is a block diagram illustrating one embodiment for partitioning a high speed DRAM device into asynchronous memory core and an interface chip. Memory device 400 includes asynchronous memory core chip 420 interfaced to a memory channel via interface chip 410. As shown in FIG. 4 , interface chip 410 receives address (430), command (440) and data (460) from an external data bus, and uses address (435), command & control (445 and 450) and data (465) over an internal data bus to communicate with asynchronous memory core chip 420.
[0045] However, it must be noted that several other partitions are also possible. For example, the address bus of a high speed DRAM typically runs at a lower speed than the data bus, For a DDR400 DDR SDRAM, the address bus runs at a 200 MHz speed while the data bus runs at a 400 MHz speed, whereas for a DDR2-800 DDR2 SDRAM, the address bus runs at a 400 MHz speed while the data bus runs at an 800 MHz speed. High-speed DRAMs use pre-fetching in order to support high data rates. So, a DDR2-800 device runs internally at a rate equivalent to 200 MHz rate except that 4n data bits are accessed from the memory core for each read or write operation, where n is the width of the external data bus. The 4n internal data bits are multiplexed/de-multiplexed onto the n external data pins, which enables the external data pins to run at 4 times the internal data rate of 200 MHz.
[0046] Thus another way to partition, for example, a high speed n-bit wide DDR2 SDRAM could be to split it into a slower, 4n-bit wide, synchronous DRAM chip and a high speed data interface chip that does the 4n to n data multiplexing/de-multiplexing. FIG. 5 is a block diagram illustrating one embodiment for partitioning a memory device into a synchronous memory chip and a data interface chip. For this embodiment, memory device 500 includes synchronous memory chip 510 and a data interface chip 520. Synchronous memory chip 510 receives address (530) and command & clock 540 from a memory channel. It also connected with data interface chip 520 through command & control (550) and data 570 over a 4n bit wide internal data bus. Data interface chip 520 connects to an n-bit wide external data bus 545 and at 4n-bit wide internal data bus 570. In one embodiment, an n-bit wide high speed DRAM may be partitioned into an m*n-bit wide synchronous DRAM chip and a high-speed data interface chip that does the m*n-to-n data multiplexing/de-multiplexing, where m is the amount of pre-fetching, m>1, and m is typically an even number.
[0047] As explained above, while several different partitions are possible, in some embodiments the partitioning should be done in such a way that:
[0048] the host system sees only a single load (per DIMM in the embodiments where the memory devices are on a DIMM) on the high speed signals or pins of the memory channel or bus and
[0049] the memory chips that are to be stacked on top of each other operate at a speed lower than the data rate of the memory channel or bus (i.e. the rate of the external data bus), such that stacking these chips does not affect the signal integrity.
[0050] Based on this, multiple memory chips may be stacked behind a single interface chip that interfaces to some or all of the signals of the memory channel. Note that this means that some or all of the I/O signals of a memory chip connect to the interface chip rather than directly to the memory channel or bus of the host system. The I/O signals from the multiple memory chips may be bussed together to the interface chip or may be connected as individual signals to the interface chip. Similarly, the I/O signals from the multiple memory chips that are to be connected directly to the memory channel or bus of the host system may be bussed together or may be connected as individual signals to the external memory bus. One or more buses may be used when the I/O signals are to be bussed to either the interface chip or the memory channel or bus. Similarly, the power for the memory chips may be supplied by the interface chip or may come directly from the host system.
[0051] FIG. 6 illustrates one embodiment for stacked memory chips. Memory chips (620, 630 and 640) include inputs and/or outputs for s1, s2, s3, s4 as well as v1 and v2. The s1 and s2 inputs and/or outputs are coupled to external memory bus 650) and s3 and s4 inputs and/or outputs are coupled to interface chip 610. Memory signals s1 and s4 are examples of signals that are not bussed. Memory signals s2 and s3 are examples of bussed memory signals. Memory power rail v1 is an example of memory power connected directly to external bus 650, whereas v2 is an example of memory power rail connected to interface 610. The memory chips that are to be stacked on top of each other may be stacked as dies or as individually packaged parts. One method is to stack individually packaged parts since these parts may be tested and built-in before stacking. In addition, since packaged parts may be stacked on top of each other and soldered together, it is quite easy to repair a stack. To illustrate, if a part in the stack were to fail, the stack may be de-soldered and separated into individual packages, the failed chip may be replaced by a new and functional chip, and the stack may be re-assembled. However, it should be clear that repairing a stack as described above is time consuming and labor intensive.
[0052] One way to build an effective p-chip memory stack is to use p+q memory chips and an interface chip, where the q extra memory chips (1≦q≦p typically) are spare chips, where in p and q comprise integer values. If one or more of the p memory chips becomes damaged during assembly of the stack, they may be replaced with the spare chips. The post-assembly detection of a failed chip may either be done using a tester or using built-in self test (BIST) logic in the interface chip. The interface chip may also be designed to have the ability to replace a failed chip with a spare chip such that the replacement is transparent to the host system.
[0053] This idea may be extended further to run-time (i.e. under normal operating conditions) replacement of memory chips in a stack, Electronic memory chips such as DRAMs are prone to hard and soft memory errors. A hard error is typically caused by broken or defective hardware such that the memory chip consistently returns incorrect results. For example, a cell in the memory array might be stuck low so that it always returns a value of “0” even when a “1” is stored in that cell. Hard errors are caused by silicon defects, bad solder joints, broken connector pins, etc. Hard errors may typically be screened by rigorous testing and burn-in of DRAM chips and memory modules. Soft errors are random, temporary errors that are caused when a disturbance near a memory cell alters the content of the cell. The disturbance is usually caused by cosmic particles impinging on the memory chips, Soft errors may be corrected by overwriting the bad content of the memory cell with the correct data. For DRAMs, soft errors are more prevalent than hard errors.
[0054] Computer manufacturers use many techniques to deal with soft errors. The simplest way is to use an error correcting code (ECC), where typically 72 bits are used to store 64 bits of data. This type of code allows the detection and correction of a single-bit error, and the detection of two-bit errors. ECC does not protect against a hard failure of a DRAM chip. Computer manufacturers use a technique called Chipkill or Advanced ECC to protect against this type of chip failure. Disk manufacturers use a technique called Redundant Array of Inexpensive Disks (RAID) to deal with similar disk errors.
[0055] More advanced techniques such as memory sparing, memory mirroring, and memory RAID are also available to protect against memory errors and provide higher levels of memory availability. These features are typically found on higher-end servers and require special logic in the memory controller. Memory sparing involves the use of a spare or redundant memory bank that replaces a memory bank that exhibits an unacceptable level of soft errors A memory bank may be composed of a single DIMM or multiple DIMMs. Note that the memory bank in this discussion about advanced memory protection techniques should not be confused with the internal banks of DRAMs.
[0056] In memory mirroring, every block of data is written to system or working memory as well as to the same location in mirrored memory but data is read back only from working memory. If a bank in the working memory exhibits an unacceptable level of errors during read back, the working memory will be replaced by the mirrored memory.
[0057] RAID is a well-known set of techniques used by the disk industry to protect against disk errors Similar RAID techniques may be applied to memory technology to protect against memory errors. Memory RAID is similar in concept to RAID 3 or RAID 4 used in disk technology. In memory RAID) a block of data (typically some integer number of cachelines) is written to two or more memory banks while the parity for that block is stored in a dedicated parity bank. If any of the banks were to fail, the block of data may be re-created with the data from the remaining banks and the parity data.
[0058] These advanced techniques (memory sparing, memory mirroring, and memory RAID) have up to now been implemented using individual DIMMs or groups of DIMMs. This obviously requires dedicated logic in the memory controller. However, in this disclosure, such features may mostly be implemented within a memory stack and requiring only minimal or no additional support from the memory controller.
[0059] A DIMM or FB-DIMM may be built using memory stacks instead of individual DRAMs For example, a standard FB-DIMM might contain nine, 18, or more DDR2 SDRAM chips. An FB-DIMM may contain nine 18, or more DDR2 stacks, wherein each stack contains a DDR2 SDRAM interface chip and one or more low speed memory chips stacked on top of it (i.e. electrically behind the interface chip—the interface chip is electrically between the memory chips and the external memory bus). Similarly, a standard DDR2 DIMM may contain nine 18 or more DDR2 SDRAM chips. A DDR2 DIMM may instead contain nine 18, or more DDR2 stacks, wherein each stack contains a DDR2 SDRAM interface chip and one or more low speed memory chips stacked on top of it. An example of a DDR2 stack built according to one embodiment is shown in FIG. 7 .
[0060] FIG. 7 is a block diagram illustrating one embodiment for interfacing a memory device to a DDR2 memory bus. As shown in FIG. 7 , memory device 700 comprises memory chips 720 coupled to DDR2 SDRAM interface chip 710. In turn, DDR2 SDRAM interface chip 710 interfaces memory chips 720 to external DDR2 memory bus 730. As described previously, in one embodiment, an effective p-chip memory stack maybe built with p+q memory chips and an interface chip, where the q chips may be used as spares, and p and q are integer values. In order to implement memory sparing within the stack, the p+q chips may be separated into two pools of chips; a working pool of p chips and a spare pool of q chips. So, if a chip in the working pool were to fail, it may be replaced by a chip from the spare pool. The replacement of a failed working chip by a spare chip may be triggered, for example, by the detection of a multi-bit failure in a working chip, or when the number of errors in the data read back from a working chip crosses a pre-defined or programmable error threshold.
[0061] Since ECC is typically implemented across the entire 64 data bits in the memory channel and optionally, across a plurality of memory channels, the detection of single-bit or multi-bit errors in the data read back is only done by the memory controller (or the AMB in the case of an FB-DIMM). The memory controller (or AMB) may be designed to keep a running count of errors in the data read back from each DIMM. If this running count of errors were to exceed a certain pre-defined or programmed threshold, then the memory controller may communicate to the interface chip to replace the chip in the working pool that is generating the errors with a chip from the spare pool.
[0062] For example, consider the case of a DDR2 DIMM. Let us assume that the DIMM contains nine DDR2 stacks (stack 0 through 8, where stack 0 corresponds to the least significant eight data bits of the 72-bit wide memory channel, and stack 8 corresponds to the most significant 8 data bits), and that each DDR2 stack consists of five chips, four of which are assigned to the working pool and the fifth chip is assigned to the spare pool. Let us also assume that the first chip in the working pool corresponds to address range [N−1:0], the second chip in the working pool corresponds to address range [2N−1N], the third chip in the working pool corresponds to address range [3N−1:2N], and the fourth chip in the working pool corresponds to address range [4N−1:3N], where “N” is an integer value.
[0063] Under normal operating conditions, the memory controller may be designed to keep track of the errors in the data from the address ranges [4N−1:3N], [3N−1:2N], [2N−1:N], and [N−1:0]. If, say, the errors in the data in the address range [3N−1:2N] exceeded the pre-defined threshold, then the memory controller may instruct the interface chip in the stack to replace the third chip in the working pool with the spare chip in the stack. This replacement may either be done simultaneously in all the nine stacks in the DIMM or may be done on a per-stack basis. Assume that the errors in the data from the address range [3N−1:2N] are confined to data bits [7:0] from the DIMM. In the former case, the third chip in all the stacks will be replaced by the spare chip in the respective stacks. In the latter case, only the third chip in stack 0 (the LSB stack) will be replaced by the spare chip in that stack. The latter case is more flexible since it compensates for or tolerates one failing chip in each stack (which need not be the same chip in all the stacks), whereas the former case compensates for or tolerates one failing chip over all the stacks in the DIMM, So, in the latter case, for an effective p-chip stack built with p+q memory chips, up to q chips may fall per stack and be replaced with spare chips. The memory controller (or AMB) may trigger the memory sparing operation (i.e. replacing a failing working chip with a spare chip) by communicating with the interface chips either through in-band signaling or through sideband signaling. A System Management Bus (SMBus) is an example of sideband signaling.
[0064] Embodiments for memory sparing within a memory stack configured in accordance with some embodiments are shown in FIGS. 8 a-8e.
[0065] FIG. 8 a is a block diagram illustrating one embodiment for stacking memory chips on a DIMM module. For this example, memory module 800 includes nine stacks (810, 820, 830, 840, 850, 860, 870, 880 and 890). Each stack comprises at least two memory chips. In one embodiment, memory module 800 is configured to work in accordance with DDR2 specifications.
[0066] FIG. 8 b is a block diagram illustrating one embodiment for stacking memory chips with memory sparing. For the example memory stack shown in FIG. 8 b, memory device 875 includes memory chips (885, 886, 888 and 892) stacked to form the working memory pool. For this embodiment, to access the working memory pool, the memory chips are each assigned a range of addresses as shown in FIG. 8 b. Memory device 875 also includes spare memory chip 895 that forms the spare memory pool. However, the spare memory pool may comprise any number of memory chips.
[0067] FIG. 8 c is a block diagram illustrating operation of a working memory pool. For this embodiment, memory module 812 includes a plurality of integrated circuit memory stacks (814, 815, 816, 817, 818, 819, 821, 822 and 823). For this example, each stack contains a working memory pool 825 and a spare memory chip 855.
[0068] FIG. 8 d is a block diagram illustrating one embodiment for implementing memory sparing for stacked memory chips. For this example, memory module 824 also includes a plurality of integrated circuit memory stacks (826, 827, 828, 829, 831, 832, 833, 834 and 835). For this embodiment, memory sparing may be enabled if data errors occur in one or more memory chips (i.e., occur in an address range). For the example illustrated in FIG. 8 d, data errors exceeding a predetermined threshold have occurred in DQ[7:0] in the address range [3N−1:2N]. To implement memory sparing, the failing chip is replaced simultaneously in all of the stacks of the DIMM. Specifically, for this example, failing chip 857 is replaced by spare chip 855 in all memory stacks of the DIMM.
[0069] FIG. 8 e is a block diagram illustrating one embodiment for implementing memory sparing on a per stack basis. For this embodiment, memory module 836 also includes a plurality of integrated circuit memory stacks (837, 838, 839, 841, 842, 843, 844, 846 and 847). Each stack is apportioned into the working memory pool and a spare memory pool (e.g., spare chip 861). For this example, memory chip chip 863 failed in stack 847. To enable memory sparing, only the spare chip in stack 847 replaces the failing chip, and all other stacks, continue to operate using the working pool.
[0070] Memory mirroring can be implemented by dividing the p+q chips in each stack into two equally sized sections—the working section and the mirrored section. Each data that is written to memory by the memory controller is stored in the same location in the working section and in the mirrored section. When data is read from the memory by the memory controller, the interface chip reads only the appropriate location in the working section and returns the data to the memory controller. If the memory controller detects that the data returned had a multi-bit error, for example, or if the cumulative errors in the read data exceeded, a pre-defined or programmed threshold, the memory controller can be designed to tell the interface chip (by means of in-band or sideband signaling) to stop using the working section and instead treat the mirrored section as the working section. As discussed for the case of memory sparing, this replacement can either be done across all the stacks in the DIMM or can be done on a per-stack basis. The latter case is more flexible since it can compensate for or tolerate one failing chip in each stack whereas the former case can compensate for or tolerate one failing chip over all the stacks in the DIMM.
[0071] Embodiments for memory mirroring within a memory stack are shown in FIGS. 9 a-9e.
[0072] FIG. 9 a is a block diagram illustrating memory mirroring in accordance with one embodiment. As shown in FIG. 9 a, a memory device 900 includes interface chip 910 that interfaces memory to an external memory bus. The memory is apportioned into a working memory section 920 and a mirrored memory section 930. During normal operation, write operations occur in both the working memory section 920 and the mirrored memory section 930. However, read operations are only conducted from the working memory section 920.
[0073] FIG. 9 b is a block diagram illustrating one embodiment for a memory device that enables memory mirroring. For this example, memory device 900 uses mirrored memory section 930 as working memory due to a threshold of errors that occurred in the working memory 920. As such, working memory section 920 is labeled as the unusable working memory section. In operation, interface chip 910 executes write operations to mirrored memory section 930 and optionally to the unusable working memory section 920. However, with memory mirroring enabled, reads occur from mirrored memory section 930.
[0074] FIG. 9 c is a block diagram illustrating one embodiment for a mirrored memory system with integrated circuit memory stacks. For this embodiment, memory module 915 includes a plurality of integrated circuit memory stacks (902, 903, 904, 905, 906, 907, 908, 909 and 912). As shown in FIG. 9 c, each stack is apportioned into a working memory section 953, and labeled “W” in FIG. 9 c, as well as a mirrored memory section 951, labeled “M” in FIG. 9 c. For this example, the working memory section is accessed (i.e., mirrored memory is not enabled).
[0075] FIG. 9 d is a block diagram illustrating one embodiment for enabling memory mirroring simultaneously across all stacks of a DIMM. For this embodiment, memory module 925 also includes a plurality of integrated circuit memory stacks (921, 922, 923, 924, 926, 927, 928, 929 and 931) apportioned into a mirrored memory section 956 and a working memory section 958. For this embodiment, when memory mirroring is enabled, all chips in the mirrored memory section for each stack in the DIMM are used as the working memory.
[0076] FIG. 9 e is a block diagram illustrating one embodiment for enabling memory mirroring on a per stack basis. For this embodiment, memory module 935 includes a plurality of integrated circuit memory stacks (941, 942, 943, 944, 945, 946, 947, 948 and 949) apportioned into a mirrored section 961 (labeled “M”) and a working memory section 963 (labeled “W”). For this embodiment, when a predetermined threshold of errors occurs from a portion of the working memory, mirrored memory from the corresponding stack is replaced with working memory. For example, if data errors occurred in DQ[7:0] and exceed a threshold, then mirrored memory section 961 (labeled “Mu”) replaces working memory section 963 (labeled “uW”) for stack 949 only.
[0077] In one embodiment, memory RAID within a (p+1)-chip stack may be implemented by storing data across p chips and storing the parity (i.e. the error correction code or information) in a separate chip (i.e. the parity chip). So, when a block of data is written to the stack, the block is broken up into p equal sized portions and each portion of data is written to a separate chip in the stack. That is, the data is “striped” across p chips in the stack.
[0078] To illustrate, say that the memory controller writes data block A to the memory stack.
[0079] The interface chip splits this data block into p equal sized portions (A1, A2, A3, . . . Ap) and writes A1 to the first chip in the stack, A2 to the second chip, A3 to the third chip, and so on, till Ap is written to the pth chip in the stack. In addition, the parity information for the entire data block A is computed by the interface chip and stored in the parity chip. When the memory controller sends a read request for data block A, the interface chip reads A1, A2, A3, . . . , Ap from the first, second, third, . . . , pth chip respectively to form data block A. In addition, it reads the stored parity information for data block A. If the memory controller detects an error in the data read back from any of the chips in the stack, the memory controller may instruct the interface chip to re-create the correct data using the parity information and the correct portions of the data block A.
[0080] Embodiments for memory RAID within a memory stack are shown in FIGS. 10 a and 10b.
[0081] FIG. 10 a is a block diagram illustrating a stack of memory chips with memory RAID capability during execution of a write operation. Memory device 1000 includes an interface chip 1010 to interface “p+1” memory chips (1015, 1020, 1025, and 1030) to an external memory bus. FIG. 10 a shows a write operation of a data block “A”, wherein data for data block “A” is written into memory chips as follows.
[0082] A=Ap . . . A2, A1,
[0083] Parity[A]=(Ap)n . . . n(A2), n(A1),
[0084] wherein, “n” is the bitwise exclusive OR operator.
[0085] FIG. 10 b is a block diagram illustrating a stack of memory chips with memory RAID capability during a read operation. Memory device 1040 includes interface chip 1050, “p” memory chips (1060, 1070 and 1080) and a parity memory chip 1090. For a read operation, data block “A” consists of A1, A2, . . . Ap and Parity[A], and is read from the respective memory memory chips as shown in FIG. 10 b.
[0086] Note that this technique ensures that the data stored in each stack can recover from some types of errors. The memory controller may implement en or correction across the data from all the memory stacks on a DIMM, and optionally, across multiple DIMMs.
[0087] In other embodiments the bits stored in the extra chip may have alternative functions than parity. As an example, the extra storage or hidden bit field may be used to tag a cacheline with the address of associated cachelines. Thus suppose the last time the memory controller fetched cacheline A, it also then fetched cacheline B (where B is a random address). The memory controller can then write back cacheline A with the address of cacheline B in the hidden bit field. Then the next time the memory controller reads cacheline A, it will also read the data in the hidden bit field and pre-fetch cacheline B. In yet other embodiments, metadata or cache tags or prefetch information may be stored in the hidden bit field.
[0088] With conventional high speed DRAMs, addition of extra memory involves adding extra electrical loads on the high speed memory bus that connects the memory chips to the memory controller, as shown in FIG. 11 .
[0089] FIG. 11 illustrates conventional impedance loading as a result of adding DRAMs to a high-speed memory bus. For this embodiment, memory controller 1110 accesses memory on high-speed bus 1115. The load of a conventional DRAM on high-speed memory bus 1115 is illustrated in FIG. 11 (1120). To add additional memory capacity in a conventional manner, memory chips are added to the high-speed bus 1115, and consequently additional loads (1125 and 1130) are also added to the high-speed memory bus 1115.
[0090] As the memory bus speed increases, the number of chips that can be connected in parallel to the memory bus decreases. This places a limit on the maximum memory capacity. Alternately stated, as the number of parallel chips on the memory bus increases, the speed of the memory bus must decrease. So, we have to accept lower speed (and lower memory performance) in order to achieve high memory capacity.
[0091] Separating a high speed DRAM into a high speed interface chip and a low speed memory chip facilitates easy addition of extra memory capacity without negatively impacting the memory bus speed and memory system performance. A single high speed interface chip can be connected to some or all of the lines of a memory bus, thus providing a known and fixed load on the memory bus. Since the other side of the interface chip runs at a lower speed, multiple low speed memory chips can be connected to (the low speed side of) the interface chip without sacrificing performance, thus providing the ability to upgrade memory. In effect, the electrical loading of additional memory chips has been shifted from a high speed bus (which is the case today with conventional high speed DRAMs) to a low speed bus. Adding additional electrical loads on a low speed bus is always a much easier problem to solve than that of adding additional electrical loads on a high speed bus.
[0092] FIG. 12 illustrates impedance loading as a result of adding DRAMs to a high-speed memory bus in accordance with one embodiment. For this embodiment, memory controller 1210 accesses a high-speed interface chip 1200 on high-speed memory bus 1215. The load 1220 from the high-speed interface chip is shown in FIG. 12 . A low speed bus 1240 couples to high-speed interface chip 1200. The loads of the memory chips (1230 and 1225) are applied to low speed bus 1240. As a result, additional loads are not added to high-speed memory bus 1215.
[0093] The number of low speed memory chips that are connected to the interface chip may either be fixed at the time of the manufacture of the memory stack or may be changed after the manufacture. The ability to upgrade and add extra memory capacity after the manufacture of the memory stack is particularly useful in markets such as desktop PCs where the user may not have a clear understanding of the total system memory capacity that is needed by the intended applications. This ability to add additional memory capacity will become very critical when the PC industry adopts DDR3 memories in several major market segments such as desktops and mobile. The reason is that at DDR3 speeds, it is expected that only one DIMM can be supported per memory channel. This means that there is no easy way for the end user to add additional memory to the system after the system has been built and shipped.
[0094] In order to provide the ability to increase the memory capacity of a memory stack, a socket may be used to add at least one low speed memory chip. In one aspect, the socket can be on the same side of the printed circuit board (PCB) as the memory stack but be adjacent to the memory stack, wherein a memory stack may consist of at least one high speed interface chip or at least one high speed interface chip and at least one low speed memory chip. FIG. 13 is a block diagram illustrating one embodiment for adding low speed memory chips using a socket. For this embodiment, a printed circuit board (PCB) 1300, such as a DIMM, includes one or more stacks of high speed interface chips. In other embodiments, the stacks also include low-speed memory chips. As shown in FIG. 13 , one or more sockets (1310) are mounted on the PCB 1300 adjacent to the stacks 1320. Low-speed memory chips may be added to the sockets to increase the memory capacity of the PCB 1300. Also, for this embodiment, the sockets 1310 are located on the same side of the PCB 1300 as stacks 1320.
[0095] In situations where the PCB space is limited or the PCB dimensions must meet some industry standard or customer requirements, the socket for additional low speed memory chips can be designed to be on the same side, of the PCB as the memory stack and sit on top of the memory stack, as shown in FIG. 14 .
[0096] FIG. 14 illustrates a PCB with a socket located on top of a stack, PCB 400 includes a plurality of stacks (1420). A stack contains a high speed interface chip and optionally, one or more low speed memory chips. For this embodiment a socket (1410) sits on top of one or more stacks. Memory chips are placed in the socket(s) (1410) to add memory capacity to the PCB (e.g., DIMM). Alternately, the socket for the additional low speed memory chips can be designed to be on the opposite side of the PCB from the memory stack, as shown in FIG. 15 .
[0097] FIG. 15 illustrates a PCB with a socket located on the opposite side from the stack. For this embodiment, PCB 1500, such as a DIMM, comprises one or more stacks (1520) containing high speed interface chips, and optionally, one or more low speed memory chips. For this embodiment, one or more sockets (1510) are mounted on the opposite side of the PCB from the stack as shown in FIG. 15 . The low speed memory chips may be added to the memory stacks one at a time. That is, each stack may have an associated socket. In this case, adding additional capacity to the memory system would involve adding one or more low speed memory chips to each stack in a memory rank (a rank denotes all the memory chips or stacks that respond to a memory access; i.e. all the memory chips or stacks that are enabled by a common Chip Select signal). Note that the same number and density of memory chips must be added to each stack in a rank. An alternative method might be to use a common socket for all the stacks in a rank. In this case, adding additional memory capacity might involve inserting a PCB into the socket, wherein the PCB contains multiple memory chips, and there is at least one memory chip for each stack in the rank. As mentioned above, the same number and density of memory chips must be added to each stack in the rank.
[0098] Many different types of sockets can be used. For example, the socket may be a female type and the PCB with the upgrade memory chips may have associated male pins.
[0099] FIG. 16 illustrates an upgrade PCB that contains one or more memory chips. For this embodiment, an upgrade PCB 1610 includes one or more memory chips (1620). As shown in FIG. 16 , PCB 1610 includes male socket pins 1630. A female receptacle socket 1650 on a DIMM PCB mates with the male socket pins 1630 to upgrade the memory capacity to include additional memory chips (1620). Another approach would be to use a male type socket and an upgrade PCB with associated female receptacles.
[0100] Separating a high speed DRAM into a low speed memory chip and a high speed interface chip and stacking multiple memory chips behind an interface chip ensures that the performance penalty associated with stacking multiple chips is minimized. However, this approach requires changes to the architecture of current DRAMs, which in turn increases the time and cost associated with bringing this technology to the marketplace. A cheaper and quicker approach is to stack multiple off-the-shelf high speed DRAM chips behind a buffer chip but at the cost of higher latency.
[0101] Current off-the-shelf high speed DRAMs (such as DDR2 SDRAMs) use source synchronous strobe signals as the timing reference for bi-directional transfer of data. In the case of a 4-bit wide DDR or DDR2 SDRAM, a dedicated strobe signal is associated with the four data signals of the DRAM. In the case of an 8-bit wide chip, a dedicated strobe signal is associated with the eight data signals. For 16-bit and 32-bit chips, a dedicated strobe signal is associated with each set of eight data signals. Most memory controllers are designed to accommodate a dedicated strobe signal for every four or eight data lines in the memory channel or bus. Consequently, due to signal integrity and electrical loading considerations, most memory controllers are capable of connecting to only nine or 18 memory chips (in the case of a 72-bit wide memory channel) per rank. This limitation on connectivity means that two 4-bit wide high speed memory chips may be stacked on top of each other on an industry standard DIMM today, but that stacking greater than two chips is difficult. It should be noted that stacking two 4-bit wide chips on top of each other doubles the density of a DIMM. The signal integrity problems associated with more than two DRAMs in a stack make it difficult to increase the density of a DIMM by more than a factor of two today by using stacking techniques.
[0102] Using the stacking technique described below, it is possible to increase the density of a DIMM by four, six or eight times by correspondingly stacking four, six or eight DRAMs on top of each other. In order to do this, a buffer chip is located between the external memory channel and the DRAM chips and buffers at least one of the address, control, and data signals to and from the DRAM chips. In one implementation, one buffer chip may be used per stack. In other implementations, more than one buffer chip may be used per stack. In yet other implementations, one buffer chip may be used for a plurality of stacks.
[0103] FIG. 17 is a block diagram illustrating one embodiment for stacking memory chips. For this embodiment, buffer chip 1810 is coupled to a host system, typically to the memory controller of the system. Memory device 1800 contains at least two high-speed memory chips 1820 (e.g., DRAMs such as DDR2 SDRAMs) stacked behind the buffer chip 1810 (e.g., the high-speed memory chips 1820 are accessed by buffer chip 1810).
[0104] It is clear that the embodiment shown in FIG. 17 is similar to that described previously and illustrated in FIG. 3 . The main difference is that in the scheme illustrated in FIG. 3 , multiple low speed memory chips were stacked on top of a high speed interface chip, The high speed interface chip presented an industry-standard interface (such as DDR SDRAM or DDR SDRAM) to the host system while the interface between the high speed interface chip and the low speed memory chips may be non-standard (i.e. proprietary) or may conform to an industry standard. The scheme illustrated in FIG. 17 , on the other hand, stacks multiple high speed, off-the-shelf DRAMs on top of a high speed buffer chip. The buffer chip may or may not perform protocol translation (i.e. the buffer chip may present an industry-standard interface such as DDR2 to both the external memory channel and to the high speed DRAM chips) and may simply isolate the electrical loads represented by the memory chips (i.e. the input parasitics of the memory chips) from the memory channel.
[0105] In other implementations the buffer chip may perform protocol translations. For example, the buffer chip may provide translation from DDR3 to DDR2. In this fashion, multiple DDR2 SDRAM chips might appear to the host system as one or more DDR3 SDRAM chips. The buffer chip may also translate from one version of a protocol to another version of the same protocol. As an example of this type of translation, the buffer chip may translate from one set of DDR2 parameters to a different set of DDR2 parameters. In this way the buffer chip might, for example, make one or more DDR2 chips of one type (e.g. 4-4-4 DDR2 SDRAM) appear to the host system as one of more DDR2 chips of a different type (e.g. 6-6-6 DDR2 SDRAM). Note that in other implementations, a buffer chip may be shared by more than one stack. Also, the buffer chip may be external to the stack rather than being part of the stack. More than one buffer chip may also be associated with a stack.
[0106] Using a buffer chip to isolate the electrical loads of the high speed DRAMs from the memory channel allows us to stack multiple (typically between two and eight) memory chips on top of a buffer chip. In one embodiment, all the memory chips in a stack may connect to the same address bus. In another embodiment, a plurality of address buses may connect to the memory chips in a stack, wherein each address bus connects to at least one memory chip in the stack. Similarly, the data and strobe signals of all the memory chips in a stack may connect to the same data bus in one embodiment, while in another embodiment, multiple data buses may connect to the data and strobe signals of the memory chips in a stack, wherein each memory chip connects to only one data bus and each data bus connects to at least one memory chip in the stack.
[0107] Using a buffer chip in this manner allows a first number of DRAMS to simulate at least one DRAM of a second number. In the context of the present description, the simulation may refer to any simulating, emulating, disguising, and/or the like that results in at least one aspect (e.g. a number in this embodiment, etc.) of the DRAMs appearing different to the system. In different embodiments, the simulation may be electrical in nature, logical in nature and/or performed in any other desired manner. For instance, in the context of electrical simulation, a number of pins, wires, signals, etc. may be simulated, while, in the context of logical simulation, a particular function may be simulated.
[0108] In still additional aspects of the present embodiment, the second number may be more or less than the first number. Still yet, in the latter case, the second number may be one, such that a single DRAM is simulated. Different optional embodiments which may employ various aspects of the present embodiment will be set forth hereinafter.
[0109] In still yet other embodiments, the buffer chip may be operable to interface the DRAMs and the system for simulating at least one DRAM with at least one aspect that is different from at least one aspect of at least one of the plurality of the DRAMs. In accordance with various aspects of such embodiment, such aspect may include a signal, a capacity, a timing, a logical interface, etc. Of course, such examples of aspects are set forth for illustrative purposes only and thus should not be construed as limiting, since any aspect associated with one or more of the DRAMs may be simulated differently in the foregoing manner.
[0110] In the case of the signal, such signal may include an address signal, control signal, data signal, and/or any other signal, for that matter. For instance, a number of the aforementioned signals may be simulated to appear as fewer or more signals, or even simulated to correspond to a different type. In still other embodiments, multiple signals may be combined to simulate another signal. Even still, a length of time in which a signal is asserted may be simulated to be different.
[0111] In the case of capacity, such may refer to a memory capacity (which may or may not be a function of a number of the DRAMs). For example, the buffer chip may be operable for stimulating at least one DRAM with a first memory capacity that is greater than (or less than) a second memory capacity of at least one of the DRAMs.
[0112] In the case where the aspect is timing-related, the timing may possibly relate to a latency (e.g. time delay, etc.). In one aspect of the present embodiment, such latency may include a column address strobe (CAS) latency (tCAS), which refers to a latency associated with accessing a column of data. Still yet, the latency may include a row address strobe (RAS) to CAS latency (RCD), which refers to a latency required between RAS and CAS. Even still, the latency may include a row precharge latency (tRP), which refers a latency required to terminate access to an open row. Further, the latency may include an active to precharge latency (tRAS), which refers to a latency required to access a certain row of data between a data request and a precharge command. In any case, the buffer chip may be operable for simulating at least one DRAM with a first latency that is longer (or shorter) than a second latency of at least one of the DRAMs. Different optional embodiments which employ various features of the present embodiment will be set forth hereinafter.
[0113] In still another embodiment, a buffer chip may be operable to receive a signal from the system and communicate the signal to at least one of the DRAMs after a delay. Again, the signal may refer to an address signal, a command signal (e.g. activate command signal, precharge command signal, a write signal, etc.) data signal, or any other signal for that matter. In various embodiments, such delay may be fixed or variable.
[0114] As an option, the delay may include a cumulative delay associated with any one or more of the aforementioned signals. Even still, the delay may time shift the signal forward and/or back in time (with respect to other signals). Of course, such forward and backward time shift may or may not be equal in magnitude. In one embodiment, this time shifting may be accomplished by utilizing a plurality of delay functions which each apply a different delay to a different signal.
[0115] Further, it should be noted that the aforementioned buffer chip may include a register, an advanced memory buffer (AMB), a component positioned on at least one DIMM, a memory controller, etc. Such register may, in various embodiments, include a Joint Electron Device Engineering Council (JEDEC) register, a JEDEC register including one or more functions set forth herein, a register with forwarding, storing, and/or buffering capabilities, etc. Different optional embodiments, which employ various features, will be set forth hereinafter.
[0116] In various embodiments, it may be desirable to determine whether the simulated DRAM circuit behaves according to a desired DRAM standard or other design specification. A behavior of many DRAM circuits is specified by the JEDEC standards and it may be desirable, in some embodiments, to exactly simulate a particular JEDEC standard DRAM. The JEDEC standard defines commands that a DRAM circuit must accept and the behavior of the DRAM circuit as a result of such commands. For example, the JEDEC specification for a DDR2 DRAM is known as JESD79-2B.
[0117] If it is desired, for example, to determine whether a JEDEC standard is met, the following algorithm may be used. Such algorithm checks, using a set of software verification tools for formal verification of logic, that protocol behavior of the simulated DRAM circuit is the same as a desired standard or other design specification. This formal verification is quite feasible because the DRAM protocol described in a DRAM standard is typically limited to a few protocol commands (e.g. approximately 15 protocol commands in the case of the JEDEC DDR2 specification, for example).
[0118] Examples of the aforementioned software verification tools include MAGELLAN supplied by SYNOPSYS, or other software verification tools, such as INCISIVE supplied by CADENCE, verification tools supplied by JASPER, VERIX supplied by REAL INTENT, 0-IN supplied by MENTOR CORPORATION, and others. These software verification tools use written assertions that correspond to the rules established by the DRAM protocol and specification. These written assertions are further included in the code that forms the logic description for the buffer chip. By writing assertions that correspond to the desired behavior of the simulated DRAM circuit, a proof may be constructed that determines whether the desired design requirements are met. In this way, one may test various embodiments for compliance with a standard, multiple standards, or other design specification.
[0119] For instance, an assertion may be written that no two DRAM control signals are allowed to be issued to an address, control and clock bus at the same time. Although one may know which of the various buffer chip and DRAM stack configurations and address mappings that have been described herein are suitable, the aforementioned algorithm may allow a designer to prove that the simulated DRAM circuit exactly meets the required standard or other design specification. If, for example, an address mapping that uses a common bus for data and a common bus for address results in a control and clock bus that does not meet a required specification, alternative designs for the buffer chip with other bus arrangements or alternative designs for the interconnect between the buffer chip and other components may be used and tested for compliance with the desired standard or other design specification.
[0120] The buffer chip may be designed to have the same footprint (or pin out) as an industry-standard DRAM (e.g. a DDR2 SDRAM footprint). The high speed DRAM chips that are stacked on top of the buffer chip may either have an industry-standard pin out or can have a non-standard pin out. This allows us to use a standard DIMM PCB since each stack has the same footprint as a single industry-standard DRAM chip. Several companies have developed proprietary ways to stack multiple DRAMs on top of each other (e.g. μZ Ball Stack from Tessera, Inc., High Performance Stakpak from Staktek Holdings, Inc.). The disclosed techniques of stacking multiple memory chips behind either a buffer chip (FIG. 18 ) or a high speed interface chip (FIG. 3 ) is compatible with all the different ways of stacking memory chips. It does not require any particular stacking technique.
[0121] A double sided DIMM (i.e. a DIMM that has memory chips on both sides of the PCB) is electrically worse than a single sided DIMM, especially if the high speed data and strobe signals have to be routed to two DRAMs, one on each side of the board. This implies that the data signal might have to split into two branches (i.e. a T topology) on the DIMM, each branch terminating at a DRAM on either side of the board. A T topology is typically worse from a signal integrity perspective than a point-to-point topology. Rambus used mirror packages on double sided Rambus In-line Memory Modules (RIMMs) so that the high speed signals had a point-to-point topology rather than a T topology. This has not been widely adopted by the DRAM makers mainly because of inventory concerns. In this disclosure, the buffer chip may be designed with an industry-standard DRAM pin out and a mirrored pin out. The DRAM chips that are stacked behind the buffer chip may have a common industry-standard pin out, irrespective of whether the buffer chip has an industry-standard pin out or a mirrored pin out. This allows us to build double sided DIMMs that are both high speed and high capacity by using mirrored packages and stacking respectively, while still using off-the-shelf DRAM chips. Of course, this requires the use of a non-standard DIMM PCB since the standard DIMM PCBs are all designed to accommodate standard (i.e. non-mirrored) DRAM packages on both sides of the PCB.
[0122] In another aspect the buffer chip may be designed not only to isolate the electrical loads of the stacked memory chips from the memory channel but also have the ability to provide redundancy features such as memory sparing, memory mirroring, and memory RAID. This allows us to build high density DIMMs that not only have the same footprint (i.e. pin compatible) as industry-standard memory modules but also provide a full suite of redundancy features. This capability is important for key segments of the server market such as the blade server segment and the 1U rack server segment, where the number of DIMM slots (or connectors) is constrained by the small form factor of the server motherboard, Many analysts have predicted that these will be the fastest growing segments in the server market.
[0123] Memory sparing may be implemented with one or more stacks of p+q high speed memory chips and a buffer chip. The p memory chips of each stack are assigned to the working pool and are available to system resources such as the operating system (OS) and application software. When the memory controller (or optionally the AMB) detects that one of the memory chips in the stack's working pool has, for example, generated an uncorrectable multi-bit error or has generated correctable errors that exceeded a pre-defined threshold, it may choose to replace the faulty chip with one of the q chips that have been placed in the spare pool. As discussed previously, the memory controller may choose to do the sparing across all the stacks in a rank even though only one working chip in one specific stack triggered the error condition, or may choose to confine the sparing operation to only the specific stack that triggered the error condition. The former method is simpler to implement from the memory controller's perspective while the latter method is more fault-tolerant. Memory sparing was illustrated in FIG. 8 for stacks built with a high speed interface chip and multiple low speed DRAMs. The same method is applicable to stacks built with high speed, off-the-shelf DRAMs and a buffer chip. In other implementations, the buffer chip may not be part of the stack. In yet other implementations, a buffer chip may be used with a plurality of stacks of memory chips or a plurality of buffer chips may be used by a single stack of memory chips.
[0124] Memory mirroring can be implemented by dividing the high speed memory chips in a stack into two equal sets—a working set and a mirrored set. When the memory controller writes data to the memory, the buffer chip writes the data to the same location in both the working set and the mirrored set. During reads, the buffer chip returns the data from the working set. If the returned data had an uncorrectable error condition or if the cumulative correctable errors in the returned data exceeded a pre-defined threshold, the memory controller may instruct the buffer chip to henceforth return data (on memory reads) from the mirrored set until the error condition in the working set has been rectified. The buffer chip may continue to send writes to both the working set and the mirrored set or may confine it to just the mirrored set. As discussed before, the memory mirroring operation may be triggered simultaneously on all the memory stacks in a rank or may be done on a per-stack basis as and when necessary. The former method is easier to implement while the latter method provides more fault tolerance. Memory mirroring was illustrated in FIG. 9 for stacks built with a high speed interface chip and multiple low speed memory chips. The same method is applicable to stacks built with high speed, off-the-shelf DRAMs and a buffer chip. In other implementations, the buffer chip may not be part of the stack. In yet other implementations, a buffer chip may be used with a plurality of stacks of memory chips or a plurality of buffer chips may be used by a single stack of memory chips.
[0125] Implementing memory mirroring within a stack has one drawback, namely that it does not protect against the failure of the buffer chip associated with a stack. In this case, the data in the memory is mirrored in two different memory chips in a stack but both these chips have to communicate to the host system through the common associated buffer chip. So, if the buffer chip in a stack were to fail, the mirrored memory capability is of no use. One solution to this problem is to group all the chips in the working set into one stack and group all the chips in the mirrored set into another stack. The working stack may now be on one side of the DIMM PCB while the mirrored stack may be on the other side of the DIMM PCB. So, if the buffer chip in the working stack were to fail now, the memory controller may switch to the mirrored stack on the other side of the PCB.
[0126] The switch from the working set to the mirrored set may be triggered by the memory controller (or AMB) sending an in-band or sideband signal to the buffers in the respective stacks. Alternately, logic may be added to the buffers so that the buffers themselves have the ability to switch from the working set to the mirrored set. For example, some of the server memory controller hubs (MCH) from Intel will read a memory location for a second time if the MCH detects an uncorrectable error on the first read of that memory location. The buffer chip may be designed to keep track of the addresses of the last m reads and to compare the address of the current read with the stored m addresses. If it detects a match, the most likely scenario is that the MCH detected an uncorrectable error in the data read back and is attempting a second read to the memory location in question. The buffer chip may now read the contents of the memory location from the mirrored set since it knows that the contents in the corresponding location in the working set had an error. The buffer chip may also be designed to keep track of the number of such events (i.e. a second read to a location due to an uncorrectable error) over some period of time. If the number of these events exceeded a certain threshold within a sliding time window, then the buffer chip may permanently switch to the mirrored set and notify an external device that the working set was being disabled.
[0127] Implementing memory RAID within a stack that consists of high speed, off-the-shelf DRAMs is more difficult than implementing it within a stack that consists of non-standard DRAMs. The reason is that current high speed DRAMs have a minimum burst length that require a certain amount of information to be read from or written to the DRAM for each read or write access respectively. For example, an n-bit wide DDR2 SDRAM has a minimum burst length of 4 which means that for every read or write operation, 4n bits must be read from or written to the DRAM. For the purpose of illustration, the following discussion will assume that all the DRAMs that are used to build stacks are 8-bit wide DDR2 SDRAMs, and that each stack has a dedicated buffer chip.
[0128] Given that 8-bit wide DDR2 SDRAMs are used to build the stacks, eight stacks will be needed per memory rank (ignoring the ninth stack needed for ECC). Since DDR2 SDRAMs have a minimum burst length of four, a single read or write operation involves transferring four bytes of data between the memory controller and a stack. This means that the memory controller must transfer a minimum of 32 bytes of data to a memory rank (four bytes per stack * eight stacks) for each read or write operation. Modern CPUs typically use a 64-byte cacheline as the basic unit of data transfer to and from the system memory. This implies that eight bytes of data may be transferred between the memory controller and each stack for a read or write operation.
[0129] In order to implement memory RAID within a stack, we may build a stack that contains 3 8-bit wide DDR2 SDRAMs and a buffer chip. Let us designate the three DRAMs in a stack as chips A, B, and C. Consider the case of a memory write operation where the memory controller performs a burst write of eight bytes to each stack in the rank (i.e. memory controller sends 64 bytes of data—one cacheline—to the entire rank). The buffer chip may be designed such that it writes the first four bytes (say, bytes Z0, Z1, Z2, and Z3) to the specified memory locations (say, addresses x1, x2, x3, and x4) in chip A and writes the second four bytes (say, bytes Z4, Z7, Z6, and Z7) to the same locations (i.e. addresses x1, x2, x3, and x4) in chip B. The buffer chip may also be designed to store the parity information corresponding to these eight bytes in the same locations in chip C. That is, the buffer chip will Store P[0,4]=Z0^Z 4 in address x1 in chip C, P[1,5]=Z1^Z5 in address x4 in chip C, P[2,6]=Z2^Z6 in address x3 in chip C, and P[3,7]=Z3^Z7 in address x4 in chip C, where ^ is the bitwise exclusive-OR operator. So, for example, the least significant bit (bit 0) of P[0,4] is the exclusive-OR of the least significant bits of Z0 and Z4, bit 1 of P[0,4] is the exclusive-OR of bit 1 of Z0 and bit 1 of Z4, and so on, Note that other striping methods may also be used. For example, the buffer chip may store bytes Z0, Z2, Z4, and Z6 in chip A and bytes Z1, Z3, Z5, and Z7 in chip B.
[0130] Now, when the memory controller reads the same cacheline back, the buffer chip will read locations x1, x2, x3, and x4 in both chips A and B and will return bytes Z0, Z1, Z2, and Z3 from chip A and then bytes Z4, Z5, Z6, and Z7 from chip B. Now let us assume that the memory controller detected a multi-bit error in byte Z1. As mentioned previously, some of the Intel server MCHs will re-read the address location when they detect an uncorrectable error in the data that was returned in response to the initial read command. So, when the memory controller re-reads the address location corresponding to byte Z1, the buffer chip may be designed to detect the second read and return P[1,5]^Z5 rather than Z1 since it knows that the memory controller detected an uncorrectable error in Z1.
[0131] Note that the behavior of the memory controller after the detection of an uncorrectable error will influence the error recovery behavior of the buffer chip. For example, if the memory controller reads the entire cacheline back in the event of an uncorrectable error but requests the burst to start with the bad byte, then the buffer chip may be designed to look at the appropriate column addresses to determine which byte corresponds to the uncorrectable error. For example, say that byte Z1 corresponds to the uncorrectable error and that the memory controller requests that the stack send the eight bytes (Z0 through Z7) back to the controller starting with byte Z1. In other words, the memory controller asks the stack to send the eight bytes back in the following order: Z1, Z2, Z3, Z0, Z5, Z6, Z7, and Z4 (i.e. burst length=8, burst type=sequential, and starting column address A[2:0]=001b). The buffer chip may be designed to recognize that this indicates that byte Z1 corresponds to the uncorrectable error and return P[1,5]^Z5, Z2, Z3, Z0, Z5, Z6, Z7, and Z4. Alternately, the buffer chip may be designed to return P[1,5]^Z5, P[2,6]^Z6, P[3,7]^Z7, P[0,4]^Z4, Z5, Z6, Z7, and Z4 if it is desired to correct not only an uncorrectable error in any given byte but also the case where an entire chip (in this case, chip A) fails. If on the other hand, the memory controller reads the entire cacheline in the same order both during a normal read operation and during a second read caused by an uncorrectable error, then the controller has to indicate to the buffer chip which byte or chip corresponds to the uncorrectable error either through an in-band signal or through a sideband signal before or during the time it performs the second read.
[0132] However, it may be that the memory controller does a 64-byte cacheline read or write in two separate bursts of length 4 (rather than a single burst of length 8). This may also be the case when an I/O device initiates the memory access. This may also be the case if the 64-byte cacheline is stored in parallel in two DIMMs. In such a case, the memory RAID implementation might require the use of the DM (Data Mask) signal. Again, consider the case of a 3-chip stack that is built with 3 8-bit wide DDR2 SDRAMs and a buffer chip, Memory RAID requires that the 4 bytes of data that are written to a stack be striped across the two memory chips (i.e. 2 bytes be written to each of the memory chips) while the parity is computed and stored in the third memory chip. However, the DDR2 SDRAMs have a minimum burst length of 4, meaning that the minimum amount of data that they are designed to transfer is 4 bytes. In order to satisfy both these requirements, the buffer chip may be designed to use the DM signal to steer two of the four bytes in a burst to chip A and steer the other two bytes in a burst to chip B. This concept is best illustrated by the example below.
[0133] Say that the memory controller sends bytes Z0, Z1, Z2, and Z3 to a particular stack when it does a 32-byte write to a memory rank, and that the associated addresses are x1, x2, x3, and x4. The stack in this example is composed of three 8—bit DDR2 SDRAMs (chips A, B, and C) and a buffer chip. The buffer chip may be designed to generate a write command to locations x1, x2, x3, and x4 on all the three chips A, B, and C, and perform the following actions:
-
- [0134] Write Z0 and Z2 to chip A and mask the writes of Z1and Z3 to chip A
- [0135] Write Z1 and Z3 to chip B and mask the writes of Z0 and Z2 to chip B
- [0136] Write (Z0^Z1) and (Z2^Z3) to chip C and mask the other two writes
[0137] This of course requires that the buffer chip have the capability to do a simple address translation so as to hide the implementation details of the memory RAID from the memory controller, FIG. 18 is a timing diagram for implementing memory RAID using a datamask (DM) signal in a three chip stack composed of 8 bit wide DDR2 SDRAMS. The first signal of the timing diagram of FIG. 18 represents data sent to the stack from the host system. The second and third signals, labeled DQ_A and DM_A, represent the data and data mask signals sent by the buffer chip to chip A during a write operation to chip A. Similarly, signals DQ_B and DM_B represent signals sent by the buffer chip to chip B during a write operation to chip B, and signals DQ_C and DM_C represent signals sent by the buffer chip to chip C during a write operation to chip C.
[0138] Now when the memory controller reads back bytes Z0, Z1, Z2, and Z3 from the stack, the buffer chip will read locations x1, x2, x3, and x4 from both chips A and B, select the appropriate two bytes from the four bytes returned by each chip, re-construct the original data, and send it back to the memory controller. It should be noted that the data striping across the two chips may be done in other ways. For example, bytes Z0 and Z1 may be written to chip A and bytes Z2 and Z3 may be written to chip B. Also, this concept may be extended to stacks that are built with a different number of chips. For example, in the case of stack built with five 8-bit wide DDR2 SDRAM chips and a buffer chip, a 4-byte burst to a stack may be striped across four chips by writing one byte to each chip and using the DM signal to mask the remaining three writes in the burst. The parity information may be stored in the fifth chip, again using the associated DM signal.
[0139] As described previously, when the memory controller (or AMB) detects an uncorrectable error in the data read back, the buffer chip may be designed to reconstruct the bad data using the data in the other chips as well as the parity information. The buffer chip may perform this operation either when explicitly instructed to do so by the memory controller or by monitoring the read requests sent by the memory controller and detecting multiple reads to the same address within some period of time, or by some other means.
[0140] Re-constructing bad data using the data from the other memory chips in the memory RAID and the parity data will require some additional amount of time. That is, the memory read latency for the case where the buffer chip has to re-construct the bad data may most likely be higher than the normal read latency. This may be accommodated in multiple ways. Say that the normal read latency is 4 clock cycles while the read latency when the buffer chip has to recreate the bad data is 5 clock cycles. The memory controller may simply choose to use 5 clock cycles as the read latency for all read operations. Alternately, the controller may default to 4 clock cycles for all normal read operations but switch to 5 clock cycles when the buffer chip has to re-create the data Another option would be for the buffer chip to stall the memory controller when it has to re-create some pail of the data. These and other methods fall within the scope of this disclosure.
[0141] As discussed above, we can implement memory RAID using a combination of memory chips and a buffer chip in a stack. This provides us with the ability to correct multi-bit errors either within a single memory chip or across multiple memory chips in a rank. However, we can create an additional level of redundancy by adding additional memory chips to the stack. That is, if the memory RAID is implemented across n chips (where the data is striped across n−1 chips and the parity is stored in the nth chip), we can create another level of redundancy by building the stack with at least n+1 memory chips. For the purpose of illustration, assume that we wish to stripe the data across two memory chips (say, chips A and B). We need a third chip (say, chip C) to store the parity information. By adding a fourth chip (chip D) to the stack, we can create an additional level of redundancy. Say that chip B has either failed or is generating an unacceptable level of uncorrectable errors. The buffer chip in the stack may re-construct the data in chip B using the data in chip A and the parity information in chip C in the same manner that is used in well-known disk RAID systems. Obviously, the performance of the memory system may be degraded (due to the possibly higher latency associated with re-creating the data in chip B) until chip B is effectively replaced. However, since we have an unused memory chip in the stack (chip D) we may substitute it for chip B until the next maintenance operation. The buffer chip may be designed to re-create the data in chip B (using the data in chip A and the parity information in chip C) and write it to chip D. Once this is completed, chip B may be discarded (i.e. no longer used by the buffer chip). The re-creation of the data in chip B and the transfer of the re-created data to chip D may be made to run in the background (i.e. during the cycles when the rank containing chips A, B, C, and D are not used) or may be performed during cycles that have been explicitly scheduled by the memory controller for the data recovery operation.
[0142] The logic necessary to implement the higher levels of memory protection such as memory sparing, memory mirroring, and memory RAID may be embedded in a buffer chip associated with each stack or may be implemented in a “more global” buffer chip (i.e. a buffer chip that buffers more data bits than is associated with an individual stack). For example, this logic may be embedded in the AMB. This variation is also covered by this disclosure.
[0143] The method of adding additional low speed memory chips behind a high speed interface by means of a socket was disclosed. The same concepts (see FIGS. 12 , 13, 14, and 15) are applicable to stacking high speed, off-the-shelf DRAM chips behind a buffer chip. This is also covered by this invention.
[0144] Although the present invention has been described in terms of specific exemplary embodiments, it will be appreciated that various modifications and alterations might be made by those skilled in the art without departing from the spirit and scope of the invention.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
The invention claimed is:
1. A memory device for electrical connection to a memory bus, the memory device comprising:
a plurality of dynamic random access memory ( “DRAM”) integrated circuits, each DRAM integrated circuit comprising a memory core of a plurality of cells and accessible at a first speed; and
an interface integrated circuit electrically coupled to the plurality of DRAM integrated circuits for providing an interface between the DRAM integrated circuits and the memory bus at a second speed;
wherein the interface integrated circuit is adapted for providing a predetermined electrical load on the memory bus independent of a number of the DRAM integrated circuits to which the interface integrated circuit is electrically coupled.
2. The memory device as set forth in claim 1, wherein each DRAM integrated circuit comprises a DRAM integrated circuit die.
3. The memory device as set forth in claim 1, wherein the plurality of DRAM integrated circuits comprises a DRAM integrated circuit package.
4. The memory device as set forth in claim 1, wherein the interface integrated circuit is adapted to operate in accordance with an industry defined specification.
5. The memory device as set forth in claim 1, wherein the interface integrated circuit is adapted to operate in accordance with a DDR2 SRAM specification.
6. The memory device as set forth in claim 1, wherein the plurality of DRAM integrated circuits include:
at least one DRAM integrated circuit which was incorporated into the memory device at manufacturing time; and
at least one DRAM integrated circuit which was incorporated into the memory device at a later time.
7. The memory device as set forth in claim 1, further comprising:
a printed circuit board; and
a socket for mounting the plurality of DRAM integrated circuits in a rank to the printed circuit board.
8. The memory device as set forth in claim 1, wherein the second speed is greater than the first speed.
9. The memory device as set forth in claim 1, wherein the plurality of DRAM integrated circuits are stacked in a vertical direction.
10. The memory device as set forth in claim 1, wherein the plurality of DRAM integrated circuits comprise:
a working pool of“p” DRAM integrated circuits; and
a spare pool of“q” DRAM integrated circuits;
wherein “p” and “q” comprise integer values.
11. The memory device as set forth in claim 10, further comprising:
a memory controller, coupled to at least one of the interface integrated circuit and the plurality of DRAM integrated circuits, for detecting occurrence of a pre-defined number of errors in working memory integrated circuits and for signaling to the interface integrated circuit to indicate the occurrence of the pre-defined number of errors; and
wherein the interface integrated circuit is adapted to replace at least one DRAM integrated circuit of the working pool with at least one DRAM integrated circuit of the spare pool.
12. The memory device as set forth in claim 11, wherein the memory controller is further adapted to signal the occurrence of the pre-defined number of errors using in-band signaling.
13. The memory device as set forth in claim 11, wherein the memory controller is further adapted to signal the occurrence of the pre-defined number of errors using side band signaling.
14. The memory device as set forth in claim 1, wherein the plurality of DRAM integrated circuits comprise:
a working pool of“p” DRAM integrated circuits; and
a mirrored pool of“q” DRAM integrated circuits;
wherein “p” and “q” comprise integer values.
15. The memory device as set forth in claim 14, further comprising;
a memory controller, coupled to at least one of the interface integrated circuit and the plurality of DRAM integrated circuits, for detecting occurrence of a pre-defined number of errors in working memory integrated circuits and for signaling to the interface integrated circuit to indicate the occurrence of the pre-defined number of errors; and
wherein the interface integrated circuit is adapted to replace at least one DRAM integrated circuit of the working pool with at least one DRAM integrated circuit of the mirrored pool.
16. The memory device as set forth in claim 15, wherein the memory controller is further adapted to signal the occurrence of the pre-defined number of errors using in-band signaling.
17. The memory device as set forth in claim 15, wherein the memory controller is further adapted to signal the occurrence of the pre-defined number of errors using side band signaling.
18. The memory device as set forth in claim 14, wherein “p” equals “q”.
19. The memory device as set forth in claim 14, wherein switching from the working pool of“p” DRAM integrated circuits to the mirrored pool of“q” DRAM integrated circuits is triggered by sending an in-band signal to buffers in at least one of the working pool of“p” DRAM integrated circuits and the mirrored pool of “q” DRAM integrated circuits.
20. The memory device as set forth in claim 19, wherein “p” equals “q”.
21. The memory device as set forth in claim 19, wherein “q”equals 1.
22. The memory device as set forth in claim 19, wherein the interface integrated circuit is operable to simulate at least one DRAM integrated circuit with a first latency that is different from a second latency of at least one of the plurality of the DRAM integrated circuits.
23. The memory device as set forth in claim 14, wherein switching from the working pool of “p” DRAM integrated circuits to the mirrored pool of “q” DRAM integrated circuits is triggered by sending a sideband signal to buffers in at least one of the working pool of “p” DRAM integrated circuits and the mirrored pool of “q” DRAM integrated circuits.
24. The memory device as set forth in claim 1, wherein error correcting code (ECC) is utilized to detect and correct single-bit errors.
25. The memory device as set forth in claim 1, further comprising a memory scheme, wherein the plurality of DRAM integrated circuits comprise:
“p” DRAM integrated circuits used as a working memory device for storing data across the “p” DRAM integrated circuits; and
at least one additional DRAM integrated circuit for storing additional information for the data stored in the “p” DRAM integrated circuits;
wherein “p” comprises an integer value.
26. The memory device as set forth in claim 25, wherein the memory scheme comprises a RAID memory scheme and the additional information comprises parity information.
27. The memory device as set forth in claim 25, wherein the additional information comprises prefetch information.
28. The memory device as set forth in claim 1, further comprising:
a socket, coupled to the plurality of DRAM integrated circuits, for adding at least one additional DRAM integrated circuit to the plurality of DRAM integrated circuits.
29. The memory device as set forth in claim 28, wherein the interface integrated circuit is stacked with the plurality of DRAM integrated circuits.
30. A memory device for use with a memory bus, the memory bus comprising:
a plurality of dynamic random access memory (“DRAM”) integrated circuits each comprising a memory core of a plurality of cells accessible at low speed; and
an interface integrated circuit for providing an interface, at a high speed relative to the low speed, between the DRAM integrated circuits and the memory bus;
wherein the interface integrated circuit is adapted for providing a predetermined electrical load on the memory bus independent of a number of the DRAM integrated circuits to which the interface integrated circuit is electrically coupled.
31. A memory device for use with a memory bus, the memory bus comprising:
means for stacking a plurality of dynamic random access memory (“DRAM”) integrated circuits each comprising a memory core of a plurality of cells accessible at a first speed; and
means for providing an interface between the DRAM integrated circuits and the memory bus at a second speed;
wherein the means for providing the interface is adapted for providing a predetermined electrical load on the memory bus independent of a number of the DRAM integrated circuits to which the means for providing the interface is electrically coupled.
32. A memory device for electrical connection to a memory bus, the memory device comprising:
a plurality of dynamic random access memory (“DRAM”) integrated circuits, each DRAM integrated circuit comprising a memory core of a plurality of cells and accessible at a first speed; and
an interface integrated circuit electrically coupled to the plurality of DRAM integrated circuits for providing an interface between the DRAM integrated circuits and the memory bus at a second speed;
wherein the interface integrated circuit is adapted for providing an electrical load on the memory bus independent of a number of the DRAM integrated circuits to which the interface integrated circuit is electrically coupled;
wherein the plurality of DRAM integrated circuits comprise;
a working pool of“p” DRAM integrated circuits; and
a spare pool of“q”DRAM integrated circuits;
wherein “p” and “q”comprise integer values.
Patent Citations (457)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4392212(A) | 1983-07-01 | Miyasaka et al. | Applicant |
| US4592019(A) | 1986-05-01 | Huang et al. | Applicant |
| US4698748(A) | 1987-10-01 | Juzswik et al. | Applicant |
| US4710903(A) | 1987-12-01 | Hereth et al. | Applicant |
| US4780843(A) | 1988-10-01 | Tietjen | Applicant |
| US4841440(A) | 1989-06-01 | Yonezu et al. | Applicant |
| US4899107(A) | 1990-02-01 | Corbett et al. | Applicant |
| US4935734(A) | 1990-06-01 | Austin | Applicant |
| US5083266(A) | 1992-01-01 | Watanabe | Applicant |
| US5220672(A) | 1993-06-01 | Nakao et al. | Applicant |
| US5241266(A) | 1993-08-01 | Ahmad et al. | Applicant |
| US5252807(A) | 1993-10-01 | Chizinsky | Applicant |
| US5257233(A) | 1993-10-01 | Schaefer | Applicant |
| US5278796(A) | 1994-01-01 | Tillinghast et al. | Applicant |
| US5282177(A) | 1994-01-01 | McLaury | Applicant |
| US5332922(A) | 1994-07-01 | Oguchi et al. | Applicant |
| US5384745(A) | 1995-01-01 | Konishi et al. | Applicant |
| US5388265(A) | 1995-02-01 | Volk | Applicant |
| US5408190(A) | 1995-04-01 | Wood et al. | Applicant |
| US5453434(A) | 1995-09-01 | Albaugh et al. | Applicant |
| US5467455(A) | 1995-11-01 | Gay et al. | Applicant |
| US5498886(A) | 1996-03-01 | Hsu et al. | Applicant |
| US5526320(A) | 1996-06-01 | Zagar et al. | Applicant |
| US5530836(A) | 1996-06-01 | Busch et al. | Applicant |
| US5559990(A) | 1996-09-01 | Cheng et al. | Applicant |
| US5566344(A) | 1996-10-01 | Hall et al. | Applicant |
| US5581779(A) | 1996-12-01 | Hall et al. | Applicant |
| US5590071(A) | 1996-12-01 | Kolor et al. | Applicant |
| US5598376(A) | 1997-01-01 | Merritt et al. | Applicant |
| US5604714(A) | 1997-02-01 | Manning et al. | Applicant |
| US5606710(A) | 1997-02-01 | Hall et al. | Applicant |
| US5610864(A) | 1997-03-01 | Manning | Applicant |
| US5623686(A) | 1997-04-01 | Hall et al. | Applicant |
| US5627791(A) | 1997-05-01 | Wright et al. | Applicant |
| US5640337(A) | 1997-06-01 | Huang et al. | Applicant |
| US5640364(A) | 1997-06-01 | Merritt et al. | Applicant |
| US5652724(A) | 1997-07-01 | Manning | Applicant |
| US5654204(A) | 1997-08-01 | Anderson | Applicant |
| US5661677(A) | 1997-08-01 | Rondeau et al. | Applicant |
| US5661695(A) | 1997-08-01 | Zagar et al. | Applicant |
| US5668773(A) | 1997-09-01 | Zagar et al. | Applicant |
| US5675549(A) | 1997-10-01 | Ong et al. | Applicant |
| US5682354(A) | 1997-10-01 | Manning | Applicant |
| US5692202(A) | 1997-11-01 | Kardach et al. | Applicant |
| US5696732(A) | 1997-12-01 | Zagar et al. | Applicant |
| US5703813(A) | 1997-12-01 | Manning et al. | Applicant |
| US5706247(A) | 1998-01-01 | Merritt et al. | Applicant |
| US5717654(A) | 1998-02-01 | Manning | Applicant |
| US5721859(A) | 1998-02-01 | Manning | Applicant |
| US5724288(A) | 1998-03-01 | Cloud et al. | Applicant |
| US5729503(A) | 1998-03-01 | Manning | Applicant |
| US5729504(A) | 1998-03-01 | Cowles | Applicant |
| US5748914(A) | 1998-05-01 | Barth et al. | Applicant |
| US5752045(A) | 1998-05-01 | Chen | Applicant |
| US5757703(A) | 1998-05-01 | Merritt et al. | Applicant |
| US5781766(A) | 1998-07-01 | Davis | Applicant |
| US5798961(A) | 1998-08-01 | Heyden et al. | Applicant |
| US5802010(A) | 1998-09-01 | Zagar et al. | Applicant |
| US5812488(A) | 1998-09-01 | Zagar et al. | Applicant |
| US5831931(A) | 1998-11-01 | Manning | Applicant |
| US5831932(A) | 1998-11-01 | Merritt et al. | Applicant |
| US5834838(A) | 1998-11-01 | Anderson | Applicant |
| US5835435(A) | 1998-11-01 | Bogin et al. | Applicant |
| US5838177(A) | 1998-11-01 | Keeth | Applicant |
| US5841580(A) | 1998-11-01 | Farmwald et al. | Applicant |
| US5843799(A) | 1998-12-01 | Hsu et al. | Applicant |
| US5845108(A) | 1998-12-01 | Yoo et al. | Applicant |
| US5850368(A) | 1998-12-01 | Ong et al. | Applicant |
| US5859792(A) | 1999-01-01 | Rondeau et al. | Applicant |
| US5860106(A) | 1999-01-01 | Domen et al. | Applicant |
| US5870347(A) | 1999-02-01 | Keeth et al. | Applicant |
| US5875142(A) | 1999-02-01 | Chevallier | Applicant |
| US5884088(A) | 1999-03-01 | Kardach et al. | Applicant |
| US5901105(A) | 1999-05-01 | Ong et al. | Applicant |
| US5903500(A) | 1999-05-01 | Tsang et al. | Applicant |
| US5905688(A) | 1999-05-01 | Park | Applicant |
| US5907512(A) | 1999-05-01 | Parkinson et al. | Applicant |
| US5915105(A) | 1999-06-01 | Farmwald et al. | Applicant |
| US5917758(A) | 1999-06-01 | Keeth | Applicant |
| US5923611(A) | 1999-07-01 | Ryan | Applicant |
| US5929650(A) | 1999-07-01 | Pappert et al. | Applicant |
| US5946265(A) | 1999-08-01 | Cowles | Applicant |
| US5949254(A) | 1999-09-01 | Keeth | Applicant |
| US5953263(A) | 1999-09-01 | Farmwald et al. | Applicant |
| US5954804(A) | 1999-09-01 | Farmwald et al. | Applicant |
| US5962435(A) | 1999-10-01 | Mao et al. | Applicant |
| US5963463(A) | 1999-10-01 | Rondeau et al. | Applicant |
| US5963504(A) | 1999-10-01 | Manning | Applicant |
| US5966724(A) | 1999-10-01 | Ryan | Applicant |
| US5966727(A) | 1999-10-01 | Nishino | Applicant |
| US5969996(A) | 1999-10-01 | Muranaka et al. | Applicant |
| US5995443(A) | 1999-11-01 | Farmwald et al. | Applicant |
| US6002613(A) | 1999-12-01 | Cloud et al. | Applicant |
| US6002627(A) | 1999-12-01 | Chevallier | Applicant |
| US6014339(A) | 2000-01-01 | Kobayashi et al. | Applicant |
| US6016282(A) | 2000-01-01 | Keeth | Applicant |
| US6026050(A) | 2000-02-01 | Baker et al. | Applicant |
| US6029250(A) | 2000-02-01 | Keeth | Applicant |
| US6032214(A) | 2000-02-01 | Farmwald et al. | Applicant |
| US6032215(A) | 2000-02-01 | Farmwald et al. | Applicant |
| US6034916(A) | 2000-03-01 | Lee | Applicant |
| US6034918(A) | 2000-03-01 | Farmwald et al. | Applicant |
| US6035365(A) | 2000-03-01 | Farmwald et al. | Applicant |
| US6038195(A) | 2000-03-01 | Farmwald et al. | Applicant |
| US6038673(A) | 2000-03-01 | Benn et al. | Applicant |
| US6044032(A) | 2000-03-01 | Li | Applicant |
| US6047344(A) | 2000-04-01 | Kawasumi et al. | Applicant |
| US6053948(A) | 2000-04-01 | Vaidyanathan et al. | Applicant |
| US6069504(A) | 2000-05-01 | Keeth | Applicant |
| US6073223(A) | 2000-06-01 | McAllister et al. | Applicant |
| US6075730(A) | 2000-06-01 | Barth et al. | Applicant |
| US6078546(A) | 2000-06-01 | Lee | Applicant |
| US6079025(A) | 2000-06-01 | Fung | Applicant |
| US6084434(A) | 2000-07-01 | Keeth | Applicant |
| US6088290(A) | 2000-07-01 | Ohtake et al. | Applicant |
| US6091251(A) | 2000-07-01 | Wood et al. | Applicant |
| USRE36839(E) | 2000-08-01 | Simmons et al. | Applicant |
| US6101152(A) | 2000-08-01 | Farmwald et al. | Applicant |
| US6101612(A) | 2000-08-01 | Jeddeloh | Applicant |
| US6108795(A) | 2000-08-01 | Jeddeloh | Applicant |
| US6111812(A) | 2000-08-01 | Gans et al. | Applicant |
| US6134638(A) | 2000-10-01 | Olarig et al. | Applicant |
| US6166991(A) | 2000-12-01 | Phelan | Applicant |
| US6182184(B1) | 2001-01-01 | Farmwald et al. | Applicant |
| US6208168(B1) | 2001-03-01 | Rhee | Applicant |
| US6216246(B1) | 2001-04-01 | Shau | Applicant |
| US6240048(B1) | 2001-05-01 | Matsubara | Applicant |
| US6243282(B1) | 2001-06-01 | Rondeau et al. | Applicant |
| US6260097(B1) | 2001-07-01 | Farmwald et al. | Applicant |
| US6260154(B1) | 2001-07-01 | Jeddeloh | Applicant |
| US6262938(B1) | 2001-07-01 | Lee et al. | Applicant |
| US6266285(B1) | 2001-07-01 | Farmwald et al. | Applicant |
| US6274395(B1) | 2001-08-01 | Weber | Applicant |
| US6279069(B1) | 2001-08-01 | Robinson et al. | Applicant |
| US6295572(B1) | 2001-09-01 | Wu | Applicant |
| US6298426(B1) | 2001-10-01 | Ajanovic | Applicant |
| US6304511(B1) | 2001-10-01 | Gans et al. | Applicant |
| US6307769(B1) | 2001-10-01 | Nuxoll et al. | Applicant |
| US6314051(B1) | 2001-11-01 | Farmwald et al. | Applicant |
| US6317352(B1) | 2001-11-01 | Halbert et al. | Applicant |
| US6317381(B1) | 2001-11-01 | Gans et al. | Applicant |
| US6324120(B2) | 2001-11-01 | Farmwald et al. | Applicant |
| US6326810(B1) | 2001-12-01 | Keeth | Applicant |
| US6327664(B1) | 2001-12-01 | Dell et al. | Applicant |
| US6330683(B1) | 2001-12-01 | Jeddeloh | Applicant |
| US6338108(B1) | 2002-01-01 | Motomura | Applicant |
| US6338113(B1) | 2002-01-01 | Kubo et al. | Applicant |
| US6341347(B1) | 2002-01-01 | Joy et al. | Applicant |
| US6353561(B1) | 2002-03-01 | Funyu et al. | Applicant |
| US6356105(B1) | 2002-03-01 | Volk | Applicant |
| US6356500(B1) | 2002-03-01 | Cloud et al. | Applicant |
| US6362656(B2) | 2002-03-01 | Rhee | Applicant |
| US6363031(B2) | 2002-03-01 | Phelan | Applicant |
| US6378020(B2) | 2002-04-01 | Farmwald et al. | Applicant |
| US6381188(B1) | 2002-04-01 | Choi et al. | Applicant |
| US6381668(B1) | 2002-04-01 | Lunteren | Applicant |
| US6414868(B1) | 2002-07-01 | Wong et al. | Applicant |
| US6426916(B2) | 2002-07-01 | Farmwald et al. | Applicant |
| US6429029(B1) | 2002-08-01 | Eldridge et al. | Applicant |
| US6430103(B2) | 2002-08-01 | Nakayama et al. | Applicant |
| US6437600(B1) | 2002-08-01 | Keeth | Applicant |
| US6438057(B1) | 2002-08-01 | Ruckerbauer | Applicant |
| US6442698(B2) | 2002-08-01 | Nizar | Applicant |
| US6452863(B2) | 2002-09-01 | Farmwald et al. | Applicant |
| US6453400(B1) | 2002-09-01 | Maesako et al. | Applicant |
| US6453402(B1) | 2002-09-01 | Jeddeloh | Applicant |
| US6457095(B1) | 2002-09-01 | Volk | Applicant |
| US6459651(B1) | 2002-10-01 | Lee et al. | Applicant |
| US6473831(B1) | 2002-10-01 | Schade | Applicant |
| US6480929(B1) | 2002-11-01 | Gauthier et al. | Applicant |
| US6487102(B1) | 2002-11-01 | Halbert et al. | Applicant |
| US6493789(B2) | 2002-12-01 | Ware et al. | Applicant |
| US6496440(B2) | 2002-12-01 | Manning | Applicant |
| US6496897(B2) | 2002-12-01 | Ware et al. | Applicant |
| US6498766(B2) | 2002-12-01 | Lee et al. | Applicant |
| US6510097(B2) | 2003-01-01 | Fukuyama | Applicant |
| US6510503(B2) | 2003-01-01 | Gillingham et al. | Applicant |
| US6512392(B2) | 2003-01-01 | Fleury et al. | Applicant |
| US6526471(B1) | 2003-02-01 | Shimomura et al. | Applicant |
| US6526484(B1) | 2003-02-01 | Stacovsky et al. | Applicant |
| US6546446(B2) | 2003-04-01 | Farmwald et al. | Applicant |
| US6553450(B1) | 2003-04-01 | Dodd et al. | Applicant |
| US6560158(B2) | 2003-05-01 | Choi et al. | Applicant |
| US6563337(B2) | 2003-05-01 | Dour | Applicant |
| US6563759(B2) | 2003-05-01 | Yahata et al. | Applicant |
| US6564281(B2) | 2003-05-01 | Farmwald et al. | Applicant |
| US6564285(B1) | 2003-05-01 | Mills et al. | Applicant |
| US6574150(B2) | 2003-06-01 | Suyama et al. | Applicant |
| US6584037(B2) | 2003-06-01 | Farmwald et al. | Applicant |
| US6587912(B2) | 2003-07-01 | Leddige et al. | Applicant |
| US6590822(B2) | 2003-07-01 | Hwang et al. | Applicant |
| US6594770(B1) | 2003-07-01 | Sato et al. | Applicant |
| US6614700(B2) | 2003-09-01 | Dietrich et al. | Applicant |
| US6618791(B1) | 2003-09-01 | Dodd et al. | Applicant |
| US6621760(B1) | 2003-09-01 | Ahmad et al. | Applicant |
| US6631086(B1) | 2003-10-01 | Bill et al. | Applicant |
| US6650594(B1) | 2003-11-01 | Lee et al. | Applicant |
| US6657918(B2) | 2003-12-01 | Foss et al. | Applicant |
| US6657919(B2) | 2003-12-01 | Foss et al. | Applicant |
| US6658530(B1) | 2003-12-01 | Robertson et al. | Applicant |
| US6665224(B1) | 2003-12-01 | Lehmann et al. | Applicant |
| US6665227(B2) | 2003-12-01 | Fetzer | Applicant |
| US6697295(B2) | 2004-02-01 | Farmwald et al. | Applicant |
| US6701446(B2) | 2004-03-01 | Tsern et al. | Applicant |
| US6708144(B1) | 2004-03-01 | Merryman et al. | Applicant |
| US6714891(B2) | 2004-03-01 | Dendinger | Applicant |
| US6724684(B2) | 2004-04-01 | Kim | Applicant |
| US6731527(B2) | 2004-05-01 | Brown | Applicant |
| US6744687(B2) | 2004-06-01 | Koo et al. | Applicant |
| US6751696(B2) | 2004-06-01 | Farmwald et al. | Applicant |
| US6754129(B2) | 2004-06-01 | Khateri et al. | Applicant |
| US6754132(B2) | 2004-06-01 | Kyung | Applicant |
| US6762948(B2) | 2004-07-01 | Kyun et al. | Applicant |
| US6779097(B2) | 2004-08-01 | Gillingham et al. | Applicant |
| US6785767(B2) | 2004-08-01 | Coulson | Applicant |
| US6791877(B2) | 2004-09-01 | Miura et al. | Applicant |
| US6795899(B2) | 2004-09-01 | Dodd et al. | Applicant |
| US6799241(B2) | 2004-09-01 | Kahn et al. | Applicant |
| US6801989(B2) | 2004-10-01 | Johnson et al. | Applicant |
| US6807598(B2) | 2004-10-01 | Farmwald et al. | Applicant |
| US6807655(B1) | 2004-10-01 | Rehani et al. | Applicant |
| US6816991(B2) | 2004-11-01 | Sanghani | Applicant |
| US6819602(B2) | 2004-11-01 | Seo et al. | Applicant |
| US6819617(B2) | 2004-11-01 | Hwang et al. | Applicant |
| US6820163(B1) | 2004-11-01 | McCall et al. | Applicant |
| US6820169(B2) | 2004-11-01 | Wilcox et al. | Applicant |
| US6826104(B2) | 2004-11-01 | Kawaguchi et al. | Applicant |
| US6839290(B2) | 2005-01-01 | Ahmad et al. | Applicant |
| US6845055(B1) | 2005-01-01 | Koga et al. | Applicant |
| US6847582(B2) | 2005-01-01 | Pan | Applicant |
| US6850449(B2) | 2005-02-01 | Takahashi | Applicant |
| US6862249(B2) | 2005-03-01 | Kyung | Applicant |
| US6862653(B1) | 2005-03-01 | Dodd et al. | Applicant |
| US6894933(B2) | 2005-05-01 | Kuzmenka et al. | Applicant |
| US6898683(B2) | 2005-05-01 | Nakamura | Applicant |
| US6908314(B2) | 2005-06-01 | Brown | Applicant |
| US6912778(B2) | 2005-07-01 | Ahn et al. | Applicant |
| US6917219(B2) | 2005-07-01 | New | Applicant |
| US6922371(B2) | 2005-07-01 | Takahashi et al. | Applicant |
| US6938119(B2) | 2005-08-01 | Kohn et al. | Applicant |
| US6961281(B2) | 2005-11-01 | Wong et al. | Applicant |
| US6968416(B2) | 2005-11-01 | Moy | Applicant |
| US6968419(B1) | 2005-11-01 | Holman | Applicant |
| US6970968(B1) | 2005-11-01 | Holman | Applicant |
| US6980021(B1) | 2005-12-01 | Srivastava et al. | Applicant |
| US6986118(B2) | 2006-01-01 | Dickman | Applicant |
| US6992950(B2) | 2006-01-01 | Foss et al. | Applicant |
| US7000062(B2) | 2006-02-01 | Perego et al. | Applicant |
| US7003618(B2) | 2006-02-01 | Perego et al. | Applicant |
| US7003639(B2) | 2006-02-01 | Tsern et al. | Applicant |
| US7007175(B2) | 2006-02-01 | Chang et al. | Applicant |
| US7010642(B2) | 2006-03-01 | Perego et al. | Applicant |
| US7010736(B1) | 2006-03-01 | Teh et al. | Applicant |
| US7024518(B2) | 2006-04-01 | Halbert et al. | Applicant |
| US7028234(B2) | 2006-04-01 | Huckaby et al. | Applicant |
| US7035150(B2) | 2006-04-01 | Streif et al. | Applicant |
| US7058776(B2) | 2006-06-01 | Lee | Applicant |
| US7058863(B2) | 2006-06-01 | Kouchi et al. | Applicant |
| US7061823(B2) | 2006-06-01 | Faue et al. | Applicant |
| US7075175(B2) | 2006-07-01 | Kazi et al. | Applicant |
| US7079441(B1) | 2006-07-01 | Partsch et al. | Applicant |
| US7079446(B2) | 2006-07-01 | Murtagh et al. | Applicant |
| US7085152(B2) | 2006-08-01 | Ellis et al. | Applicant |
| US7085941(B2) | 2006-08-01 | Li | Applicant |
| US7089438(B2) | 2006-08-01 | Raad | Applicant |
| US7093101(B2) | 2006-08-01 | Aasheim et al. | Applicant |
| US7103730(B2) | 2006-09-01 | Saxena et al. | Applicant |
| US7120727(B2) | 2006-10-01 | Lee et al. | Applicant |
| US7126399(B1) | 2006-10-01 | Lee | Applicant |
| US7133960(B1) | 2006-11-01 | Thompson et al. | Applicant |
| US7136978(B2) | 2006-11-01 | Miura et al. | Applicant |
| US7149145(B2) | 2006-12-01 | Kim et al. | Applicant |
| US7149824(B2) | 2006-12-01 | Johnson | Applicant |
| US7173863(B2) | 2007-02-01 | Conley et al. | Applicant |
| US7200021(B2) | 2007-04-01 | Raghuram | Applicant |
| US7205789(B1) | 2007-04-01 | Karabatsos | Applicant |
| US7224595(B2) | 2007-05-01 | Dreps et al. | Examiner |
| US7228264(B2) | 2007-06-01 | Barrenscheen et al. | Applicant |
| US7233541(B2) | 2007-06-01 | Yamamoto et al. | Applicant |
| US7245541(B2) | 2007-07-01 | Janzen | Applicant |
| US7266639(B2) | 2007-09-01 | Raghuram | Applicant |
| US7269042(B2) | 2007-09-01 | Kinsley et al. | Applicant |
| US7269708(B2) | 2007-09-01 | Ware | Applicant |
| US7289386(B2) | 2007-10-01 | Bhakta ct al. | Applicant |
| US7296754(B2) | 2007-11-01 | Nishizawa et al. | Applicant |
| US7299330(B2) | 2007-11-01 | Gillingham et al. | Applicant |
| US7307863(B2) | 2007-12-01 | Yen et al. | Applicant |
| US7363422(B2) | 2008-04-01 | Perego et al. | Applicant |
| US7379316(B2) | 2008-05-01 | Rajan | Applicant |
| US7386656(B2) | 2008-06-01 | Rajan et al. | Applicant |
| US7392338(B2) | 2008-06-01 | Rajan et al. | Applicant |
| US7408393(B1) | 2008-08-01 | Jain et al. | Applicant |
| US7409492(B2) | 2008-08-01 | Tanaka et al. | Applicant |
| US7464225(B2) | 2008-12-01 | Tsern | Applicant |
| US7472220(B2) | 2008-12-01 | Rajan et al. | Applicant |
| US7496777(B2) | 2009-02-01 | Kapil | Applicant |
| US7532537(B2) | 2009-05-01 | Solomon et al. | Applicant |
| US2001/0000822(A1) | 2001-05-01 | Dell et al. | Applicant |
| US2002/0019961(A1) | 2002-02-01 | Blodgett | Applicant |
| US2002/0038405(A1) | 2002-03-01 | Leddige et al. | Applicant |
| US2002/0041507(A1) | 2002-04-01 | Woo et al. | Applicant |
| US2002/0051398(A1) | 2002-05-01 | Mizugaki | Applicant |
| US2002/0064073(A1) | 2002-05-01 | Chien | Applicant |
| US2002/0064083(A1) | 2002-05-01 | Ryu et al. | Applicant |
| US2002/0124195(A1) | 2002-09-01 | Nizar | Applicant |
| US2002/0145900(A1) | 2002-10-01 | Schaefer | Applicant |
| US2002/0165706(A1) | 2002-11-01 | Raynham | Applicant |
| US2002/0174274(A1) | 2002-11-01 | Wu et al. | Applicant |
| US2002/0184438(A1) | 2002-12-01 | Usui | Applicant |
| US2003/0002262(A1) | 2003-01-01 | Benisek et al. | Applicant |
| US2003/0021175(A1) | 2003-01-01 | Tae Kwak | Applicant |
| US2003/0061458(A1) | 2003-03-01 | Wilcox et al. | Applicant |
| US2003/0093614(A1) | 2003-05-01 | Kohn et al. | Applicant |
| US2003/0101392(A1) | 2003-05-01 | Lee | Applicant |
| US2003/0105932(A1) | 2003-06-01 | David et al. | Applicant |
| US2003/0117875(A1) | 2003-06-01 | Lee et al. | Applicant |
| US2003/0126338(A1) | 2003-07-01 | Dodd et al. | Applicant |
| US2003/0131160(A1) | 2003-07-01 | Hampel et al. | Applicant |
| US2003/0145163(A1) | 2003-07-01 | Seo et al. | Applicant |
| US2003/0158995(A1) | 2003-08-01 | Lee et al. | Applicant |
| US2003/0182513(A1) | 2003-09-01 | Dodd et al. | Applicant |
| US2003/0189868(A1) | 2003-10-01 | Riesenman et al. | Applicant |
| US2003/0189870(A1) | 2003-10-01 | Wilcox | Applicant |
| US2003/0191888(A1) | 2003-10-01 | Klein | Applicant |
| US2003/0191915(A1) | 2003-10-01 | Saxena et al. | Applicant |
| US2003/0200382(A1) | 2003-10-01 | Wells et al. | Applicant |
| US2003/0200474(A1) | 2003-10-01 | Li | Applicant |
| US2003/0223290(A1) | 2003-12-01 | Park et al. | Applicant |
| US2003/0227798(A1) | 2003-12-01 | Pax | Applicant |
| US2003/0229821(A1) | 2003-12-01 | Ma | Applicant |
| US2003/0231542(A1) | 2003-12-01 | Zaharinova-Papazova et al. | Applicant |
| US2004/0034732(A1) | 2004-02-01 | Valin et al. | Applicant |
| US2004/0037133(A1) | 2004-02-01 | Park et al. | Applicant |
| US2004/0044808(A1) | 2004-03-01 | Salmon et al. | Applicant |
| US2004/0047228(A1) | 2004-03-01 | Chen | Applicant |
| US2004/0064647(A1) | 2004-04-01 | DeWhitt et al. | Applicant |
| US2004/0064767(A1) | 2004-04-01 | Huckaby et al. | Applicant |
| US2004/0088475(A1) | 2004-05-01 | Streif et al. | Applicant |
| US2004/0117723(A1) | 2004-06-01 | Foss | Applicant |
| US2004/0123173(A1) | 2004-06-01 | Emberling et al. | Applicant |
| US2004/0133736(A1) | 2004-07-01 | Kyung | Applicant |
| US2004/0139359(A1) | 2004-07-01 | Samson et al. | Applicant |
| US2004/0145963(A1) | 2004-07-01 | Byon | Applicant |
| US2004/0174765(A1) | 2004-09-01 | Seo et al. | Applicant |
| US2004/0177079(A1) | 2004-09-01 | Gluhovsky et al. | Applicant |
| US2004/0184324(A1) | 2004-09-01 | Pax | Applicant |
| US2004/0186956(A1) | 2004-09-01 | Perego et al. | Applicant |
| US2004/0188704(A1) | 2004-09-01 | Halbert et al. | Applicant |
| US2004/0196732(A1) | 2004-10-01 | Lee | Applicant |
| US2004/0208173(A1) | 2004-10-01 | Di Gregorio | Applicant |
| US2004/0228166(A1) | 2004-11-01 | Braun et al. | Applicant |
| US2004/0228203(A1) | 2004-11-01 | Koo | Applicant |
| US2004/0230932(A1) | 2004-11-01 | Dickmann | Applicant |
| US2004/0256638(A1) | 2004-12-01 | Perego et al. | Applicant |
| US2004/0260957(A1) | 2004-12-01 | Jeddeloh et al. | Applicant |
| US2004/0264255(A1) | 2004-12-01 | Royer | Applicant |
| US2004/0268161(A1) | 2004-12-01 | Ross | Applicant |
| US2005/0018495(A1) | 2005-01-01 | Bhakta et al. | Applicant |
| US2005/0021874(A1) | 2005-01-01 | Georgiou et al. | Applicant |
| US2005/0027928(A1) | 2005-02-01 | Avraham et al. | Applicant |
| US2005/0028038(A1) | 2005-02-01 | Pomaranski et al. | Applicant |
| US2005/0044303(A1) | 2005-02-01 | Perego et al. | Applicant |
| US2005/0044305(A1) | 2005-02-01 | Jakobs et al. | Applicant |
| US2005/0047192(A1) | 2005-03-01 | Matsui et al. | Applicant |
| US2005/0071543(A1) | 2005-03-01 | Ellis et al. | Applicant |
| US2005/0078532(A1) | 2005-04-01 | Ruckerbauer et al. | Applicant |
| US2005/0081085(A1) | 2005-04-01 | Ellis et al. | Applicant |
| US2005/0102590(A1) | 2005-05-01 | Norris et al. | Applicant |
| US2005/0132158(A1) | 2005-06-01 | Hampel et al. | Applicant |
| US2005/0138267(A1) | 2005-06-01 | Bains et al. | Applicant |
| US2005/0139977(A1) | 2005-06-01 | Nishio et al. | Applicant |
| US2005/0141199(A1) | 2005-06-01 | Chiou et al. | Applicant |
| US2005/0149662(A1) | 2005-07-01 | Perego et al. | Applicant |
| US2005/0152212(A1) | 2005-07-01 | Yang et al. | Applicant |
| US2005/0166026(A1) | 2005-07-01 | Ware et al. | Applicant |
| US2005/0193163(A1) | 2005-09-01 | Perego et al. | Applicant |
| US2005/0194991(A1) | 2005-09-01 | Dour et al. | Applicant |
| US2005/0195629(A1) | 2005-09-01 | Leddige et al. | Applicant |
| US2005/0204111(A1) | 2005-09-01 | Natarajan | Applicant |
| US2005/0210196(A1) | 2005-09-01 | Perego et al. | Applicant |
| US2005/0223179(A1) | 2005-10-01 | Perego et al. | Applicant |
| US2005/0235119(A1) | 2005-10-01 | Sechrest et al. | Applicant |
| US2005/0235131(A1) | 2005-10-01 | Ware | Applicant |
| US2005/0237838(A1) | 2005-10-01 | Kwak et al. | Applicant |
| US2005/0243635(A1) | 2005-11-01 | Schaefer | Applicant |
| US2005/0259504(A1) | 2005-11-01 | Murtugh et al. | Applicant |
| US2005/0265506(A1) | 2005-12-01 | Foss et al. | Applicant |
| US2005/0278474(A1) | 2005-12-01 | Perersen et al. | Applicant |
| US2005/0281123(A1) | 2005-12-01 | Bell et al. | Applicant |
| US2005/0285174(A1) | 2005-12-01 | Saito et al. | Applicant |
| US2005/0289292(A1) | 2005-12-01 | Morrow et al. | Applicant |
| US2005/0289317(A1) | 2005-12-01 | Liou et al. | Applicant |
| US2006/0002201(A1) | 2006-01-01 | Janzen | Applicant |
| US2006/0010339(A1) | 2006-01-01 | Klein | Applicant |
| US2006/0026484(A1) | 2006-02-01 | Hollums | Applicant |
| US2006/0039205(A1) | 2006-02-01 | Cornelius | Applicant |
| US2006/0041711(A1) | 2006-02-01 | Miura et al. | Applicant |
| US2006/0041730(A1) | 2006-02-01 | Larson | Applicant |
| US2006/0044909(A1) | 2006-03-01 | Kinsley et al. | Applicant |
| US2006/0050574(A1) | 2006-03-01 | Streif et al. | Applicant |
| US2006/0056244(A1) | 2006-03-01 | Ware | Applicant |
| US2006/0085616(A1) | 2006-04-01 | Zeighami et al. | Applicant |
| US2006/0090031(A1) | 2006-04-01 | Kirshenbaum et al. | Applicant |
| US2006/0090054(A1) | 2006-04-01 | Choi et al. | Applicant |
| US2006/0106951(A1) | 2006-05-01 | Bains | Applicant |
| US2006/0112214(A1) | 2006-05-01 | Yeh | Applicant |
| US2006/0117152(A1) | 2006-06-01 | Amidi et al. | Applicant |
| US2006/0117160(A1) | 2006-06-01 | Jackson et al. | Applicant |
| US2006/0129712(A1) | 2006-06-01 | Raghuram | Applicant |
| US2006/0129755(A1) | 2006-06-01 | Raghuram | Applicant |
| US2006/0149982(A1) | 2006-07-01 | Vogt | Applicant |
| US2006/0176744(A1) | 2006-08-01 | Stave | Applicant |
| US2006/0179333(A1) | 2006-08-01 | Brittain et al. | Applicant |
| US2006/0179334(A1) | 2006-08-01 | Brittain et al. | Applicant |
| US2006/0181953(A1) | 2006-08-01 | Rotenberg et al. | Applicant |
| US2006/0206738(A1) | 2006-09-01 | Jeddeloh et al. | Applicant |
| US2006/0248387(A1) | 2006-11-01 | Nicholson et al. | Applicant |
| US2006/0262586(A1) | 2006-11-01 | Solomon et al. | Applicant |
| US2006/0294295(A1) | 2006-12-01 | Fukuzo | Applicant |
| US2007/0050530(A1) | 2007-03-01 | Rajan | Applicant |
| US2007/0058471(A1) | 2007-03-01 | Rajan et al. | Applicant |
| US2007/0088995(A1) | 2007-04-01 | Tsern et al. | Applicant |
| US2007/0106860(A1) | 2007-05-01 | Foster, Sr. et al. | Applicant |
| US2007/0162700(A1) | 2007-07-01 | Fortin et al. | Applicant |
| US2007/0192563(A1) | 2007-08-01 | Rajan et al. | Applicant |
| US2007/0195613(A1) | 2007-08-01 | Rajan et al. | Applicant |
| US2007/0216445(A1) | 2007-09-01 | Raghavan et al. | Applicant |
| US2007/0247194(A1) | 2007-10-01 | Jain | Applicant |
| US2007/0288683(A1) | 2007-12-01 | Panabaker et al. | Applicant |
| US2007/0288686(A1) | 2007-12-01 | Arcedera et al. | Applicant |
| US2007/0288687(A1) | 2007-12-01 | Panabaker | Applicant |
| US2008/0025108(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0025136(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0025137(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0027702(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0056014(A1) | 2008-03-01 | Rajan et al. | Applicant |
| US2008/0062773(A1) | 2008-03-01 | Rajan et al. | Applicant |
| US2008/0065820(A1) | 2008-03-01 | Gillingham et al. | Applicant |
| US2008/0120458(A1) | 2008-05-01 | Gillingham et al. | Applicant |
| US2008/0126690(A1) | 2008-05-01 | Rajan et al. | Applicant |
| JP62121978 | 1987-06-01 | Applicant | |
| JP1171047 | 1989-07-01 | Applicant | |
| JP3-029357 | 1991-02-01 | Applicant | |
| JP3029357 | 1991-02-01 | Applicant | |
| JP3/276487 | 1991-12-01 | Applicant | |
| JP3286234 | 1991-12-01 | Applicant | |
| JP7-141870 | 1995-06-01 | Applicant | |
| JP8/077097 | 1996-03-01 | Applicant | |
| JP8077097 | 1996-03-01 | Applicant | |
| JP11-149775 | 1999-06-01 | Applicant | |
| JP2002025255 | 2002-01-01 | Applicant | |
| JP2006236388 | 2006-09-01 | Applicant | |
| KR1020040062717 | 2004-07-01 | Applicant | |
| WO95/05676 | 1995-02-01 | Applicant | |
| WO9900734 | 1999-01-01 | Applicant | |
| WO2007002324 | 2007-01-01 | Applicant | |
| WO2007/038225 | 2007-04-01 | Applicant |
Non-Patent Literature (22)
- “Using Two Chip Selects to Enable Quad Rank,” IP.com PriorArtDatabase, copyright IP.com, Inc. 2004.Applicant
- “BIOS and Kernel Developer's Guide (BKDG) for AMD Family 10h Processors,” AMD, 31116 Rev 3.00, Sep. 7, 2007.Applicant
- Skerlj et al., “Buffer Device For Memory Modules (DIMM)” Qimonda 2006, p. 1.Applicant
- Written Opinion from PCT Application No. PCT/US06/24360 mailed on Jan. 8, 2007.Applicant
- Preliminary Report On Patentability from PCT Application No. PCT/US06/24360 mailed on Jan. 10, 2008.Applicant
- Written Opinion from International PCT Application No. PCT/US06/34390 mailed on Nov. 21, 2007.Applicant
- International Search Report from PCT Application No. PCT/US06/34390 mailed on Nov. 21, 2007.Applicant
- Office Action from U.S. Appl. No. 11/461,427 mailed on Sep. 5, 2008.Applicant
- Final Office Action from U.S. Appl. No. 11/461,430 mailed on Sep. 8, 2008.Applicant
- Notice of Allowance from U.S. Appl. No. 11/474,075 mailed on Nov. 26, 2008.Applicant
- Office Action from U.S. Appl. No. 11/474,076 mailed on Nov. 3, 2008.Applicant
- Office Action from U.S. Appl. No. 11/524,811 mailed on Sep. 17, 2008.Applicant
- Non-final Office Action from U.S. Appl. No. 11/461,430 mailed on Feb. 19, 2009.Applicant
- Final Office Action from U.S. Appl. No. 11/461,435 mailed on Jan. 28, 2009.Applicant
- Non-final Office Action from U.S. Appl. No. 11/461,437 mailed on Jan. 26, 2009.Applicant
- Non-final Office Action from application no. 11/939,432 mailed on Feb. 6, 2009.Applicant
- Wu et al., “eNVy: A Non-Volatile, Main Memory Storage System,” ASPLOS-VI Proceedings - Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, San Jose, California, Oct. 4-7, 1994. SIGARCH Computer Architecture News 22(Special Issue Oct. 1994).Applicant
- German Office Action from German Patent Application No. 11 2005 002 300.4-55 mailed on Jun. 05, 2009 (with Translation).Applicant
- German Office Action From German Patent Application No. 11 2006 002 300.4-55 Mailed Jun. 05, 2009 (With Translation).Applicant
- Non-Final Office Action From U.S. Appl. No. 11/461,441 Mailed Apr. 02, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 12/111,819 Mailed Apr. 27, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 12/111,828 Mailed Apr. 17, 2009.Applicant