US 8,077,535 B2Grant
Memory refresh apparatus and method
Issue Date:2011-12-13
•34 Claims
•19 Drawing Sheets
Abstract
A system and method are provided. The system and method simulate a DRAM memory circuit using an interface circuit connected to a plurality of other DRAM memory circuits. In response to the receipt of a refresh control signal, a first refresh control signal is sent to a first subset of the plurality of other DRAM memory circuits and a second refresh control signal is sent to a second subset of the plurality of other DRAM memory circuits.
Metadata
Assignee
- Google Inc.
Inventors
- Keith R. Schakel
- Suresh Natarajan Rajan
- Michael John Sebastian Smith
- David T. Wang
- Frederick Daniel Weber
Application Information
Application Number:US 11/461,437
Filing Date:2006-07-31
Priority Date:2006-07-31
Art Unit:2824
Classifications
IPC:
G11C7/00
Patent Drawings (19 sheets)
Description
Field of the Invention
[0001] The present invention relates to memory, and more particularly to multiple-memory circuit systems.
Background
[0002] The memory capacity requirements of computers in general, and servers in particular, are increasing rapidly due to various trends such as 64-bit processors and operating systems, multi-core processors, virtualization, etc. However, other industry trends such as higher memory bus speeds and small form factor machines, etc. are reducing the number of memory module slots in such systems. Thus, a need exists in the industry for larger capacity memory circuits to be used in such systems.
[0003] However, there is also an exponential relationship between a capacity of monolithic memory circuits and a price associated therewith. As a result, large capacity memory modules may be cost prohibitive. To this end, the use of multiple smaller capacity memory circuits is a cost-effective approach to increasing such memory capacity.
Summary
[0004] An apparatus and method are provided. In response to the receipt of a refresh control signal, a plurality of refresh control signals is sent to the memory circuits at different times.
Brief Description of the Drawings
[0005] FIG. 1 illustrates a multiple memory circuit framework, in accordance with one embodiment.
[0006] FIG. 2A-2E show various configurations of a buffered stack of dynamic random access memory (DRAM) circuits with a buffer chip, in accordance with various embodiments.
[0007] FIG. 2F illustrates a method for storing at least a portion of information received in association with a first operation for use in performing a second operation, in accordance with still another embodiment.
[0008] FIG. 3 shows a high capacity dual in-line memory module (DIMM) using buffered stacks, in accordance with still yet another embodiment.
[0009] FIG. 4 shows a timing design of a buffer chip that makes a buffered stack of DRAM circuits mimic longer column address strobe (CAS) latency DRAM to a memory controller, in accordance with another embodiment.
[0010] FIG. 5 shows the write data timing expected by DRAM in a buffered stack, in accordance with yet another embodiment.
[0011] FIG. 6 shows write control signals delayed by a buffer chip, in accordance with still yet another embodiment.
[0012] FIG. 7 shows early write data from an advanced memory buffer (AMB), in accordance with another embodiment.
[0013] FIG. 8 shows address bus conflicts caused by delayed write operations, in accordance with yet another embodiment.
[0014] FIGS. 9A-B show variable delays of operation through a buffer chip, in accordance with yet another embodiment.
[0015] FIG. 10 shows a buffered stack of four 512 Mb DRAM circuits mapped to a single 2 Gb DRAM circuit, in accordance with yet another embodiment.
[0016] FIG. 11 illustrates a method for refreshing a plurality of memory circuits, in accordance with yet another embodiment.
[0017] FIG. 12 illustrates a method for refreshing a plurality of memory circuits.
Detailed Description
[0018] FIG. 1 illustrates a multiple memory circuit framework 100, in accordance with one embodiment. As shown, included are an interface circuit 102, a plurality of memory circuits 104A, 104B, 104N, and a system 106. In the connect of the present description, such memory circuits 104A, 104B, 104N may include any circuit capable of serving as memory.
[0019] For example, in various embodiments, one or more of the memory circuits 104A, 104B, 104N may include a monolithic memory circuit. For insurance, such monolithic memory circuit may take the form of dynamic random access memory (DRAM). Such DRAM may take any form including, but not limited to synchronous (SDRAM), double data rate synchronous (DDR DRAM, DDR2 DRAM, DDR3 DRAM, etc.), quad data rate (QDR DRAM), direct RAMBUS (DRDRAM), fast page mode (FPM DRAM), video (VDRAM), extended data out (EDO DRAM), burst EDO (BEDO DRAM), multibank (MDRAM), synchronous graphics (SGRAM), and/or any other type DRAM. Of course, one or more of the memory circuits 104A, 104B, 104N may include other types of memory such as magnetic random access memory (MRAM), intelligent random access memory (IRAM), distributed network architecture (DNA) memory, window random access memory (WRAM), flash memory (e.g. NAND, NOR, or others, etc.), pseudostatic random access memory (PSRAM), wetware memory, and/or any other type of memory circuit that meets the above definition.
[0020] In additional embodiments, the memory circuits 104A, 104B, 104N may be symmetrical or asymmetrical. For example, in one embodiment, the memory circuits 104A, 104B, 104N may be of the same type, brand, and/or size, etc. Of course, in other embodiments, one or more of the memory circuits 104A, 104B, 104N may be of a first type, brand, and/or size, while one or more other memory circuits 104A, 104B, 104N may be of a second type, brand, and/or size, etc. Just by way of example, one or more memory circuits 104A, 104B, 104N may be of a DRAM type, while one or more other memory circuits 104A, 104B, 104N may be of a flash type. While three or more memory circuits 104A, 104B, 104N are shown in FIG. 1 in accordance with one embodiment, it should be noted that any plurality of memory circuits 104A, 104B, 104N may be employed.
[0021] Strictly as an option, the memory circuits 104A, 104B, 104N may or may not be positioned on at least one dual in-line memory module (DIMM) (not shown). In various embodiments, the DIMM may include a registered DIMM (R-DIMM), a small outline-DIMM (SO-DIMM), a fully buffered-DIMM (FB-DIMM), an un-buffered DIMM, etc. Of course, in other embodiments, the memory circuits 104A, 104B, 104N may or may not be positioned on any desired entity for packaging purposes.
[0022] Further in the context of the present description, the system 106 may include any system capable of requesting and/or initiating a process that results in an access of the memory circuits 104A, 104B, 104N. As an option, the system 106 may accomplish this utilizing a memory controller (not shown), or any other desired mechanism. In one embodiment, such system 106 may include a host system in the form of a desktop computer, lap-top computer, server, workstation, a personal digital assistant (PDA) device, a mobile phone device, a television, a peripheral device (e.g. printer, etc.) Of course, such examples are set forth for illustrative purposes only, as any system meeting the above definition may be employed in the context of the present framework 100.
[0023] Turning now to the interface circuit 102, such interface circuit 102 may include any circuit capable of indirectly or directly communicating with the memory circuits 104A, 104B, 104N and the system 106. In various optional embodiments, the interface circuit 102 may include one or more interface circuits, a buffer chip, etc. Embodiments involving such a buffer chip will be set forth hereinafter during reference to subsequent figures. In still other embodiments, the interface circuit 102 may or may not be manufactured in monolithic form.
[0024] While the memory circuits 104A, 104B, 104N, interface circuit 102, and system 106 are shown to be separate parts, it is contemplated that any of such parts (or portions thereof) may or may not be integrated in any desired manner. In various embodiments, such optional integration may involve simply packaging such parts together (e.g. stacking the parts, etc.) and/or integrating them monolithically. Just by way of example, in various optional embodiments, one or more portions (or all, for that matter) of the interface circuit 102 may or may not be packaged with one or more of the memory circuits 104A, 104B, 104N (or all, for that matter). Different optional embodiments which may be implemented in accordance with the present multiple memory circuit framework 100 will be set forth hereinafter during references to FIGS. 2A-2E , and 3 et al.
[0025] In use, the interface circuit 102 may be capable of various functionality, in the context of different embodiments. More illustrative information will now be set forth regarding such optional functionality which may or may not be implemented in the context of such interface circuit 102, per the desires of the user. It should be strongly noted that the following information is set forth for illustrative purposes and should not be construed as limiting in any manner. For example, any of the following features may be optionally incorporated with or without the exclusion of other features described.
[0026] For instance, in one optional embodiment, the interface circuit 102 interfaces a plurality of signals 108 that are communicated between the memory circuits 104A, 104B, 104N and the system 106. As shown, such signals may, for example, include address/control/clock signals, etc. In on aspect of the present embodiments, the interfaced signals 108 may represent all of the signals that are communicated between the memory circuits 104A, 104B, 104N and the system 106. In other aspects, at least a portion of signals 110 may travel directly between the memory circuits 104A, 104B, 104N and the system 106 or component thereof [e.g. register, advanced memory buffer (AMB), memory controller, or any other component thereof, where the term component is defined herebelow]. In various embodiments, the number of the signals 108 (vs. a number of the signals 110, etc.) may vary such that the signals 108 are a majority or more (L>M), etc.
[0027] In yet another embodiment, the interface circuit 102 may be operable to interface a first number of memory circuits 104A, 104B, 104N and the system 106 for simulating at least one memory circuit of a second number. In the context of the present description, the simulation may refer to any simulating, emulating, disguising, transforming, converting, and/or the like that results in a least one aspect (e.g. a number in this embodiment, etc.) of the memory circuits 104A, 104B, 104N appearing different to the system 106. In different embodiments, the simulation may be electrical in nature, logical in nature, protocol in nature, and/or performed in any other desired manner. For instance, in the context of electrical simulation, a number of pine, wires, signals, etc. may be simulated, while, in the context of logical simulation, a particular function may be simulated. In the context of protocol, a particular protocol (e.g. DDR3, etc.) may be simulated.
[0028] In still additional aspects of the present embodiment, the second number may be more or less than the first number. Still yet, in the latter case, the second number may be one, such that a single memory circuit is simulated. Different optional embodiments which may employ various aspects of the present embodiment will be set forth hereinafter during reference to FIGS. 2A-2E , and 3 et al.
[0029] In still yet another embodiment, the interface circuit 102 may be operable to interface the memory circuits 104A, 104B, 104N and the system 106 for simulating at least one memory circuit with at least one aspect that is different from at least one aspect of at least one of the plurality of the memory circuits 104A, 104B, 104N. In accordance with various aspects of such embodiment, such aspect may include a signal, a capacity, a timing, a logical interface, etc. Of curse, such examples of aspects are set forth for illustrative purposes only and thus should not be construed as limiting, since any aspect associated with one or more of the memory circuits 104A, 104B, 104N may be simulated differently in the foregoing manner.
[0030] In the case of the signal, such signal may refer to a control signal (e.g. an address signal, a signal associated with an activate operation, precharge operation, write operation, read operation, a mode register write operation, a mode register read operation, a refresh operation, etc.), a data signal, a logical or physical signal, or any other signal for that matter. For instance, a number of the aforementioned signals may be simulated to appear as fewer or more signals, or even simulated to correspond to a different type. In still other embodiments, multiple signals may be combined to simulate another signal. Even still, a length of time in which a signal is asserted may be simulated to be different.
[0031] In the case of protocol, such may, in one exemplary embodiment, refer to a particular standard protocol. For example, a number of memory circuits 104A, 104B, 104N that obey a standard protocol (e.g. DDR2 etc.) may be used to simulate one or more memory circuits that obey a different protocol (DDR3 etc.). Also, a number of memory circuits 104A, 104B, 104N that obey a version of protocol (e.g. DDR2 with 3-3-3 latency timing, etc.) may be used to simulate one or more memory circuits that obey a different version of the same protocol (e.g. DDR2 with 5-5-5 latency timing, etc.).
[0032] In the case of capacity, such may refer to a memory capacity (which may or may not be a function of a number of the memory circuits 104A, 104B, 104N, see previous embodiment). For example, the interface circuit 102 may be operable for simulating at least one memory circuit with a first memory capacity that is greater that (or less than) a second memory capacity of at least one of the memory circuits 104A, 104B, 104N.
[0033] In the case where the aspect is timing-related, the timing may possibly relate to a latency (e.g. time delay, etc.). In one aspect of the present embodiment, such latency may include a column address strobe (CAS) latency, which refers to a latency associated with accessing a column of data. Still yet, the latency may include a row address to column address latency (tRCD), which refers to a latency required between the row address strobe (RAS) and CAS. Even still, the latency may include a row precharge latency (tRP), which refers a latency required to terminate access to an open row, and open access to a next row. Further, the latency may include an active to precharge latency (tRAS), which refers to a latency required to access a certain row of data between an activate operation and a precharge operation. In any cases, the interface circuit 102 may be operable for simulating at least one memory circuit with a first latency that is longer (or shorter) than a second latency of at least one of the memory circuits 104A, 104B, 104N. Different optional embodiments which employ various features of the present embodiment will be set forth hereinafter during reference to FIGS. 2A-2E , and 3 et al.
[0034] In still another embodiment, a component may be operable to receive a signal from the system 106 and communicate the signal to at least one of the memory circuits 104A, 104B, 104N after a delay. Again, the signal may refer to a control signal (e.g. an address signal, a signal associated with an activate operation, precharge operation, write operation, read operation, etc.), a data signal, a logical or physical signal, or any other signal for that matter. In various embodiments, such delay may be fixed or variable (e.g. a function of the current signal, the previous signal, etc.). In still other embodiments, the component may be operable to receive a signal from at least one of the memory circuits 104A, 104B, 104N and communicate the signal to the system 106 after a delay.
[0035] As an option, the delay may include a cumulative delay associated with any one or more of the aforementioned signals. Even still, the delay may result in a time shift of the signal forward and/or back in time (with respect to other signals). Of course, such forward and backward time shift may or may not be equal in magnitude. In one embodiment, this time shifting may be accomplished by utilizing a plurality of delay functions which each apply a different delay to a different signal. In still additional embodiments, the aforementioned shifting may be coordinated among multiple signals such that different signals are subject to shifts with different relative directions/magnitudes, in an organized fashion.
[0036] Further, it should be noted that the aforementioned component may, but need not necessarily take the form of the interface circuit 102 of FIG. 1 . For example, the component may include a register, an AMB, a component positioned on at least one DIMM, a memory controller, etc. Such register may, in various embodiments, include a Joint Electron Device Engineering Council (JEDEC) register, a JEDEC register including one or more functions set forth herein, a register with forwarding, storing, and/or buffering capabilities, etc. Different optional embodiments which employ various features of the present embodiment will be set forth hereinafter during reference to FIGS. 4-7 , and 9A-B et al.
[0037] In a power-saving embodiment, at least one of a plurality of memory circuits 104A, 104B, 104N may be identified that is not currently being accessed by the system 106. In one embodiment, such identification may involve determining whether a page [i.e. any portion of any memory(s), etc.] is being accessed in at least one of the plurality of memory circuits 104A, 104B, 104N. Of course, any other technique may be used that results in the identification of at least one of the memory circuits 104A, 104B, 104N that is not being accessed.
[0038] In response to the identification of the at least one memory circuit 104A, 104B, 104N, a power saving operation is initiated in association with the at least one memory circuit 104A, 104B, 104N. In one optional embodiment, such power saving operation may involve a power down operation and, in particular, a precharge power down operation. Of course, however, it should be noted that any operation that results in at least some power savings may be employed in the context of the present embodiment.
[0039] Similar to one or more of the previous embodiments, the present functionality or a portion thereof may be carried out utilizing any desired component. For example, such component may, but need not necessarily take the form of the interface circuit 102 of FIG. 1 . In other embodiments, the component may include a register, an AMB, a component positioned on at least one DIMM, a memory controller, etc. One optional embodiment which employs a various features of the present embodiment will set forth hereinafter during reference to FIG. 10 .
[0040] In still yet another embodiment, a plurality of the aforementioned components may serve, in combination, to interface the memory circuits 104A, 104B, 104N and the system 106. In various embodiments, two, three, four, or more components may accomplish this. Also, the different components may be relatively configured in any desired manner. For example, the components may be configured in parallel, serially, or a combinations thereof. In addition, any number of the components may be allocated to any number of the memory circuits 104A, 104B, 104N.
[0041] Further, in the present embodiment, each of the plurality of components may be the same or different. Still yet, the components may share the same or similar interface tasks and/or perform different interface tasks. Such interface tasks may include, but are not limited to simulating one or more aspects of a memory circuit, performing a power savings/refresh operation, carrying out any one or more of the various functionalities set forth herein, and/or any other task relevant to the aforementioned interfacing. One optional embodiment which employs various features of the present embodiment will be set forth hereinafter during reference to FIG. 3 .
[0042] Additional illustrative information will now be set forth regarding various optional embodiments in which the foregoing techniques may or may not be implemented, per the desires of the user. For example, an embodiment is set forth for storing at least a portion of information received in association with a first operation for use in performing a second operation. See FIG. 2F . Further, a technique is provided for refreshing a plurality of memory circuits, in accordance with still yet another embodiment. See FIG. 11 .
[0043] It should again be strongly noted that the following information is set forth for illustrative purposes and should not be construed as limiting in any manner. Any of the following features may be optionally incorporated with or without the exclusion of other features described.
[0044] FIGS. 2A-2E show various configurations of a buffered stack of DRAM circuits 106A-D with a buffer chip 202, in accordance with various embodiments. As an option, the various configurations to be described in the following embodiments may be implemented in the context of the architecture and/or environment of FIG. 1 . Of course, however, they may also be carried out in any other desired environment (e.g. using other memory types, etc.). It should also be noted that the aforementioned definitions may apply during the present description.
[0045] As shown in each of such figures, the buffer chip 202 is placed electrically between an electronic host system 204 and a stack of DRAM circuits 206A-D. In the context of the present description, a stack may refer to any collection of memory circuits. Further, the buffer chip 202 may include any device capable of buffering a stack of circuits (e.g. DRAM circuits 206A-D, etc.). Specifically, the buffer chip 202 may be capable of buffering the stack of DRAM circuits 206A-D to electrically and/or logically resemble at least one larger capacity DRAM circuit to the host system 204. In this way, the stack of DRAM circuits 206A-D may appear as a smaller quantity of larger capacity DRAM circuits to the host system 204.
[0046] For example, the stack of DRAM circuits 206A-D may include eight 512 Mb DRAM circuits. This, the buffer chip 202 may buffer the stack of eight 512 Mb DRAM circuits to resemble a single 4 Gb DRAM circuit to a memory controller (not shown) of the associated host system 204. In another example, the buffer chip 202 may buffer the stack of eight 512 Mb DRAM circuits to resemble two 2 Gb DRAM circuits to a memory controller of an associated host system 204.
[0047] Further, the stack of DRAM circuits 206A-D may include any number of DRAM circuits. Just by way of example, a buffer chip 202 may be connected to 2, 4, 8 or more DRAM circuits 206A-D. Also, the DRAM circuits 206A-D may be arranged in a single stack, as shown in FIGS. 2A-2D .
[0048] The DRAM circuits 206A-D may be arranged on a single side of the buffer chip 202, as shown in FIGS. 2A-2D . Of course, however, the DRAM circuits 206A-D may be located on both sides of the buffer chip 202 shown in FIG. 2E . Thus, for example, a buffer chip 202 may be connected to 16 DRAM circuits with 8 DRAM circuits on either side of the buffer chip 202, where the 8 DRAM circuits on each side of the buffer chip 202 are arranged in two stacks of four DRAM circuits.
[0049] The buffer chip 202 may optionally be a part of the stack of DRAM circuits 206A-D. Of course, however, the buffer chip 202 may also be separate from the stack of DRAM circuits 206A-D. In addition, the buffer chip 202 may be physically located anywhere in the stack of DRAM circuits 206A-D, where such buffer chip 202 electrically sets between the electronic host system 204 and the stack of DRAM circuits 206A-D.
[0050] In one embodiment, a memory bus (not shown) may connect to the buffer chip 202, and the buffer chip 202 may connect to each of the DRAM circuits 206A-D in the stack. As shown in FIGS. 2A-2D , the buffer chip 202 may be located at the bottom of the stack of DRAM circuits 206A-D (e.g. the bottom-most device in the stack). As another option, and as shown in FIG. 2E , the buffer chip 202 may be located in the middle of the stack of DRAM circuits 206A-D. As still yet another option, the buffer chip 202 may be located at the top of the stack of DRAM circuits 206A-D (e.g. the top-most device in the stack). Of course, however, the buffer chip 202 may be located anywhere between the two extremities of the stack of DRAM circuits 206A-D.
[0051] The electrical connections between the buffer chip 202 and the stack of DRAM circuits 206A-D may be configured in any desired manner. In one optional embodiment, address, control (e.g. command, etc.), and clock signals may be common to all DRAM circuits 206A-D in the stack (e.g. using one common bus). As another option, there may be multiple address, control and clock busses. As yet another option, there may be individual address, control and clock busses to each DRAM circuits 206A-D. Similarly, data signals may be wired as one common bus, several busses or as an individual bus to each DRAM circuits 206A-D. Of course, it should be noted that any combinations of such configurations may also be utilized.
[0052] For example, as shown in FIG. 2A , the stack of DRAM circuits 206A-D may have one common address, control and clock bus 208 with individual data busses 210. In another example, as shown in FIG. 2B , the stack of DRAM circuits 206A-D may have two address, control and clock busses 208 along with two data busses 210. In still yet another example, as shown in FIG. 2C , the stack of DRAM circuits 206A-D may have one address, control and clock bus 208 together with two data busses 210. In addition, as shown in FIG. 2D , the stack of DRAM circuits 206A-D may have one common address, control and clock bus 208 and one common data bus 210. It should be noted that any other permutations and combinations of such address, control, clock and data busses may be utilized.
[0053] These configurations may therefore allow for the host system 204 to only be in contact with a load of the buffer chip 202 on the memory bus. In this way, any electrical loading problems (e.g. bad signal integrity, improper signal timing, etc.) associated with the stacked DRAM circuits 206A-D may (but not necessarily) be prevented, in the context of various optional embodiments.
[0054] FIG. 2F illustrates a method 280 for storing at least a portion of information received in association with a first operation for use in performing a second operation, in accordance with still yet another embodiment. As an option, the method 280 may be implemented in the context of the architecture and/or environment of any one or more of FIGS. 1-2E . For example, the method 280 may be carried out by the interface circuit 102 of FIG. 1 . Of course, however, the method 280 may be carried out in any desired environment. It should also be noted that the aforementioned definitions may apply during the present description.
[0055] In operation 282, first information is received in association with a first operation to be performed on at least one of a plurality of memory circuits (e.g. see the memory circuits 104A, 104B, 104N of FIG. 1 , etc.). In various embodiments, such first information may or may not be received coincidently with the first operation, as long as it is associated in some capacity. Further, the first operation may, in one embodiment, include a row operation. In such embodiment, the first information may include address information (e.g. a set of address bits, etc.).
[0056] For reasons that will soon become apparent, at least a portion of the first information is stored. Note operation 284. Still yet, in operation 286, second information is received in association with a second operation. Similar to the first information, the second information may or may not be received coincidently with the second operation, and may include address information. Such second operation, however, may, in one embodiment, include a column operation.
[0057] In this end, the second operation may be performed utilizing the stored portion of the first information in addition to the second information. See operation 288. More illustrative information will now be set forth regarding various optional features with which the foregoing method 280 may or may not be implemented, per the desires of the user. Specifically, an example will be set for illustrating the manner in which the method 280 may be employed for accommodating a buffer chip that is simulating at least one aspect of a plurality of memory circuits.
[0058] In particular, the present example of the method 280 of FIG. 2F will be set forth in the context of the various components (e.g. buffer chip 202, etc.) shown in the embodiments of FIGS. 2A-2E . It should be noted that, since the buffered stack of DRAM circuits 206A-D may appear to the memory controller of the host system 204 as one or more larger capacity DRAM circuits, the buffer chip 202 may receive more address bits from the memory controller than are required by the DRAM circuits 206A-D in the stack. These extra address bits may be decoded by the buffer chip 202 to individually select the DRAM circuits 206A-D in the stack, utilizing separate chip select signals to each of the DRAM circuits 206A-D in the stack.
[0059] For example, a stack of four x4 1 Gb DRAM circuits 206A-D behind a buffer chip 202 may appear as a single x4 4 Gb circuit to the memory controller. Thus, the memory controller may provide sixteen row address bits and three bank address bits during a row (e.g. activate) operation, and provide eleven column address bits and three bank address bits during a column (e.g. read or write) operation. However, the individual DRAM circuits 206A-D 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.
[0060] As a result, during a row operation in the above example, the buffer chip 202 may receive two address bits more than are needed by each DRAM circuit 206A-D in the stack. The buffer chip 202 may therefore use the two extra address bits from the memory controller to select one of the four DRAM circuits 206A-D in the stack. In addition, the buffer chip 202 may receive the same number of address bits from the memory controller during a column operation as are needed by each DRAM circuit 206A-D in the stack.
[0061] Thus, in order to select the correct DRAM circuit 206A-D in the stack during a column operation, the buffer chip 202 may be designed to store the two extra address bits provided during a row operation and use the two stored address bits to select the correct DRAM circuit 206A-D during the column operation. The mapping between a system address (e.g. address from the memory controller, including the chip select signal(s) and a device address (e.g. the address, including the chip select signals, presented to the DRAM circuits 206A-D in the stack) may be performed by the buffer chip 202 in various manners.
[0062] In one embodiment, a lower order system row address and bank address bits may be mapped directly to the device row address and bank address inputs. In addition, the most significant row address bit(s) and, optionally, the most significant bank address bit(s), may be decoded to generate the chip select signals for the DRAM circuits 206A-D in the stack during a row operation. The address bits used to generate the chip select signals during the row operation may also be stored in an internal lookup table by the buffer chip 202 for one or more clock cycles. During a column operation, the system column address and bank address bits may be mapped directly to the device column address and bank address inputs, while the stored address bits may be decoded to generate the chip select signals.
[0063] For example, addresses may be mapped between four 512 Mb DRAM circuits 206A-D that simulate a single 2 Gb DRAM circuits utilizing the buffer chip 202. There may be 15 row address bits from the system 204, such that row address bits 0 through 13 are mapped directly the DRAM circuits 206A-D. There may also be 3 bank address bits from the system 204, such that bank address bits 0 through 1 are mapped directly to the DRAM circuits 206A-D.
[0064] During a row operation, the bank address bit 2 and the row address bit 14 may be decoded to generate the 4 chip select signals for each of the four DRAM circuits 206A-D. Row address bits 14 may be stored during the row operation using the bank address as the index. In addition, during the column operation, the stored row address bit 14 may again used with bank address bit 2 to from the four DRAM chip select signals.
[0065] As another example, addresses may be mapped between four 1 Gb DRAM circuits 206A-D that simulate a single 4 Gb DRAM circuits utilizing the buffer chip 202. There may be 16 row address bits from the system 204, such that row address bits 0 through 14 are mapped directly to the DRAM circuits 206A-D. There may also be 3 bank address bits from the system 204, such that bank address bits 0 through 3 are mapped directly to the DRAM circuits 206A-D.
[0066] During a row operation, row address bits 14 and 15 may be decoded to generate the 4 chip select signals for each of the four DRAM circuits 206A-D. Row address bits 14 and 15 may also be stored during the row operation using the bank address as the index. During the column operation, the stored now address bits 14 and 15 may again be used to form the four DRAM chip select signals.
[0067] In various embodiments, this mapping technique may optionally be used 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 202. Such combinational logic circuits may instead be used to generate the individual chip select signals. This may therefore allow the capacitive loading on the address outputs of the buffer chip 202 to be much higher than the loading on the individual chip select signal outputs of the buffer chip 202.
[0068] In another embodiment, the address mapping may be performed by the buffer chip 202 using some of the bank address signals from the memory controller to generate the individual chip select signals. The buffer chip 202 may store the higher order row address bits during a row operation using the bank address as the index, and then may use the stored address bits as part of the DRAM circuit bank address during a column operation. This address mapping technique may require an optional lookup table to be positioned in the critical timing path between the address inputs from the memory controller and the address outputs, to the DRAM circuits 206A-D in the stack.
[0069] For example, addresses may be mapped between four 512 Mb DRAM circuits 206A-D that simulate a single 2 Gb DRAM utilizing the buffer chip 202. There may be 15 row address bits from the system 204, where row address bits 0 through 13 are mapped directly to the DRAM circuits 206A-D. There may also be 3 bank address bits from the system 204, such that bank address bit 0 is used as a DRAM circuit bank address bit for the DRAM circuits 206A-D.
[0070] In addition, row address bit 14 may be used as an additional DRAM circuit bank address bit. During a row operation, the bank address bits 1 and 2 from the system may be decoded to generate the 4 chip select signals for each of the four DRAM circuits 206A-D. Further, row address bit 14 may be stored during the row operation. During the column operation, the stored row address bit 14 may again be used along with the bank address bit 0 from the system to form the DRAM circuit bank address.
[0071] In both of the above described address mapping techniques, the column address from the memory controller may be mapped directly as the column address to the DRAM circuits 206A-D in the stack. Specifically, this direct mapping may be performed since each of the DRAM circuits 206A-D in the stack, even if of the same width but different capacities (e.g. from 512 Mb to 4 Gb), may have the same page sizes. In an optional embodiment, address A[10] from the memory controller to the DRAM circuits 206A-D in the stack without any modifications during a column operation.
[0072] In various embodiments, it may be desirable to determine whether the simulated DRAM circuit behaves according to a desired DRAM standard or other design specification. A behavior of many DRAM circuits is specified by the JEDEC standards and it may be desirable, in some embodiments, to exactly simulate a particular JEDEC standard DRAM. The JEDEC standard defines 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 a DDR2 DRAM is known as JESD79-2B.
[0073] If it is desired, for example, to determine whether a JEDEC standard is met, the following algorithm may be used. Such algorithm checks, using a set of software verification tools for formal verification of logic, that protocol behavior of the simulated DRAM circuit is the same as a desired standard or other design specification. This formal verification is quite feasible because the DRAM protocol described in a DRAM standard is typically limited to a few control signals (e.g. approximately 15 control signals in the case of the JEDEC DDR2 specification, for example).
[0074] Examples of the aforementioned software verification tools include MAGELLAN supplied by SYNOPSYS, or other software verification tools, such as INCISIVE supplied by CADENCE, verification tools supplied by JASPER, VERIX supplied by REAL INTENT, 0-IN supplied by MENTOR CORPORATION, and others. These software verification tools use written assertions that correspond to the rules established by the DRAM protocol and specification. These written assertions are further included in the code that forms the logic description for the buffer chip. By writing assertions that correspond to the desired behavior of the simulated DRAM circuit, a proof may be constructed that determines whether the desired design requirements are met. In this way, one may test various embodiments for compliance with a standard, multiple standards, or other design specification.
[0075] For instance, an assertion may be written that no two DRAM control signals are allowed to be issued to an address, control and clock but at the same time. Although one may know which of the various buffer chip/DRAM stack configurations and address mappings that have been described herein are suitable, the aforementioned algorithm may allow a designer to prove that the simulated DRAM circuit exactly meets the required standard or other design specification. If, for example, an address mapping that uses a common bus for data and a common bus for address results in a control and clock bus that does not meet a required specification, alternative designs for buffer chips with other bus arrangements or alternative designs for the interconnect between the buffer chips may be used and tested for compliance with the desired standard or other design specification.
[0076] FIG. 3 shows a high capacity DIMM 300 using buffered stacks of DRAM circuits 302, in accordance with still yet another embodiment. As an option, the high capacity DIMM 300 may be implemented in the context of the architecture and environment of FIGS. 1 and/or 2A-F. Of course, however, the high capacity DIMM 300 may be used in any desired environment. It should also be noted that the aforementioned definitions may apply during the present description.
[0077] As shown, a high capacity DIMM 300 may be created utilizing buffered stacks of DRAM circuits 302. Thus, a DIMM 300 may utilize a plurality of buffered stacks of DRAM circuits 302 instead of individual DRAM circuits, thus increasing the capacity of the DIMM. In addition, the DIMM 300 may include a register 304 for address and operation control of each of the buffered stacks of DRAM circuits 302. It should be noted that any desired number of buffered stacks of DRAM circuits 302 may be utilized in conjunction with the DIMM 300. Therefore, the configuration of the DIMM 300, as shown, should not be construed as limiting in any way.
[0078] In an additional unillustrated embodiment, the register 304 may be substituted with an AMB (not shown), in the context of an FB-DIMM.
[0079] FIG. 4 shows a timing design 400 of a buffer chip that makes a buffered stack of dram circuits mimic longer CAS latency DRAM to a memory controller, in accordance with another embodiment. As an option, the design of the buffer chip may be implemented in the context of the architecture and environment of FIGS. 1-3 . Of course, however, the design of the buffer chip may be used in any desired environment. It should also be noted that the aforementioned definitions may apply during the present description.
[0080] In use, any delay through a buffer chip (e.g. see the buffer chip 202 of FIGS. 2A-E , etc.) may be made transparent to a memory controller of a host system (e.g. see the host system 204 of FIGS. 2A-E , etc.) utilizing the buffer chip. In particular, the buffer chip may buffer a stack of DRAM circuits such that the buffered stack of DRAM circuits appears as at least one larger capacity DRAM circuit with higher CAS latency.
[0081] Such 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 most 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 therefore be needed for these signals to traverse through the buffer chip. With the exception of register chips and advanced memory buffers (AMB), industry standard protocols for memory [e.g. (DDR SDRAM), DDR2 SDRAM, etc.] may not comprehend the buffer chip that sits between the memory bus and the DRAM. Industry standard protocols for memory [e.g. (DDR SDRAM), DDR2 SDRAM, etc.] narrowly define the properties of chips that sit between host and memory circuits. Such industry standard protocols define the properties of a register chip and AMB but not the properties of the buffer chip 202, etc. Thus, the signal delay through the buffer chip may violate the specifications of industry standard protocols.
[0082] In one embodiment, the buffer chip may provide a one-half clock cycle delay between the buffer chip receiving address and control signals from the memory controller (or optionally from a register chip, an AMB, etc.) and the address and control signals being valid at the inputs of the stacked DRAM circuits. Similarly, the data signals may also have a one-half clock cycle delay in traversing the buffer chip, either from the memory controller to the DRAM circuits or from the DRAM circuits to the memory controller. Of course, the one-half clock cycle delay set forth above is set forth for illustrative purposes only and thus should not be construed as limiting in any manner whatsoever. For example, other embodiments are contemplated where a one clock cycle delay, a multiple clock cycle delay (or fraction thereof), and/or any other delay amount is incorporated, for that matter. As mentioned earlier, in other embodiments, the aforementioned delay may be coordinated among multiple signals such that different signals are subject to time-shifting with different relative directions/magnitudes, in an organized fashion.
[0083] As shown in FIG. 4 , the cumulative delay through the buffer chip (e.g. the sum of a first delay 402 of the address and control signals through the buffer chip and a second delay 404 of the data signals through the buffer chip) is j clock cycles. Thus, the buffer chip may make the buffered stack appear to the memory controller as one or more larger DRAM circuits with a CAS latency 408 of i+j clocks, where j is the native CAS latency of the DRAM circuits.
[0084] In one example, if the DRAM circuits in the stack have a native CAS latency of 4 and the address and control signals along with the data signals experience a one-half clock cycle delay through the buffer chip, then the buffer chip may make the buffered stack appear to the memory controller as one or more larger DRAM circuits with a CAS latency of 5 (i.e. 4+1). In another example, if the address and control signals along with the data signals experience a 1 clock cycle delay through the buffer chip, then the buffer chip may make the buffered stack appear as one or more larger DRAM circuits with a CAS latency of 6 (i.e. 4+2).
[0085] FIG. 5 shows the write data timing 500 expected by a DRAM circuit in a buffered stack, in accordance with yet another embodiment. As an option, the write data timing 500 may be implemented in the context of the architecture and environment of FIGS. 1-4 . Of course, however, the write data timing 500 may be carried out in any desired environment. It should also be noted that the aforementioned definitions may apply during the present description.
[0086] Designing a buffer chip (e.g. see the buffer chip 202 of FIGS. 2A-E , etc.) so that a buffered stack appears as at least one larger capacity DRAM circuit with higher CAS latency may, in some embodiments, create a problem with the timing of write operations. For example, with respect to a buffered stack of DDR2 SDRAM circuits with a CAS latency of 4 that appear as a single larger DDR2 SDRAM with a CAS latency of 6 to the memory controller, the DDR2 SDRAM protocol may specify that the write CAS latency is one less than the read CAS latency. Therefore, since the buffered stack appears as a DDR2 SDRAM with a read CAS latency of 6, the memory controller may use a write CAS latency of 5 (see 502) when scheduling a write operation to the buffered stack.
[0087] However, since the native read CAS latency of the DRAM circuits is 4, the DRAM circuits may require a write CAS latency of 3 (see 504). As a result, the write data from the memory controller may arrive at the buffer chip later than when the DRAM circuits require the data. Thus, the buffer chip may delay such write operations to alleviate any of such timing problems. Such delay in write operations will be described in more detail with respect to FIG. 6 below.
[0088] FIG. 6 shows write operations 600 delayed by a buffer chip, in accordance with still yet another embodiment. As an option, the write operations 600 may be implemented in the context of the architecture and environment of FIGS. 1-5 . Of course, however, the write operations 600 may be used in any desired environment. Again, it should also be noted that the aforementioned definitions may apply during the present description.
[0089] In order to be compliant with the protocol utilized by the DRAM circuits in the stack, a buffer chip (e.g. see the buffer chip 202 of FIGS. 2A-E , etc.) may provide an additional delay, over and beyond the delay of the address and control signals through the buffer chip, between receiving the write operation and address from the memory controller (and/or optionally from a register and/or AMB, etc.), and sending it to the DRAM circuits in the stack. The additional delay may be equal to j clocks, where j is the cumulative delay of the address and control signals through the buffer chip and the delay of the data signals through the buffer chip. As another option, the write address and operation may be delayed by a register chip on a DIMM, by an AMB, or be the memory controller.
[0090] FIG. 7 shows early write data 700 from an AMB, in accordance with another embodiment. As an option, the early write data 700 may be implemented in the context of the architecture and environment of FIGS. 1-5 . Of course, however, the early write data 700 may be used in any desired environment. It should also be noted that the aforementioned definitions may apply during the present description.
[0091] As shown, an AMB on an FB-DIMM may be designed to send write data earlier to buffered stacks instead of delaying the write address and operation, as described in reference to FIG. 6 . Specifically, an early write latency 702 may be utilized to send the write data to the buffered stack. Thus, correct timing of the write operation at the inputs of the DRAM circuits in the stack may be ensured.
[0092] For example, a buffer chip (e.g. see the buffer chip 202 of FIGS. 2A-E , etc.) may have a cumulative latency of 2, in which case, the AMB may send the write data 2 clock cycles earlier to the buffered stack. It should be noted that this scheme may not be possible in the case of registered DIMMs since the memory controller may be designed data directly to the buffered stacks. As an option, a memory controller may be designed to send write data earlier so that write operations have the correct timing at the input of the DRAM circuits in the stack without requiring the buffer chip to delay the write address and operation.
[0093] FIG. 8 shows address bus conflicts 800 caused by delayed write operations, in accordance with yet another embodiment. As mentioned earlier, the delaying of the write addresses and operations may be performed by a buffer chip, or optionally a register, AMB, etc., in a manner that is completely transparent to the memory controller of a host system. However, since the memory controller is unaware of this delay, it may schedule subsequent operations, such as for example activate or precharge operations, which may collide with the delayed writes on the address bus from the buffer chip to the DRAM circuits in the stack. As shown, an activate operation 802 may interfere with a write operation 804 that has been delayed. Thus, a delay of activate operations may be employed, as will be described in further detail with respect to FIG. 9 .
[0094] FIGS. 9A-B show variable delays 900 and 950 of operations through a buffer chip, in accordance with another embodiment. As an option, the variable delays 900 and 950 may be implemented in the context of the architecture and environment of FIGS. 1-8 . Of course, however, the variable delays 900 and 950 may be carried out in any desired environment. It should also be noted that the aforementioned definitions may apply during the present description.
[0095] In order to prevent conflicts on an address bus between the buffer chip and its associated stack(s), either the write operation or the precharge/activate operation may be delayed. As shown, a buffer chip (e.g. see the buffer chip 202 of FIGS. 2A-E , etc.) may delay the precharge/activate operations 952A-C/902A-C. In particular, the buffer chip may make the buffered stack appear as one or more larger capacity DRAM circuits that have longer tRCD (RAS to CAS delay) and tRP (i.e. precharge time) parameters.
[0096] For example, if the cumulative latency through a buffer chip is 2 clock cycles while the native read CAS latency of the DRAM circuits is 4 clock cycles, then in order to hide the delay of the address/control signals and the data signals through the buffer chip, the buffered stack may appear as one or more larger capacity DRAM circuits with a read CAS latency of 6 clock cycles to the memory controller. In addition, if the tRCD and tRP of the DRAM circuits is 4 clock cycles each, the buffered stack may appear as one or more larger capacity DRAM circuits with tRCD of 6 clock cycles and tRP of 6 clock cycles in order to allow a buffer chip (e.g. see the buffer chip 202 of FIGS. 2A-E , etc.) to delay the activate and precharge operations in a manner that is transparent to the memory controller. Specifically, a buffered stack that uses 4-4-4 DRAM circuits (i.e. CAS latency=4, tRCD=4, tRP=4) may appear as one or at least one larger capacity DRAM circuits with 6-6-6 timing (i.e. CAS latency=6, tRCD=6, tRP=6).
[0097] Since the buffered stack appears to the memory controller as having a tRCD of 6 clock cycles, the memory controller may schedule a column operation to a bank 6 clock cycles after an activate (e.g. row) operation to the same bank. However, the DRAM circuits in the stack may actually have a tRCD of 4 clock cycles. Thus, the buffer chip may have the ability to delay the activate operation by up to 2 clock cycles in order to avoid any conflicts on the address bus between the buffer chip and the DRAM circuits in the stack while still ensuring correct read and write timing on the channel between the memory controller and the buffered stack.
[0098] As shown, the buffer chip may issue the activate operation to the DRAM circuits one, two, or three clock cycles after it receives the activate operation from the memory controller, register, or AMB. The actual delay of the activate operation through the buffer chip may depend on the presence of absence of other DRAM operations that may conflict with the activate operation, and may optionally change from one activate operation to another.
[0099] Similarly, since the buffered stack may appear to the memory controller as at least one larger capacity DRAM circuit with a tRP of 6 clock cycles, the memory controller may schedule a subsequent activate (e.g. row) operation to a bank a minimum of 6 clock cycles after issuing a precharge operation to that bank. However, since the DRAM circuits in the stack actually have a tRP of 4 clock cycles, the buffer chip may have the ability to delay issuing the precharge operation to the DRAM circuits in the stack by up to 2 clock cycles in order to avoid any conflicts on the address bus between the buffer chip and the DRAM circuits in the stack. In addition, even if there are no conflicts on the address bus, the buffer chip may still delay issuing a precharge operation in order to satisfy the tRAS requirement of the DRAM circuits.
[0100] 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 requirement of the DRAM circuits. The buffer chip may issue the precharge operation to the DRAM circuits one, two, or three clock cycles after it receives the precharge operation from the memory controller, register, or AMB. The actual delay of the precharge operation through the buffer chip may depend on the presence or absence of address bus conflicts or tRAS violations, and may change from one precharge operation to another.
[0101] FIG. 10 shows a buffered stack 1000 of four 512 b DRAM circuits mapped to a single 2 Gb DRAM circuit, in accordance with yet another embodiment. As an option, the buffered stack 1000 may be implemented in the context of the architecture and environment of FIGS. 1-9 . Of course, however, the buffered stack 1000 may be carried out in any desired environment. It should also be noted that the aforementioned definitions may apply during the present description.
[0102] The multiple DRAM circuits 1002A-D buffered in the stack by the buffer chip 1004 may appear as a least one larger capacity DRAM circuit to the memory controller. However, the combined power dissipation of such DRAM circuits 1002A-D may be much higher than the power dissipation of a monolithic DRAM of the same capacity. For example, the buffered stack may consist of four 512 Mb DDR2 SDRAM circuits that appear to the memory controller as a single 2 Gb SDRAM. As a result, a DIMM containing multiple buffered stacks may dissipate much more power than a standard DIMM built using monolithic DRAM circuits. This increased power dissipation may limit the widespread adoption of DIMMs that use buffered stacks.
[0103] Thus, a power management technique that reduces the power dissipation of DIMMs that contain buffered stacks of DRAM circuits may be utilized. Specifically, the DRAM circuits 1002A-D may be opportunistically placed in a precharge power down mode using the clock enable (CKE) pin of the DRAM circuits 1002A-D. For example, a single rank registered DIMM (R-DIMM) may contain a plurality of buffered stacks of DRAM circuits 1002A-D, where each stack consists of four x4 512 Mb DDR2 SDRAM circuits 1002A-D and appears as a single x4 2 Gb DDR2 SDRAM circuit to the memory controller. A 2 Gb DDR2 SDRAM may generally have eight banks as specified by JEDEC. Therefore, the buffer chip 1004 may map each 512 Mb DRAM circuit in the stack to two banks of the equivalent 2 Gb DRAM, as shown.
[0104] The memory controller of the host system may open and close pages in the banks of the DRAM circuits 1002A-D based on the memory requests it receives from the rest of the system. In various embodiments, no more than one page may be able to be open in a bank at any given time. For example, with respect to FIG. 10 , since each DRAM circuits 1002A-D in the stack is mapped to two banks of the equivalent larger DRAM, at any given time a DRAM circuit 1002A-D may have two open pages, one open page, or no open pages. When a DRAM circuit 1002A-D has no open pages, the power management scheme may place that DRAM circuit 1002A-D in the precharge power down mode by de-asserting its CKE input.
[0105] The CKE inputs of the DRAM circuits 1002A-D in a stack may be controlled by the buffer chip 1004, by a chip on an R-DIMM, by an AMB on a FB-DIMM, or be the memory controller in order to implement the power management scheme described hereinabove. In one embodiment, this power management scheme may be particularly efficient when the memory controller implements a closed page policy.
[0106] Another optional power management scheme may include mapping a plurality of DRAM circuits to a single bank of the larger capacity DRAM seen by the memory controller. For example, a buffered stack of sixteen x4 256 Mb DDR2 SDRAM circuits may appear to the memory controller as a single x4 4 Mb DDR2 SDRAM circuit. Since a 4 Gb DDR2 SDRAM circuit is specified by JEDEC to have eight banks, each bank of the 4 Gb DDR2 SDRAM circuit may be 512 Mb. Thus, two of the 256 Mb DDR2 SDRAM circuits may be mapped by the buffer chip 1004 to a single bank of the equivalent 4 Gb DDR2 SDRAM circuit seen by the memory controller.
[0107] In this way, bank 0 of the 4 Gb DDR2 SDRAM circuit may be mapped by the buffer chip to two 256 Mb DDR2 SDRAM circuit (e.g. DRAM A and DRAM B) in the stack. However, since only one page can be open in a bank at any given time, only one of DRAM A or DRAM B may be in the active state at any given time. If the memory controller opens a page in DRAM A, then DRAM B may be placed in the precharge power down mode by de-asserting its CKE input. As another option, if the memory controller opens a page in DRAM B, DRAM A may be placed in the precharge power down mode by de-asserting its CKE input. This technique may ensure that if p DRAM circuits are mapped to a bank of the larger capacity DRAM circuit seen by the memory controller, then p−1 of the p DRAM circuits may continuously (e.g. always, etc.) be subjected to a power saving operation. The power saving operation may, for example, comprise operating in precharge power down mode except when refresh is required. Of course, power-savings may also occur in other embodiments without such continuity.
[0108] FIG. 11 illustrates a method 1100 for refreshing a plurality of memory circuits, in accordance with still yet another embodiment. As an option, the method 1100 may be implemented in the context of the architecture and environment of any one or more of FIGS. 1-10 . For example, the method 1100 may be carried out by the interface circuit 102 of FIG. 1 . Of course, however, the method 1100 may be carried out in any desired environment. It should also be noted that the aforementioned definitions may apply during the present description.
[0109] As shown, a refresh signal is received in operation 1102. In one optional embodiment, such refresh control signal may, for example, be received from a memory controller, where such memory controller intends to refresh a simulated memory circuit(s).
[0110] In response to the receipt of such refresh control signal, a plurality of refresh control signals are sent to a plurality of the memory circuits (e.g. see the memory circuits 104A, 104B, 104N of FIG. 1 , etc.), at different times. See operation 1104. Such refresh control signals may or may not each include the refresh control signal of operation 1102 or an instantiation/copy thereof. Of course, in other embodiments, the refresh control signals may each include refresh control signals that are different in at least one aspect (e.g. format, content, etc.).
[0111] During use of still additional embodiments, at least one first refresh control signal may be sent to a first subset (e.g. of one or more) of the memory circuits at a first time and at least one second refresh control signal may be sent to a second subset (e.g. of one or more) of the memory circuits at a second time. Thus, in some embodiments, a single refresh control signal may be sent to a plurality of the memory circuits (e.g. a group of memory circuits, etc.). Further, a plurality of the refresh control signals may be sent to a plurality of the memory circuits. To this end, refresh control signals may be sent individually or to groups of memory circuits, as desired.
[0112] Thus, in still yet additional embodiments, the refresh control signals may be sent after a delay in accordance with a particular timing. In one embodiment, for example, the timing in which the refresh control signals are sent to the memory circuits may be selected to minimize a current draw. This may be accomplished in various embodiments by staggering a plurality of refresh control signals. In still other embodiments, the timing in which the refresh control signals are sent to the memory circuits may be selected to comply with a tRFC parameter associated with each of the memory circuits.
[0113] To this end, in the context of an example involving a plurality of DRAM circuits (e.g. see the embodiments of FIGS. 1-2E , etc.). DRAM circuits of any desired size may receive periodic refresh operations to maintain the integrity of data 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 to a DRAM circuit, a minimum time (e.g. denoted by tRFC) may be required to elapse before another control signal may be issued to that DRAM circuit. The tRFC parameter may therefore increase as the size of the DRAM circuit increases.
[0114] When the buffer chip receives a refresh control signal from the memory controller (FIG. 12. 1202 ), it may refresh the smaller DRAM circuits within the span of time specified by the tRFC associated with the emulated DRAM circuit. Since the tRFC of the emulated DRAM circuits is larger than that of the small DRAM circuits, it may not be necessary to issue refresh control signals to all of the smaller DRAM circuits simultaneously. Refresh control signals may be issued separately to individual DRAM circuits or may be issued to groups of DRAM circuits, provided that the tRFC requirement of the smaller DRAM circuits is satisfied by the time the tRFC of the emulated DRAM circuits has elapsed (FIG. 12. 1204 and 1206). In use, the refreshes may be spaced to minimize the peak current draw of the combination buffer chip and DRAM circuit set during a refresh operation.
[0115] While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. For example, any of the network elements may employ any of the desired functionality set forth hereinabove. Thus, the breadth and scope of a preferred embodiment should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.
Claims
Post-issuance certificates present
The text shown below may not reflect later post-issuance changes.
What is claimed is:
1. A method, comprising:
simulating at least one first DRAM memory circuit having a first memory capacity and a first row refresh cycle time (tRFC) using an interface circuit connected to a plurality of second DRAM memory circuits each having a second memory capacity that is smaller than the first memory capacity and a second tRFC that is less than the first tRFC;
receiving, at the interface circuit, a refresh control signal from a memory controller; and
in response to receiving the refresh control signal from the memory controller, sending from the interface circuit a first refresh control signal to a first subset of the second DRAM memory circuits and a second refresh control signal to a second subset of the second DRAM memory circuits, wherein the first and the second refresh control signals are sent at different times with the different times being selected so that refresh cycles of the second DRAM memory circuits initiated by the first and second refresh control signals complete within a time span specified by the first tRFC associated with the at least one first DRAM memory circuit.
2. The method of claim 1, wherein the different times at which the first refresh control signal to the first subset of the second DRAM memory circuits and the second refresh control signal to the second subset of the second DRAM memory circuits are sent are selected to minimize a current draw.
3. The method of claim 1, wherein the different times at which the first refresh control signal to the first subset of the second DRAM memory circuits and the second refresh control signal to the second subset of the second DRAM memory circuits are sent are selected to minimize a peak current draw.
4. The method of claim 1, wherein the different times at which the first refresh control signal to the first subset of the second DRAM memory circuits and the second refresh control signal to the second subset of the second DRAM memory circuits are sent to the plurality of second memory circuits are selected to comply with a respective second row refresh cycle time (tRFC) associated with each of the second DRAM memory circuits.
5. The method of claim 1, wherein the sending is performed by the interface circuit, the interface circuit interfacing the plurality of second DRAM memory circuits and the memory controller.
6. The method of claim 5, wherein the interface circuit interfaces the memory controller and simulates the at least one first DRAM memory circuit.
7. The method of claim 5, wherein the different times at which the first refresh control signal to the first subset of the second DRAM memory circuits and the second refresh control signal to the second subset of the second DRAM memory circuits are sent are selected to minimize a current draw.
8. The method of claim 1, wherein the first tRFC associated with the at least one simulated first DRAM memory circuit is greater than any second tRFC associated with any of the second DRAM memory circuits.
9. The method of claim 8, wherein a timing in which the plurality of refresh control signals are sent to the plurality of second DRAM memory circuits is selected to ensure that the respective second tRFC associated with each of the second DRAM memory circuits is satisfied before the first tRFC associated with the at least one first DRAM memory circuit elapses.
10. The method of claim 1, wherein at least one of the first subset and the second subset of the plurality of second DRAM memory circuits includes only a single second DRAM memory circuit.
11. The method of claim 1, wherein at least one of the first subset and the second subset includes more than one of the second DRAM memory circuits.
12. The method of claim 1, wherein each of the second DRAM memory circuits includes dynamic random access memory (DRAM).
13. The method of claim 1, wherein each of the second DRAM memory circuits includes a monolithic DRAM.
14. The method of claim 13, wherein the plurality of second DRAM memory circuits arc stacked.
15. The method of claim 1, wherein one of the first and second refresh control signals is sent to two or more of the plurality of second DRAM memory circuits.
16. The method of claim 1, wherein the first and second refresh control signals are each sent to two or more of the plurality of second DRAM memory circuits.
17. The method of claim 1, wherein at least one of the first subset and the second subset includes a rank of second DRAM memory circuits.
18. The method of claim 1, wherein the refresh control signal from the memory controller is received from the memory controller intending to refresh the at least one first DRAM memory circuit.
19. The method of claim 1, wherein the at least one first DRAM memory circuit and the plurality of second DRAM memory circuits have at least one aspect that is different, the at least one aspect includes at least one of a signal, a timing, and a logical interface.
20. The method of claim 1, wherein at least one of the first and second refresh control signals is a copy of the first refresh control signal.
21. The method of claim 1, wherein the first and second refresh controls signals are different in at least one characteristic.
22. The method of claim 21, wherein the at least one characteristic includes format.
23. The method of claim 1, further comprising receiving, at the interface circuit, a signal from at least one of the plurality of second DRAM memory circuits and communicating the signal to a system after a delay.
24. An apparatus, comprising:
a plurality of dynamic random access memory (DRAM) memory circuits each having a first memory capacity and a first row refresh cycle time (tRFC); and
an interface circuit operable to:
communicate with the plurality of DRAM memory circuits and a system;
emulate at least one memory circuit having a second memory capacity and a second tRF'C, the first memory capacity being smaller than the second memory capacity and the first tRFC being less than the second tRFC;
receive a refresh control signal from the system; and
send, in response to receiving the refresh control signal from the system, a first refresh to a control signal to a first subset of the DRAM memory circuits and a second refresh control signal second subset of the DRAM memory circuits, wherein the interface circuit is operable to send the first and the second refresh control signals at different times with the different times being selected so that refresh cycles of the DRAM memory circuits initiated by the first and second refresh control signals complete within a time span specified by the second tRFC associated with the at least one emulated memory circuit.
25. The apparatus of claim 24, wherein the interface circuit is further operable to receive a signal from at least one of the plurality of DRAM memory circuits and to communicate the signal to the system after a delay.
26. The apparatus of claim 24, wherein the plurality of DRAM memory circuits and the at least one emulated memory circuit differ in at least one aspect, the at least one aspect including at least one of a signal, a timing, and a logical interface.
27. The apparatus of claim 24, wherein one or more of the plurality of DRAM memory circuits are each operable to receive a data signal intended for the at least one emulated memory circuit.
28. The apparatus of claim 24, wherein the interface circuit is further operable to communicate a data signal intended for the at least one emulated memory circuit to one or more of the plurality of DRAM memory circuits.
29. The apparatus of claim 24, wherein the interface circuit is operable to receive the first refresh control signal from the system, the first refresh control signal intending to refresh the at least one emulated memory circuit.
30. An apparatus, comprising:
a plurality of physical DRAM memory circuits; and
an interface circuit in communication with the plurality of physical DRAM memory circuits, the interlace circuit operable to:
communicate with a system;
communicate with the plurality of physical DRAM memory circuits;
emulate at least one memory circuit having a second memory capacity and a second tRFC, the first memory capacity being smaller than the second memory capacity and the first tRFC being less than the second tRFC;
receive a refresh control signal from the system; and
send, in response to receiving the refresh control signal from the system, a first refresh control signal to a first subset of the DRAM memory circuits and a second refresh control signal to a second subset of the DRAM memory circuits, wherein the interface circuit is operable to send the first and the second refresh control signals at different times with the different times being selected so that refresh cycles of the DRAM memory circuits initiated by the first and second refresh control signals complete within a time span specified by the second tRFC associated with the at least one emulated memory circuit.
31. The apparatus of claim 30, wherein the interface circuit is further operable to receive a signal from at least one of the plurality of physical DRAM memory circuits and to communicate the signal to the system after a delay.
32. The apparatus of claim 30, wherein the plurality of physical DRAM memory circuits and the at least one emulated memory circuit differ in at least one aspect, the at least one aspect including at least one of a signal, a timing, and a logical interface.
33. The apparatus of claim 30, wherein one or more of the plurality of physical DRAM memory circuits are each operable to receive a data signal intended for the at least one emulated memory circuit.
34. The apparatus of claim 30, wherein the interface circuit is operable to receive the first refresh control signal from the system, the first refresh control signal intending to refresh the at least one emulated memory circuit.
Patent Citations (733)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4069452(A) | 1978-01-01 | Conway et al. | Applicant |
| US4323965(A) | 1982-04-01 | Johnson et al. | Applicant |
| US4334307(A) | 1982-06-01 | Bourgeois et al. | Applicant |
| US4345319(A) | 1982-08-01 | Bernardini et al. | Applicant |
| US4392212(A) | 1983-07-01 | Miyasaka et al. | Applicant |
| US4525921(A) | 1985-07-01 | Carson et al. | Applicant |
| US4592019(A) | 1986-05-01 | Huang et al. | Applicant |
| US4646128(A) | 1987-02-01 | Carson et al. | Applicant |
| US4698748(A) | 1987-10-01 | Juzswik et al. | Applicant |
| US4706166(A) | 1987-11-01 | Go | Applicant |
| US4710903(A) | 1987-12-01 | Hereth et al. | Applicant |
| US4764846(A) | 1988-08-01 | Go | Applicant |
| US4780843(A) | 1988-10-01 | Tietjen | Applicant |
| US4794597(A) | 1988-12-01 | Ooba et al. | Applicant |
| US4796232(A) | 1989-01-01 | House | Applicant |
| US4841440(A) | 1989-06-01 | Yonezu et al. | Applicant |
| US4862347(A) | 1989-08-01 | Rudy | Examiner |
| US4884237(A) | 1989-11-01 | Mueller et al. | Applicant |
| US4887240(A) | 1989-12-01 | Garverick et al. | Applicant |
| US4888687(A) | 1989-12-01 | Allison et al. | Applicant |
| US4899107(A) | 1990-02-01 | Corbett et al. | Applicant |
| US4912678(A) | 1990-03-01 | Mashiko | Applicant |
| US4922451(A) | 1990-05-01 | Lo et al. | Applicant |
| US4935734(A) | 1990-06-01 | Austin | Applicant |
| US4937791(A) | 1990-06-01 | Steele et al. | Applicant |
| US4982265(A) | 1991-01-01 | Watanabe et al. | Applicant |
| US4983533(A) | 1991-01-01 | Go | Applicant |
| US5025364(A) | 1991-06-01 | Zellmer | Applicant |
| US5072424(A) | 1991-12-01 | Brent et al. | Applicant |
| US5083266(A) | 1992-01-01 | Watanabe | Applicant |
| US5104820(A) | 1992-04-01 | Go et al. | Applicant |
| US5193072(A) | 1993-03-01 | Frenkil et al. | Examiner |
| US5220672(A) | 1993-06-01 | Nakao et al. | Applicant |
| US5241266(A) | 1993-08-01 | Ahmad et al. | Applicant |
| US5252807(A) | 1993-10-01 | Chizinsky | Applicant |
| US5257233(A) | 1993-10-01 | Schaefer | Applicant |
| US5278796(A) | 1994-01-01 | Tillinghast et al. | Applicant |
| US5282177(A) | 1994-01-01 | McLaury | Applicant |
| US5332922(A) | 1994-07-01 | Oguchi et al. | Applicant |
| US5347428(A) | 1994-09-01 | Carson et al. | Applicant |
| US5384745(A) | 1995-01-01 | Konishi et al. | Applicant |
| US5388265(A) | 1995-02-01 | Volk | Applicant |
| US5408190(A) | 1995-04-01 | Wood et al. | Applicant |
| US5432729(A) | 1995-07-01 | Carson et al. | Applicant |
| US5448511(A) | 1995-09-01 | Paurus et al. | Applicant |
| US5453434(A) | 1995-09-01 | Albaugh et al. | Applicant |
| US5467455(A) | 1995-11-01 | Gay et al. | Applicant |
| US5483497(A) | 1996-01-01 | Mochizuki et al. | Applicant |
| US5498886(A) | 1996-03-01 | Hsu et al. | Applicant |
| US5502333(A) | 1996-03-01 | Bertin et al. | Applicant |
| US5502667(A) | 1996-03-01 | Bertin et al. | Applicant |
| US5513135(A) | 1996-04-01 | Dell et al. | Applicant |
| US5513339(A) | 1996-04-01 | Agrawal et al. | Applicant |
| US5519832(A) | 1996-05-01 | Warchol | Applicant |
| US5526320(A) | 1996-06-01 | Zagar et al. | Applicant |
| US5530836(A) | 1996-06-01 | Busch et al. | Applicant |
| US5550781(A) | 1996-08-01 | Sugawara et al. | Examiner |
| US5559990(A) | 1996-09-01 | Cheng et al. | Applicant |
| US5561622(A) | 1996-10-01 | Bertin et al. | Applicant |
| US5563086(A) | 1996-10-01 | Bertin et al. | Applicant |
| US5566344(A) | 1996-10-01 | Hall et al. | Applicant |
| US5581498(A) | 1996-12-01 | Ludwig et al. | Applicant |
| US5581779(A) | 1996-12-01 | Hall et al. | Applicant |
| US5590071(A) | 1996-12-01 | Kolor et al. | Applicant |
| US5598376(A) | 1997-01-01 | Merritt et al. | Applicant |
| US5604714(A) | 1997-02-01 | Manning et al. | Applicant |
| US5606710(A) | 1997-02-01 | Hall et al. | Applicant |
| US5610864(A) | 1997-03-01 | Manning | Applicant |
| US5623686(A) | 1997-04-01 | Hall et al. | Applicant |
| US5627791(A) | 1997-05-01 | Wright et al. | Applicant |
| US5640337(A) | 1997-06-01 | Huang et al. | Applicant |
| US5640364(A) | 1997-06-01 | Merritt et al. | Applicant |
| US5652724(A) | 1997-07-01 | Manning | Applicant |
| US5654204(A) | 1997-08-01 | Anderson | Applicant |
| US5661677(A) | 1997-08-01 | Rondeau et al. | Applicant |
| US5661695(A) | 1997-08-01 | Zagar et al. | Applicant |
| US5668773(A) | 1997-09-01 | Zagar et al. | Applicant |
| US5675549(A) | 1997-10-01 | Ong et al. | Applicant |
| US5680342(A) | 1997-10-01 | Frankeny | Applicant |
| US5682354(A) | 1997-10-01 | Manning | Applicant |
| US5692121(A) | 1997-11-01 | Bozso et al. | Applicant |
| US5692202(A) | 1997-11-01 | Kardach et al. | Applicant |
| US5696732(A) | 1997-12-01 | Zagar et al. | Applicant |
| US5702984(A) | 1997-12-01 | Bertin et al. | Applicant |
| US5703813(A) | 1997-12-01 | Manning et al. | Applicant |
| US5706247(A) | 1998-01-01 | Merritt et al. | Applicant |
| US5717654(A) | 1998-02-01 | Manning | Applicant |
| US5721859(A) | 1998-02-01 | Manning | Applicant |
| US5724288(A) | 1998-03-01 | Cloud et al. | Applicant |
| US5729503(A) | 1998-03-01 | Manning | Applicant |
| US5729504(A) | 1998-03-01 | Cowles | Applicant |
| US5742792(A) | 1998-04-01 | Yanai et al. | Applicant |
| US5748914(A) | 1998-05-01 | Barth et al. | Applicant |
| US5752045(A) | 1998-05-01 | Chen | Applicant |
| US5757703(A) | 1998-05-01 | Merritt et al. | Applicant |
| US5761703(A) | 1998-06-01 | Bolyn | Applicant |
| US5781766(A) | 1998-07-01 | Davis | Applicant |
| US5787457(A) | 1998-07-01 | Miller et al. | Applicant |
| US5798961(A) | 1998-08-01 | Heyden et al. | Applicant |
| US5802010(A) | 1998-09-01 | Zagar et al. | Applicant |
| US5802395(A) | 1998-09-01 | Connolly et al. | Applicant |
| US5802555(A) | 1998-09-01 | Shigeeda | Applicant |
| US5812488(A) | 1998-09-01 | Zagar et al. | Applicant |
| US5831833(A) | 1998-11-01 | Shirakawa et al. | Applicant |
| US5831931(A) | 1998-11-01 | Manning | Applicant |
| US5831932(A) | 1998-11-01 | Merritt et al. | Applicant |
| US5834838(A) | 1998-11-01 | Anderson | Applicant |
| US5835435(A) | 1998-11-01 | Bogin et al. | Applicant |
| US5838177(A) | 1998-11-01 | Keeth | Applicant |
| US5841580(A) | 1998-11-01 | Farmwald et al. | Applicant |
| US5843799(A) | 1998-12-01 | Hsu et al. | Applicant |
| US5843807(A) | 1998-12-01 | Burns | Applicant |
| US5845108(A) | 1998-12-01 | Yoo et al. | Applicant |
| US5850368(A) | 1998-12-01 | Ong et al. | Applicant |
| US5859792(A) | 1999-01-01 | Rondeau et al. | Applicant |
| US5860106(A) | 1999-01-01 | Domen et al. | Applicant |
| US5870347(A) | 1999-02-01 | Keeth et al. | Applicant |
| US5870350(A) | 1999-02-01 | Bertin et al. | Applicant |
| US5872907(A) | 1999-02-01 | Griess et al. | Applicant |
| US5875142(A) | 1999-02-01 | Chevallier | Applicant |
| US5884088(A) | 1999-03-01 | Kardach et al. | Applicant |
| US5901105(A) | 1999-05-01 | Ong et al. | Applicant |
| US5903500(A) | 1999-05-01 | Tsang et al. | Applicant |
| US5905688(A) | 1999-05-01 | Park | Applicant |
| US5907512(A) | 1999-05-01 | Parkinson et al. | Applicant |
| US5915105(A) | 1999-06-01 | Farmwald et al. | Applicant |
| US5915167(A) | 1999-06-01 | Leedy | Applicant |
| US5917758(A) | 1999-06-01 | Keeth | Applicant |
| US5923611(A) | 1999-07-01 | Ryan | Applicant |
| US5924111(A) | 1999-07-01 | Huang et al. | Applicant |
| US5926435(A) | 1999-07-01 | Park et al. | Applicant |
| US5929650(A) | 1999-07-01 | Pappert et al. | Applicant |
| US5943254(A) | 1999-08-01 | Bakeman, Jr. et al. | Applicant |
| US5946265(A) | 1999-08-01 | Cowles | Applicant |
| US5949254(A) | 1999-09-01 | Keeth | Applicant |
| US5953215(A) | 1999-09-01 | Karabatsos | Applicant |
| US5953263(A) | 1999-09-01 | Farmwald et al. | Applicant |
| US5954804(A) | 1999-09-01 | Farmwald et al. | Applicant |
| US5956233(A) | 1999-09-01 | Yew et al. | Applicant |
| US5962435(A) | 1999-10-01 | Park et al. | Applicant |
| US5963429(A) | 1999-10-01 | Chen | Applicant |
| US5963463(A) | 1999-10-01 | Rondeau et al. | Applicant |
| US5963464(A) | 1999-10-01 | Dell et al. | Applicant |
| US5963504(A) | 1999-10-01 | Manning | Applicant |
| US5966724(A) | 1999-10-01 | Ryan | Applicant |
| US5966727(A) | 1999-10-01 | Nishino | Applicant |
| US5969996(A) | 1999-10-01 | Muranaka et al. | Examiner |
| US5973392(A) | 1999-10-01 | Senba et al. | Applicant |
| US5995424(A) | 1999-11-01 | Lawrence et al. | Applicant |
| US5995443(A) | 1999-11-01 | Farmwald et al. | Applicant |
| US6002613(A) | 1999-12-01 | Cloud et al. | Applicant |
| US6002627(A) | 1999-12-01 | Chevallier | Applicant |
| US6014339(A) | 2000-01-01 | Kobayashi et al. | Applicant |
| US6016282(A) | 2000-01-01 | Keeth | Applicant |
| US6026050(A) | 2000-02-01 | Baker et al. | Applicant |
| US6029250(A) | 2000-02-01 | Keeth | Applicant |
| US6032214(A) | 2000-02-01 | Farmwald et al. | Applicant |
| US6032215(A) | 2000-02-01 | Farmwald et al. | Applicant |
| US6034916(A) | 2000-03-01 | Lee | Applicant |
| US6034918(A) | 2000-03-01 | Farmwald et al. | Applicant |
| US6035365(A) | 2000-03-01 | Farmwald et al. | Applicant |
| US6038195(A) | 2000-03-01 | Farmwald et al. | Applicant |
| US6038673(A) | 2000-03-01 | Benn et al. | Applicant |
| US6044032(A) | 2000-03-01 | Li | Applicant |
| US6047073(A) | 2000-04-01 | Norris et al. | Applicant |
| US6047344(A) | 2000-04-01 | Kawasumi et al. | Applicant |
| US6053948(A) | 2000-04-01 | Vaidyanathan et al. | Applicant |
| US6058451(A) | 2000-05-01 | Bermingham et al. | Applicant |
| US6069504(A) | 2000-05-01 | Keeth | Applicant |
| US6070217(A) | 2000-05-01 | Connolly et al. | Applicant |
| US6073223(A) | 2000-06-01 | McAllister et al. | Applicant |
| US6075730(A) | 2000-06-01 | Barth et al. | Applicant |
| US6075744(A) | 2000-06-01 | Tsern et al. | Applicant |
| US6078546(A) | 2000-06-01 | Lee | Applicant |
| US6079025(A) | 2000-06-01 | Fung | Applicant |
| US6084434(A) | 2000-07-01 | Keeth | Applicant |
| US6088290(A) | 2000-07-01 | Ohtake et al. | Applicant |
| US6091251(A) | 2000-07-01 | Wood et al. | Applicant |
| USRE36839(E) | 2000-08-01 | Simmons et al. | Applicant |
| US6101152(A) | 2000-08-01 | Farmwald et al. | Applicant |
| US6101612(A) | 2000-08-01 | Jeddeloh | Applicant |
| US6108795(A) | 2000-08-01 | Jeddeloh | Applicant |
| US6111812(A) | 2000-08-01 | Gans et al. | Applicant |
| US6134638(A) | 2000-10-01 | Olarig et al. | Applicant |
| US6154370(A) | 2000-11-01 | Degani et al. | Applicant |
| US6166991(A) | 2000-12-01 | Phelan | Applicant |
| US6182184(B1) | 2001-01-01 | Farmwald et al. | Applicant |
| US6199151(B1) | 2001-03-01 | Williams et al. | Applicant |
| US6208168(B1) | 2001-03-01 | Rhee | Applicant |
| US6216246(B1) | 2001-04-01 | Shau | Applicant |
| US6222739(B1) | 2001-04-01 | Bhakta et al. | Applicant |
| US6233192(B1) | 2001-05-01 | Tanaka | Applicant |
| US6233650(B1) | 2001-05-01 | Johnson et al. | Applicant |
| US6240048(B1) | 2001-05-01 | Matsubara | Applicant |
| US6243282(B1) | 2001-06-01 | Rondeau et al. | Applicant |
| US6252807(B1) | 2001-06-01 | Suzuki et al. | Applicant |
| US6260097(B1) | 2001-07-01 | Farmwald et al. | Applicant |
| US6260154(B1) | 2001-07-01 | Jeddeloh | Applicant |
| US6262938(B1) | 2001-07-01 | Lee et al. | Applicant |
| US6266285(B1) | 2001-07-01 | Farmwald et al. | Applicant |
| US6266292(B1) | 2001-07-01 | Tsern et al. | Applicant |
| US6274395(B1) | 2001-08-01 | Weber | Applicant |
| US6279069(B1) | 2001-08-01 | Robinson et al. | Applicant |
| US6295572(B1) | 2001-09-01 | Wu | Applicant |
| US6298426(B1) | 2001-10-01 | Ajanovic | Applicant |
| US6304511(B1) | 2001-10-01 | Gans et al. | Applicant |
| US6307769(B1) | 2001-10-01 | Nuxoll et al. | Applicant |
| US6314051(B1) | 2001-11-01 | Farmwald et al. | Applicant |
| US6317352(B1) | 2001-11-01 | Halbert et al. | Applicant |
| US6317381(B1) | 2001-11-01 | Gans et al. | Applicant |
| US6324120(B2) | 2001-11-01 | Farmwald et al. | Applicant |
| US6326810(B1) | 2001-12-01 | Keeth | Applicant |
| US6327664(B1) | 2001-12-01 | Dell et al. | Applicant |
| US6330683(B1) | 2001-12-01 | Jeddeloh | Applicant |
| US6338108(B1) | 2002-01-01 | Motomura | Applicant |
| US6338113(B1) | 2002-01-01 | Kubo et al. | Applicant |
| US6341347(B1) | 2002-01-01 | Joy et al. | Applicant |
| US6343042(B1) | 2002-01-01 | Tsern et al. | Applicant |
| US6353561(B1) | 2002-03-01 | Funyu et al. | Applicant |
| US6356105(B1) | 2002-03-01 | Volk | Applicant |
| US6356500(B1) | 2002-03-01 | Cloud et al. | Applicant |
| US6362656(B2) | 2002-03-01 | Rhee | Applicant |
| US6363031(B2) | 2002-03-01 | Phelan | Applicant |
| US6378020(B2) | 2002-04-01 | Farmwald et al. | Applicant |
| US6381188(B1) | 2002-04-01 | Choi et al. | Applicant |
| US6381668(B1) | 2002-04-01 | Lunteren | Applicant |
| US6389514(B1) | 2002-05-01 | Rokicki | Applicant |
| US6392304(B1) | 2002-05-01 | Butler | Applicant |
| US6414868(B1) | 2002-07-01 | Wong et al. | Applicant |
| US6418034(B1) | 2002-07-01 | Weber et al. | Applicant |
| US6421754(B1) | 2002-07-01 | Kau et al. | Applicant |
| US6426916(B2) | 2002-07-01 | Farmwald et al. | Applicant |
| US6429029(B1) | 2002-08-01 | Eldridge et al. | Applicant |
| US6430103(B2) | 2002-08-01 | Nakayama et al. | Applicant |
| US6437600(B1) | 2002-08-01 | Keeth | Applicant |
| US6438057(B1) | 2002-08-01 | Ruckerbauer | Applicant |
| US6442698(B2) | 2002-08-01 | Nizar | Applicant |
| US6445591(B1) | 2002-09-01 | Kwong | Applicant |
| US6452826(B1) | 2002-09-01 | Kim et al. | Applicant |
| US6452863(B2) | 2002-09-01 | Farmwald et al. | Applicant |
| US6453400(B1) | 2002-09-01 | Maesako et al. | Applicant |
| US6453402(B1) | 2002-09-01 | Jeddeloh | Applicant |
| US6453434(B2) | 2002-09-01 | Delp et al. | Applicant |
| US6455348(B1) | 2002-09-01 | Yamaguchi | Applicant |
| US6457095(B1) | 2002-09-01 | Volk | Applicant |
| US6459651(B1) | 2002-10-01 | Lee et al. | Applicant |
| US6473831(B1) | 2002-10-01 | Schade | Applicant |
| US6480929(B1) | 2002-11-01 | Gauthier et al. | Applicant |
| US6487102(B1) | 2002-11-01 | Halbert et al. | Applicant |
| US6490161(B1) | 2002-12-01 | Johnson | Applicant |
| US6493789(B2) | 2002-12-01 | Ware et al. | Applicant |
| US6496440(B2) | 2002-12-01 | Manning | Applicant |
| US6496897(B2) | 2002-12-01 | Ware et al. | Applicant |
| US6498766(B2) | 2002-12-01 | Lee et al. | Applicant |
| US6510097(B2) | 2003-01-01 | Fukuyama | Applicant |
| US6510503(B2) | 2003-01-01 | Gillingham et al. | Applicant |
| US6512392(B2) | 2003-01-01 | Fleury et al. | Applicant |
| US6526471(B1) | 2003-02-01 | Shimomura et al. | Applicant |
| US6526473(B1) | 2003-02-01 | Kim | Applicant |
| US6526484(B1) | 2003-02-01 | Stacovsky et al. | Applicant |
| US6545895(B1) | 2003-04-01 | Li et al. | Applicant |
| US6546446(B2) | 2003-04-01 | Farmwald et al. | Applicant |
| US6553450(B1) | 2003-04-01 | Dodd et al. | Examiner |
| US6560158(B2) | 2003-05-01 | Choi et al. | Applicant |
| US6563337(B2) | 2003-05-01 | Dour | Applicant |
| US6563759(B2) | 2003-05-01 | Yahata et al. | Applicant |
| US6564281(B2) | 2003-05-01 | Farmwald et al. | Applicant |
| US6564285(B1) | 2003-05-01 | Mills et al. | Applicant |
| US6574150(B2) | 2003-06-01 | Suyama et al. | Applicant |
| US6584037(B2) | 2003-06-01 | Farmwald et al. | Applicant |
| US6587912(B2) | 2003-07-01 | Leddige et al. | Applicant |
| US6590822(B2) | 2003-07-01 | Hwang et al. | Applicant |
| US6594770(B1) | 2003-07-01 | Sato et al. | Applicant |
| US6597616(B2) | 2003-07-01 | Tsern et al. | Applicant |
| US6597617(B2) | 2003-07-01 | Ooishi et al. | Applicant |
| US6614700(B2) | 2003-09-01 | Dietrich et al. | Applicant |
| US6618267(B1) | 2003-09-01 | Dalal et al. | Applicant |
| US6618791(B1) | 2003-09-01 | Dodd et al. | Applicant |
| US6621760(B1) | 2003-09-01 | Ahmad et al. | Applicant |
| US6631086(B1) | 2003-10-01 | Bill et al. | Applicant |
| US6639820(B1) | 2003-10-01 | Khandekar et al. | Applicant |
| US6646939(B2) | 2003-11-01 | Kwak | Applicant |
| US6650588(B2) | 2003-11-01 | Yamagata | Examiner |
| US6650594(B1) | 2003-11-01 | Lee et al. | Applicant |
| US6657918(B2) | 2003-12-01 | Foss et al. | Applicant |
| US6657919(B2) | 2003-12-01 | Foss et al. | Applicant |
| US6658016(B1) | 2003-12-01 | Dai et al. | Applicant |
| US6658530(B1) | 2003-12-01 | Robertson et al. | Applicant |
| US6664625(B2) | 2003-12-01 | Hiruma | Applicant |
| US6665224(B1) | 2003-12-01 | Lehmann et al. | Applicant |
| US6665227(B2) | 2003-12-01 | Fetzer | Applicant |
| US6674154(B2) | 2004-01-01 | Minamio et al. | Applicant |
| US6683372(B1) | 2004-01-01 | Wong et al. | Applicant |
| US6684292(B2) | 2004-01-01 | Piccirillo et al. | Applicant |
| US6690191(B2) | 2004-02-01 | Wu et al. | Applicant |
| US6697295(B2) | 2004-02-01 | Farmwald et al. | Applicant |
| US6701446(B2) | 2004-03-01 | Tsern et al. | Applicant |
| US6705877(B1) | 2004-03-01 | Li et al. | Applicant |
| US6708144(B1) | 2004-03-01 | Merryman et al. | Applicant |
| US6710430(B2) | 2004-03-01 | Minamio et al. | Applicant |
| US6711043(B2) | 2004-03-01 | Friedman et al. | Examiner |
| US6713856(B2) | 2004-03-01 | Tsai et al. | Applicant |
| US6714891(B2) | 2004-03-01 | Dendinger | Applicant |
| US6724684(B2) | 2004-04-01 | Kim | Applicant |
| US6731527(B2) | 2004-05-01 | Brown | Applicant |
| US6744687(B2) | 2004-06-01 | Koo et al. | Applicant |
| US6747887(B2) | 2004-06-01 | Halbert et al. | Applicant |
| US6751113(B2) | 2004-06-01 | Bhakta et al. | Applicant |
| US6751696(B2) | 2004-06-01 | Farmwald et al. | Applicant |
| US6754129(B2) | 2004-06-01 | Khatri et al. | Applicant |
| US6754132(B2) | 2004-06-01 | Kyung | Applicant |
| US6757751(B1) | 2004-06-01 | Gene | Applicant |
| US6762948(B2) | 2004-07-01 | Kyun et al. | Applicant |
| US6765812(B2) | 2004-07-01 | Anderson | Applicant |
| US6766469(B2) | 2004-07-01 | Larson et al. | Applicant |
| US6771526(B2) | 2004-08-01 | LaBerge | Applicant |
| US6772359(B2) | 2004-08-01 | Kwak et al. | Applicant |
| US6779097(B2) | 2004-08-01 | Gillingham et al. | Applicant |
| US6785767(B2) | 2004-08-01 | Coulson | Applicant |
| US6791877(B2) | 2004-09-01 | Miura et al. | Applicant |
| US6795899(B2) | 2004-09-01 | Dodd et al. | Applicant |
| US6799241(B2) | 2004-09-01 | Kahn et al. | Applicant |
| US6801989(B2) | 2004-10-01 | Johnson et al. | Applicant |
| US6807598(B2) | 2004-10-01 | Farmwald et al. | Applicant |
| US6807655(B1) | 2004-10-01 | Rehani et al. | Applicant |
| US6816991(B2) | 2004-11-01 | Sanghani | Applicant |
| US6819602(B2) | 2004-11-01 | Seo et al. | Applicant |
| US6819617(B2) | 2004-11-01 | Hwang et al. | Applicant |
| US6820163(B1) | 2004-11-01 | McCall et al. | Applicant |
| US6820169(B2) | 2004-11-01 | Wilcox et al. | Applicant |
| US6826104(B2) | 2004-11-01 | Kawaguchi et al. | Examiner |
| US6839290(B2) | 2005-01-01 | Ahmad et al. | Applicant |
| US6845055(B1) | 2005-01-01 | Koga et al. | Applicant |
| US6847582(B2) | 2005-01-01 | Pan | Applicant |
| US6850449(B2) | 2005-02-01 | Takahashi | Examiner |
| US6862202(B2) | 2005-03-01 | Schaefer | Applicant |
| US6862249(B2) | 2005-03-01 | Kyung | Applicant |
| US6862653(B1) | 2005-03-01 | Dodd et al. | Applicant |
| US6873534(B2) | 2005-03-01 | Bhakta et al. | Applicant |
| US6894933(B2) | 2005-05-01 | Kuzmenka et al. | Applicant |
| US6898683(B2) | 2005-05-01 | Nakamura | Applicant |
| US6908314(B2) | 2005-06-01 | Brown | Applicant |
| US6912778(B2) | 2005-07-01 | Ahn et al. | Applicant |
| US6917219(B2) | 2005-07-01 | New | Applicant |
| US6922371(B2) | 2005-07-01 | Takahashi et al. | Examiner |
| US6930900(B2) | 2005-08-01 | Bhakta et al. | Applicant |
| US6930903(B2) | 2005-08-01 | Bhakta et al. | Applicant |
| US6938119(B2) | 2005-08-01 | Kohn et al. | Applicant |
| US6947341(B2) | 2005-09-01 | Stubbs et al. | Applicant |
| US6952794(B2) | 2005-10-01 | Lu | Applicant |
| US6961281(B2) | 2005-11-01 | Wong et al. | Applicant |
| US6968416(B2) | 2005-11-01 | Moy | Applicant |
| US6968419(B1) | 2005-11-01 | Holman | Applicant |
| US6970968(B1) | 2005-11-01 | Holman | Applicant |
| US6980021(B1) | 2005-12-01 | Srivastava et al. | Applicant |
| US6986118(B2) | 2006-01-01 | Dickman | Applicant |
| US6992501(B2) | 2006-01-01 | Rapport | Applicant |
| US6992950(B2) | 2006-01-01 | Foss et al. | Applicant |
| US7000062(B2) | 2006-02-01 | Perego et al. | Applicant |
| US7003618(B2) | 2006-02-01 | Perego et al. | Applicant |
| US7003639(B2) | 2006-02-01 | Tsern et al. | Applicant |
| US7007095(B2) | 2006-02-01 | Chen et al. | Applicant |
| US7007175(B2) | 2006-02-01 | Chang et al. | Applicant |
| US7010642(B2) | 2006-03-01 | Perego et al. | Applicant |
| US7010736(B1) | 2006-03-01 | Teh et al. | Applicant |
| US7024518(B2) | 2006-04-01 | Halbert et al. | Applicant |
| US7026708(B2) | 2006-04-01 | Cady et al. | Applicant |
| US7028215(B2) | 2006-04-01 | Depew et al. | Applicant |
| US7028234(B2) | 2006-04-01 | Huckaby et al. | Applicant |
| US7033861(B1) | 2006-04-01 | Partridge et al. | Applicant |
| US7035150(B2) | 2006-04-01 | Streif et al. | Applicant |
| US7043599(B1) | 2006-05-01 | Ware et al. | Applicant |
| US7046538(B2) | 2006-05-01 | Kinsley et al. | Applicant |
| US7058776(B2) | 2006-06-01 | Lee | Applicant |
| US7058863(B2) | 2006-06-01 | Kouchi et al. | Applicant |
| US7061784(B2) | 2006-06-01 | Jakobs et al. | Applicant |
| US7061823(B2) | 2006-06-01 | Faue et al. | Applicant |
| US7075175(B2) | 2006-07-01 | Kazi et al. | Applicant |
| US7079441(B1) | 2006-07-01 | Partsch et al. | Applicant |
| US7079446(B2) | 2006-07-01 | Murtagh et al. | Applicant |
| US7085152(B2) | 2006-08-01 | Ellis et al. | Applicant |
| US7085941(B2) | 2006-08-01 | Li | Applicant |
| US7089438(B2) | 2006-08-01 | Raad | Applicant |
| US7093101(B2) | 2006-08-01 | Aasheim et al. | Applicant |
| US7103730(B2) | 2006-09-01 | Saxena et al. | Applicant |
| US7119428(B2) | 2006-10-01 | Tanie et al. | Applicant |
| US7120727(B2) | 2006-10-01 | Lee et al. | Applicant |
| US7126399(B1) | 2006-10-01 | Lee | Applicant |
| US7127567(B2) | 2006-10-01 | Ramakrishnan et al. | Applicant |
| US7133960(B1) | 2006-11-01 | Thompson et al. | Applicant |
| US7136978(B2) | 2006-11-01 | Miura et al. | Applicant |
| US7149145(B2) | 2006-12-01 | Kim et al. | Applicant |
| US7149824(B2) | 2006-12-01 | Johnson | Applicant |
| US7173863(B2) | 2007-02-01 | Conley et al. | Applicant |
| US7200021(B2) | 2007-04-01 | Raghuram | Applicant |
| US7205789(B1) | 2007-04-01 | Karabatsos | Applicant |
| US7210059(B2) | 2007-04-01 | Jeddeloh | Applicant |
| US7215561(B2) | 2007-05-01 | Park et al. | Applicant |
| US7218566(B1) | 2007-05-01 | Totolos, Jr. et al. | Applicant |
| US7224595(B2) | 2007-05-01 | Dreps et al. | Applicant |
| US7228264(B2) | 2007-06-01 | Barrenscheen et al. | Applicant |
| US7231562(B2) | 2007-06-01 | Ohlhoff et al. | Applicant |
| US7233541(B2) | 2007-06-01 | Yamamoto et al. | Applicant |
| US7234081(B2) | 2007-06-01 | Nguyen et al. | Applicant |
| US7243185(B2) | 2007-07-01 | See et al. | Applicant |
| US7245541(B2) | 2007-07-01 | Janzen | Applicant |
| US7254036(B2) | 2007-08-01 | Pauley et al. | Applicant |
| US7266639(B2) | 2007-09-01 | Raghuram | Applicant |
| US7269042(B2) | 2007-09-01 | Kinsley et al. | Applicant |
| US7269708(B2) | 2007-09-01 | Ware | Applicant |
| US7274583(B2) | 2007-09-01 | Park et al. | Applicant |
| US7286436(B2) | 2007-10-01 | Bhakta et al. | Applicant |
| US7289386(B2) | 2007-10-01 | Bhakta et al. | Applicant |
| US7296754(B2) | 2007-11-01 | Nishizawa et al. | Applicant |
| US7299330(B2) | 2007-11-01 | Gillingham et al. | Applicant |
| US7302598(B2) | 2007-11-01 | Suzuki et al. | Applicant |
| US7307863(B2) | 2007-12-01 | Yen et al. | Applicant |
| US7317250(B2) | 2008-01-01 | Koh et al. | Applicant |
| US7363422(B2) | 2008-04-01 | Perego et al. | Applicant |
| US7366947(B2) | 2008-04-01 | Gower et al. | Applicant |
| US7379316(B2) | 2008-05-01 | Rajan | Applicant |
| US7386656(B2) | 2008-06-01 | Rajan et al. | Applicant |
| US7392338(B2) | 2008-06-01 | Rajan et al. | Applicant |
| US7408393(B1) | 2008-08-01 | Jain et al. | Applicant |
| US7409492(B2) | 2008-08-01 | Tanaka et al. | Applicant |
| US7428644(B2) | 2008-09-01 | Jeddeloh et al. | Applicant |
| US7437579(B2) | 2008-10-01 | Jeddeloh et al. | Applicant |
| US7441064(B2) | 2008-10-01 | Gaskins | Applicant |
| US7464225(B2) | 2008-12-01 | Tsern | Applicant |
| US7472220(B2) | 2008-12-01 | Rajan et al. | Applicant |
| US7474576(B2) | 2009-01-01 | Co et al. | Applicant |
| US7480774(B2) | 2009-01-01 | Ellis et al. | Applicant |
| US7496777(B2) | 2009-02-01 | Kapil | Applicant |
| US7515453(B2) | 2009-04-01 | Rajan | Applicant |
| US7532537(B2) | 2009-05-01 | Solomon et al. | Applicant |
| US7539800(B2) | 2009-05-01 | Dell et al. | Applicant |
| US7573136(B2) | 2009-08-01 | Jiang et al. | Applicant |
| US7580312(B2) | 2009-08-01 | Rajan et al. | Applicant |
| US7581121(B2) | 2009-08-01 | Barth et al. | Applicant |
| US7581127(B2) | 2009-08-01 | Rajan et al. | Applicant |
| US7590796(B2) | 2009-09-01 | Rajan et al. | Applicant |
| US7599205(B2) | 2009-10-01 | Rajan | Applicant |
| US7606245(B2) | 2009-10-01 | Ma et al. | Applicant |
| US7609567(B2) | 2009-10-01 | Rajan et al. | Applicant |
| US7613880(B2) | 2009-11-01 | Miura et al. | Applicant |
| US7619912(B2) | 2009-11-01 | Bhakta et al. | Applicant |
| US7724589(B2) | 2010-05-01 | Rajan et al. | Applicant |
| US7730338(B2) | 2010-06-01 | Rajan et al. | Applicant |
| US7761724(B2) | 2010-07-01 | Rajan et al. | Applicant |
| US2001/0000822(A1) | 2001-05-01 | Dell et al. | Applicant |
| US2001/0003198(A1) | 2001-06-01 | Wu | Applicant |
| US2001/0011322(A1) | 2001-08-01 | Stolt et al. | Applicant |
| US2001/0019509(A1) | 2001-09-01 | Aho et al. | Applicant |
| US2001/0021106(A1) | 2001-09-01 | Weber et al. | Applicant |
| US2001/0021137(A1) | 2001-09-01 | Kai et al. | Applicant |
| US2001/0046129(A1) | 2001-11-01 | Broglia et al. | Applicant |
| US2002/0004897(A1) | 2002-01-01 | Kao et al. | Applicant |
| US2002/0015340(A1) | 2002-02-01 | Batinovich | Applicant |
| US2002/0019961(A1) | 2002-02-01 | Blodgett | Applicant |
| US2002/0034068(A1) | 2002-03-01 | Weber et al. | Applicant |
| US2002/0038405(A1) | 2002-03-01 | Leddige et al. | Applicant |
| US2002/0041507(A1) | 2002-04-01 | Woo et al. | Applicant |
| US2002/0051398(A1) | 2002-05-01 | Mizugaki | Examiner |
| US2002/0064073(A1) | 2002-05-01 | Chien | Applicant |
| US2002/0064083(A1) | 2002-05-01 | Ryu et al. | Applicant |
| US2002/0089831(A1) | 2002-07-01 | Forthun | Applicant |
| US2002/0089970(A1) | 2002-07-01 | Asada et al. | Applicant |
| US2002/0094671(A1) | 2002-07-01 | Distefano et al. | Applicant |
| US2002/0121650(A1) | 2002-09-01 | Minamio et al. | Applicant |
| US2002/0121670(A1) | 2002-09-01 | Minamio et al. | Applicant |
| US2002/0124195(A1) | 2002-09-01 | Nizar | Applicant |
| US2002/0145900(A1) | 2002-10-01 | Schaefer | Applicant |
| US2002/0165706(A1) | 2002-11-01 | Raynham | Applicant |
| US2002/0167092(A1) | 2002-11-01 | Fee et al. | Applicant |
| US2002/0172024(A1) | 2002-11-01 | Hui et al. | Applicant |
| US2002/0174274(A1) | 2002-11-01 | Wu et al. | Applicant |
| US2002/0184438(A1) | 2002-12-01 | Usui | Applicant |
| US2003/0002262(A1) | 2003-01-01 | Benisek et al. | Applicant |
| US2003/0021175(A1) | 2003-01-01 | Tae Kwak | Applicant |
| US2003/0026159(A1) | 2003-02-01 | Frankowsky et al. | Applicant |
| US2003/0035312(A1) | 2003-02-01 | Halbert et al. | Applicant |
| US2003/0039158(A1) | 2003-02-01 | Horiguchi et al. | Applicant |
| US2003/0041295(A1) | 2003-02-01 | Hou et al. | Applicant |
| US2003/0061458(A1) | 2003-03-01 | Wilcox et al. | Applicant |
| US2003/0061459(A1) | 2003-03-01 | Aboulenein et al. | Applicant |
| US2003/0093614(A1) | 2003-05-01 | Kohn et al. | Applicant |
| US2003/0101392(A1) | 2003-05-01 | Lee | Applicant |
| US2003/0105932(A1) | 2003-06-01 | David et al. | Applicant |
| US2003/0117875(A1) | 2003-06-01 | Lee et al. | Applicant |
| US2003/0123389(A1) | 2003-07-01 | Russell et al. | Applicant |
| US2003/0126338(A1) | 2003-07-01 | Dodd et al. | Applicant |
| US2003/0127737(A1) | 2003-07-01 | Takahashi | Applicant |
| US2003/0131160(A1) | 2003-07-01 | Hampel et al. | Applicant |
| US2003/0145163(A1) | 2003-07-01 | Seo et al. | Examiner |
| US2003/0158995(A1) | 2003-08-01 | Lee et al. | Applicant |
| US2003/0164543(A1) | 2003-09-01 | Kheng Lee | Applicant |
| US2003/0182513(A1) | 2003-09-01 | Dodd et al. | Applicant |
| US2003/0189868(A1) | 2003-10-01 | Riesenman et al. | Applicant |
| US2003/0189870(A1) | 2003-10-01 | Wilcox | Applicant |
| US2003/0191888(A1) | 2003-10-01 | Klein | Applicant |
| US2003/0191915(A1) | 2003-10-01 | Saxena et al. | Applicant |
| US2003/0200382(A1) | 2003-10-01 | Wells et al. | Applicant |
| US2003/0200474(A1) | 2003-10-01 | Li | Applicant |
| US2003/0206476(A1) | 2003-11-01 | Joo | Applicant |
| US2003/0217303(A1) | 2003-11-01 | Chua-Eoan et al. | Applicant |
| US2003/0223290(A1) | 2003-12-01 | Park et al. | Applicant |
| US2003/0227798(A1) | 2003-12-01 | Pax | Applicant |
| US2003/0229821(A1) | 2003-12-01 | Ma | Applicant |
| US2003/0230801(A1) | 2003-12-01 | Jiang et al. | Applicant |
| US2003/0231540(A1) | 2003-12-01 | Lazar et al. | Applicant |
| US2003/0231542(A1) | 2003-12-01 | Zaharinova-Papazova et al. | Applicant |
| US2004/0016994(A1) | 2004-01-01 | Huang | Applicant |
| US2004/0027902(A1) | 2004-02-01 | Ooishi et al. | Applicant |
| US2004/0034732(A1) | 2004-02-01 | Valin et al. | Applicant |
| US2004/0034755(A1) | 2004-02-01 | LaBerge et al. | Applicant |
| US2004/0037133(A1) | 2004-02-01 | Park et al. | Applicant |
| US2004/0044808(A1) | 2004-03-01 | Salmon et al. | Applicant |
| US2004/0047228(A1) | 2004-03-01 | Chen | Applicant |
| US2004/0057317(A1) | 2004-03-01 | Schaefer | Applicant |
| US2004/0064647(A1) | 2004-04-01 | DeWhitt et al. | Applicant |
| US2004/0064767(A1) | 2004-04-01 | Huckaby et al. | Applicant |
| US2004/0088475(A1) | 2004-05-01 | Streif et al. | Applicant |
| US2004/0117723(A1) | 2004-06-01 | Foss | Applicant |
| US2004/0123173(A1) | 2004-06-01 | Emberling et al. | Applicant |
| US2004/0125635(A1) | 2004-07-01 | Kuzmenka | Applicant |
| US2004/0133736(A1) | 2004-07-01 | Kyung | Applicant |
| US2004/0139359(A1) | 2004-07-01 | Samson et al. | Applicant |
| US2004/0145963(A1) | 2004-07-01 | Byon | Applicant |
| US2004/0151038(A1) | 2004-08-01 | Ruckerbauer et al. | Applicant |
| US2004/0174765(A1) | 2004-09-01 | Seo et al. | Applicant |
| US2004/0177079(A1) | 2004-09-01 | Gluhovsky et al. | Applicant |
| US2004/0178824(A1) | 2004-09-01 | Pan | Applicant |
| US2004/0184324(A1) | 2004-09-01 | Pax | Applicant |
| US2004/0186956(A1) | 2004-09-01 | Perego et al. | Applicant |
| US2004/0188704(A1) | 2004-09-01 | Halbert et al. | Applicant |
| US2004/0196732(A1) | 2004-10-01 | Lee | Applicant |
| US2004/0205433(A1) | 2004-10-01 | Gower et al. | Applicant |
| US2004/0208173(A1) | 2004-10-01 | Di Gregorio | Applicant |
| US2004/0225858(A1) | 2004-11-01 | Brueggen | Applicant |
| US2004/0228166(A1) | 2004-11-01 | Braun et al. | Applicant |
| US2004/0228203(A1) | 2004-11-01 | Koo | Applicant |
| US2004/0230932(A1) | 2004-11-01 | Dickmann | Applicant |
| US2004/0236877(A1) | 2004-11-01 | Burton | Applicant |
| US2004/0256638(A1) | 2004-12-01 | Perego et al. | Applicant |
| US2004/0257847(A1) | 2004-12-01 | Matsui et al. | Applicant |
| US2004/0260957(A1) | 2004-12-01 | Jeddeloh et al. | Applicant |
| US2004/0264255(A1) | 2004-12-01 | Royer | Applicant |
| US2004/0268161(A1) | 2004-12-01 | Ross | Applicant |
| US2005/0018495(A1) | 2005-01-01 | Bhakta et al. | Applicant |
| US2005/0021874(A1) | 2005-01-01 | Georgiou et al. | Applicant |
| US2005/0024963(A1) | 2005-02-01 | Jakobs et al. | Applicant |
| US2005/0027928(A1) | 2005-02-01 | Avraham et al. | Applicant |
| US2005/0028038(A1) | 2005-02-01 | Pomaranski et al. | Applicant |
| US2005/0036350(A1) | 2005-02-01 | So et al. | Applicant |
| US2005/0041504(A1) | 2005-02-01 | Perego et al. | Applicant |
| US2005/0044303(A1) | 2005-02-01 | Perego et al. | Applicant |
| US2005/0044305(A1) | 2005-02-01 | Jakobs et al. | Applicant |
| US2005/0047192(A1) | 2005-03-01 | Matsui et al. | Applicant |
| US2005/0071543(A1) | 2005-03-01 | Ellis et al. | Applicant |
| US2005/0078532(A1) | 2005-04-01 | Ruckerbauer et al. | Applicant |
| US2005/0081085(A1) | 2005-04-01 | Ellis et al. | Applicant |
| US2005/0099834(A1) | 2005-05-01 | Funaba et al. | Applicant |
| US2005/0102590(A1) | 2005-05-01 | Norris et al. | Applicant |
| US2005/0105318(A1) | 2005-05-01 | Funaba et al. | Applicant |
| US2005/0108460(A1) | 2005-05-01 | David | Applicant |
| US2005/0132158(A1) | 2005-06-01 | Hampel et al. | Applicant |
| US2005/0135176(A1) | 2005-06-01 | Ramakrishnan et al. | Applicant |
| US2005/0138267(A1) | 2005-06-01 | Bains et al. | Applicant |
| US2005/0138304(A1) | 2005-06-01 | Ramakrishnan et al. | Applicant |
| US2005/0139977(A1) | 2005-06-01 | Nishio et al. | Applicant |
| US2005/0141199(A1) | 2005-06-01 | Chiou et al. | Applicant |
| US2005/0149662(A1) | 2005-07-01 | Perego | Applicant |
| US2005/0152212(A1) | 2005-07-01 | Yang et al. | Applicant |
| US2005/0156934(A1) | 2005-07-01 | Perego et al. | Applicant |
| US2005/0166026(A1) | 2005-07-01 | Ware et al. | Applicant |
| US2005/0193163(A1) | 2005-09-01 | Perego | Applicant |
| US2005/0194676(A1) | 2005-09-01 | Fukuda et al. | Applicant |
| US2005/0194991(A1) | 2005-09-01 | Dour et al. | Applicant |
| US2005/0195629(A1) | 2005-09-01 | Leddige et al. | Applicant |
| US2005/0204111(A1) | 2005-09-01 | Natarajan | Applicant |
| US2005/0207255(A1) | 2005-09-01 | Perego et al. | Applicant |
| US2005/0210196(A1) | 2005-09-01 | Perego et al. | Applicant |
| US2005/0223179(A1) | 2005-10-01 | Perego et al. | Applicant |
| US2005/0224948(A1) | 2005-10-01 | Lee et al. | Applicant |
| US2005/0232049(A1) | 2005-10-01 | Park | Applicant |
| US2005/0235119(A1) | 2005-10-01 | Sechrest et al. | Applicant |
| US2005/0235131(A1) | 2005-10-01 | Ware | Applicant |
| US2005/0237838(A1) | 2005-10-01 | Kwak et al. | Examiner |
| US2005/0243635(A1) | 2005-11-01 | Schaefer | Applicant |
| US2005/0249011(A1) | 2005-11-01 | Maeda | Applicant |
| US2005/0259504(A1) | 2005-11-01 | Murtugh et al. | Applicant |
| US2005/0263312(A1) | 2005-12-01 | Bolken et al. | Applicant |
| US2005/0265506(A1) | 2005-12-01 | Foss et al. | Applicant |
| US2005/0278474(A1) | 2005-12-01 | Perersen et al. | Applicant |
| US2005/0281096(A1) | 2005-12-01 | Bhakta et al. | Applicant |
| US2005/0281123(A1) | 2005-12-01 | Bell et al. | Applicant |
| US2005/0283572(A1) | 2005-12-01 | Ishihara | Applicant |
| US2005/0285174(A1) | 2005-12-01 | Saito et al. | Applicant |
| US2005/0289292(A1) | 2005-12-01 | Morrow et al. | Applicant |
| US2005/0289317(A1) | 2005-12-01 | Liou et al. | Applicant |
| US2006/0002201(A1) | 2006-01-01 | Janzen | Applicant |
| US2006/0010339(A1) | 2006-01-01 | Klein | Applicant |
| US2006/0026484(A1) | 2006-02-01 | Hollums | Applicant |
| US2006/0039205(A1) | 2006-02-01 | Cornelius | Applicant |
| US2006/0041711(A1) | 2006-02-01 | Miura et al. | Applicant |
| US2006/0041730(A1) | 2006-02-01 | Larson | Applicant |
| US2006/0044909(A1) | 2006-03-01 | Kinsley et al. | Examiner |
| US2006/0044913(A1) | 2006-03-01 | Klein et al. | Applicant |
| US2006/0050574(A1) | 2006-03-01 | Streif et al. | Applicant |
| US2006/0056244(A1) | 2006-03-01 | Ware | Applicant |
| US2006/0062047(A1) | 2006-03-01 | Bhakta et al. | Applicant |
| US2006/0067141(A1) | 2006-03-01 | Perego et al. | Applicant |
| US2006/0085616(A1) | 2006-04-01 | Zeighami et al. | Applicant |
| US2006/0087900(A1) | 2006-04-01 | Bucksch et al. | Applicant |
| US2006/0090031(A1) | 2006-04-01 | Kirshenbaum et al. | Applicant |
| US2006/0090054(A1) | 2006-04-01 | Choi et al. | Applicant |
| US2006/0106951(A1) | 2006-05-01 | Bains | Applicant |
| US2006/0112214(A1) | 2006-05-01 | Yeh | Applicant |
| US2006/0112219(A1) | 2006-05-01 | Chawla et al. | Applicant |
| US2006/0117152(A1) | 2006-06-01 | Amidi et al. | Applicant |
| US2006/0117160(A1) | 2006-06-01 | Jackson et al. | Applicant |
| US2006/0120193(A1) | 2006-06-01 | Casper | Applicant |
| US2006/0123265(A1) | 2006-06-01 | Ruckerbauer et al. | Applicant |
| US2006/0126369(A1) | 2006-06-01 | Raghuram | Applicant |
| US2006/0129712(A1) | 2006-06-01 | Raghuram | Applicant |
| US2006/0129740(A1) | 2006-06-01 | Ruckerbauer et al. | Applicant |
| US2006/0129755(A1) | 2006-06-01 | Raghuram | Applicant |
| US2006/0133173(A1) | 2006-06-01 | Jain et al. | Applicant |
| US2006/0149982(A1) | 2006-07-01 | Vogt | Applicant |
| US2006/0174082(A1) | 2006-08-01 | Bellows et al. | Applicant |
| US2006/0176744(A1) | 2006-08-01 | Stave | Applicant |
| US2006/0179333(A1) | 2006-08-01 | Brittain et al. | Applicant |
| US2006/0179334(A1) | 2006-08-01 | Brittain et al. | Applicant |
| US2006/0181953(A1) | 2006-08-01 | Rotenberg et al. | Applicant |
| US2006/0195631(A1) | 2006-08-01 | Rajamani | Applicant |
| US2006/0198178(A1) | 2006-09-01 | Kinsley et al. | Applicant |
| US2006/0203590(A1) | 2006-09-01 | Mori et al. | Applicant |
| US2006/0206738(A1) | 2006-09-01 | Jeddeloh et al. | Applicant |
| US2006/0233012(A1) | 2006-10-01 | Sekiguchi et al. | Applicant |
| US2006/0236165(A1) | 2006-10-01 | Cepulis et al. | Applicant |
| US2006/0236201(A1) | 2006-10-01 | Gower et al. | Applicant |
| US2006/0248261(A1) | 2006-11-01 | Jacob et al. | Applicant |
| US2006/0248387(A1) | 2006-11-01 | Nicholson et al. | Applicant |
| US2006/0262586(A1) | 2006-11-01 | Solomon et al. | Applicant |
| US2006/0294295(A1) | 2006-12-01 | Fukuzo | Applicant |
| US2007/0005998(A1) | 2007-01-01 | Jain et al. | Applicant |
| US2007/0050530(A1) | 2007-03-01 | Rajan | Applicant |
| US2007/0058471(A1) | 2007-03-01 | Rajan et al. | Applicant |
| US2007/0070669(A1) | 2007-03-01 | Tsern | Applicant |
| US2007/0088995(A1) | 2007-04-01 | Tsern et al. | Applicant |
| US2007/0091696(A1) | 2007-04-01 | Niggemeier et al. | Applicant |
| US2007/0106860(A1) | 2007-05-01 | Foster, Sr. et al. | Applicant |
| US2007/0136537(A1) | 2007-06-01 | Doblar et al. | Applicant |
| US2007/0162700(A1) | 2007-07-01 | Fortin et al. | Applicant |
| US2007/0192563(A1) | 2007-08-01 | Rajan et al. | Applicant |
| US2007/0195613(A1) | 2007-08-01 | Rajan et al. | Applicant |
| US2007/0204075(A1) | 2007-08-01 | Rajan et al. | Applicant |
| US2007/0216445(A1) | 2007-09-01 | Raghavan et al. | Applicant |
| US2007/0247194(A1) | 2007-10-01 | Jain | Applicant |
| US2007/0279084(A1) | 2007-12-01 | Oh et al. | Applicant |
| US2007/0288683(A1) | 2007-12-01 | Panabaker et al. | Applicant |
| US2007/0288686(A1) | 2007-12-01 | Arcedera et al. | Applicant |
| US2007/0288687(A1) | 2007-12-01 | Panabaker et al. | Applicant |
| US2008/0002447(A1) | 2008-01-01 | Gulachenski et al. | Applicant |
| US2008/0010435(A1) | 2008-01-01 | Smith et al. | Applicant |
| US2008/0025108(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0025122(A1) | 2008-01-01 | Schakel et al. | Applicant |
| US2008/0025136(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0025137(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0027697(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0027702(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0027703(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0028135(A1) | 2008-01-01 | Rajan et al. | Applicant |
| US2008/0028136(A1) | 2008-01-01 | Schakel et al. | Applicant |
| US2008/0028137(A1) | 2008-01-01 | Schakel et al. | Applicant |
| US2008/0031030(A1) | 2008-02-01 | Rajan et al. | Applicant |
| US2008/0031072(A1) | 2008-02-01 | Rajan et al. | Applicant |
| US2008/0037353(A1) | 2008-02-01 | Rajan et al. | Applicant |
| US2008/0056014(A1) | 2008-03-01 | Rajan et al. | Applicant |
| US2008/0062773(A1) | 2008-03-01 | Rajan et al. | Applicant |
| US2008/0065820(A1) | 2008-03-01 | Gillingham et al. | Applicant |
| US2008/0082763(A1) | 2008-04-01 | Rajan et al. | Applicant |
| US2008/0086588(A1) | 2008-04-01 | Danilak et al. | Applicant |
| US2008/0098277(A1) | 2008-04-01 | Hazelzet | Applicant |
| US2008/0103753(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0104314(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0109206(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0109595(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0109597(A1) | 2008-05-01 | Schakel et al. | Applicant |
| US2008/0109598(A1) | 2008-05-01 | Schakel et al. | Applicant |
| US2008/0115006(A1) | 2008-05-01 | Smith et al. | Applicant |
| US2008/0120443(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0120458(A1) | 2008-05-01 | Gillingham et al. | Applicant |
| US2008/0123459(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0126687(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0126688(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0126689(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0126690(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0126692(A1) | 2008-05-01 | Rajan et al. | Applicant |
| US2008/0133825(A1) | 2008-06-01 | Rajan et al. | Applicant |
| US2008/0159027(A1) | 2008-07-01 | Kim | Applicant |
| US2008/0170425(A1) | 2008-07-01 | Rajan | Applicant |
| US2008/0239857(A1) | 2008-10-01 | Rajan et al. | Applicant |
| US2008/0239858(A1) | 2008-10-01 | Rajan et al. | Applicant |
| US2009/0024789(A1) | 2009-01-01 | Rajan et al. | Applicant |
| US2009/0024790(A1) | 2009-01-01 | Rajan et al. | Applicant |
| US2009/0216939(A1) | 2009-08-01 | Smith et al. | Applicant |
| US2009/0285031(A1) | 2009-11-01 | Rajan et al. | Applicant |
| US2009/0290442(A1) | 2009-11-01 | Rajan | Applicant |
| US2010/0020585(A1) | 2010-01-01 | Rajan | Applicant |
| DE102004051345 | 2006-05-01 | Applicant | |
| DE102004053316 | 2006-05-01 | Applicant | |
| DE102005036528 | 2007-02-01 | Applicant | |
| JP62121978 | 1987-06-01 | Applicant | |
| JP1171047 | 1989-07-01 | Applicant | |
| JP3-029357 | 1991-02-01 | Applicant | |
| JP3029357 | 1991-02-01 | Applicant | |
| JP3/276487 | 1991-12-01 | Applicant | |
| JP3286234 | 1991-12-01 | Applicant | |
| JP7-141870 | 1995-06-01 | Applicant | |
| JP8/077097 | 1996-03-01 | Applicant | |
| JP8077097 | 1996-03-01 | Applicant | |
| JP11-149775 | 1999-06-01 | Applicant | |
| JP2002025255 | 2002-01-01 | Applicant | |
| JP2006236388 | 2006-09-01 | Applicant | |
| KR1020040062717 | 2004-07-01 | Applicant | |
| WO95/05676 | 1995-02-01 | Applicant | |
| WO9900734 | 1999-01-01 | Applicant | |
| WO2007002324 | 2007-01-01 | Applicant | |
| WO2007/028109 | 2007-03-01 | Applicant | |
| WO2007/038225 | 2007-04-01 | Applicant | |
| WO2007/095080 | 2007-08-01 | Applicant | |
| WO2008063251 | 2008-05-01 | Applicant |
Non-Patent Literature (94)
- Office Action from U.S. Appl. No. 11/461,427 mailed on Sep. 5, 2008.Applicant
- Final Office Action from U.S. Appl. No, 11/461,430 mailed on Sep. 8, 2008.Applicant
- Notice of Allowance from U.S. Appl. No. 11/474,075 mailed on Nov. 26, 2008.Applicant
- Office Action from U.S. Appl. No. 11/474,076 mailed on Nov. 3, 2008.Applicant
- Office Action from U.S. Appl. No. 11/524,811 mailed on Sep. 17, 2008.Applicant
- Non-final Office Action from U.S. Appl. No. 11/461,430 mailed on Feb. 19, 2009.Applicant
- Final Office Action from U.S. Appl. No. 11/461,435 mailed on Jan. 28, 2009.Applicant
- Non-final Office Action from U.S. Appl. No. 11/461,437 mailed on Jan. 26, 2009.Applicant
- Non-final Office Action from U.S. Appl. No. 11/939,432 mailed on Feb. 6, 2009.Applicant
- Wu et al., “eNVy: A Non-Volatile, Main Memory Storage System,” ASPLOS-VI Proceedings—Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, San Jose, California, Oct. 4-7, 1994. SIGARCH Computer Architecture News 22(Special Issue Oct. 1994).Applicant
- German Office Action From German Patent Application No. 11 2006 002 300.4-55 Mailed Jun. 5, 2009 (With Translation).Applicant
- Non-Final Office Action From Application No. 11/461,430 Mailed Feb. 19, 2009.Applicant
- Final Office Action From Application No. 11/461,435 Mailed Jan. 28, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 11/461,437 Mailed Jan. 26, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 11/461,441 Mailed Apr. 2, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 11/611,374 Mailed Mar. 23, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 11/762,010 Mailed Mar. 20, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 11/939,432 Mailed Feb. 6, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 12/111,819 Mailed Apr. 27, 2009.Applicant
- Non-Final Office Action From U.S. Appl. No. 12/111,828 Mailed Apr. 17, 2009.Applicant
- Fang et al., W. Power Complexity Analysis of Adiabatic SRAM, 6th Int. Conference on ASIC, vol. 1, Oct. 2005, pp. 334-337.Applicant
- 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.Applicant
- German Office Action From German Patent Application No. 11 2006 001 810.8-55 Mailed Apr. 20, 2009 (With Translation).Applicant
- Final Rejection From U.S. Appl. No. 11/461,437 Mailed Nov. 10, 2009.Applicant
- Final Rejection from U.S. Appl. No. 11/762,010 Mailed Dec. 4, 2009.Applicant
- Non-Final Rejection from U.S. Appl. No. 11/672,921 Mailed Dec. 8, 2009.Applicant
- Non-Final Rejection from U.S. Appl. No. 11/672,924 Mailed Dec. 14, 2009.Applicant
- Non-Final Rejection from U.S. Appl. No. 11/929,225 Mailed Dec. 14, 2009.Applicant
- Non-Final Rejection from U.S. Appl. No. 11/929,261 Mailed Dec. 14, 2009.Applicant
- Notice of Allowance From U.S. Appl. No. 11/611,374 Mailed Nov. 30, 2009.Applicant
- Notice of Allowance From U.S. Appl. No. 12/111,819 Mailed Nov. 20, 2009.Applicant
- Notice of Allowance From U.S. Appl. No. 12/111,828 Mailed Dec. 15, 2009.Applicant
- Great Britain Office Action from GB Patent Application No. GB0800734.6 Mailed Mar. 1, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/461,420 Mailed Apr. 28, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/553,372 Mailed Mar. 12, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/553,399 Mailed Mar. 22, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/588,739 Mailed Dec. 29, 2009.Applicant
- Notice of Allowance from U.S. Appl. No. 11/611,374 Mailed Apr. 5, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/828,181 Mailed Mar. 2, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/828,182 Mailed Mar. 29, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/858,518 Mailed Apr. 21, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/929,432 Mailed Jan. 14, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/929,571 Mailed Mar. 3, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/929,631 Mailed Mar. 3, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/929,636 Mailed Mar. 9, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/929,655 Mailed Mar. 3, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/939,432 Mailed Dec. 1, 2009.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/939,432 Mailed Apr. 12, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 12/111,819 Mailed Mar. 10, 2010.Applicant
- Non-Final Office Action from U.S. Appl. No. 12/507,682 Mailed Mar. 8, 2010.Applicant
- Great Britain Office Action from GB Patent Application No. GB0803913.3 Mailed Mar. 1, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/461,435 Dated May 13, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/515,167 Dated Jun. 3, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/515,223 Dated Jul. 30, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/553,390 Dated Jun. 24, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/611,374 Dated Jul. 19, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/672,921 Dated Jul. 23, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/702,960 Dated Jun. 21, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/762,010 Dated Jul. 2, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/763,365 Dated Jun. 29, 2010.Applicant
- Final Office Action from U.S. Appl. No. 11/929,500 Dated Jun. 24, 2010.Applicant
- Office Action from U.S. Appl. No. 12/574,628 Dated Jun. 10, 2010.Applicant
- Notice of Allowance from U.S. Appl. No. 11/762,010 Dated Jun. 8, 2011.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/672,924 Dated Jun. 8, 2011.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/929,225 Dated Jun. 8, 2011.Applicant
- Kellerbauer “Die Schnelle Million”, with translation, “The Quick Million”; downloaded Apr. 1, 2008.Applicant
- Wu et al., “eNVy: A Non-Volatile, Main Memory Storage System”, ASPLOS-VI Proceedings, Oct. 4-7, 1994, pp. 86-97; downloaded Nov. 1994.Applicant
- “Using Two Chip Selects to Enable Quad Rank,” IP.com PriorArtDatabase, copyright IP.com, Inc. 2004.Applicant
- “BIOS and Kernel Developer's Guide (BKDG) for AMD Family 10h Processors,” AMD, 31116 Rev 3.00, Sep. 7, 2007.Applicant
- Skerlj et al., “Buffer Device for Memory Modules (DIMM)” Qimonda 2006, p. 1.Applicant
- Written Opinion from PCT Application No. PCT/US06/24360 mailed on Jan. 8, 2007.Applicant
- Preliminary Report on Patentability from PCT Application No. PCT/US06/24360 mailed on Jan. 10, 2008.Applicant
- Written Opinion from International PCT Application No. PCT/US06/34390 mailed on Nov. 21, 2007.Applicant
- International Search Report from PCT Application No. PCT/US06/34390 mailed on Nov. 21, 2007.Applicant
- Notice of Allowance from U.S. Appl. No. 11/929,500 Dated Jun. 13, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/941,589 Dated Jun. 15, 2011.Applicant
- Final Office Action from U.S. Appl. No. 12/057,306 Dated Jun. 15, 2011.Applicant
- Final Office Action from U.S. Appl. No. 12/769,428 Dated Jun. 16, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 12/203,100 Dated Jun. 17, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/762,013 Dated Jun. 20, 2011.Applicant
- Non-Final Office Action from U.S. Appl. No. 12/797,557 Dated Jun. 21, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/929,483 Dated Jun. 23, 2011.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/702,960 Dated Jun. 23, 2011.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/929,655 Dated Jun. 24, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/763,365 Dated Jun. 24, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/611,374 Dated Jun. 24, 2011.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/828,182 Dated Jun. 27, 2011.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/828,181 Dated Jun. 27, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 12/838,896 Dated Apr. 19, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/702,981 Dated Apr. 25, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/929,320 Dated May 5, 2011.Applicant
- Final Office Action from U.S. Appl. No. 11/939,440 Dated May 19, 2011.Applicant
- Final Office Action from U.S. Appl. No. 11/855,805, Dated May 26, 2011.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/672,921 Dated May 27, 2011.Applicant