Simulating a refresh operation latency

Abstract
A memory apparatus includes multiple memory circuits an interface circuit having one or more first components of a first type and one or more second components of a second type different from the first type, each of the one or more first components and second components being electrically couplable to a host system. The interface circuit is operable to present to the host system a simulated memory circuit where there is a difference in at least one aspect between the simulated memory circuit and at least one memory circuit of the plurality of memory circuits. The at least one aspect includes a timing that relates to a refresh operation latency, in which each memory circuit of the plurality of memory circuits is electrically coupled to at least one first component and to at least one second component.
Description
BACKGROUND OF THE INVENTION

1. Technical Field of the Invention


This invention relates generally to digital memory such as used in computers, and more specifically to organization and design of memory modules such as DIMMs.


2. Background Art


Digital memories are utilized in a wide variety of electronic systems, such as personal computers, workstations, servers, consumer electronics, printers, televisions, and so forth. Digital memories are manufactured as monolithic integrated circuits (“ICs” or “chips”). Digital memories come in several types, such as dynamic random access memory (DRAM), static random access memory (SRAM), flash memory, electrically erasable programmable read only memory (EEPROM), and so forth.


In some systems, the memory chips are coupled directly into the system such as by being soldered directly to the system's main motherboard. In other systems, groups of memory chips are first coupled into memory modules, such as dual in-line memory modules (DIMMs), which are in turn coupled into a system by means of slots, sockets, or other connectors. Some types of memory modules include not only the memory chips themselves, but also some additional logic which interfaces the memory chips to the system. This logic may perform a variety of low level functions, such as buffering or latching signals between the chips and the system, but it may also perform higher level functions, such as telling the system what are the characteristics of the memory chips. These characteristics may include, for example, memory capacity, speed, latency, interface protocol, and so forth.


Memory capacity requirements of such systems are increasing rapidly. However, other industry trends such as higher memory bus speeds, small form factor machines, etc. are reducing the number of memory module slots, sockets, connectors, etc. that are available in such systems. There is, therefore, pressure for manufacturers to use large capacity memory modules in such systems.


However, there is also an exponential relationship between a memory chip's capacity and its price. As a result, large capacity memory modules may be cost prohibitive in some systems.


What is needed, then, is an effective way to make use of low cost memory chips in manufacturing high capacity memory modules.


SUMMARY

A memory subsystem is provided including an interface circuit adapted for communication with a system and a majority of address or control signals of a first number of memory circuits. The interface circuit includes emulation logic for emulating at least one memory circuit of a second number.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 shows a system coupled to multiple memory circuits and an interface circuit according to one embodiment of this invention.



FIG. 2 shows a buffered stack of DRAM circuits each having a dedicated data path from the buffer chip and sharing a single address, control, and clock bus.



FIG. 3 shows a buffered stack of DRAM circuits having two address, control, and clock busses and two data busses.



FIG. 4 shows a buffered stack of DRAM circuits having one address, control, and clock bus and two data busses.



FIG. 5 shows a buffered stack of DRAM circuits having one address, control, and clock bus and one data bus.



FIG. 6 shows a buffered stack of DRAM circuits in which the buffer chip is located in the middle of the stack of DRAM chips.



FIG. 7 is a flow chart showing one method of storing information.



FIG. 8 shows a high capacity DIMM using buffered stacks of DRAM chips according to one embodiment of this invention.



FIG. 9 is a timing diagram showing one embodiment of how the buffer chip makes a buffered stack of DRAM circuits appear to the system or memory controller to use longer column address strobe (CAS) latency DRAM chips than is actually used by the physical DRAM chips.



FIG. 10 shows a timing diagram showing the write data timing expected by DRAM in a buffered stack, in accordance with another embodiment of this invention.



FIG. 11 is a timing diagram showing how write control signals are delayed by a buffer chip in accordance with another embodiment of this invention.



FIG. 12 is a timing diagram showing early write data from a memory controller or an advanced memory buffer (AMB) according to yet another embodiment of this invention.



FIG. 13 is a timing diagram showing address bus conflicts caused by delayed write operations.



FIG. 14 is a timing diagram showing variable delay of an activate operation through a buffer chip.



FIG. 15 is a timing diagram showing variable delay of a precharge operation through a buffer chip.



FIG. 16 shows a buffered stack of DRAM circuits and the buffer chip which presents them to the system as if they were a single, larger DRAM circuit, in accordance with one embodiment of this invention.



FIG. 17 is a flow chart showing a method of refreshing a plurality of memory circuits, in accordance with one embodiment of this invention.



FIG. 18 shows a block diagram of another embodiment of the invention.





DETAILED DESCRIPTION

The invention will be understood more fully from the detailed description given below and from the accompanying drawings of embodiments of the invention which, however, should not be taken to limit the invention to the specific embodiments described, but are for explanation and understanding only.



FIG. 1 illustrates a system 100 including a system device 106 coupled to an interface circuit 102, which is in turn coupled to a plurality of physical memory circuits 104A-N. The physical memory circuits may be any type of memory circuits. In some embodiments, each physical memory circuit is a separate memory chip. For example, each may be a DDR2 DRAM. In some embodiments, the memory circuits may be symmetrical, meaning each has the same capacity, type, speed, etc., while in other embodiments they may be asymmetrical. For ease of illustration only, three such memory circuits are shown, but actual embodiments may use any plural number of memory circuits. As will be discussed below, the memory chips may optionally be coupled to a memory module (not shown), such as a DIMM.


The system device may be any type of system capable of requesting and/or initiating a process that results in an access of the memory circuits. The system may include a memory controller (not shown) through which it accesses the memory circuits.


The interface circuit may include any circuit or logic capable of directly or indirectly communicating with the memory circuits, such as a buffer chip, advanced memory buffer (AMB) chip, etc. The interface circuit interfaces a plurality of signals 108 between the system device and the memory circuits. Such signals may include, for example, data signals, address signals, control signals, clock signals, and so forth. In some embodiments, all of the signals communicated between the system device and the memory circuits are communicated via the interface circuit. In other embodiments, some other signals 110 are communicated directly between the system device (or some component thereof, such as a memory controller, an AMB, or a register) and the memory circuits, without passing through the interface circuit. In some such embodiments, the majority of signals are communicated via the interface circuit, such that L>M.


As will be explained in greater detail below, the interface circuit presents to the system device an interface to emulated memory devices which differ in some aspect from the physical memory circuits which are actually present. For example, the interface circuit may tell the system device that the number of emulated memory circuits is different than the actual number of physical memory circuits. The terms “emulating”, “emulated”, “emulation”, and the like will be used in this disclosure to signify emulation, simulation, disguising, transforming, converting, and the like, which results in at least one characteristic of the memory circuits appearing to the system device to be different than the actual, physical characteristic. In some embodiments, the emulated characteristic may be electrical in nature, physical in nature, logical in nature, pertaining to a protocol, etc. An example of an emulated electrical characteristic might be a signal, or a voltage level. An example of an emulated physical characteristic might be a number of pins or wires, a number of signals, or a memory capacity. An example of an emulated protocol characteristic might be a timing, or a specific protocol such as DDR3.


In the case of an emulated signal, such signal may be a control signal such as an address signal, a data signal, or a control signal associated with an activate operation, precharge operation, write operation, mode register read operation, refresh operation, etc. The interface circuit may emulate the number of signals, type of signals, duration of signal assertion, and so forth. It may combine multiple signals to emulate another signal.


The interface circuit may present to the system device an emulated interface to e.g. DDR3 memory, while the physical memory chips are, in fact, DDR2 memory. The interface circuit may emulate an interface to one version of a protocol such as DDR2 with 5-5-5 latency timing, while the physical memory chips are built to another version of the protocol such as DDR2 with 3-3-3 latency timing. The interface circuit may emulate an interface to a memory having a first capacity that is different than the actual combined capacity of the physical memory chips.


An emulated timing may relate to latency of e.g. a column address strobe (CAS) latency, a row address to column address latency (tRCD), a row precharge latency (tRP), an activate to precharge latency (tRAS), and so forth. CAS latency is related to the timing of accessing a column of data. tRCD is the latency required between the row address strobe (RAS) and CAS. tRP is the latency required to terminate an open row and open access to the next row. tRAS is the latency required to access a certain row of data between an activate operation and a precharge operation.


The interface circuit may be operable to receive a signal from the system device and communicate the signal to one or more of the memory circuits after a delay (which may be hidden from the system device). Such delay may be fixed, or in some embodiments it may be variable. If variable, the delay may depend on e.g. a function of the current signal or a previous signal, a combination of signals, or the like. The delay may include a cumulative delay associated with any one or more of the signals. The delay may result in a time shift of the signal forward or backward in time with respect to other signals. Different delays may be applied to different signals. The interface circuit may similarly be operable to receive a signal from a memory circuit and communicate the signal to the system device after a delay.


The interface circuit may take the form of, or incorporate, or be incorporated into, a register, an AMB, a buffer, or the like, and may comply with Joint Electron Device Engineering Council (JEDEC) standards, and may have forwarding, storing, and/or buffering capabilities.


In some embodiments, the interface circuit may perform operations without the system device's knowledge. One particularly useful such operation is a power-saving operation. The interface circuit may identify one or more of the memory circuits which are not currently being accessed by the system device, and perform the power saving operation on those. In one such embodiment, the identification may involve determining whether any page (or other portion) of memory is being accessed. The power saving operation may be a power down operation, such as a precharge power down operation.


The interface circuit may include one or more devices which together perform the emulation and related operations. The interface circuit may be coupled or packaged with the memory devices, or with the system device or a component thereof, or separately. In one embodiment, the memory circuits and the interface circuit are coupled to a DIMM.



FIG. 2 illustrates one embodiment of a system 200 including a system device (e.g. host system 204, etc.) which communicates address, control, clock, and data signals with a memory subsystem 201 via an interface.


The memory subsystem includes a buffer chip 202 which presents the host system with emulated interface to emulated memory, and a plurality of physical memory circuits which, in the example shown, are DRAM chips 206A-D. In one embodiment, the DRAM chips are stacked, and the buffer chip is placed electrically between them and the host system. Although the embodiments described here show the stack consisting of multiple DRAM circuits, a stack may refer to any collection of memory circuits (e.g. DRAM circuits, flash memory circuits, or combinations of memory circuit technologies, etc.).


The buffer chip buffers communicates signals between the host system and the DRAM chips, and presents to the host system an emulated interface to present the memory as though it were a smaller number of larger capacity DRAM chips, although in actuality there is a larger number of smaller capacity DRAM chips in the memory subsystem. For example, there may be eight 512 Mb physical DRAM chips, but the buffer chip buffers and emulates them to appear as a single 4 Gb DRAM chip, or as two 2 Gb DRAM chips. Although the drawing shows four DRAM chips, this is for ease of illustration only; the invention is, of course, not limited to using four DRAM chips.


In the example shown, the buffer chip is coupled to send address, control, and clock signals 208 to the DRAM chips via a single, shared address, control, and clock bus, but each DRAM chip has its own, dedicated data path for sending and receiving data signals 210 to/from the buffer chip.


Throughout this disclosure, the reference number 1 will be used to denote the interface between the host system and the buffer chip, the reference number 2 will be used to denote the address, control, and clock interface between the buffer chip and the physical memory circuits, and the reference number 3 will be used to denote the data interface between the buffer chip and the physical memory circuits, regardless of the specifics of how any of those interfaces is implemented in the various embodiments and configurations described below. In the configuration shown in FIG. 2, there is a single address, control, and clock interface channel 2 and four data interface channels 3; this implementation may thus be said to have a “1A4D” configuration (wherein “1A” means one address, control, and clock channel in interface 2, and “4D” means four data channels in interface 3).


In the example shown, the DRAM chips are physically arranged on a single side of the buffer chip. The buffer chip may, optionally, be a part of the stack of DRAM chips, and may optionally be the bottommost chip in the stack. Or, it may be separate from the stack.



FIG. 3 illustrates another embodiment of a system 301 in which the buffer chip 303 is interfaced to a host system 304 and is coupled to the DRAM chips 307A-307D somewhat differently than in the system of FIG. 2. There are a plurality of shared address, control, and clock busses 309A and 309B, and a plurality of shared data busses 305A and 305B. Each shared bus has two or more DRAM chips coupled to it. As shown, the sharing need not necessarily be the same in the data busses as it is in the address, control, and clock busses. This embodiment has a “2A2D” configuration.



FIG. 4 illustrates another embodiment of a system 411 in which the buffer chip 413 is interfaced to a host system 404 and is coupled to the DRAM chips 417A-417D somewhat differently than in the system of FIG. 2 or 3. There is a shared address, control, and clock bus 419, and a plurality of shared data busses 415A and 415B. Each shared bus has two or more DRAM chips coupled to it. This implementation has a “1A2D” configuration.



FIG. 5 illustrates another embodiment of a system 521 in which the buffer chip 523 is interfaced to a host system 504 and is coupled to the DRAM chips 527A-527D somewhat differently than in the system of FIGS. 2 through 4. There is a shared address, control, and clock bus 529, and a shared data bus 525. This implementation has a “1A1D” configuration.



FIG. 6 illustrates another embodiment of a system 631 in which the buffer chip 633 is interfaced to a host system 604 and is coupled to the DRAM chips 637A-637D somewhat differently than in the system of FIGS. 2 through 5. There is a plurality of shared address, control, and clock busses 639A and 639B, and a plurality of dedicated data paths 635. Each shared bus has two or more DRAM chips coupled to it. Further, in the example shown, the DRAM chips are physically arranged on both sides of the buffer chip. There may be, for example, sixteen DRAM chips, with the eight DRAM chips on each side of the buffer chip arranged in two stacks of four chips each. This implementation has a “2A4D” configuration.



FIGS. 2 through 6 are not intended to be an exhaustive listing of all possible permutations of data paths, busses, and buffer chip configurations, and are only illustrative of some ways in which the host system device can be in electrical contact only with the load of the buffer chip and thereby be isolated from whatever physical memory circuits, data paths, busses, etc. exist on the (logical) other side of the buffer chip.



FIG. 7 illustrates one embodiment of a method 700 for storing at least a portion of information received in association with a first operation, for use in performing a second operation. Such a method may be practiced in a variety of systems, such as, but not limited to, those of FIGS. 1-6. For example, the method may be performed by the interface circuit of FIG. 1 or the buffer chip of FIG. 2.


Initially, first information is received (702) in association with a first operation to be performed on at least one of the memory circuits (DRAM chips). Depending on the particular implementation, the first information may be received prior to, simultaneously with, or subsequent to the instigation of the first operation. The first operation may be, for example, a row operation, in which case the first information may include e.g. address values received by the buffer chip via the address bus from the host system. At least a portion of the first information is then stored (704).


The buffer chip also receives (706) second information associated with a second operation. For convenience, this receipt is shown as being after the storing of the first information, but it could also happen prior to or simultaneously with the storing. The second operation may be, for example, a column operation.


Then, the buffer chip performs (708) the second operation, utilizing the stored portion of the first information, and the second information.


If the buffer chip is emulating a memory device which has a larger capacity than each of the physical DRAM chips in the stack, the buffer chip may receive from the host system's memory controller more address bits than are required to address any given one of the DRAM chips. In this instance, the extra address bits may be decoded by the buffer chip to individually select the DRAM chips, utilizing separate chip select signals (not shown) to each of the DRAM chips in the stack.


For example, a stack of four x4 1 Gb DRAM chips behind the buffer chip may appear to the host system as a single x4 4 Gb DRAM circuit, in which case the memory controller may provide sixteen row address bits and three bank address bits during a row operation (e.g. an activate operation), and provide eleven column address bits and three bank address bits during a column operation (e.g. a read or write operation). However, the individual DRAM chips in the stack may require only fourteen row address bits and three bank address bits for a row operation, and eleven column address bits and three bank address bits during a column operation. As a result, during a row operation (the first operation in the method 702), the buffer chip may receive two address bits more than are needed by any of the DRAM chips. The buffer chip stores (704) these two extra bits during the row operation (in addition to using them to select the correct one of the DRAM chips), then uses them later, during the column operation, to select the correct one of the DRAM chips.


The mapping between a system address (from the host system to the buffer chip) and a device address (from the buffer chip to a DRAM chip) may be performed in various manners. In one embodiment, lower order system row address and bank address bits may be mapped directly to the device row address and bank address bits, with the most significant system row address bits (and, optionally, the most significant bank address bits) being stored for use in the subsequent column operation. In one such embodiment, what is stored is the decoded version of those bits; in other words, the extra bits may be stored either prior to or after decoding. The stored bits may be stored, for example, in an internal lookup table (not shown) in the buffer chip, for one or more clock cycles.


As another example, the buffer chip may have four 512 Mb DRAM chips with which it emulates a single 2 Gb DRAM chip. The system will present fifteen row address bits, from which the buffer chip may use the fourteen low order bits (or, optionally, some other set of fourteen bits) to directly address the DRAM chips. The system will present three bank address bits, from which the buffer chip may use the two low order bits (or, optionally, some other set of two bits) to directly address the DRAM chips. During a row operation, the most significant bank address bit (or other unused bit) and the most significant row address bit (or other unused bit) are used to generate the four DRAM chip select signals, and are stored for later reuse. And during a subsequent column operation, the stored bits are again used to generate the four DRAM chip select signals. Optionally, the unused bank address is not stored during the row operation, as it will be re-presented during the subsequent column operation.


As yet another example, addresses may be mapped between four 1 Gb DRAM circuits to emulate a single 4 Gb DRAM circuit. Sixteen row address bits and three bank address bits come from the host system, of which the low order fourteen address bits and all three bank address bits are mapped directly to the DRAM circuits. During a row operation, the two most significant row address bits are decoded to generate four chip select signals, and are stored using the bank address bits as the index. During the subsequent column operation, the stored row address bits are again used to generate the four chip select signals.


A particular mapping technique may be chosen, to ensure that there are no unnecessary combinational logic circuits in the critical timing path between the address input pins and address output pins of the buffer chip. Corresponding combinational logic circuits may instead be used to generate the individual chip select signals. This may allow the capacitive loading on the address outputs of the buffer chip to be much higher than the loading on the individual chip select signal outputs of the buffer chip.


In another embodiment, the address mapping may be performed by the buffer chip using some of the bank address signals from the host system to generate the chip select signals. The buffer chip may store the higher order row address bits during a row operation, using the bank address as the index, and then use the stored address bits as part of the DRAM circuit bank address during a column operation.


For example, four 512 Mb DRAM chips may be used in emulating a single 2 Gb DRAM. Fifteen row address bits come from the host system, of which the low order fourteen are mapped directly to the DRAM chips. Three bank address bits come from the host system, of which the least significant bit is used as a DRAM circuit bank address bit for the DRAM chips. The most significant row address bit may be used as an additional DRAM circuit bank address bit. During a row operation, the two most significant bank address bits are decoded to generate the four chip select signals. The most significant row address bit may be stored during the row operation, and reused during the column operation with the least significant bank address bit, to form the DRAM circuit bank address.


The column address from the host system memory controller may be mapped directly as the column address to the DRAM chips in the stack, since each of the DRAM chips may have the same page size, regardless any differences in the capacities of the (asymmetrical) DRAM chips.


Optionally, address bit A[10] may be used by the memory controller to enable or disable auto-precharge during a column operation, in which case the buffer chip may forward that bit to the DRAM circuits without any modification during a column operation.


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. Behavior of many DRAM circuits is specified by the JEDEC standards, and it may be desirable to exactly emulate a particular JEDEC standard DRAM. The JEDEC standard defines control signals that a DRAM circuit must accept and the behavior of the DRAM circuit as a result of such control signals. For example, the JEDEC specification for DDR2 DRAM is known as JESD79-2B. If it is desired to determine whether a standard is met, the following algorithm may be used. Using a set of software verification tools, it checks for formal verification of logic, that protocol behavior of the simulated DRAM circuit is the same as the desired standard or other design specification. Examples of suitable verification tools include: Magellan, supplied by Synopsys, Inc. of 700 E. Middlefield Rd., Mt. View, Calif. 94043; Incisive, supplied by Cadence Design Systems, Inc., of 2655 Sealy Ave., San Jose, Calif. 95134; tools supplied by Jasper Design Automation, Inc. of 100 View St. #100, Mt. View, Calif.; Verix, supplied by Real Intent, Inc., of 505 N. Mathilda Ave. #210, Sunnyvale, Calif. 94085; 0-In, supplied by Mentor Graphics Corp. of 8005 SW Boeckman Rd., Wilsonville, Oreg. 97070; and others. These software verification took use written assertions that correspond to the rules established by the particular 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 emulated DRAM circuit, a proof may be constructed that determines whether the desired design requirements are met.


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/DRAM stack configurations and address mappings (such as those described above) are suitable, the verification process allows a designer to prove that the emulated DRAM circuit exactly meets the required standard etc. 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 buffer chips with other bus arrangements or alternative designs for the sideband signal interconnect between two or more buffer chips may be used and tested for compliance. Such sideband signals convey the power management signals, for example.



FIG. 8 illustrates a high capacity DIMM 800 using a plurality of buffered stacks of DRAM circuits 802 and a register device 804, according to one embodiment of this invention. The register performs the addressing and control of the buffered stacks. In some embodiments, the MINI may be an FB-DIMM, in which case the register is an AMB. In one embodiment the emulation is performed at the DIMM level.



FIG. 9 is a timing diagram illustrating a timing design 900 of a buffer chip which makes a buffered stack of DRAM chips mimic a larger DRAM circuit having longer CAS latency, in accordance with another embodiment of this invention. Any delay through a buffer chip may be made transparent to the host system's memory controller, by using such a method. Such a delay may be a result of the buffer chip being located electrically between the memory bus of the host system and the stacked DRAM circuits, since some or all of the signals that connect the memory bus to the DRAM circuits pass through the buffer chip. A finite amount of time may be needed for these signals to traverse through the buffer chip. With the exception of register chips and AMBs, industry standard memory protocols may not comprehend the buffer chip that sits between the memory bus and the DRAM chips. Industry standards narrowly define the properties of a register chip and an AMB, but not the properties of the buffer chip of this embodiment. Thus, any signal delay caused by the buffer chip may cause a violation of the industry standard protocols.


In one embodiment, the buffer chip may cause a one-half clock cycle delay between the buffer chip receiving address and control signals from the host system memory controller (or, optionally, from a register chip or an AMB), and the address and control signals being valid at the inputs of the stacked DRAM circuits. Data signals may also have a one-half clock cycle delay in either direction to/from the host system. Other amounts of delay are, of course, possible, and the half-clock cycle example is for illustration only.


The cumulative delay through the buffer chip is the sum of a delay of the address and control signals and a delay of the data signals. FIG. 9 illustrates an example where the buffer chip is using DRAM chips having a native CAS latency of i clocks, and the buffer chip delay is j clocks, thus the buffer chip emulates a DRAM having a CAS latency of i+j clocks. In the example shown, the DRAM chips have a native CAS latency 906 of four clocks (from t1 to t5), and the total latency through the buffer chip is two clocks (one clock delay 902 from t0 to t1 for address and control signals, plus one clock delay 904 from t5 to t6 for data signals), and the buffer chip emulates a DRAM having a six clock CAS latency 908.


In FIG. 9 (and other timing diagrams), the reference numbers 1, 2, and/or 3 at the left margin indicate which of the interfaces correspond to the signals or values illustrated on the associated waveforms. For example, in FIG. 9: the “Clock” signal shown as a square wave on the uppermost waveform is indicated as belonging to the interface 1 between the host system and the buffer chip; the “Control Input to Buffer” signal is also part of the interface 1; the “Control Input to DRAM” waveform is part of the interface 2 from the buffer chip to the physical memory circuits; the “Data Output from DRAM” waveform is part of the interface 3 from the physical memory circuits to the buffer chip; and the “Data Output from Buffer” shown in the lowermost waveform is part of the interface 1 from the buffer chip to the host system.



FIG. 10 is a timing diagram illustrating a timing design 1000 of write data timing expected by a DRAM circuit in a buffered stack. Emulation of a larger capacity DRAM circuit having higher CAS latency (as in FIG. 9) may, in some implementations, create a problem with the timing of write operations. For example, with respect to a buffered stack of DDR2 SDRAM chips with a read CAS latency of four clocks which are used in emulating a single larger DDR2 SDRAM with a read CAS latency of six clocks, the DDR2 SDRAM protocol may specify that the write CAS latency 1002 is one less than the read CAS latency. Therefore, since the buffered stack appears as a DDR2 SDRAM with a read CAS latency of six clocks, the memory controller may use a buffered stack write CAS latency of five clocks 1004 when scheduling a write operation to the memory.


In the specific example shown, the memory controller issues the write operation at t0. After a one clock cycle delay through the buffer chip, the write operation is issued to the DRAM chips at t1. Because the memory controller believes it is connected to memory having a read CAS latency of six clocks and thus a write CAS latency of five clocks, it issues the write data at time t0+5=t5. But because the physical DRAM chips have a read CAS latency of four clocks and thus a write CAS latency of three clocks, they expect to receive the write data at time t1+3=t4. Hence the problem, which the buffer chip may alleviate by delaying write operations.


The waveform “Write Data Expected by DRAM” is not shown as belonging to interface 1, interface 2, or interface 3, for the simple reason that there is no such signal present in any of those interfaces. That waveform represents only what is expected by the DRAM, not what is actually provided to the DRAM.



FIG. 11 is a timing illustrating a timing design 1100 showing how the buffer chip does this. The memory controller issues the write operation at t0. In FIG. 10, the write operation appeared at the DRAM circuits one clock later at t1, due to the inherent delay through the buffer chip. But in FIG. 11, in addition to the inherent one clock delay, the buffer chip has added an extra two clocks of delay to the write operation, which is not issued to the DRAM chips until t0+1+2=t3. Because the DRAM chips receive the write operation at t3 and have a write CAS latency of three clocks, they expect to receive the write data at t3+3=t6. Because the memory controller issued the write operation at t0, and it expects a write CAS latency of five clocks, it issues the write data at time t0+5=t5. After a one clock delay through the buffer chip, the write data arrives at the DRAM chips at t5+1=t6, and the timing problem is solved.


It should be noted that extra delay of j clocks (beyond the inherent delay) which the buffer chip deliberately adds before issuing the write operation to the DRAM is the sum j clocks of the inherent delay of the address and control signals and the inherent delay of the data signals. In the example shown, both those inherent delays are one clock, so j=2.



FIG. 12 is a timing diagram illustrating operation of an FB-DIMM's AMB, which may be designed to send write data earlier to buffered stacks instead of delaying the write address and operation (as in FIG. 11). Specifically, it may use an early write CAS latency 1202 to compensate the timing of the buffer chip write operation. If the buffer chip has a cumulative (address and data) inherent delay of two clocks, the AMB may send the write data to the buffered stack two clocks early. This may not be possible in the case of registered DIMMs, in which the memory controller sends the write data directly to the buffered stacks (rather than via the AMB). In another embodiment, the memory controller itself could be designed to send write data early, to compensate for the j clocks of cumulative inherent delay caused by the buffer chip.


In the example shown, the memory controller issues the write operation at t0. After a one clock inherent delay through the buffer chip, the write operation arrives at the DRAM at t1. The DRAM expects the write data at t1+3=t4. The industry specification would suggest a nominal write data time of t0+5=t5, but the AMB (or memory controller), which already has the write data (which are provided with the write operation), is configured to perform an early write at t5−2=t3. After the inherent delay 1203 through the buffer chip, the write data arrive at the DRAM at t3+1=t4, exactly when the DRAM expects it—specifically, with a three-cycle DRAM Write CAS latency 1204 which is equal to the three-cycle Early Write CAS Latency 1202.



FIG. 13 is a timing diagram 1300 illustrating bus conflicts which can be caused by delayed write operations. The delaying of write addresses and write operations may be performed by a buffer chip, a register, an AMB, etc. in a manner that is completely transparent to the memory controller of the host system. And, because the memory controller is unaware of this delay, it may schedule subsequent operations such as activate or precharge operations, which may collide with the delayed writes on the address bus to the DRAM chips in the stack.


An example is shown, in which the memory controller issues a write operation 1302 at time t0. The buffer chip or AMB delays the write operation, such that it appears on the bus to the DRAM chips at time t3. Unfortunately, at time t2 the memory controller issued an activate operation (control signal) 1304 which, after a one-clock inherent delay through the buffer chip, appears on the bus to the DRAM chips at time t3, colliding with the delayed write.



FIGS. 14 and 15 are a timing diagram 1400 and a timing diagram 1500 illustrating methods of avoiding such collisions. If the cumulative latency through the buffer chip is two clock cycles, and the native read CAS latency of the DRAM chips is four clock cycles, then in order to hide the delay of the address and control signals and the data signals through the buffer chip, the buffer chip presents the host system with an interface to an emulated memory having a read CAS latency of six clock cycles. And if the tRCD and tRP of the DRAM chips are four clock cycles each, the buffer chip tells the host system that they are six clock cycles each in order to allow the buffer chip to delay the activate and precharge operations to avoid collisions in a manner that is transparent to the host system.


For example, a buffered stack that uses 4-4-4 DRAM chips (that is, CAS latency=4, tRCD=4, and tRP=4) may appear to the host system as one larger DRAM that uses 6-6-6 timing.


Since the buffered stack appears to the host system's memory controller as having a tRCD of six clock cycles, the memory controller may schedule a column operation to a bank six clock cycles (at time t6) after an activate (row) operation (at time t0) to the same bank. However, the DRAM chips in the stack actually have a tRCD of four clock cycles. This gives the buffer chip time to delay the activate operation by up to two clock cycles, avoiding any conflicts on the address bus between the buffer chip and the DRAM chips, while ensuring correct read and write timing on the channel between the memory controller and the buffered stack.


As shown, the buffer chip may issue the activate operation to the DRAM chips one, two, or three clock cycles after it receives the activate operation from the memory controller, register, or AMB. The actual delay selected may depend on the presence or absence of other DRAM operations that may conflict with the activate operation, and may optionally change from one activate operation to another. In other words, the delay may be dynamic. A one-clock delay (1402A, 1502A) may be accomplished simply by the inherent delay through the buffer chip. A two-clock delay (1402B, 1502B) may be accomplished by adding one clock of additional delay to the one-clock inherent delay, and a three-clock delay (1402C, 1502C) may be accomplished by adding two clocks of additional delay to the one-clock inherent delay. A read, write, or activate operation issued by the memory controller at time t6 will, after a one-clock inherent delay through the buffer chip, be issued to the DRAM chips at time t7. A preceding activate or precharge operation issued by the memory controller at time t0 will, depending upon the delay, be issued to the DRAM chips at time t1, t2, or t3, each of which is at least the tRCD or tRP of four clocks earlier than the t7 issuance of the read, write, or activate operation.


Since the buffered stack appears to the memory controller to have a tRP of six clock cycles, the memory controller may schedule a subsequent activate (row) operation to a bank a minimum of six clock cycles after issuing a precharge operation to that bank. However, since the DRAM circuits in the stack actually have a tRP of four clock cycles, the buffer chip may have the ability to delay issuing the precharge operation to the DRAM chips by up to two clock cycles, in order to avoid any conflicts on the address bus, or in order to satisfy the tRAS requirements of the DRAM chips.


In particular, if the activate operation to a bank was delayed to avoid an address bus conflict, then the precharge operation to the same bank may be delayed by the buffer chip to satisfy the tRAS requirements of the DRAM. The buffer chip may issue the precharge operation to the DRAM chips one, two, or three clock cycles after it is received. The delay selected may depend on the presence or absence of address bus conflicts or tRAS violations, and may change from one precharge operation to another.



FIG. 16 illustrates a buffered stack 1600 according to one embodiment of this invention. The buffered stack includes four 512 Mb DDR2 DRAM circuits (chips) 1602 which a buffer chip 1604 maps to a single 2 Gb DDR2 DRAM.


Although the multiple DRAM chips appear to the memory controller as though they were a single, larger DRAM, the combined power dissipation of the actual DRAM chips may be much higher than the power dissipation of a monolithic DRAM of the same capacity. In other words, the physical DRAM may consume significantly more power than would be consumed by the emulated DRAM.


As a result, a DIMM containing multiple buffered stacks may dissipate much more power than a standard DIMM of the same actual capacity using monolithic DRAM circuits. This increased power dissipation may limit the widespread adoption of DIMMs that use buffered stacks. Thus, it is desirable to have a power management technique which reduces the power dissipation of DIMMs that use buffered stacks.


In one such technique, the DRAM circuits may be opportunistically placed in low power states or modes. For example, the DRAM circuits may be placed in a precharge power down mode using the clock enable (CKE) pin of the DRAM circuits.


A single rank registered DIMM (R-DIMM) may contain a plurality of buffered stacks, each including four x4 512 Mb DDR2 SDRAM chips and appear (to the memory controller via emulation by the buffer chip) as a single x4 2 Gb DDR2 SDRAM. The JEDEC standard indicates that a 2 Gb DDR2 SDRAM may generally have eight banks, shown in FIG. 16 as Bank 0 to Bank 7. Therefore, the buffer chip may map each 512 Mb DRAM chip in the stack to two banks of the equivalent 2 Gb DRAM, as shown; the first DRAM chip 1602A is treated as containing banks 0 and 1, 1602B is treated as containing banks 2 and 4, and so forth.


The memory controller may open and close pages in the DRAM banks based on memory requests it receives from the rest of the host system. In some embodiments, no more than one page may be able to be open in a bank at any given time. In the embodiment shown in FIG. 16, each DRAM chip may therefore have up to two pages open at a time. When a DRAM chip has no open pages, the power management scheme may place it in the precharge power down mode.


The clock enable inputs of the DRAM chips may be controlled by the buffer chip, or by another chip (not shown) on the R-DIMM, or by an AMB (not shown) in the case of an FB-DIMM, or by the memory controller, to implement the power management technique. The power management technique may be particularly effective if it implements a closed page policy.


Another optional power management technique may include mapping a plurality of DRAM circuits to a single bank of the larger capacity emulated DRAM. For example, a buffered stack (not shown) of sixteen x4 256 Mb DDR2 SDRAM chips may be used in emulating a single x4 4 Gb DDR2 SDRAM. The 4 Gb DRAM is specified by JEDEC as having eight banks of 512 Mbs each, so two of the 256 Mb DRAM chips may be mapped by the buffer chip to emulate each bank (whereas in FIG. 16 one DRAM was used to emulate two banks).


However, since only one page can be open in a bank at any given time, only one of the two DRAM chips emulating that bank can be in the active state at any given time. If the memory controller opens a page in one of the two DRAM chips, the other may be placed in the precharge power down mode. Thus, if a number p of DRAM chips are used to emulate one bank, at least p−1 of them may be in a power down mode at any given time; in other words, at least p−1 of the p chips are always in power down mode, although the particular powered down chips will tend to change over time, as the memory controller opens and closes various pages of memory.


As a caveat on the term “always” in the preceding paragraph, the power saving operation may comprise operating in precharge power down mode except when refresh is required.



FIG. 17 is a flow chart 1700 illustrating one embodiment of a method of refreshing a plurality of memory circuits. A refresh control signal is received (1702) e.g. from a memory controller which intends to refresh an emulated memory circuit. In response to receipt of the refresh control signal, a plurality of refresh control signals are sent (1704) e.g. by a buffer chip to a plurality of physical memory circuits at different times. These refresh control signals may optionally include the received refresh control signal or an instantiation or copy thereof. They may also, or instead, include refresh control signals that are different in at least one aspect (format, content, etc.) from the received signal.


In some embodiments, at least one first refresh control signal may be sent to a first subset of the physical memory circuits at a first time, and at least one second refresh control signal may be sent to a second subset of the physical memory circuits at a second time. Each refresh signal may be sent to one physical memory circuit, or to a plurality of physical memory circuits, depending upon the particular implementation.


The refresh control signals may be sent to the physical memory circuits after a delay in accordance with a particular timing. For example, the timing in which they are sent to the physical memory circuits may be selected to minimize an electrical current drawn by the memory, or to minimize a power consumption of the memory. This may be accomplished by staggering a plurality of refresh control signals. Or, the timing may be selected to comply with e.g. a tRFC parameter associated with the memory circuits.


To this end, physical DRAM circuits may receive periodic refresh operations to maintain integrity of data stored therein. A memory controller may initiate refresh operations by issuing refresh control signals to the DRAM circuits with sufficient frequency to prevent any loss of data in the DRAM circuits. After a refresh control signal is issued, a minimum time tRFC may be required to elapse before another control signal may be issued to that DRAM circuit. The tRFC parameter value may increase as the size of the DRAM circuit increases.


When the buffer chip receives a refresh control signal from the memory controller, it may refresh the smaller DRAM circuits within the span of time specified by the tRFC of the emulated DRAM circuit. Since the tRFC of the larger, emulated DRAM is longer than the tRFC of the smaller, physical DRAM circuits, it may not be necessary to issue any or all of the refresh control signals to the physical DRAM circuits simultaneously. Refresh control signals may be issued separately to individual DRAM circuits or to groups of DRAM circuits, provided that the tRFC requirements of all physical DRAMs has been met by the time the emulated DRAM's tRFC has elapsed. In use, the refreshes may be spaced in time to minimize the peak current draw of the combination buffer chip and DRAM circuit set during a refresh operation.



FIG. 18 illustrates one embodiment of an interface circuit such as may be utilized in any of the above-described memory systems, for interfacing between a system and memory circuits. The interface circuit may be included in the buffer chip, for example.


The interface circuit includes a system address signal interface for sending/receiving address signals to/from the host system, a system control signal interface for sending/receiving control signals to/from the host system, a system clock signal interface for sending/receiving clock signals to/from the host system, and a system data signal interface for sending/receiving data signals to/from the host system. The interface circuit further includes a memory address signal interface for sending/receiving address signals to/from the physical memory, a memory control signal interface for sending/receiving control signals to/from the physical memory, a memory clock signal interface for sending/receiving clock signals to/from the physical memory, and a memory data signal interface for sending/receiving data signals to/from the physical memory.


The host system includes a set of memory attribute expectations, or built-in parameters of the physical memory with which it has been designed to work (or with which it has been told, e.g. by the buffer circuit, it is working). Accordingly, the host system includes a set of memory interaction attributes, or built-in parameters according to which the host system has been designed to operate in its interactions with the memory. These memory interaction attributes and expectations will typically, but not necessarily, be embodied in the host system's memory controller.


In addition to physical storage circuits or devices, the physical memory itself has a set of physical attributes.


These expectations and attributes may include, by way of example only, memory timing, memory capacity, memory latency, memory functionality, memory type, memory protocol, memory power consumption, memory current requirements, and so forth.


The interface circuit includes memory physical attribute storage for storing values or parameters of various physical attributes of the physical memory circuits. The interface circuit further includes system emulated attribute storage. These storage systems may be read/write capable stores, or they may simply be a set of hard-wired logic or values, or they may simply be inherent in the operation of the interface circuit.


The interface circuit includes emulation logic which operates according to the stored memory physical attributes and the stored system emulation attributes, to present to the system an interface to an emulated memory which differs in at least one attribute from the actual physical memory. The emulation logic may, in various embodiments, alter a timing, value, latency, etc. of any of the address, control, clock, and/or data signals it sends to or receives from the system and/or the physical memory. Some such signals may pass through unaltered, while others may be altered. The emulation logic may be embodied as, for example, hard wired logic, a state machine, software executing on a processor, and so forth.


CONCLUSION

When one component is said to be “adjacent” another component, it should not be interpreted to mean that there is absolutely nothing between the two components, only that they are in the order indicated.


The physical memory circuits employed in practicing this invention may be any type of memory whatsoever, such as: DRAM, DDR DRAM, DDR2 DRAM, DDR3 DRAM, SDRAM, QDR DRAM, DRDRAM, FPM DRAM, VDRAM, EDO DRAM, BEDO DRAM, MDRAM, SGRAM, MRAM, IRAM, NAND flash, NOR flash, PSRAM, wetware memory, etc.


The physical memory circuits may be coupled to any type of memory module, such as: DIMM, R-DIMM, SO-DIMM, FB-DIMM, unbuffered DIMM, etc.


The system device which accesses the memory may be any type of system device, such as: desktop computer, laptop computer, workstation, server, consumer electronic device, television, personal digital assistant (PDA), mobile phone, printer or other peripheral device, etc.


The various features illustrated in the figures may be combined in many ways, and should not be interpreted as though limited to the specific embodiments in which they were explained and shown.


Those skilled in the art, having the benefit of this disclosure, will appreciate that many other variations from the foregoing description and drawings may be made within the scope of the present invention. Indeed, the invention is not limited to the details described above. Rather, it is the following claims including any amendments thereto that define the scope of the invention.

Claims
  • 1. A memory apparatus for use with a host system, the memory apparatus comprising: a plurality of memory circuits; andan interface circuit including: one or more first components of a first type, each of the one or more first components being electrically couplable to the host system; andone or more second components of a second type different from the first type, each of the one or more second components being electrically couplable to the host system, the interface circuit being operable to present to the host system a simulated memory circuit where there is a difference in at least one aspect between the simulated memory circuit and at least one memory circuit of the plurality of memory circuits, the at least one aspect comprising a timing that relates to a refresh operation latency,wherein each memory circuit of the plurality of memory circuits is electrically coupled to at least one first component of the one or more first components and to at least one second component of the one or more second components.
  • 2. The memory apparatus of claim 1, where the first type of component is a register and the second type of component is a buffer chip.
  • 3. The memory apparatus of claim 1, where at least one component of the first and second components is operable to receive control and clock signals intended for the simulated memory circuit.
  • 4. The memory apparatus of claim 1, where at least one component of the first and second components is operable to receive data signals intended for the simulated memory circuit.
  • 5. The memory apparatus of claim 1, where the plurality of memory circuits comprise a stack of dynamic random access memory (DRAM) circuits and are coupled to a dual inline memory module (DIMM).
  • 6. The memory apparatus of claim 5, where the DIMM is a registered DIMM (R-DIMM).
  • 7. The memory apparatus of claim 5, where the stack further includes the one or more second components of the second type.
  • 8. The memory apparatus of claim 5, further comprising: a first package including the one or more second components; anda second separate package including the plurality of memory circuits.
  • 9. The memory apparatus of claim 5, where the one or more second components are packaged together with the plurality of memory circuits in the stack.
  • 10. The memory apparatus of claim 1, where at least one component of the first and second components is operable to refresh the plurality of physical memory circuits in response to receiving from the host system a first refresh control signal intended for the simulated memory circuit.
  • 11. The memory apparatus of claim 10, where the at least one component of the first and second components is operable to receive the first refresh control signal intended for the simulated memory circuit from a memory controller of the host system.
  • 12. The memory apparatus of claim 10, where the at least one component of the first and second components is operable to minimize a current draw of the plurality of memory circuits by issuing second refresh control signals at different times to one or more memory circuits of the plurality of memory circuits.
  • 13. The memory apparatus of claim 10, where the at least one component of the first and second components is operable to issue a plurality of second refresh control signals to one or more memory circuits of the plurality of memory circuits in response to receiving the first refresh control signal intended for the simulated memory circuit.
  • 14. The memory apparatus of claim 13, where the at least one component of the first and second components is operable to stagger the issuance of the plurality of second refresh control signals to the one or more memory circuits of the plurality of memory circuits.
  • 15. The memory apparatus of claim 1, where the timing comprises one or more of a row address to column address latency (tRCD), a row precharge latency (tRP), an activate to precharge latency (tRAS), a row cycle time (tRC), a refresh latency (tRFC), or a column address strobe (CAS) latency.
  • 16. The memory apparatus of claim 1, where the simulated memory circuit is associated with a first refresh operation latency and the plurality of memory circuits are associated with a second refresh operation latency, where the first refresh operation latency is longer than the second refresh operation latency.
  • 17. The memory apparatus of claim 1, where the at least one aspect includes a signal associated with a mode register operation.
  • 18. The memory apparatus of claim 1, where the at least one aspect includes a number of banks.
  • 19. The memory apparatus of claim 1, where the difference in at least one aspect is a difference in a number of row-address signals.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 11/762,010, entitled “Memory Device with Emulated Characteristics,” filed on Jun. 12, 2007, which, in turn, is a continuation in part of U.S. patent application Ser. No. 11/461,420, entitled “System and Method for Simulating a Different Number of Memory Circuits,” filed on Jul. 31, 2006, each of which is incorporated herein by reference in its entirety.

US Referenced Citations (756)
Number Name Date Kind
3800292 Curley et al. Mar 1974 A
4069452 Conway et al. Jan 1978 A
4334307 Bourgeois et al. Jun 1982 A
4345319 Bernardini et al. Aug 1982 A
4392212 Miyasaka et al. Jul 1983 A
4525921 Carson et al. Jul 1985 A
4566082 Anderson Jan 1986 A
4592019 Huang et al. May 1986 A
4646128 Carson et al. Feb 1987 A
4698748 Juzswik et al. Oct 1987 A
4706166 Go Nov 1987 A
4710903 Hereth et al. Dec 1987 A
4764846 Go Aug 1988 A
4780843 Tietjen Oct 1988 A
4794597 Ooba et al. Dec 1988 A
4796232 House Jan 1989 A
4807191 Flannagan Feb 1989 A
4841440 Yonezu et al. Jun 1989 A
4862347 Rudy Aug 1989 A
4887240 Garverick et al. Dec 1989 A
4899107 Corbett et al. Feb 1990 A
4912678 Mashiko Mar 1990 A
4922451 Lo et al. May 1990 A
4935734 Austin Jun 1990 A
4937791 Steele et al. Jun 1990 A
4956694 Eide Sep 1990 A
4982265 Watanabe et al. Jan 1991 A
4983533 Go Jan 1991 A
5025364 Zellmer Jun 1991 A
5072424 Brent et al. Dec 1991 A
5083266 Watanabe Jan 1992 A
5104820 Go et al. Apr 1992 A
5193072 Frenkil et al. Mar 1993 A
5212666 Takeda May 1993 A
5220672 Nakao et al. Jun 1993 A
5222014 Lin Jun 1993 A
5241266 Ahmad et al. Aug 1993 A
5252807 Chizinsky Oct 1993 A
5257233 Schaefer Oct 1993 A
5278796 Tillinghast et al. Jan 1994 A
5282177 McLaury Jan 1994 A
5332922 Oguchi et al. Jul 1994 A
5347428 Carson et al. Sep 1994 A
5369749 Baker et al. Nov 1994 A
5384745 Konishi et al. Jan 1995 A
5388265 Volk Feb 1995 A
5390334 Harrison Feb 1995 A
5392251 Manning Feb 1995 A
5408190 Wood et al. Apr 1995 A
5453434 Albaugh et al. Sep 1995 A
5467455 Gay et al. Nov 1995 A
5498886 Hsu et al. Mar 1996 A
5502333 Bertin et al. Mar 1996 A
5513135 Dell et al. Apr 1996 A
5513339 Agrawal et al. Apr 1996 A
5519832 Warchol May 1996 A
5526320 Zagar et al. Jun 1996 A
5530836 Busch et al. Jun 1996 A
5550781 Sugawara et al. Aug 1996 A
5559990 Cheng et al. Sep 1996 A
5563086 Bertin et al. Oct 1996 A
5566344 Hall et al. Oct 1996 A
5581779 Hall et al. Dec 1996 A
5590071 Kolor et al. Dec 1996 A
5598376 Merritt et al. Jan 1997 A
5604714 Manning et al. Feb 1997 A
5606710 Hall et al. Feb 1997 A
5608262 Degani et al. Mar 1997 A
5610864 Manning Mar 1997 A
5623686 Hall et al. Apr 1997 A
5627791 Wright et al. May 1997 A
5640337 Huang et al. Jun 1997 A
5640364 Merritt et al. Jun 1997 A
5652724 Manning Jul 1997 A
5654204 Anderson Aug 1997 A
5661677 Rondeau et al. Aug 1997 A
5661695 Zagar et al. Aug 1997 A
5668773 Zagar et al. Sep 1997 A
5675549 Ong et al. Oct 1997 A
5682354 Manning Oct 1997 A
5692121 Bozso et al. Nov 1997 A
5692202 Kardach et al. Nov 1997 A
5696732 Zagar et al. Dec 1997 A
5701313 Purdham Dec 1997 A
5702984 Bertin et al. Dec 1997 A
5703813 Manning et al. Dec 1997 A
5706247 Merritt et al. Jan 1998 A
RE35733 Hernandez et al. Feb 1998 E
5717654 Manning Feb 1998 A
5721859 Manning Feb 1998 A
5724288 Cloud et al. Mar 1998 A
5729503 Manning Mar 1998 A
5729504 Cowles Mar 1998 A
5742792 Yanai et al. Apr 1998 A
5748914 Barth et al. May 1998 A
5752045 Chen May 1998 A
5757703 Merritt et al. May 1998 A
5760478 Bozso et al. Jun 1998 A
5761703 Bolyn Jun 1998 A
5781766 Davis Jul 1998 A
5787457 Miller et al. Jul 1998 A
5798961 Heyden et al. Aug 1998 A
5802010 Zagar et al. Sep 1998 A
5802555 Shigeeda Sep 1998 A
5812488 Zagar et al. Sep 1998 A
5819065 Chilton et al. Oct 1998 A
5831833 Shirakawa et al. Nov 1998 A
5831931 Manning Nov 1998 A
5831932 Merritt et al. Nov 1998 A
5834838 Anderson Nov 1998 A
5835435 Bogin et al. Nov 1998 A
5838165 Chatter Nov 1998 A
5838177 Keeth Nov 1998 A
5841580 Farmwald et al. Nov 1998 A
5843799 Hsu et al. Dec 1998 A
5843807 Burns Dec 1998 A
5845108 Yoo et al. Dec 1998 A
5850368 Ong et al. Dec 1998 A
5859792 Rondeau et al. Jan 1999 A
5860106 Domen et al. Jan 1999 A
5870347 Keeth et al. Feb 1999 A
5870350 Bertin et al. Feb 1999 A
5872907 Griess et al. Feb 1999 A
5875142 Chevallier Feb 1999 A
5878279 Athenes Mar 1999 A
5884088 Kardach et al. Mar 1999 A
5901105 Ong et al. May 1999 A
5903500 Tsang et al. May 1999 A
5905688 Park May 1999 A
5907512 Parkinson et al. May 1999 A
5910010 Nishizawa et al. Jun 1999 A
5915105 Farmwald et al. Jun 1999 A
5915167 Leedy Jun 1999 A
5917758 Keeth Jun 1999 A
5923611 Ryan Jul 1999 A
5926435 Park et al. Jul 1999 A
5929650 Pappert et al. Jul 1999 A
5946265 Cowles Aug 1999 A
5949254 Keeth Sep 1999 A
5953263 Farmwald et al. Sep 1999 A
5954804 Farmwald et al. Sep 1999 A
5962435 Mao et al. Oct 1999 A
5963429 Chen Oct 1999 A
5963463 Rondeau et al. Oct 1999 A
5963504 Manning Oct 1999 A
5966724 Ryan Oct 1999 A
5966727 Nishino Oct 1999 A
5969996 Muranaka et al. Oct 1999 A
5973392 Senba et al. Oct 1999 A
5978304 Crafts Nov 1999 A
5995424 Lawrence et al. Nov 1999 A
5995443 Farmwald et al. Nov 1999 A
6001671 Fjelstad Dec 1999 A
6002613 Cloud et al. Dec 1999 A
6002627 Chevallier Dec 1999 A
6014339 Kobayashi et al. Jan 2000 A
6016282 Keeth Jan 2000 A
6026050 Baker et al. Feb 2000 A
6029250 Keeth Feb 2000 A
6032214 Farmwald et al. Feb 2000 A
6032215 Farmwald et al. Feb 2000 A
6034916 Lee Mar 2000 A
6034918 Farmwald et al. Mar 2000 A
6035365 Farmwald et al. Mar 2000 A
6038195 Farmwald et al. Mar 2000 A
6038673 Benn et al. Mar 2000 A
6044032 Li Mar 2000 A
6047073 Norris et al. Apr 2000 A
6047344 Kawasumi et al. Apr 2000 A
6053948 Vaidyanathan et al. Apr 2000 A
6065092 Roy May 2000 A
6069504 Keeth May 2000 A
6073223 McAllister et al. Jun 2000 A
6075730 Barth et al. Jun 2000 A
6075744 Tsern et al. Jun 2000 A
6078546 Lee Jun 2000 A
6079025 Fung Jun 2000 A
6084434 Keeth Jul 2000 A
6088290 Ohtake et al. Jul 2000 A
6091251 Wood et al. Jul 2000 A
RE36839 Simmons et al. Aug 2000 E
6101152 Farmwald et al. Aug 2000 A
6101564 Athenes et al. Aug 2000 A
6101612 Jeddeloh Aug 2000 A
6108795 Jeddeloh Aug 2000 A
6111812 Gans et al. Aug 2000 A
6134638 Olarig et al. Oct 2000 A
6166991 Phelan Dec 2000 A
6181640 Kang Jan 2001 B1
6182184 Farmwald et al. Jan 2001 B1
6208168 Rhee Mar 2001 B1
6216246 Shau Apr 2001 B1
6226709 Goodwin et al. May 2001 B1
6226730 Murdoch et al. May 2001 B1
6240048 Matsubara May 2001 B1
6243282 Rondeau et al. Jun 2001 B1
6253278 Ryan Jun 2001 B1
6260097 Farmwald et al. Jul 2001 B1
6260154 Jeddeloh Jul 2001 B1
6262938 Lee et al. Jul 2001 B1
6266285 Farmwald et al. Jul 2001 B1
6266292 Tsern et al. Jul 2001 B1
6274395 Weber Aug 2001 B1
6279069 Robinson et al. Aug 2001 B1
6295572 Wu Sep 2001 B1
6298426 Ajanovic Oct 2001 B1
6304511 Gans et al. Oct 2001 B1
6307769 Nuxoll et al. Oct 2001 B1
6314051 Farmwald et al. Nov 2001 B1
6317352 Halbert et al. Nov 2001 B1
6317381 Gans et al. Nov 2001 B1
6324120 Farmwald et al. Nov 2001 B2
6326810 Keeth Dec 2001 B1
6327664 Dell et al. Dec 2001 B1
6330683 Jeddeloh Dec 2001 B1
6336174 Li et al. Jan 2002 B1
6338108 Motomura Jan 2002 B1
6338113 Kubo et al. Jan 2002 B1
6341347 Joy et al. Jan 2002 B1
6343019 Jiang et al. Jan 2002 B1
6343042 Tsern et al. Jan 2002 B1
6353561 Funyu et al. Mar 2002 B1
6356105 Volk Mar 2002 B1
6356500 Cloud et al. Mar 2002 B1
6362656 Rhee Mar 2002 B2
6363031 Phelan Mar 2002 B2
6378020 Farmwald et al. Apr 2002 B2
6381188 Choi et al. Apr 2002 B1
6381668 Lunteren Apr 2002 B1
6414868 Wong et al. Jul 2002 B1
6421754 Kau et al. Jul 2002 B1
6424532 Kawamura Jul 2002 B2
6426916 Farmwald et al. Jul 2002 B2
6429029 Eldridge et al. Aug 2002 B1
6430103 Nakayama et al. Aug 2002 B2
6434660 Lambert et al. Aug 2002 B1
6437600 Keeth Aug 2002 B1
6438057 Ruckerbauer Aug 2002 B1
6442698 Nizar Aug 2002 B2
6445591 Kwong Sep 2002 B1
6452863 Farmwald et al. Sep 2002 B2
6453400 Maesako et al. Sep 2002 B1
6453402 Jeddeloh Sep 2002 B1
6453434 Delp et al. Sep 2002 B2
6455348 Yamaguchi Sep 2002 B1
6457095 Volk Sep 2002 B1
6459651 Lee et al. Oct 2002 B1
6473831 Schade Oct 2002 B1
6476476 Glenn Nov 2002 B1
6480929 Gauthier et al. Nov 2002 B1
6489669 Shimada et al. Dec 2002 B2
6490161 Johnson Dec 2002 B1
6492726 Quek et al. Dec 2002 B1
6493789 Ware et al. Dec 2002 B2
6496440 Manning Dec 2002 B2
6496897 Ware et al. Dec 2002 B2
6498766 Lee et al. Dec 2002 B2
6510097 Fukuyama Jan 2003 B2
6510503 Gillingham et al. Jan 2003 B2
6512392 Fleury et al. Jan 2003 B2
6521984 Matsuura Feb 2003 B2
6526471 Shimomura et al. Feb 2003 B1
6526484 Stacovsky et al. Feb 2003 B1
6546446 Farmwald et al. Apr 2003 B2
6553450 Dodd et al. Apr 2003 B1
6560158 Choi et al. May 2003 B2
6563337 Dour May 2003 B2
6563759 Yahata et al. May 2003 B2
6564281 Farmwald et al. May 2003 B2
6564285 Mills et al. May 2003 B1
6574150 Suyama et al. Jun 2003 B2
6584037 Farmwald et al. Jun 2003 B2
6587912 Leddige et al. Jul 2003 B2
6590822 Hwang et al. Jul 2003 B2
6594770 Sato et al. Jul 2003 B1
6597616 Tsern et al. Jul 2003 B2
6614700 Dietrich et al. Sep 2003 B2
6618267 Dalal et al. Sep 2003 B1
6618791 Dodd et al. Sep 2003 B1
6621760 Ahmad et al. Sep 2003 B1
6628538 Funaba et al. Sep 2003 B2
6630729 Huang Oct 2003 B2
6631086 Bill et al. Oct 2003 B1
6650588 Yamagata Nov 2003 B2
6650594 Lee et al. Nov 2003 B1
6657634 Sinclair et al. Dec 2003 B1
6657918 Foss et al. Dec 2003 B2
6657919 Foss et al. Dec 2003 B2
6658016 Dai et al. Dec 2003 B1
6658530 Robertson et al. Dec 2003 B1
6659512 Harper et al. Dec 2003 B1
6664625 Hiruma Dec 2003 B2
6665224 Lehmann et al. Dec 2003 B1
6665227 Fetzer Dec 2003 B2
6668242 Reynov et al. Dec 2003 B1
6674154 Minamio et al. Jan 2004 B2
6683372 Wong et al. Jan 2004 B1
6684292 Piccirillo et al. Jan 2004 B2
6690191 Wu et al. Feb 2004 B2
6697295 Farmwald et al. Feb 2004 B2
6701446 Tsern et al. Mar 2004 B2
6705877 Li et al. Mar 2004 B1
6708144 Merryman et al. Mar 2004 B1
6710430 Minamio et al. Mar 2004 B2
6711043 Friedman et al. Mar 2004 B2
6713856 Tsai et al. Mar 2004 B2
6714891 Dendinger Mar 2004 B2
6724684 Kim Apr 2004 B2
6730540 Siniaguine May 2004 B2
6731009 Jones et al. May 2004 B1
6731527 Brown May 2004 B2
6742098 Halbert et al. May 2004 B1
6744687 Koo et al. Jun 2004 B2
6747887 Halbert et al. Jun 2004 B2
6751696 Farmwald et al. Jun 2004 B2
6754129 Khateri et al. Jun 2004 B2
6754132 Kyung Jun 2004 B2
6762948 Kyun et al. Jul 2004 B2
6766469 Larson et al. Jul 2004 B2
6779097 Gillingham et al. Aug 2004 B2
6785767 Coulson Aug 2004 B2
6791877 Miura et al. Sep 2004 B2
6795899 Dodd et al. Sep 2004 B2
6799241 Kahn et al. Sep 2004 B2
6801989 Johnson et al. Oct 2004 B2
6807598 Farmwald et al. Oct 2004 B2
6807650 Lamb et al. Oct 2004 B2
6807655 Rehani et al. Oct 2004 B1
6816991 Sanghani Nov 2004 B2
6819602 Seo et al. Nov 2004 B2
6819617 Hwang et al. Nov 2004 B2
6820163 McCall et al. Nov 2004 B1
6820169 Wilcox et al. Nov 2004 B2
6826104 Kawaguchi et al. Nov 2004 B2
6839290 Ahmad et al. Jan 2005 B2
6844754 Yamagata Jan 2005 B2
6845027 Mayer et al. Jan 2005 B2
6845055 Koga et al. Jan 2005 B1
6847582 Pan Jan 2005 B2
6850449 Takahashi Feb 2005 B2
6854043 Hargis et al. Feb 2005 B2
6862249 Kyung Mar 2005 B2
6862653 Dodd et al. Mar 2005 B1
6878570 Lyu et al. Apr 2005 B2
6894933 Kuzmenka et al. May 2005 B2
6898683 Nakamura May 2005 B2
6908314 Brown Jun 2005 B2
6912778 Ahn et al. Jul 2005 B2
6914786 Paulsen et al. Jul 2005 B1
6917219 New Jul 2005 B2
6922371 Takahashi et al. Jul 2005 B2
6938119 Kohn et al. Aug 2005 B2
6943450 Fee et al. Sep 2005 B2
6944748 Sanches et al. Sep 2005 B2
6947341 Stubbs et al. Sep 2005 B2
6951982 Chye et al. Oct 2005 B2
6952794 Lu Oct 2005 B2
6961281 Wong et al. Nov 2005 B2
6968416 Moy Nov 2005 B2
6968419 Holman Nov 2005 B1
6970968 Holman Nov 2005 B1
6980021 Srivastava et al. Dec 2005 B1
6986118 Dickman Jan 2006 B2
6992950 Foss et al. Jan 2006 B2
7000062 Perego et al. Feb 2006 B2
7003618 Perego et al. Feb 2006 B2
7003639 Tsern et al. Feb 2006 B2
7007095 Chen et al. Feb 2006 B2
7007175 Chang et al. Feb 2006 B2
7010642 Perego et al. Mar 2006 B2
7010736 Teh et al. Mar 2006 B1
7024518 Halbert et al. Apr 2006 B2
7026708 Cady et al. Apr 2006 B2
7028215 Depew et al. Apr 2006 B2
7028234 Huckaby et al. Apr 2006 B2
7035150 Streif et al. Apr 2006 B2
7043599 Ware et al. May 2006 B1
7043611 McClannahan et al. May 2006 B2
7045396 Crowley et al. May 2006 B2
7045901 Lin et al. May 2006 B2
7053470 Sellers et al. May 2006 B1
7053478 Roper et al. May 2006 B2
7058776 Lee Jun 2006 B2
7058863 Kouchi et al. Jun 2006 B2
7061823 Faue et al. Jun 2006 B2
7066741 Burns et al. Jun 2006 B2
7075175 Kazi et al. Jul 2006 B2
7079396 Gates et al. Jul 2006 B2
7079441 Partsch et al. Jul 2006 B1
7079446 Murtagh et al. Jul 2006 B2
7085152 Ellis et al. Aug 2006 B2
7085941 Li Aug 2006 B2
7089438 Raad Aug 2006 B2
7093101 Aasheim et al. Aug 2006 B2
7103730 Saxena et al. Sep 2006 B2
7119428 Tanie et al. Oct 2006 B2
7120727 Lee et al. Oct 2006 B2
7126399 Lee Oct 2006 B1
7127567 Ramakrishnan et al. Oct 2006 B2
7133960 Thompson et al. Nov 2006 B1
7136978 Miura et al. Nov 2006 B2
7138823 Janzen et al. Nov 2006 B2
7149145 Kim et al. Dec 2006 B2
7149824 Johnson Dec 2006 B2
7173863 Conley et al. Feb 2007 B2
7200021 Raghuram Apr 2007 B2
7205789 Karabatsos Apr 2007 B1
7210059 Jeddeloh Apr 2007 B2
7215561 Park et al. May 2007 B2
7218566 Totolos, Jr. et al. May 2007 B1
7224595 Dreps et al. May 2007 B2
7228264 Barrenscheen et al. Jun 2007 B2
7231562 Ohlhoff et al. Jun 2007 B2
7233541 Yamamoto et al. Jun 2007 B2
7234081 Nguyen et al. Jun 2007 B2
7243185 See et al. Jul 2007 B2
7245541 Janzen Jul 2007 B2
7254036 Pauley et al. Aug 2007 B2
7266639 Raghuram Sep 2007 B2
7269042 Kinsley et al. Sep 2007 B2
7269708 Ware Sep 2007 B2
7274583 Park et al. Sep 2007 B2
7277333 Schaefer Oct 2007 B2
7286436 Bhakta et al. Oct 2007 B2
7289386 Bhakta et al. Oct 2007 B2
7296754 Nishizawa et al. Nov 2007 B2
7299330 Gillingham et al. Nov 2007 B2
7302598 Suzuki et al. Nov 2007 B2
7307863 Yen et al. Dec 2007 B2
7317250 Koh et al. Jan 2008 B2
7327613 Lee Feb 2008 B2
7337293 Brittain et al. Feb 2008 B2
7363422 Perego et al. Apr 2008 B2
7366947 Gower et al. Apr 2008 B2
7379316 Rajan May 2008 B2
7386656 Rajan et al. Jun 2008 B2
7392338 Rajan et al. Jun 2008 B2
7408393 Jain et al. Aug 2008 B1
7409492 Tanaka et al. Aug 2008 B2
7414917 Ruckerbauer et al. Aug 2008 B2
7428644 Jeddeloh et al. Sep 2008 B2
7437579 Jeddeloh et al. Oct 2008 B2
7457122 Lai et al. Nov 2008 B2
7464225 Tsern Dec 2008 B2
7472220 Rajan et al. Dec 2008 B2
7474576 Co et al. Jan 2009 B2
7480147 Hoss et al. Jan 2009 B2
7480774 Ellis et al. Jan 2009 B2
7496777 Kapil Feb 2009 B2
7515453 Rajan Apr 2009 B2
7532537 Solomon et al. May 2009 B2
7539800 Dell et al. May 2009 B2
7573136 Jiang et al. Aug 2009 B2
7580312 Rajan et al. Aug 2009 B2
7581121 Barth et al. Aug 2009 B2
7581127 Rajan et al. Aug 2009 B2
7590796 Rajan et al. Sep 2009 B2
7599205 Rajan Oct 2009 B2
7606245 Ma et al. Oct 2009 B2
7609567 Rajan et al. Oct 2009 B2
7613880 Miura et al. Nov 2009 B2
7619912 Bhakta et al. Nov 2009 B2
7724589 Rajan et al. May 2010 B2
7730338 Rajan et al. Jun 2010 B2
7761724 Rajan et al. Jul 2010 B2
7934070 Brittain et al. Apr 2011 B2
7990797 Moshayedi et al. Aug 2011 B2
8116144 Shaw et al. Feb 2012 B2
20010000822 Dell et al. May 2001 A1
20010003198 Wu Jun 2001 A1
20010011322 Stolt et al. Aug 2001 A1
20010019509 Aho et al. Sep 2001 A1
20010021106 Weber et al. Sep 2001 A1
20010046129 Broglia et al. Nov 2001 A1
20010046163 Yaganawa Nov 2001 A1
20010052062 Lipovski Dec 2001 A1
20020002662 Olarig et al. Jan 2002 A1
20020004897 Kao et al. Jan 2002 A1
20020015340 Batinovich Feb 2002 A1
20020019961 Blodgett Feb 2002 A1
20020034068 Weber et al. Mar 2002 A1
20020038405 Leddige et al. Mar 2002 A1
20020040416 Tsern et al. Apr 2002 A1
20020041507 Woo et al. Apr 2002 A1
20020051398 Mizugaki May 2002 A1
20020060945 Ikeda May 2002 A1
20020060948 Chang et al. May 2002 A1
20020064073 Chien May 2002 A1
20020064083 Ryu et al. May 2002 A1
20020089831 Forthun Jul 2002 A1
20020089970 Asada et al. Jul 2002 A1
20020094671 Distefano et al. Jul 2002 A1
20020121650 Minamio et al. Sep 2002 A1
20020121670 Minamio et al. Sep 2002 A1
20020124195 Nizar Sep 2002 A1
20020129204 Leighnor et al. Sep 2002 A1
20020145900 Schaefer Oct 2002 A1
20020165706 Raynham Nov 2002 A1
20020167092 Fee et al. Nov 2002 A1
20020172024 Hui et al. Nov 2002 A1
20020174274 Wu et al. Nov 2002 A1
20020184438 Usui Dec 2002 A1
20030002262 Benisek et al. Jan 2003 A1
20030011993 Summers et al. Jan 2003 A1
20030016550 Yoo et al. Jan 2003 A1
20030021175 Tae Kwak Jan 2003 A1
20030026155 Yamagata Feb 2003 A1
20030026159 Frankowsky et al. Feb 2003 A1
20030035312 Halbert et al. Feb 2003 A1
20030041295 Hou et al. Feb 2003 A1
20030061458 Wilcox et al. Mar 2003 A1
20030083855 Fukuyama May 2003 A1
20030088743 Rader May 2003 A1
20030093614 Kohn et al. May 2003 A1
20030101392 Lee May 2003 A1
20030105932 David et al. Jun 2003 A1
20030117875 Lee et al. Jun 2003 A1
20030123389 Russell et al. Jul 2003 A1
20030126338 Dodd et al. Jul 2003 A1
20030127737 Takahashi Jul 2003 A1
20030131160 Hampel et al. Jul 2003 A1
20030145163 Seo et al. Jul 2003 A1
20030158995 Lee et al. Aug 2003 A1
20030164539 Yau Sep 2003 A1
20030164543 Kheng Lee Sep 2003 A1
20030182513 Dodd et al. Sep 2003 A1
20030183934 Barrett Oct 2003 A1
20030189868 Riesenman et al. Oct 2003 A1
20030189870 Wilcox Oct 2003 A1
20030191888 Klein Oct 2003 A1
20030191915 Saxena et al. Oct 2003 A1
20030200382 Wells et al. Oct 2003 A1
20030200474 Li Oct 2003 A1
20030205802 Segaram et al. Nov 2003 A1
20030223290 Park et al. Dec 2003 A1
20030227798 Pax Dec 2003 A1
20030229821 Ma Dec 2003 A1
20030230801 Jiang et al. Dec 2003 A1
20030231542 Zaharinova-Papazova et al. Dec 2003 A1
20030234664 Yamagata Dec 2003 A1
20040016994 Huang Jan 2004 A1
20040034732 Valin et al. Feb 2004 A1
20040034755 LaBerge et al. Feb 2004 A1
20040037133 Park et al. Feb 2004 A1
20040042503 Shaeffer et al. Mar 2004 A1
20040044808 Salmon et al. Mar 2004 A1
20040047228 Chen Mar 2004 A1
20040049624 Salmonsen Mar 2004 A1
20040064647 DeWhitt et al. Apr 2004 A1
20040064767 Huckaby et al. Apr 2004 A1
20040083324 Rabinovitz et al. Apr 2004 A1
20040088475 Streif et al. May 2004 A1
20040100837 Lee May 2004 A1
20040117723 Foss Jun 2004 A1
20040123173 Emberling et al. Jun 2004 A1
20040125635 Kuzmenka Jul 2004 A1
20040133736 Kyung Jul 2004 A1
20040139359 Samson et al. Jul 2004 A1
20040145963 Byon Jul 2004 A1
20040174765 Seo et al. Sep 2004 A1
20040177079 Gluhovsky et al. Sep 2004 A1
20040184324 Pax Sep 2004 A1
20040186956 Perego et al. Sep 2004 A1
20040188704 Halbert et al. Sep 2004 A1
20040195682 Kimura Oct 2004 A1
20040196732 Lee Oct 2004 A1
20040205433 Gower et al. Oct 2004 A1
20040208173 Di Gregorio Oct 2004 A1
20040225858 Brueggen Nov 2004 A1
20040228166 Braun et al. Nov 2004 A1
20040228196 Kwak et al. Nov 2004 A1
20040228203 Koo Nov 2004 A1
20040230932 Dickmann Nov 2004 A1
20040236877 Burton Nov 2004 A1
20040250989 Im et al. Dec 2004 A1
20040256638 Perego et al. Dec 2004 A1
20040260957 Jeddeloh et al. Dec 2004 A1
20040264255 Royer Dec 2004 A1
20040268161 Ross Dec 2004 A1
20050018495 Bhakta et al. Jan 2005 A1
20050021874 Georgiou et al. Jan 2005 A1
20050027928 Avraham et al. Feb 2005 A1
20050028038 Pomaranski et al. Feb 2005 A1
20050034004 Bunker et al. Feb 2005 A1
20050044302 Pauley et al. Feb 2005 A1
20050044303 Perego et al. Feb 2005 A1
20050044305 Jakobs et al. Feb 2005 A1
20050047192 Matsui et al. Mar 2005 A1
20050071543 Ellis et al. Mar 2005 A1
20050078532 Ruckerbauer et al. Apr 2005 A1
20050081085 Ellis et al. Apr 2005 A1
20050086548 Haid et al. Apr 2005 A1
20050102590 Norris et al. May 2005 A1
20050108460 David May 2005 A1
20050127531 Tay et al. Jun 2005 A1
20050132158 Hampel et al. Jun 2005 A1
20050135176 Ramakrishnan et al. Jun 2005 A1
20050138267 Bains et al. Jun 2005 A1
20050138304 Ramakrishnan et al. Jun 2005 A1
20050139977 Nishio et al. Jun 2005 A1
20050141199 Chiou et al. Jun 2005 A1
20050149662 Perego et al. Jul 2005 A1
20050152212 Yang et al. Jul 2005 A1
20050156934 Perego et al. Jul 2005 A1
20050166026 Ware et al. Jul 2005 A1
20050193163 Perego et al. Sep 2005 A1
20050193183 Barth et al. Sep 2005 A1
20050194676 Fukuda et al. Sep 2005 A1
20050194991 Dour et al. Sep 2005 A1
20050195629 Leddige et al. Sep 2005 A1
20050201063 Lee et al. Sep 2005 A1
20050204111 Natarajan Sep 2005 A1
20050210196 Perego et al. Sep 2005 A1
20050223179 Perego et al. Oct 2005 A1
20050232049 Park Oct 2005 A1
20050235119 Sechrest et al. Oct 2005 A1
20050235131 Ware Oct 2005 A1
20050237838 Kwak et al. Oct 2005 A1
20050243635 Schaefer Nov 2005 A1
20050246558 Ku Nov 2005 A1
20050259504 Murtugh et al. Nov 2005 A1
20050263312 Bolken et al. Dec 2005 A1
20050265506 Foss et al. Dec 2005 A1
20050269715 Yoo Dec 2005 A1
20050278474 Perersen et al. Dec 2005 A1
20050281096 Bhakta et al. Dec 2005 A1
20050281123 Bell et al. Dec 2005 A1
20050285174 Saito et al. Dec 2005 A1
20050286334 Saito et al. Dec 2005 A1
20050289292 Morrow et al. Dec 2005 A1
20050289317 Liou et al. Dec 2005 A1
20060002201 Janzen Jan 2006 A1
20060010339 Klein Jan 2006 A1
20060026484 Hollums Feb 2006 A1
20060038597 Becker et al. Feb 2006 A1
20060039204 Cornelius Feb 2006 A1
20060039205 Cornelius Feb 2006 A1
20060041711 Miura et al. Feb 2006 A1
20060041730 Larson Feb 2006 A1
20060044909 Kinsley et al. Mar 2006 A1
20060049502 Goodwin et al. Mar 2006 A1
20060050574 Streif et al. Mar 2006 A1
20060056244 Ware Mar 2006 A1
20060085616 Zeighami et al. Apr 2006 A1
20060087900 Bucksch et al. Apr 2006 A1
20060090031 Kirshenbaum et al. Apr 2006 A1
20060090054 Choi et al. Apr 2006 A1
20060106951 Bains May 2006 A1
20060112214 Yeh May 2006 A1
20060112219 Chawla et al. May 2006 A1
20060117152 Amidi et al. Jun 2006 A1
20060117160 Jackson et al. Jun 2006 A1
20060118933 Haba Jun 2006 A1
20060129712 Raghuram Jun 2006 A1
20060129755 Raghuram Jun 2006 A1
20060136791 Nierle Jun 2006 A1
20060149982 Vogt Jul 2006 A1
20060176744 Stave Aug 2006 A1
20060179262 Brittain et al. Aug 2006 A1
20060179333 Brittain et al. Aug 2006 A1
20060179334 Brittain et al. Aug 2006 A1
20060180926 Mullen et al. Aug 2006 A1
20060181953 Rotenberg et al. Aug 2006 A1
20060195631 Rajamani Aug 2006 A1
20060206738 Jeddeloh et al. Sep 2006 A1
20060236165 Cepulis et al. Oct 2006 A1
20060236201 Gower et al. Oct 2006 A1
20060248387 Nicholson et al. Nov 2006 A1
20060262586 Solomon et al. Nov 2006 A1
20060262587 Matsui et al. Nov 2006 A1
20060277355 Ellsberry et al. Dec 2006 A1
20060294295 Fukuzo Dec 2006 A1
20070005998 Jain et al. Jan 2007 A1
20070050530 Rajan Mar 2007 A1
20070058471 Rajan et al. Mar 2007 A1
20070088995 Tsern et al. Apr 2007 A1
20070091696 Niggemeier et al. Apr 2007 A1
20070106860 Foster, Sr. et al. May 2007 A1
20070136537 Doblar et al. Jun 2007 A1
20070162700 Fortin et al. Jul 2007 A1
20070188997 Hockanson et al. Aug 2007 A1
20070192563 Rajan et al. Aug 2007 A1
20070195613 Rajan et al. Aug 2007 A1
20070204075 Rajan et al. Aug 2007 A1
20070216445 Raghavan et al. Sep 2007 A1
20070247194 Jain Oct 2007 A1
20070279084 Oh et al. Dec 2007 A1
20070288683 Panabaker et al. Dec 2007 A1
20070288686 Arcedera et al. Dec 2007 A1
20070288687 Panabaker et al. Dec 2007 A1
20080002447 Gulachenski et al. Jan 2008 A1
20080010435 Smith et al. Jan 2008 A1
20080025108 Rajan et al. Jan 2008 A1
20080025122 Schakel et al. Jan 2008 A1
20080025136 Rajan et al. Jan 2008 A1
20080025137 Rajan et al. Jan 2008 A1
20080027697 Rajan et al. Jan 2008 A1
20080027702 Rajan et al. Jan 2008 A1
20080027703 Rajan et al. Jan 2008 A1
20080028135 Rajan et al. Jan 2008 A1
20080028136 Schakel et al. Jan 2008 A1
20080028137 Schakel et al. Jan 2008 A1
20080031030 Rajan et al. Feb 2008 A1
20080031072 Rajan et al. Feb 2008 A1
20080037353 Rajan et al. Feb 2008 A1
20080056014 Rajan et al. Mar 2008 A1
20080062773 Rajan et al. Mar 2008 A1
20080065820 Gillingham et al. Mar 2008 A1
20080082763 Rajan et al. Apr 2008 A1
20080086588 Danilak et al. Apr 2008 A1
20080089034 Hoss et al. Apr 2008 A1
20080098277 Hazelzet Apr 2008 A1
20080103753 Rajan et al. May 2008 A1
20080104314 Rajan et al. May 2008 A1
20080109206 Rajan et al. May 2008 A1
20080109595 Rajan et al. May 2008 A1
20080109597 Schakel et al. May 2008 A1
20080109598 Schakel et al. May 2008 A1
20080115006 Smith et al. May 2008 A1
20080120443 Rajan et al. May 2008 A1
20080120458 Gillingham et al. May 2008 A1
20080123459 Rajan et al. May 2008 A1
20080126624 Prete et al. May 2008 A1
20080126687 Rajan et al. May 2008 A1
20080126688 Rajan et al. May 2008 A1
20080126689 Rajan et al. May 2008 A1
20080126690 Rajan et al. May 2008 A1
20080126692 Rajan et al. May 2008 A1
20080130364 Guterman et al. Jun 2008 A1
20080133825 Rajan et al. Jun 2008 A1
20080155136 Hishino Jun 2008 A1
20080159027 Kim Jul 2008 A1
20080170425 Rajan Jul 2008 A1
20080195894 Schreck et al. Aug 2008 A1
20080215832 Allen et al. Sep 2008 A1
20080239857 Rajan et al. Oct 2008 A1
20080239858 Rajan et al. Oct 2008 A1
20080256282 Guo et al. Oct 2008 A1
20080282084 Hatakeyama Nov 2008 A1
20080282341 Hatakeyama Nov 2008 A1
20090024789 Rajan et al. Jan 2009 A1
20090024790 Rajan et al. Jan 2009 A1
20090049266 Kuhne Feb 2009 A1
20090063865 Berenbaum et al. Mar 2009 A1
20090063896 Lastras-Montano et al. Mar 2009 A1
20090070520 Mizushima Mar 2009 A1
20090089480 Wah et al. Apr 2009 A1
20090109613 Legen et al. Apr 2009 A1
20090216939 Smith et al. Aug 2009 A1
20090285031 Rajan et al. Nov 2009 A1
20090290442 Rajan Nov 2009 A1
20100005218 Gower et al. Jan 2010 A1
20100020585 Rajan Jan 2010 A1
20100257304 Rajan et al. Oct 2010 A1
20100271888 Rajan Oct 2010 A1
20100281280 Rajan et al. Nov 2010 A1
Foreign Referenced Citations (35)
Number Date Country
102004051345 May 2006 DE
102004053316 May 2006 DE
102005036528 Feb 2007 DE
0644547 Mar 1995 EP
62121978 Jun 1987 JP
01171047 Jul 1989 JP
03-029357 Feb 1991 JP
03029357 Feb 1991 JP
03276487 Dec 1991 JP
03286234 Dec 1991 JP
05-298192 Nov 1993 JP
07-141870 Jun 1995 JP
08077097 Mar 1996 JP
08077097 Mar 1996 JP
11-149775 Jun 1999 JP
2002025255 Jan 2002 JP
3304893 May 2002 JP
04-327474 Nov 2004 JP
2006236388 Sep 2006 JP
1020040062717 Jul 2004 KR
2005120344 Dec 2005 KR
WO 9505676 Feb 1995 WO
07-141870 Jun 1995 WO
WO9900734 Jan 1999 WO
WO0045270 Aug 2000 WO
WO0190900 Nov 2001 WO
WO0197160 Dec 2001 WO
WO2004044754 May 2004 WO
WO2004051645 Jun 2004 WO
WO2006072040 Jul 2006 WO
WO2007002324 Jan 2007 WO
WO2007028109 Mar 2007 WO
WO 2007038225 Apr 2007 WO
WO2007095080 Aug 2007 WO
WO2008063251 May 2008 WO
Non-Patent Literature Citations (261)
Entry
Office Action from U.S. Appl. No. 11/461,427 mailed on Sep. 5, 2008.
Final Office Action from U.S. Appl. No. 11/461,430 mailed on Sep. 8, 2008.
Notice of Allowance from U.S. Appl. No. 11/474,075 mailed on Nov. 26, 2008.
Office Action from U.S. Appl. No. 11/474,076 mailed on Nov. 3, 2008.
Office Action from U.S. Appl. No. 11/524,811 mailed on Sep. 17, 2008.
Kellerbauer “Die Schnelle Million,” with translation, “The quick million.”
Wu et al., “eNVy: A Non-Volatile, Main Memory Storage System,” to appear in ASPLOS VI.
“Using Two Chip Selects to Enable Quad Rank,” IP.com PriorArtDatabase, copyright IP.com, Inc. 2004.
“BIOS and Kernel Developer's Guide (BKDG) for AMD Family 10h Processors,” AMD, 31116 Rev 3.00, Sep. 7, 2007.
Skerlj et al., “Buffer Device for Memory Modules (DIMM)” Qimonda 2006, p. 1.
Written Opinion from PCT Application No. PCT/US06/24360 mailed on Jan. 8, 2007.
Preliminary Report on Patentability from PCT Application No. PCT/US06/24360 mailed on Jan. 10, 2008.
Written Opinion from International PCT Application No. PCT/US06/34390 mailed on Nov. 21, 2007.
International Search Report from PCT Application No. PCT/US06/34390 mailed on Nov. 21, 2007.
Search Report From PCT Application No. PCT/US10/038041 Dated Aug. 23, 2010.
Non-Final Office Action from U.S. Appl. No. 11/461,437 Dated Jan. 4, 2011.
Notice of Allowance from U.S. Appl. No. 11/515,223 Dated Feb. 4, 2011.
Non-Final Office Action from U.S. Appl. No. 11/553,372 Dated Jan. 5, 2011.
Final Office Action from U.S. Appl. No. 11/588,739 Dated Dec. 15, 2010.
Notice of Allowance from U.S. Appl. No. 11/762,010 Dated Feb. 18, 2011.
Final Office Action from U.S. Appl. No. 11/828,182 Dated Dec. 22, 2010.
Non-Final Office Action from U.S. Appl. No. 11/855,826 Dated Jan. 13, 2011.
Notice of Allowance from U.S. Appl. No. 11/939,432 Dated Feb. 18, 2011.
Notice of Allowance from U.S. Appl. No. 12/144,396 Dated Feb. 1, 2011.
Non-Final Office Action from U.S. Appl. No. 12/816,756 Dated Feb. 7, 2011.
Notice of Allowance from U.S. Appl. No. 11/762,013 Dated Feb. 23, 2011.
Notice of Allowance from U.S. Appl. No. 11/929,500 Dated Feb. 24, 2011.
Notice of Allowance from U.S. Appl. No. 11/763,365 Dated Mar. 1, 2011.
Final Office Action from U.S. Appl. No. 12/574,628 Dated Mar. 3, 2011.
Final Office Action from U.S. Appl. No. 11/929,571 Dated Mar. 3, 2011.
Notice of Allowance from U.S. Appl. No. 11/611,374 Dated Mar. 4, 2011.
Notice of Allowance from U.S. Appl. No. 11/553,399 Dated Mar. 18, 2011.
Final Office Action from U.S. Appl. No. 12/507,682 Dated Mar. 29, 2011.
Non-Final Office Action from U.S. Appl. No. 11/929,403 Dated Mar. 31, 2011.
Notice of Allowance from U.S. Appl. No. 12/838,896 Dated Apr. 19, 2011.
Notice of Allowance from U.S. Appl. No. 11/702,981 Dated Apr. 25, 2011.
Notice of Allowance from U.S. Appl. No. 11/929,320 Dated May 5, 2011.
Final Office Action from U.S. Appl. No. 11/939,440 Dated May 19, 2011.
Final Office Action from U.S. Appl. No. 11/855,805, Dated May 26, 2011.
Non-Final Office Action from U.S. Appl. No. 11/672,921 Dated May 27, 2011.
Non-Final Office Action from U.S. Appl. No. 11/461,420 Dated Jul. 23, 2009.
Notice of Allowance from U.S. Appl. No. 11/461,430 Dated Sep. 10, 2009.
Non-Final Office Action from U.S. Appl. No. 11/461,435 Dated Aug. 5, 2009.
Non-Final Office Action from U.S. Appl. No. 11/515,167 Dated Sep. 25, 2009.
Non-Final Office Action from U.S. Appl. No. 11/515,223 Dated Sep. 22, 2009.
Non-Final Office Action from U.S. Appl. No. 11/538,041 Dated Jun. 10, 2009.
Non-Final Office Action from U.S. Appl. No. 11/553,372 Dated Jun. 25, 2009.
Notice of Allowance from U.S. Appl. No. 11/553,372 Dated Sep. 30, 2009.
Non-Final Office Action from U.S. Appl. No. 11/553,390 Dated Sep. 9, 2009.
Non-Final Office Action from U.S. Appl. No. 11/553,399 Dated Jul. 7, 2009.
Notice of Allowance from U.S. Appl. No. 11/553,399 Dated Oct. 13, 2009.
Notice of Allowance from U.S. Appl. No. 11/611,374 Dated Sep. 15, 2009.
Non-Final Office Action from U.S. Appl. No. 11/702,960 Dated Sep. 25, 2009.
Non-Final Office Action from U.S. Appl. No. 11/702,981 Dated Aug. 19, 2009.
Non-Final Office Action from U.S. Appl. No. 11/762,013 Dated Jun. 5, 2009.
Non-Final Office Action from U.S. Appl. No. 11/763,365 Dated Oct. 28, 2009.
Non-Final Office Action from U.S. Appl. No. 11/858,518 Dated Aug. 14, 2009.
Non-Final Office Action from U.S. Appl. No. 11/929,500 Dated Oct. 13, 2009.
Notice of Allowance from U.S. Appl. No. 11/939,432 Dated Sep. 24, 2009.
Non-Final Office Action from U.S. Appl. No. 11/941,589 Dated Oct. 1, 2009.
Supplemental European Search Report and Search Opinion issued Sep. 21, 2009 in European Application No. 07870726.2, 8 pp.
Wu et al., “eNVy: A Non-Volatile, Main Memory Storage System”, ASPLOS-VI Proceedings, Oct. 4-7, 1994, pp. 86-97.
Buffer Device for Memory Modules (DIMM), IP.com Prior Art Database, <URL: http://ip.com/IPCOM/000144850>, Feb. 10, 2007, 1 pg.
German Office Action from German Patent Application No. 11 2006 002 300.4-55 Dated May 11, 2009 (With Translation).
International Preliminary Examination Report From PCT Application No. PCT/US07/016385 Dated Feb. 3, 2009.
Search Report and Written Opinion From PCT Application No. PCT/US07/03460 Dated on Feb. 14, 2008.
Notice of Allowance from U.S. Appl. No. 11/553,372 Dated Aug. 4, 2010.
Notice of Allowance from U.S. Appl. No. 11/553,399 Dated Dec. 3, 2010.
Notice of Allowance from U.S. Appl. No. 11/611,374 Dated Oct. 29, 2010.
Final Office Action from U.S. Appl. No. 11/672,924 Dated Sep. 7, 2010.
Non-Final Office Action from U.S. Appl. No. 11/702,981 Dated Mar. 11, 2009.
Notice of Allowance from U.S. Appl. No. 11/762,010 Dated Oct. 22, 2010.
Notice of Allowance from U.S. Appl. No. 11/762,013 Dated Aug. 17, 2010.
Notice of Allowance from U.S. Appl. No. 11/762,013 Dated Dec. 7, 2010.
Notice of Allowance from U.S. Appl. No. 11/763,365 Dated Oct. 20, 2010.
Non-Final Office Action from U.S. Appl. No. 11/855,805 Dated Sep. 21, 2010.
Non-Final Office Action from U.S. Appl. No. 11/858,518 Dated Sep. 8, 2010.
Final Office Action from U.S. Appl. No. 11/929,225 Dated Aug. 27, 2010.
Final Office Action from U.S. Appl. No. 11/929,261 Dated Sep. 7, 2010.
Final Office Action from U.S. Appl. No. 11/929,286 Dated Aug. 20, 2010.
Notice of Allowance from U.S. Appl. No. 11/929,320 Dated Sep. 29, 2010.
Final Office Action from U.S. Appl. No. 11/929,403 Dated Aug. 31, 2010.
Final Office Action from U.S. Appl. No. 11/929,417 Dated Aug. 31, 2010.
Final Office Action from U.S. Appl. No. 11/929,432 Dated Aug. 20, 2010.
Final Office Action from U.S. Appl. No. 11/929,450 Dated Aug. 20, 2010.
Final Office Action from U.S. Appl. No. 11/929,631 Dated Nov. 18, 2010.
Final Office Action from U.S. Appl. No. 11/929,655 Dated Nov. 22, 2010.
Non-Final Office Action from U.S. Appl. No. 11/939,440 Dated Sep. 17, 2010.
Notice of Allowance from U.S. Appl. No. 11/941,589 Dated Oct. 25, 2010.
Non-Final Office Action from U.S. Appl. No. 12/057,306 Dated Oct. 8, 2010.
Non-Final Office Action from U.S. Appl. No. 12/203,100 Dated Dec. 1, 2010.
Non-Final Office Action from U.S. Appl. No. 12/769,428 Dated Nov. 8, 2010.
Non-Final Office Action from U.S. Appl. No. 12/838,896 Dated Sep. 3, 2010.
Fang et al., W. Power Complexity Analysis of Adiabatic SRAM, 6th Int. Conference on ASIC, vol. 1, Oct. 2005, pp. 334-337.
Pavan et al., P. A Complete Model of E2PROM Memory Cells for Circuit Simulations, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 22, No. 8, Aug. 2003, pp. 1072-1079.
German Office Action From German Patent Application No. 11 2006 001 810.8-55 (With Translation).
Great Britain Office Action from GB Patent Application No. GB0800734.6 Mailed Mar. 1, 2010.
Final Office Action from U.S. Appl. No. 11/461,420 Mailed Apr. 28, 2010.
Notice of Allowance from U.S. Appl. No. 11/553,372 Mailed Mar. 12, 2010.
Notice of Allowance from U.S. Appl. No. 11/553,399 Mailed Mar. 22, 2010.
Non-Final Office Action from U.S. Appl. No. 11/588,739 Mailed Dec. 29, 2009.
Notice of Allowance from U.S. Appl. No. 11/611,374 Mailed Apr. 5, 2010.
Non-Final Office Action from U.S. Appl. No. 11/828,181 Mailed Mar. 2, 2010.
Non-Final Office Action from U.S. Appl. No. 11/828,182 Mailed Mar. 29, 2010.
Final Office Action from U.S. Appl. No. 11/858,518 Mailed Apr. 21, 2010.
Non-Final Office Action from U.S. Appl. No. 11/929,432 Mailed Jan. 14, 2010.
Non-Final Office Action from U.S. Appl. No. 11/929,571 Mailed Mar. 3, 2010.
Non-Final Office Action from U.S. Appl. No. 11/929,631 Mailed Mar. 3, 2010.
Non-Final Office Action from U.S. Appl. No. 11/929,636 Mailed Mar. 9, 2010.
Non-Final Office Action from U.S. Appl. No. 11/929,655 Mailed Mar. 3, 2010.
Notice of Allowance from U.S. Appl. No. 11/939,432 Mailed Dec. 1, 2009.
Non-Final Office Action from U.S. Appl. No. 11/939,432 Mailed Apr. 12, 2010.
Notice of Allowance from U.S. Appl. No. 12/111,819 Mailed Mar. 10, 2010.
Non-Final Office Action from U.S. Appl. No. 12/507,682 Mailed Mar. 8, 2010.
Great Britain Office Action from GB Patent Application No. GB0803913.3 Mailed Mar. 1, 2010.
Final Office Action from U.S. Appl. No. 11/461,435 Dated May 13, 2010.
Final Office Action from U.S. Appl. No. 11/515,167 Dated Jun. 3, 2010.
Notice of Allowance from U.S. Appl. No. 11/515,223 Dated Jul. 30, 2010.
Final Office Action from U.S. Appl. No. 11/553,390 Dated Jun. 24, 2010.
Notice of Allowance from U.S. Appl. No. 11/611,374 Dated Jul. 19, 2010.
Final Office Action from U.S. Appl. No. 11/672,921 Dated Jul. 23, 2010.
Final Office Action from U.S. Appl. No. 11/702,960 Dated Jun. 21, 2010.
Notice of Allowance from U.S. Appl. No. 11/762,010 Dated Jul. 2, 2010.
Notice of Allowance from U.S. Appl. No. 11/763,365 Dated Jun. 29, 2010.
Final Office Action from U.S. Appl. No. 11/929,500 Dated Jun. 24, 2010.
Office Action from U.S. Appl. No. 12/574,628 Dated Jun. 10, 2010.
German Office Action From German Patent Application No. 11 2006 002 300.4-55 Mailed Jun. 5, 2009 (With Translation).
Non-Final Office Action From U.S. Appl. No. 11/461,430 Mailed Feb. 19, 2009.
Final Office Action From U.S. Appl. No. 11/461,435 Mailed Jan. 28, 2009.
Non-Final Office Action From U.S. Appl. No. 11/461,437 Mailed Jan. 26, 2009.
Non-Final Office Action From U.S. Appl. No. 11/461,441 Mailed Apr. 2, 2009.
Non-Final Office Action From U.S. Appl. No. 11/611,374 Mailed Mar. 23, 2009.
Non-Final Office Action From U.S. Appl. No. 11/762,010 Mailed Mar. 20, 2009.
Non-Final Office Action From U.S. Appl. No. 11/939,432 Mailed Feb. 6, 2009.
Non-Final Office Action From U.S. Appl. No. 12/111,819 Mailed Apr. 27, 2009.
Non-Final Office Action From U.S. Appl. No. 12/111,828 Mailed Apr. 17, 2009.
Non-final Office Action from U.S. Appl. No. 11/461,430 mailed on Feb. 19, 2009.
Final Office Action from U.S. Appl. No. 11/461,435 mailed on Jan. 28, 2009.
Non-final Office Action from U.S. Appl. No. 11/461,437 mailed on Jan. 26, 2009.
Non-final Office Action from U.S. Appl. No. 11/939,432 mailed on Feb. 6, 2009.
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).
Notice of Allowance from U.S. Appl. No. 11/762,010 Dated Jun. 8, 2011.
Non-Final Office Action from U.S. Appl. No. 11/672,924 Dated Jun. 8, 2011.
Non-Final Office Action from U.S. Appl. No. 11/929,225 Dated Jun. 8, 2011.
Notice of Allowance from U.S. Appl. No. 11/929,500 Dated Jun. 13, 2011.
Notice of Allowance from U.S. Appl. No. 11/941,589 Dated Jun. 15, 2011.
Final Office Action from U.S. Appl. No. 12/057,306 Dated Jun. 15, 2011.
Final Office Action from U.S. Appl. No. 12/769,428 Dated Jun. 16, 2011.
Notice of Allowance from U.S. Appl. No. 12/203,100 Dated Jun. 17, 2011.
Notice of Allowance from U.S. Appl. No. 11/762,013 Dated Jun. 20, 2011.
Non-Final Office Action from U.S. Appl. No. 12/797,557 Dated Jun. 21, 2011.
Notice of Allowance from U.S. Appl. No. 11/929,483 Dated Jun. 23, 2011.
Non-Final Office Action from U.S. Appl. No. 11/702,960 Dated Jun. 23, 2011.
Non-Final Office Action from U.S. Appl. No. 11/929,655 Dated Jun. 24, 2011.
Notice of Allowance from U.S. Appl. No. 11/763,365 Dated Jun. 24, 2011.
Notice of Allowance from U.S. Appl. No. 11/611,374 Dated Jun. 24, 2011.
Non-Final Office Action from U.S. Appl. No. 11/828,182 Dated Jun. 27, 2011.
Non-Final Office Action from U.S. Appl. No. 11/828,181 Dated Jun. 27, 2011.
Non-Final Office Action from U.S. Appl. No. 12/378,328 Dated Jul. 15, 2011.
Final Office Action from U.S. Appl. No. 11/461,420 Dated Jul. 20, 2011.
Notice of Allowance from U.S. Appl. No. 11/461,437 Dated Jul. 25, 2011.
Notice of Allowance from U.S. Appl. No. 11/702,981 Dated Aug. 5, 2011.
Notice of Allowability from U.S. Appl. No. 11/855,826 Dated Aug. 15, 2011.
Non-Final Office Action from U.S. Appl. No. 12/574,628 Dated Sep. 20, 2011.
Non-Final Office Action from U.S. Appl. No. 11/858,518 Dated Sep. 27, 2011.
Notice of Allowance from U.S. Appl. No. 11/929,571 Dated Sep. 27, 2011.
Notice of Allowance from U.S. Appl. No. 11/929,500 Dated Sep. 27, 2011.
Notice of Allowance from U.S. Appl. No. 11/941,589 Dated Sep. 30, 2011.
Notice of Allowance from U.S. Appl. No. 12/816,756 Dated Oct. 3, 2011.
Non-Final Office Action from U.S. Appl. No. 12/508,496 Dated Oct. 11, 2011.
Non-Final Office Action from U.S. Appl. No. 11/588,739 Dated Oct. 13, 2011.
Notice of Allowance from U.S. Appl. No. 11/939,432 Dated Oct. 24, 2011.
Non-Final Office Action from U.S. Appl. No. 11/929,631 Dated Nov. 1, 2011.
Non-Final Office Action from U.S. Appl. No. 11/553,372 Dated Nov. 14, 2011.
Notice of Allowance from U.S. Appl. No. 11/515,223 Dated Nov. 29, 2011.
Notice of Allowance from U.S. Appl. No. 12/769,428 Dated Nov. 28, 2011.
Final Office Action from U.S. Appl. No. 11/939,440 Dated Dec. 12, 2011.
Notice of Allowance from U.S. Appl. No. 12/797,557 Dated Dec. 28, 2011.
Office Action, including English translation, from co-pending Japanese application No. 2008-529353, Dated Jan. 10, 2012.
Notice of Allowance from U.S. Appl. No. 12/838,896 Dated Jan. 18, 2012.
Final Office Action from U.S. Appl. No. 11/929,655 Dated Jan. 19, 2012.
Final Office Action from U.S. Appl. No. 12/378,328 Dated Feb. 3, 2012.
Final Office Action from U.S. Appl. No. 11/672,921 Dated Feb. 16, 2012.
Final Office Action from U.S. Appl. No. 11/672,924 Dated Feb. 16, 2012.
Final Office Action from U.S. Appl. No. 11/929,225 Dated Feb. 16, 2012.
International Search Report for Application No. EP12150807 Dated Feb. 16, 2012.
Final Office Action from U.S. Appl. No. 11/828,181 Dated Feb. 23, 2012.
Non-Final Office Action from U.S. Appl. No. 11/461,520 Dated Feb. 29, 2012.
Notice of Allowance from U.S. Appl. No. 12/574,628 Dated Mar. 6, 2012.
Non-Final Office Action from U.S. Appl. No. 13/276,212 Dated Mar. 15, 2012.
Non-Final Office Action from U.S. Appl. No. 13/343,612 Dated Mar. 29, 2012.
Notice of Allowance from U.S. Appl. No. 11/939,440 Dated Mar. 30, 2012.
European Search Report from co-pending European application No. 11194876.6-2212/2450798, Dated Apr. 12, 2012.
European Search Report from co-pending European application No. 11194862.6-2212/2450800, Dated Apr. 12, 2012.
Notice of Allowance from U.S. Appl. No. 11/929,636, Dated Apr. 17, 2012.
Final Office Action from U.S. Appl. No. 11/858,518, Dated Apr. 17, 2012.
European Search Report from co-pending European application No. 11194883.2-2212, Dated Apr. 27, 2012.
Non-Final Office Action from U.S. Appl. No. 11/553,372, Dated May 3, 2012.
Notice of Allowance from U.S. Appl. No. 11/929,631, Dated May 3, 2012.
Non-Final Office Action from U.S. Appl. No. 13/165,713, Dated May 22, 2012.
Non-Final Office Action from U.S. Appl. No. 12/144,396, Dated May 29, 2012.
Non-Final Office Action from U.S. Appl. No. 13/165,713, Dated May 31, 2012.
Non-Final Office Action from U.S. Appl. No. 13/280,251, Dated Jun. 12, 2012.
Final Office Action from U.S. Appl. No. 11/855,805, Dated Jun. 14, 2012.
Office Action, including English translation, from co-pending Japanese application No. 2008-529353, Dated Jul. 31, 2012.
Final Office Action from U.S. Appl. No. 13/315,933, Dated Aug. 24, 2012.
Final Office Action from U.S. Appl. No. 13/276,212, Dated Aug. 30, 2012.
Non-Final Office Action from U.S. Appl. No. 13/367,182, Dated Aug. 31, 2012.
Notice of Allowance from U.S. Appl. No. 11/461,420, Dated Sep. 5, 2012.
Final Office Action from U.S. Appl. No. 13/280,251, Dated Sep. 12, 2012.
Non-Final Office Action from U.S. Appl. No. 11/929,225, Dated Sep. 17, 2012.
Notice of Allowance from U.S. Appl. No. 12/508,496, Dated Sep. 17, 2012.
Non-Final Office Action from U.S. Appl. No. 11/672,921, Dated Oct. 1, 2012.
Notice of Allowance from U.S. Appl. No. 12/057,306, Dated Oct. 10, 2012.
Notice of Allowance from U.S. Appl. No. 12/144,396, Dated Oct. 11, 2012.
Non-Final Office Action from U.S. Appl. No. 13/411,489, Dated Oct. 17, 2012.
Non-Final Office Action from U.S. Appl. No. 13/471,283, Dated Dec. 7, 2012.
English translation of Office Action from co-pending Korean patent application No. KR1020087005172, dated Dec. 20, 2012.
Office Action, including English translation, from co-pending Japanese application No. 2008-529353, Dated Dec. 27, 2012.
Office Action from co-pending European patent application No. EP12150798, Dated Jan. 3, 2013.
Final Office Action from U.S. Appl. No. 11/672,924, Dated Feb. 1, 2013.
Non-Final Office Action from U.S. Appl. No. 13/260,650, Dated Feb. 1, 2013.
Notice of Allowance from U.S. Appl. No. 13/141,844, Dated Feb. 5, 2013.
Notice of Allowance from U.S. Appl. No. 13/473,827, Dated Feb. 15, 2013.
Notice of Allowance from U.S. Appl. No. 12/378,328, Dated Feb. 27, 2013.
Non-Final Office Action from U.S. Appl. No. 13/536,093, Dated Mar. 1, 2013.
Notice of Allowance from U.S. Appl. No. 11/461,435, Dated Mar. 6, 2013.
U.S. Appl. No. 13/620,425, filed Sep. 14, 2012, Rajan et al., Memory Module With Memory Stack and Interface With Enhanced Capabilities.
U.S. Appl. No. 13/620,565, filed Sep. 14, 2012, Rajan et al., Methods and Apparatus of Stacking Drams.
U.S. Appl. No. 13/620,424, Sep. 14, 2012, Danilak et al., System and Method for Increasing Capacity, Performance, and Flexibility of Flash Storage.
U.S. Appl. No. 13/615,008, Sep. 13, 2012, Smith et al., Adjusting the Timing of Signals Associated With a Memory System.
U.S. Appl. No. 13/620,650, Sep. 14, 2012, Rajan et al., System and Method for Translating an Address Associated With a Command Communicated Between a System and Memory Circuits.
U.S. Appl. No. 13/618,246, Sep. 14, 2012, Smith et al., Memory Modules With Reliability and Serviceability Functions.
U.S. Appl. No. 13/620,645, Sep. 14, 2012, Schakel et al., Method and Apparatus for Refresh Management of Memory Modules.
U.S. Appl. No. 13/620,412, Sep. 14, 2012, Zohni et al., Embossed Heat Spreader.
U.S. Appl. No. 13/620,793, Sep. 15, 2012, Rosenband et al., Hybrid Memory Module.
U.S. Appl. No. 13/620,207, Sep. 14, 2012, Rajan et al., Configurable Memory System.
Office Action from co-pending Japanese patent application No. 2012-132119, Dated Mar. 6, 2013.
Notice of Allowance from U.S. Appl. No. 11/515,223, Dated Mar. 18, 2013.
Notice of Allowance from U.S. Appl. No. 13/471,283, Dated Mar. 21, 2013.
Extended European Search Report for co-pending European patent application No. EP12150807.1, dated Feb. 1, 2013, mailed Mar. 22, 2013.
English translation of Office Action from co-pending Korean patent application No. KR1020087019582, Dated Mar. 13, 2013.
Notice of Allowance from U.S. Appl. No. 13/618,246, Dated Apr. 23, 2013.
Notice of Allowance from U.S. Appl. No. 13/182,234, Dated May 1, 2013.
Final Office Action from U.S. Appl. No. 13/315,933, Dated May 3, 2013.
English Translation of Office Action from co-pending Korean patent application No. 10-2013-7004006, Dated apr. 12, 2013.
Non-Final Office Action from U.S. Appl. No. 13/620,793, Dated May 6, 2013.
Non-Final Office Action from U.S. Appl. No. 13/620,565, Dated May 24, 2013.
Final Office Action from U.S. Appl. No. 11/929,225, Dated May 24, 2013.
Final Office Action from U.S. Appl. No. 11/672,921, Dated May 24, 2013.
Notice of Allowance from U.S. Appl. No. 11/929,631, Dated May 28, 2013.
Notice of Allowance from U.S. Appl. No. 13/620,424, Dated May 29, 2013.
Notice of Allowance from U.S. Appl. No. 13/341,844, Dated May 30, 2013.
Non-Final Office Action from U.S. Appl. No. 13/455,691, Dated Jun. 4, 2013.
Non-Final Office Action from U.S. Appl. No. 13/620,199, Dated Jun. 17, 2013.
Non-Final Office Action from U.S. Appl. No. 13/620,207, Dated Jun. 20, 2013.
Non-Final Office Action from U.S. Appl. No. 11/828,182, Dated Jun. 20, 2013.
Final Office Action from U.S. Appl. No. 11/828,181, Dated Jun. 20, 2013.
Notice of Allowance from U.S. Appl. No. 13/597,895, Dated Jun. 25, 2013.
Non-Final Office Action from U.S. Appl. No. 13/620,645, Dated Jun. 26, 2013.
Notice of Allowance from U.S. Appl. No. 13/471,283, Dated Jun. 28, 2013.
Related Publications (1)
Number Date Country
20120008436 A1 Jan 2012 US
Continuations (1)
Number Date Country
Parent 11762010 Jun 2007 US
Child 13181716 US
Continuation in Parts (1)
Number Date Country
Parent 11461420 Jul 2006 US
Child 11762010 US