US 8,397,013 B1Grant
Hybrid memory module
Issue Date:2013-03-12
•36 Claims
•12 Drawing Sheets
Abstract
One embodiment of the present invention sets forth a hybrid memory module that combines memory devices of different types while presenting a single technology interface. The hybrid memory module includes a number of super-stacks and a first interface configured to transmit data between the super-stacks and a memory controller. Each super-stack includes a number of sub-stacks, a super-controller configured to control the sub-stacks, and a second interface configured to transmit data between the sub-stacks and the first interface. Combining memory devices of different types allows utilizing the favorable properties of each type of the memory devices, while hiding their unfavorable properties from the memory controller.
Metadata
Assignee
- Google Inc.
Inventors
- Daniel L. Rosenband
- Frederick Daniel Weber
- Michael John Sebastian Smith
Application Information
Application Number:US 12/057,306
Filing Date:2008-03-27
Priority Date:2006-10-05
Art Unit:2188
Classifications
IPC:
G06F12/00G11C7/00
Patent Drawings (12 sheets)
Description
Cross-Reference to Related Applications
[0001] This application is a continuation-in-part of U.S. patent application Ser. No. 11/611,374, having a filed Dec. 15, 2006 now U.S. Pat. No. 8,055,833, which claims benefit of U.S. Provisional Patent Application Ser. No. 60/849,631, filed Oct. 5, 2006, all of which are herein incorporated by reference.
Background of the Invention
[0002] 1. Field of the Invention
[0003] Embodiments of the present invention generally relate to memory modules and, more specifically, to hybrid or mixed-technology memory modules.
[0004] 2. Description of the Related Art
[0005] Memory systems in computers are typically built from memory modules. An example of a common type of memory module is a Dual Inline Memory Module or DIMM. The most common type of memory module is a DIMM that contains just one type of memory technology known as DRAM.
[0006] There are several new forms of semiconductor memory that are currently being developed, some as potential replacements for one-transistor-cell DRAM. Examples are Magnetoresistive Random Access Memory (MRAM), Phase-change memory (also known as PCM, PRAM, PCRAM, Ovonic Unified Memory and Chalcogenide RAM or C-RAM), Ferroelectric RAM (FRAM), Resistor RAM (RRAM), and Molecular Wire Crossbar Memory (MWCM). Most of these new memory technologies have system properties (most notably the read and write bandwidth and read and write latency) that are different from DRAM. In addition there are several flash memory technologies, such as NAND and NOR flash, that are attractive (because of their high density and low cost) for use as system memory, but again have system properties that are different from DRAM. Therefore, an ideal memory module would incorporate different types of memory while having a single memory interface with a host computer.
[0007] As the foregoing illustrates, what is needed in the art is a mixed-technology memory module architecture that combines different memory technologies while presenting a single, preferably standard, technology interface.
Summary of the Invention
[0008] One embodiment of the present invention sets forth a hybrid memory module comprising a plurality of super-stacks and a first interface configured to transmit data between the plurality of super-stacks and a memory controller. Each super-stack includes a plurality of sub-stacks, a super-controller configured to control the plurality of sub-stacks, and a second interface configured to transmit data between the plurality of sub-stacks and the first interface.
[0009] One advantage of the disclosed hybrid memory module is that combining memory devices of different types allows utilizing the favorable properties of each type of the memory devices, while hiding their unfavorable properties from the memory controller. More specifically, combining slow memory devices and fast memory devices using the architecture of the hybrid memory module allows the long latency of the slow memory devices to be hidden, so that the hybrid memory module appears to the memory controller as a standard fast memory device characterized by having low latency.
Brief Description of the Drawings
[0010] So that the manner in which the above recited features of the present invention can be understood in detail, a more particular description of the invention, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrate only typical embodiments of this invention and are therefore not to be considered limiting of its scope, for the invention may admit to other equally effective embodiments.
[0011] FIG. 1A shows an abstract and conceptual model of a mixed-technology memory module, according to one embodiment.
[0012] FIG. 1B is an exploded hierarchical view of a logical model of a HybridDIMM, according to one embodiment.
[0013] FIG. 2 shows a HybridDIMM Super-Stack with multiple Sub-stacks, according to one embodiment.
[0014] FIG. 3 shows a Sub-Stack showing a Sub-Controller, according to one embodiment.
[0015] FIG. 4 shows the Sub-Controller, according to one embodiment.
[0016] FIG. 5 depicts a physical implementation of a 1-high Super Stack, according to one embodiment.
[0017] FIG. 6A depicts a physical implementation of 2-high Super-Stacks, according to one embodiment.
[0018] FIG. 6B depicts a physical implementation of a 4-high Super-Stack, according to one embodiment.
[0019] FIG. 7 shows a method of retrieving data from a HybridDIMM, according to one embodiment.
[0020] FIG. 8A shows a method of managing SRAM pages on a HybridDIMM, according to one embodiment.
[0021] FIG. 8B shows a method of freeing SRAM pages on a HybridDIMM, according to one embodiment.
[0022] FIG. 9 shows a method of copying a flash page to an SRAM page on a HybridDIMM, according to one embodiment.
Detailed Description
[0023] Embodiments of the invention disclosed herein describe how to build standard DIMMs that contain more than one type of memory technology. An example of a mixed-technology DIMM is a module that combines flash memory with SRAM.
[0024] FIG. 1A shows an abstract and conceptual model of a mixed-technology memory module, according to one embodiment.
[0025] The mixed-technology memory module 100 shown in FIG. 1A has both slow memory and fast memory, with the combination architected so as to appear to a host computer as fast memory using a standard interface. The specific embodiment of the mixed-technology memory module 100, which will also be referred to as a HybridDIMM 100, shows both slow, non-volatile memory portion 104 (e.g. flash memory), and a latency-hiding buffer using fast memory 106 (e.g. using SRAM, DRAM, or embedded DRAM volatile memory), together with a controller 108. As shown in FIG. 1A , the combination of the fast and slow memory is presented to a host computer over a host interface 110 (also referred to herein as a DIMM interface 110) as a JEDEC-compatible standard DIMM. In one embodiment, the host interface 110 may communicate data between the mixed-technology memory module 100 and a memory controller within a host computer. The host interface 110 may be a standard DDR3 interface, for example. The DDR3 interface provides approximately 8 gigabyte/s read/write bandwidth per DIMM and a 15 nanosecond read latency when a standard DIMM uses standard DDR3 SDRAM. The host interface 110 may present any other JEDEC-compatible interface, or even, the host interface may present to the host system via a custom interface, and/or using a custom protocol.
[0026] The DDR3 host interface is defined by JEDEC as having 240 pins including data, command, control and clocking pins (as well as power and ground pins). There are two forms of the standard JEDEC DDR3 host interface using compatible 240-pin sockets: one set of pin definitions for registered DIMMs (R-DIMMs) and one set for unbuffered DIMMs (U-DIMMs). There are currently no unused or reserved pins in this JEDEC DDR3 standard. This is a typical situation in high-speed JEDEC standard DDR interfaces and other memory interfaces—that is normally all pins are used for very specific functions with few or no spare pins and very little flexibility in the use of pins. Therefore, it is advantageous and preferable to create a HybridDIMM that does not require any extra pins or signals on the host interface and uses the pins in a standard fashion.
[0027] In FIG. 1A , an interface 105 to the slow memory 104 may provide read bandwidth of 2-8 gigabyte/s with currently available flash memory chips depending on the exact number and arrangement of the memory chips on the HybridDIMM. Other configurations of the interface 105 are possible and envisioned by virtue of scaling the width and/or the signaling speed of the interface 105. However, in general, the slow memory 104, such as non-volatile memory (e.g. standard NAND flash memory), provides a read latency that is much longer than the read latency of the fast memory 106, such as DDR3 SDRAM, e.g. 25 microseconds for current flash chips versus 15 nanoseconds for DDR3 SDRAM.
[0028] The combination of the fast memory 106 and the controller 108, shown as an element 107 in FIG. 1A , allows the “bad” properties of the slow memory 104 (e.g. long latency) to be hidden from the memory controller and the host computer. When the memory controller performs an access to the mixed-technology memory module 100, the memory controller sees the “good” (e.g. low latency) properties of the fast memory 106. The fast memory 106 thus acts as a latency-hiding component to buffer the slow memory 104 and enable the HybridDIMM 100 to appear as if it were a standard memory module built using only the fast memory 106 operating on a standard fast memory bus.
[0029] FIG. 1B is an exploded hierarchical view of a logical model of the HybridDIMM 100, according to one embodiment. While FIG. 1A depicts an abstract and conceptual model of the HybridDIMM 100, FIG. 1B is a specific embodiment of the HybridDIMM 100. FIG. 1B replaces the simple view of a single block of slow memory (the slow memory 104 in FIG. 1A ) with a number of sub-assemblies or Sub-Stacks 122 that contain the slow memory (flash memory components 124). FIG. 1B also replaces the simple view of a single block of fast memory (the fast memory 106 in FIG. 1A ) by SRAM 144 in a number of Sub-Controllers 126. Further, the simple view of a single controller (the controller 108 in FIG. 1A ) is replaced now in FIG. 1B by the combination of a Super-Controller 116 and a number of Sub-Controllers 126. Of course, the particular HybridDIMM architecture shown in FIG. 1B is just one of many possible implementations of the more general architecture shown in FIG. 1A .
[0030] In the embodiment shown in FIG. 1B , the slow memory portion in the Sub-Stack 122 may use NAND flash, but, in alternative embodiments, could also use NOR flash, or any other relatively slow (relative to DRAM) memory. Also, in the embodiment shown in FIG. 1B , the fast memory in the Sub-Controller 126 comprises an SRAM 144, but could be comprised of DRAM, or embedded DRAM, or any other relatively fast (relative to flash) memory etc. Of course it is typical that memory made by use of differing technologies will exhibit different bandwidths and latencies. Accordingly, as a function of the overall architecture of the HybridDIMM 100, and in particular as a function of the Super-Controller 116, the differing access properties (including latency and bandwidth) inherent in the use of different memories are managed by logic. In other words, even though there may exist the situation where a one memory word is retrieved from (for example) SRAM, and another memory value retrieved from (for example) flash memory, the memory controller of the host computer (not shown) connected to the interface 110 is still presented with signaling and protocol as defined for just one of the aforementioned memories. For example, in the case that the memory controller requests a read of two memory words near a page boundary, 8 bits of data may be read from a memory value retrieved from (for example) SRAM 144, and 8 bits of data may be read from a memory value retrieved from (for example) the flash memory component 124.
[0031] Stated differently, any implementation of the HybridDIMM 100, may use at least two different memory technologies combined on the same memory module, and, as such, may use the lower latency fast memory as a buffer in order to mask the higher latency slow memory. Of course the foregoing combination is described as occurring on a single memory module, however the combination of a faster memory and a slower memory may be presented on the same bus, regardless of how the two types of memory are situated in the physical implementation.
[0032] The abstract model described above uses two types of memory on a single DIMM. Examples of such combinations include using any of DRAM, SRAM, flash, or any volatile or nonvolatile memory in any combination, but such combinations not limited to permutations involving only two memory types. For example, it is also possible to use SRAM, DRAM and flash memory circuits together in combination on a single mixed-technology memory module. In various embodiments, the HybridDIMM 100 may use on-chip SRAM together with DRAM to form the small but fast memory combined together with slow but large flash memory circuits in combination on a mixed-technology memory module to emulate a large and fast standard memory module.
[0033] Continuing into the hierarchy of the HybridDIMM 100, FIG. 1B shows multiple Super-Stack components 1021-102n (also referred to herein as Super-Stacks 102). Each Super-Stack 102 has an interface 112 that is shown in FIG. 1B as an 8-bit wide interface compatible with DDR3 SDRAMs with x8 organization, providing 8 bits to the DIMM interface 110. For example nine 8-bit wide Super-Stacks 102 may provide the 72 data bits of a DDR3 R-DIMM with ECC. Each Super-Stack 102 in turn comprises a Super-Controller 116 and at least one Sub-Stack 114. Additional Sub-Stacks 1131-113n (also referred to herein as Sub-Stacks 113) may be optionally disposed within any one or more of the Super-Stack components 1021-102n.
[0034] The Sub-Stack 122 in FIG. 1B , intended to illustrate components of any of the Sub-Stack 114 or the additional Sub-Stacks 113, is comprised of a Sub-Controller 126 and at least one slow memory component, for example a plurality of flash memory components 1241-124n (also referred to herein as flash memory components 124). Further continuing into the hierarchy of the HybridDIMM 100, the Sub-Controller 126 may include fast memory, such as the SRAM 144, queuing logic 154, interface logic 156 and one or more flash controller(s) 146 which may provide functions such as interface logic 148, mapping logic 150, and error-detection and error-correction logic 152.
[0035] In preferred embodiments, the HybridDIMM 100 contains nine or eighteen Super-Stacks 102, depending for example, if the HybridDIMM 100 is populated on one side (using nine Super-Stacks 102) of the HybridDIMM 100 or on both sides (using eighteen Super-Stacks 102). However, depending on the width of the host interface 110 and the organization of the Super-Stacks 102 (and, thus, the width of the interface 112), any number of Super-Stacks 102 may be used. As mentioned earlier, the Super-Controllers 116 are in electrical communication with the memory controller of the host computer through the host interface 110, which is a JEDEC DDR3-compliant interface.
[0036] The number and arrangement of Super-Stacks 102, Super-Controllers 116, and Sub-Controllers 126 depends largely on the number of flash memory components 124. The number of flash memory components 124 depends largely on the bandwidth and the capacity required of the HybridDIMM 100. Thus, in order to increase capacity, a larger number and/or larger capacity flash memory components 124 may be used. In order to increase bandwidth the flash memory components 124 may be time-interleaved or time-multiplexed, which is one of the functions of the Sub-Controller 126. If only a small-capacity and low-bandwidth HybridDIMM 100 is required, then it is possible to reduce the number of Sub-Controllers 126 to one and merge that function together with the Super-Controller 116 in a single chip, possibly even merged together with the non-volatile memory. Such a small, low-bandwidth HybridDIMM 100 may be useful in laptop or desktop computers for example, or in embedded systems. If a large-capacity and high-bandwidth HybridDIMM 100 is required, then a number of flash memory components 124 may be connected to one or more of the Sub-Controller 126 and the Sub-Controllers 126 connected to the Super-Controller 116. In order to describe the most general form of HybrdDIMM 100, the descriptions below will focus on the HybridDIMM 100 with separate Super-Controller 116 and multiple Sub-Controllers 126.
[0037] FIGS. 2 through 4 illustrate various implementations of the Super-Stack 102, the Sub-Stack 122, and the Sub-Controller 126.
[0038] FIG. 2 shows a HybridDIMM Super-Stack 200 with multiple Sub-Stacks, according to one embodiment. The HybridDIMM Super-Stack 200 shown in FIG. 2 comprises at least one Sub-Stack 204 including the slow memory and at least one Super-Controller 206. The HybridDIMM Super-Stack 200 shown in FIG. 2 may also comprise optional Sub-Stacks 2021-202n including the slow memory. Interfaces 210 between the Sub-Stack 204 (and/or the Sub-Stacks 2021-202n) and the Super-Controller 206 may be an industry-standard flash-memory interface (e.g. NAND, NOR, etc.) and/or they may be a flash memory interface designed for flash-memory subsystems (e.g. OneNAND, ONFI, etc.). The embodiment shown includes the Super-Controller 206 that communicates over the interface 112 (as shown in FIG. 1B ) to the memory controller of the host computer, using a standard memory interface (such as DDR3).
[0039] The Super-Controller 206 in FIG. 2 operates to provide error-detection and management of the interfaces 210 and 112, as well as management of the Sub-Stack 204, 2021-202n (also referred to herein as Sub-Stack components 204, 2021-202n). The Super-Stack interface 112 appears as if Super-Stack 200 was a standard memory component. In a preferred embodiment, the interface 112 conforms to JEDEC x8 DDR3 standard, however in other embodiments, it could be x4 or x16 DDR3, or could be DDR, DDR2, GDDR, GDDR5 etc. In still other embodiments, the interface 112 could include a serial memory interface such as an FBDIMM interface.
[0040] The interfaces 210 in FIG. 2 , between the Super-Controller 206 and one or more Sub-Stacks 204, 2021-202n, may be variously configured. Note first that in other embodiments the Super-Controller 206 may optionally connect directly to one or more flash memory components 124 illustrated in FIG. 1B (not shown in FIG. 2 ). In some embodiments that use an optional direct interface to the flash memory components 124, the protocol of interface 210 is one of several standard flash protocols (NAND, NOR, OneNAND, ONFI, etc). Additionally, and strictly as an option, in the case that the interface 210 communicates with Sub-Stacks 204, 2021-202n, the interface protocol may still be a standard flash protocol, or any other protocol as may be convenient.
[0041] With an understanding of the interfaces 210 and 112 of the Super-Stack 200, it follows to disclose some of the various functions of the Super-Stack 200.
[0042] The first internal function of the Super-Controller 206 is performed by a signaling translation unit 212 that translates signals (data, clock, command, and control) from a standard (e.g. DDR3) high-speed parallel (or serial in the case of a protocol such as FB-DIMM) memory channel protocol to one or more typically lower speed and possibly different bus-width protocols. The signaling translation unit 212 may thus also convert between bus widths (FIG. 2 shows a conversion from an m-bit bus to an n-bit bus). The signaling translation unit 212 converts the command, address, control, clock, and data signals from a standard memory bus to corresponding signals on the sub-stack or flash interface(s). The Super-Controller 206 may provide some or all (or none) of the logical functions of a standard DRAM interface to the extent it is “pretending” to be a DRAM on the memory bus. Thus in preferred embodiments, the Super-Controller 206 performs all the required IO characteristics, voltage levels, training, initialization, mode register responses and so on—as described by JEDEC standards. So, for example if the memory interface at 112 is a standard x8 DDR3 SDRAM interface then the Super-Controller memory interface as defined by the signaling translation unit 212 behaves as described by the JEDEC DDR3 DRAM standard.
[0043] A second internal function of the Super-Controller 206 is performed by protocol logic 216 that converts from one protocol (such as DDR3, corresponding to a fast memory protocol) to another (such as ONFI, corresponding to a slow memory protocol).
[0044] A third internal function of the Super-Controller 206 is performed by MUX/Interleave logic 214 that provides a MUX/DEMUX and/or memory interleave from a single memory interface to one or more Sub-Stacks 204, 2021-202n, or alternatively (not shown in FIG. 2 ) directly to one or more flash memory components 124. The MUX/Interleave logic 214 is necessary to match the speed of the slow memory 104 (flash) to the fast memory 106 (DRAM).
[0045] FIG. 3 shows a Sub-Stack 302 including a Sub-Controller 306, according to one embodiment. As shown in FIG. 3 , the Sub-Stack 302 includes the Sub-Controller 306 and a collection of NAND flash memory components 308, 3041-304n. The interface 210 between the Sub-Stack 302 and the Super-Controller, such as the Super-Controller 206 or 116, has already been described in the context of FIG. 2 . Interfaces 310 between the Sub-Controller 306 and the flash memory components 308, 3041-304n are standard flash interfaces. The interfaces 310 are defined by the flash memory components 308, 3041-304n that are used to build the Sub-Stack 302.
[0046] The flash memory components 308, 3041-304n are organized into an array or stacked vertically in a package using wire-bonded connections (alternatively through-silicon vias or some other connection technique or technology may be used). The Sub-Stack 302 shown as an example in FIG. 3 has 8 active flash memory components 3041-304n plus a spare flash memory component 308, resulting in an array or stack of 9 flash memory components 308, 3041-304n. The spare flash memory component 308 is included to increase the yield of the Sub-Stack 302 during assembly. The capacity of the flash memory in the Sub-Stack 302 in aggregate (exclusive of any spare capacity) is any arbitrary size (e.g. 8 gigabit, 16 gigabit, 32 gigabit, etc), and prophetic configurations are envisioned to be arbitrarily larger, bounded only by the practical limits of the availability of the flash memory components 308, 3041-304n. Thus, for example, the total flash capacity on a HybridDIMM with 9 Super-Stacks (eight data and one for ECC) with four Sub-Stacks each containing eight 8-gigabit flash chips would be 32 gigabytes. Of course any known or derivative technology for flash may be used, including SLC, MLC, etc.
[0047] FIG. 4 shows the Sub-Controller 306, according to one embodiment. The Sub-Controller 306 contains (physically or virtually) as many flash controllers 4061-406n as there are flash memory components 308, 3041-304n in the Sub-Stack 302, the fast memory 404, plus (optionally) additional components to provide interfacing features and advanced functions. The optional components include Command Queuing logic 414 and High-Speed Interface logic 416. The interface 210 shown in FIG. 4 between the Sub-Controller and Super-Controller has already been described in the context of both FIG. 2 and FIG. 3 . The interface 310 between the flash controllers and the flash chips was described in the context of FIG. 3 .
[0048] It should be noted that each flash controller 406 in FIG. 4 may be a single block implementing one or more flash controllers, or it may be a collection of flash controllers, one each dedicated to controlling a corresponding flash memory device.
[0049] The High-Speed Interface logic 416 is configured to convert from a high-speed interface capable of handling the aggregate traffic from all of the flash memory components 308, 3041-304n in the Sub-Stack 302 to a lower speed interface used by the flash controllers and each individual flash memory component 308, 3041-304n.
[0050] The Command Queuing logic 414 is configured to queue, order, interleave and MUX the data from both the fast memory 404 and array of slow flash memory components 308, 3041-304n.
[0051] Each flash controller 406 contains an Interface unit 408, a Mapping unit 418, as well as ECC (or error correction) unit 412. The Interface unit 408 handles the I/O to the flash components in the Sub-Stack 302, using the correct command, control and data signals with the correct voltage and protocol. The ECC unit 412 corrects for errors that may occur in the flash memory in addition to other well-known housekeeping functions typically associated with flash memory (such as bad-block management, wear leveling, and so on). It should be noted that one or more of these housekeeping functions associated with the use of various kinds of slow memory such as flash may be performed on the host computer instead of being integrated in the flash controller. The functionality of the Mapping unit 418 will be described in much more detail shortly and is the key to being able to access, address and handle the slow flash memory and help make it appear to the outside world as fast memory operating on a fast memory bus.
[0052] FIG. 5 depicts a cross-sectional view of one possible physical implementation of a 1-high Super-Stack 502, according to one embodiment. In this embodiment, the Super-Stack 502 is organized as two vertical stacks of chips. A first vertical stack comprising a Super-Controller 506 and a Sub-Controller 508 situated on one end of a multi-chip package (MCP) substrate, and a second vertical Sub-Stack 504 comprises a plurality of flash memory components. The stacks in FIG. 5 show connections between flash memory components made using wire bonds. This is a typical and well-known assembly technique for stacked chips. Other techniques such as through-silicon vias or other chip-stacking techniques may be used. In addition there is no requirement to stack the Super-Controller 506 and Sub-Controller 508 separately from the flash memory components.
[0053] FIG. 6A depicts a physical implementation of 2-high Super-Stack 602, according to one embodiment. This implementation is called “2-high” because it essentially takes the 1-high Super-Stack shown in FIG. 5 and duplicates it. In FIG. 6A , element 604 comprise the flash chips, element 608 is a Sub-Controller, and element 610 is a Super-Controller.
[0054] FIG. 6B depicts a physical implementation of 4-high Super-Stack 652, according to one embodiment. In FIG. 6B , element 654 comprise the flash chips, element 658 is a Sub-Controller, and element 610 is a Super-Controller.
[0055] Having described the high-level view and functions of the HybridDIMM 100 as well as the details of one particular example implementation we can return to FIG. 1A in order to explain the operation of the HybridDIMM 100. One skilled in the art will recognize that the slow memory 104 (discussed above in embodiments using non-volatile memory) can be implemented using any type of memory—including SRAM or DRAM or any other type of volatile or nonvolatile memory. In such as case the fast memory 106 acting as a latency-hiding buffer may emulate a DRAM, in particular a DDR3 SDRAM, and thus present over the host interface 110 according to any one (or more) standards, such as a JEDEC-compliant (or JEDEC-compatible) DDR3 SDRAM interface.
[0056] Now that the concept of emulation as implemented in embodiments of a HybridDIMM has been disclosed, we may now turn to a collection of constituent features, including advanced paging and advanced caching techniques. These techniques are the key to allowing the HybridDIMM 100 to appear to be a standard DIMM or to emulate a standard DIMM. These techniques use the existing memory management software and hardware of the host computer to enable two important things: first, to allow the computer to address a very large HybridDIMM 100, and, second, to allow the computer to read and write to the slow memory 104 indirectly as if the access were to the fast memory 106. Although the use and programming of the host computer memory management system described here employs one particular technique, the method is general in that any programming and use of the host computer that results in the same behavior is possible. Indeed because the programming of a host computer system is very flexible, one of the most powerful elements of the ideas described here is that it affords a wide range of implementations in both hardware and software. Such flexibility is both useful in itself and allows implementation on a wide range of hardware (different CPUs for example) and a wide range of operating systems (Microsoft Windows, Linux, Solaris, etc.).
[0057] In particular, embodiments of this invention include a host-based paging system whereby a paging system allows access to the mixed-technology memory module 100, a paging system is modified to allow access to the mixed-technology memory module 100 with different latencies, and modifications to a paging system that permits access to a larger memory space than the paging system would normally allow.
[0058] Again considering the fast memory 106, embodiments of this invention include a caching system whereby the Hybrid DIMM 100 alters the caching and memory access process.
[0059] For example, in one embodiment of the HybridDIMM 100 the well-known Translation Lookaside Buffer (TLB) and/or Page Table functions can be modified to accommodate a mixed-technology DIMM. In this case an Operating System (OS) of the host computer treats main memory on a module as if it were comprised of two types of memory or two classes of memory (and in general more than one type or class of memory). In our HybridDIMM implementation example, the first memory type corresponds to fast memory or standard DRAM and the second memory type corresponds to slow memory or flash. By including references in the TLB (the references may be variables, pointers or other forms of table entries) to both types of memory different methods (or routines) may be taken according to the reference type. If the TLB reference type shows that the memory access is to fast memory, this indicates that the required data is held in the fast memory (SRAM, DRAM, embedded DRAM, etc.) of the HybridDIMM (the fast memory appears to the host as if it were DRAM). In this case a read command is immediately sent to the HybridDIMM and the data is read from SRAM (as if it were normal DRAM). If the TLB shows that the memory access is to slow memory, this indicates that the required data is held in the slow memory (flash etc.) of the HybridDIMM. In this case a copy command is immediately sent to the HybridDIMM and the data is copied from flash (slow memory) to SRAM (fast memory). The translation between host address and HybridDIMM address is performed by the combination of the normal operation of the host memory management and the mapper logic function on the HybridDIMM using well-known and existing techniques. The host then waits for the copy to complete and issues a read command to the HybridDIMM and the copied data is read from SRAM (again now as if it were normal DRAM).
[0060] Having explained the general approach, various embodiments of such techniques, methods (or routines) are presented in further detail below. In order to offer consistency in usage of terms, definitions are provided here, as follows:
[0061] va—virtual address that caused the page fault
[0062] sp—SRAM page selected in Step 1
[0063] pa—a physical address
[0064] Page Table and Mapper requirements:
[0065] PageTable[va]==pa
[0066] Mapper[pa]==sp
[0067] Hence: Mapper[PageTable[va]]=sp
[0068] How do we select a physical address “pa”?
[0069] Must not already map to an active SRAM location
[0070] Must map to the BigDIMM that contains the “sp”
[0071] The caches must not contain stale data with “pa” physical tags
[0072] No processor in the coherence domain must contain a stale TLB entry for “va”
[0073] FIGS. 7 through 9 illustrate interactions between the OS of the host computer and the mixed-technology memory module 100 from the perspective of the OS. Although the method steps of FIGS. 7-9 are described with respect to the memory management portion of the computer OS, any elements or combination of elements within the OS and/or computer configured to perform the method steps, in any order, falls within the scope of the present invention.
[0074] FIG. 7 shows a method 700 for returning data resident on the HybridDIMM to the memory controller. As an option, the present method 700 may be implemented in the context of the architecture and functionality of FIG. 1 through FIG. 6 . Of course, however, the method 700 or any operation therein may be carried out in any desired environment.
[0075] The method 700 as described herein may be entered as a result of a request from the memory controller for some data resident on a HybridDIMM. The operation underlying decision 702 may find the data is “Present” on the HybridDIMM (it is standard and well-known that an OS uses the terms “Present” and “Not Present” in its page tables). The term “Present” means that the data is being held in the fast memory on a HybridDIMM. To the OS it is as if the data is being held in standard DRAM memory, though the actual fast memory on the HybridDIMM may be SRAM, DRAM, embedded DRAM, etc. as we have already described. In the example here we shall use fast memory and SRAM interchangeably and we shall use slow memory and flash memory interchangeably. If the data is present then the BigDIMM returns the requested data as in a normal read operation (operation 712) to satisfy the request from the memory controller. Alternatively, if the requested data is “Not Present” in fast memory, the OS must then retrieve the data from slow memory. Of course retrieval from slow memory may include various housekeeping and management (as already has been described for flash memory, for example). More specifically, in the case that the requested data is not present in fast memory, the OS allocates a free page of fast memory (operation 704) to serve as a repository, and possibly a latency-hiding buffer for the page containing the requested data. Once the OS allocates a page of fast memory, the OS then copies at least one page of memory from slow memory to fast memory (operation 706). The OS records the success of the operation 706 in the page table (see operation 708). The OS then records the range of addresses now present in fast memory in the mapper (see operation 710). Now that the initially requested data is present in fast memory, the OS restarts the initially memory access operation from the point of decision 702.
[0076] To make the operations required even more clear the following pseudo-code describes the steps to be taken in an alternative but equivalent fashion:
A. If Data is “Present” (e.g. present in memory type DRAM) in the HybridDIMM:
-
- [0077] The HybridDIMM SRAM behaves the same as standard DRAM
B. Data “Not Present” (e.g. present in memory type Flash)—there is a HybridDIMM Page Fault:
- [0077] The HybridDIMM SRAM behaves the same as standard DRAM
[0078] 1. Get free SRAM page
[0079] 2. Copy flash page to SRAM page
[0080] 3. Update Page Table and/or TLB
[0081] 4. Update Mapper
[0082] 5. Restart Read/Write (Load/Store)
[0083] We will describe the steps taken in method or code branch B above in more detail presently. First, we must describe the solution to a problem that arises in addressing or accessing the large HybridDIMM. In order to access the large memory space that is made possible by using a HybridDIMM (which may be as much as several terabytes), the host OS may also modify the use of well-known page-table structures. Thus for example, a 256 terabyte virtual address space (a typical limit for current CPUs because of address-length limitations) may be mapped to pages of a HybridDIMM using the combination of an OS page table and a mapper on the HybridDIMM. The OS page table may map the HybridDIMM pages in groups of 8. Thus entries in the OS page table correspond to HybrdDIMM pages (or frames) 0-7, 8-15, 16-23 etc. Each entry in the OS page table points to a 32 kilobyte page (or frame), that is either in SRAM or in flash on the HybridDIMM. The mapping to the HybridDIMM space is then performed through a 32 GB aperture (a typical limit for current memory controllers that may only address 32 GB per DIMM). In this case a 128-megabyte SRAM on the HybridDIMM contains 4096 pages that are each 32 kilobyte in size. A 2-terabyte flash memory (using 8-, 16-, or 32-gigabit flash memory chips) on the HybridDIMM also contains pages that are 32 kilobyte (made up from 8 flash chips with 4 kilobyte per flash chip).
[0084] The technique of using an aperture, mapper, and table in combination is well-known and similar to, for example, Accelerated Graphics Port (AGP) graphics applications using an AGP Aperture and a Graphics Address Relocation Table (GART).
[0085] Now the first four steps of method or code branch B above will be described in more detail, first using pseudo-code and then using a flow diagram and accompanying descriptions:
[0086]
| Step 1 - Get a free SRAM page |
| Get free SRAM page( ) |
| if SRAM page free list is empty( ) then |
| Free an SRAM page; |
| Pop top element from SRAM page free list |
| Free an SRAM page: |
| sp = next SRAM page to free; // depending on |
| chosen replacement policy |
| if sp is dirty then |
| foreach cache line CL in sp do // ensure |
| SRAM contains last written data; |
| // could instead also set caches to write- |
| through |
| CLFlush(CL); //<10 μs per 32 KB |
| fp = Get free flash page; // wear leveling, etc. is perfomed here |
| Send SRAM2flashCpy(sp, fp) command to DIMM; |
| Wait until copy completes; |
| else |
| fp = flash address that sp maps to; |
| Page Table [virtual address(sp)] = “not present”, fp; |
| // In MP environment must handle multiple TLBs |
| using additional code here |
| Mapper[sp] = “unmapped” |
| Push sp on SRAM page free list |
| Step 2 - Copy flash page to SRAM |
| Copy flash page to SRAM page: |
| Send flash2SRAMCpy(sp, fp) command to DIMM; |
| Wait until copy completes; |
| Step 3 - Update Page Table |
| Update Page Table: |
| // Use a bit-vector and rotate through the |
| vector-cycling from 0 GB up to the 32 GB |
| aperture and then roll around to 0 GB, re-using |
| physical addresses |
| pa = next unused physical page; |
| if (pa == 0) then |
| WBINVD; // we have rolled around so flush |
| and invalidate the entire cache |
| PageTable[va] = pa; |
[0087] Now we shall describe the key elements of these steps in the pseudo-code above using flow diagrams and accompanying descriptions. FIG. 8A shows a method 800 for the OS to obtain a free page of fast memory (“Get free SRAM page” in the above pseudo-code). Remember we are using fast memory and SRAM interchangeably for this particular example implementation. As an option, the present method 800 may be implemented in the context of the architecture and functionality of FIG. 1 through FIG. 7 . Of course, however, the method 800 or any operation therein may be carried out in any desired environment.
[0088] The operation 704 from FIG. 7 indicates an operation for the OS to get a page of fast memory. Although many embodiments are possible and conceived, one such operation is disclosed here, namely the method 800. That is, the method 800 is entered at entry point 802 whenever a new page of fast memory is needed. The decision 804 checks for a ready and available page from the page free stack. If there is such an available page, the OS pops that page from the page free stack and returns it in operation 810. Alternatively, if the free stack is empty then the decision 804 will proceed to operation 806. Operation 806 serves to acquire a free fast memory page, whether acquired from a pool or reused resources or whether from a newly allocated page. Once acquired then, the OS pushes the pointer to that page onto the page free stack and the processing proceeds to operation 810, returning the free fast memory page as is the intended result to the method 800.
[0089] FIG. 8B shows a method 850 for the OS to free a page of fast memory (“Free an SRAM page” in the above pseudo-code). As an option, the present method 850 may be implemented in the context of the architecture and functionality of FIG. 1 through FIG. 8A . Of course, however, the method 850 or any operation therein may be carried out in any desired environment.
[0090] The operation 806 from FIG. 8A indicates an operation for the OS to free a page of fast memory. Although many embodiments are possible and conceived, one embodiment of such an operation is disclosed here, namely the method 850. That is, the method 850 is operable to free a page of fast memory, while maintaining the fidelity of any data that may had previously been written to the page.
[0091] As shown, the system is entered when a page of fast memory is required. In general, a free fast memory page could be a page that had previously been allocated, used and subsequently freed, or may be a page that has been allocated and is in use at the moment that the method 850 is executed. The decision 856 operates on a pointer pointing to the next fast memory page to free (from operation 854) to determine if the page is immediately ready to be freed (and re-used) or if the page is in use and contains data that must be retained in slow memory (a “dirty” page). In the latter case, a sequence of operations may be performed in the order shown such that data integrity is maintained. That is, for each cache line CL (operation 858), the OS flushes the cache line (operation 860), the OS assigns a working pointer FP to point to a free slow memory page (see operation 862), the OS writes the ‘Dirty’ fast memory page to slow memory (operation 864), and the loop continues once the operation 864 completes.
[0092] In the alternative (see decision 856), if the page is immediately ready to be freed (and re-used), then the OS assigns the working pointer FP to point to a slow memory address that SP maps to (operation 868). Of course since the corresponding page will now be reused for cache storage of new data, the page table must be updated accordingly to reflect that the previously cached address range is (or will soon be) no longer available in cache (operation 870). Similarly, the OS records the status indicating that address range is (or will soon be) not mapped (see operation 872). Now, the page of fast memory is free, the data previously cached in that page (if any) has been written to slow memory, and the mapping status has been marked; thus the method 850 pushes the pointer to the page of fast memory onto the page free stack.
[0093] FIG. 9 shows a method 900 copying a page of slow memory to a page of fast memory. As an option, the present method 900 may be implemented in the context of the architecture and functionality of FIG. 1 through FIG. 8B . Of course, however, the method 900 or any operation therein may be carried out in any desired environment.
[0094] The operation 706 from FIG. 7 indicates an operation to copy page of slow memory to a page of fast memory. In the embodiment shown, the OS is operable to not only perform the actually copy, but also to perform bookkeeping and synchronization. In particular, after the actual copy is performed (operation 904) the OS sends the fact that this copy has been performed to the HybridDIMM (operation 906) and the method 900 waits (operation 908) until completion of operation 906 is signaled.
[0095] These methods and steps are described in detail only to illustrate one possible approach to constructing a host OS and memory subsystem that uses mixed-technology memory modules.
[0096] While the foregoing is directed to embodiments of the present invention, other and further embodiments of the present invention may be devised without departing from the basic scope thereof, and the scope thereof is determined by the claims that follow.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
We claim:
1. A hybrid memory module, comprising:
a plurality of super-stacks; and
a host interface configured to transmit data between the plurality of super-stacks and a memory controller,
wherein each super-stack includes:
a respective plurality of sub-stacks, each of the sub-stacks including: a respective sub-controller, a plurality of memory devices of a first memory type and a memory device of a second memory type,
a respective super-controller configured to control the plurality of sub-stacks, and
a respective super-stack interface configured to transmit data between the plurality of sub-stacks and the host interface.
2. The hybrid memory module of claim 1, wherein each respective sub-controller is configured to control the plurality of memory devices of the first memory type, and wherein each sub-stack further includes:
a respective interface configured to transmit data between the sub-controller and the super-controller.
3. The hybrid memory module of claim 2, wherein each sub-controller includes:
the respective memory device of the second memory type;
a respective plurality of flash controllers configured to provide interface, mapping, error detection, or error correction functionality to the plurality of memory devices of the first memory type; and
a respective flash interface configured to transmit data between the plurality of flash controllers and the plurality of memory devices of the first memory type.
4. The hybrid memory module of claim 3, wherein:
the number of flash controllers within the plurality of flash controllers is equal to the number of memory devices within the plurality of memory devices of the first memory type, and
each flash controller provides interface, mapping, error detection, and error correction functionality to only one of the plurality of the memory devices of the first memory type.
5. The hybrid memory module of claim 3, wherein the plurality of flash controllers are implemented in a single block.
6. The hybrid memory module of claim 3, wherein the sub-controller further includes command queuing logic configured to:
receive first data from the plurality of memory devices of the first memory type and the memory device of the second memory type;
multiplex the first data to produce multiplexed data; and
transmit the multiplexed data to the super-controller via the interface.
7. The hybrid memory module of claim 6, wherein the command queuing logic is further configured to:
receive second data from the super-controller via the interface;
demultiplex the received second data to produce demultiplexed data; and
transmit the demultiplexed data to at least one of the plurality of memory devices of the first memory type via the flash interface and the memory device of the second memory type.
8. The hybrid memory module of claim 3, wherein the sub-controller further includes high-speed interface logic configured to convert the data communicated via the interface to the data communicated via the flash interface.
9. The hybrid memory module of claim 3, wherein the super-controller includes a signaling translation unit configured to translate data, clock, command, and control signals from a first memory channel protocol having a first signaling speed to a second memory channel protocol having a second signaling speed, the second signaling speed being different from the first signaling speed.
10. The hybrid memory module of claim 3, wherein the super-controller includes protocol logic configured to convert a first protocol used to transmit data via the interface to a second protocol.
11. The hybrid memory module of claim 3, wherein the super-controller includes logic configured to match the speed of each memory device of the first memory type with the speed of the memory device of the second memory type.
12. The hybrid memory module of claim 3, wherein the first memory type comprises non-volatile memory.
13. The hybrid memory module of claim 12, wherein the non-volatile memory comprises NAND flash memory.
14. The hybrid memory module of claim 12, wherein the sub-stack includes a spare device.
15. The hybrid memory module of claim 3, wherein the second memory type comprises volatile memory.
16. The hybrid memory module of claim 15, wherein the volatile memory comprises Static Random Access Memory (SRAM) memory.
17. The hybrid memory module of claim 1, wherein the hybrid memory module comprises a dual inline memory module (DIMM).
18. The hybrid memory module of claim 1, wherein the hybrid memory module is part of a memory subsystem.
19. The hybrid memory module of claim 1, wherein the hybrid memory module is coupled to a motherboard.
20. The hybrid memory module of claim 1, wherein the hybrid memory module is included in a computer system.
21. A hybrid memory module, comprising:
a plurality of super-stacks; and
a host interface configured to transmit data between the plurality of super-stacks and a memory controller,
wherein each super-stack includes:
a plurality of sub-stacks, each of the sub-stacks including:
a respective plurality of non-volatile memory devices;
a respective sub-controller configured to control the plurality of non-volatile memory devices, the sub-controller including a volatile memory device; and
a respective interface configured to transmit data between the sub-controller and a super-controller; and
the super-controller configured to control the plurality of sub-stacks, and
a super-stack interface configured to transmit data between the plurality of sub-stacks and the first interface.
22. The hybrid memory module of claim 21, wherein each sub-controller includes:
a respective plurality of flash controllers configured to provide interface, mapping, error detection, or error correction functionality to the plurality of non-volatile memory devices; and
a respective flash interface configured to transmit data between the plurality of flash controllers and the plurality of non-volatile memory devices.
23. The hybrid memory module of claim 22, wherein:
the number of flash controllers within the plurality of flash controllers is equal to the number of non-volatile memory devices within the plurality of non-volatile memory devices, and
each flash controller provides interface, mapping, error detection, and error correction functionality to only one of the plurality of non-volatile memory devices.
24. The hybrid memory module of claim 22, wherein the plurality of flash controllers are implemented in a single block.
25. The hybrid memory module of claim 22, wherein the sub-controller further includes command queuing logic configured to:
receive first data from at least two of the plurality of non-volatile memory devices;
multiplex the first data to produce multiplexed data; and
transmit the multiplexed data to the super-controller via the interface.
26. The hybrid memory module of claim 25, wherein the command queuing logic is further configured to:
receive second data from the super-controller via the interface;
demultiplex the received second data to produce demultiplexed data; and
transmit the demultiplexed data to at least two of the plurality of non-volatile memory devices via the flash interface.
27. The hybrid memory module of claim 22, wherein the sub-controller further includes high-speed interface logic configured to convert the data communicated via the interface to the data communicated via the flash interface.
28. The hybrid memory module of claim 22, wherein the super-controller includes a signaling translation unit configured to translate data, clock, command, and control signals from a first memory channel protocol having a first signaling speed to a second memory channel protocol having a second signaling speed, the second signaling speed being different from the first signaling speed.
29. The hybrid memory module of claim 22, wherein the super-controller includes protocol logic configured to convert a first protocol used to transmit data via the interface to a second protocol.
30. A hybrid memory module, comprising:
a plurality of super-stacks; and
a host interface configured to transmit data between the plurality of super-stacks and a memory controller,
wherein each super-stack includes:
a plurality of sub-stacks, each of the sub-stacks including:
a respective plurality of flash memory devices;
a respective sub-controller configured to control the plurality of flash memory devices, the sub-controller including:
a volatile memory device;
a respective plurality of flash controllers configured to provide interface, mapping, error detection, or error correction functionality to the plurality of flash memory devices, the respective plurality of flash controllers being equal in number to the flash memory devices; and
a respective flash interface configured to transmit data between the plurality of flash controllers and the plurality of flash memory devices;
a respective interface configured to transmit data between the sub-controller and a super-controller; and
the super-controller configured to control the plurality of sub-stacks, and
a super-stack interface configured to transmit data between the plurality of sub-stacks and the host interface.
31. The hybrid memory module of claim 30, wherein the plurality of flash controllers are implemented in a single block.
32. The hybrid memory module of claim 30, wherein the sub-controller further includes command queuing logic configured to:
receive first data from at least two of the plurality of non-volatile memory devices;
multiplex the first data to produce multiplexed data; and
transmit the multiplexed data to the super-controller via the interface.
33. The hybrid memory module of claim 32, wherein the command queuing logic is further configured to:
receive second data from the super-controller via the interface;
demultiplex the received second data to produce demultiplexed data; and
transmit the demultiplexed data to at least two of the plurality of non-volatile memory devices via the flash interface.
34. The hybrid memory module of claim 30, wherein the sub-controller further includes high-speed interface logic configured to convert the data communicated via the interface to the data communicated via the flash interface.
35. The hybrid memory module of claim 30, wherein the super-controller includes a signaling translation unit configured to translate data, clock, command, and control signals from a first memory channel protocol having a first signaling speed to a second memory channel protocol having a second signaling speed, the second signaling speed being different from the first signaling speed.
36. The hybrid memory module of claim 30, wherein the super-controller includes protocol logic configured to convert a first protocol used to transmit data via the interface to a second protocol.
Patent Citations (822)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3800292(A) | 1974-03-01 | Curley et al. | Applicant |
| 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 |
| US4566082(A) | 1986-01-01 | Anderson | 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 |
| US4807191(A) | 1989-02-01 | Flannagan | Applicant |
| US4841440(A) | 1989-06-01 | Yonezu et al. | Applicant |
| US4862347(A) | 1989-08-01 | Rudy | Applicant |
| 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 |
| US4956694(A) | 1990-09-01 | Eide | 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. | Applicant |
| US5212666(A) | 1993-05-01 | Takeda | Applicant |
| US5220672(A) | 1993-06-01 | Nakao et al. | Applicant |
| US5241266(A) | 1993-08-01 | Ahmad et al. | Applicant |
| US5252807(A) | 1993-10-01 | Chizinsky | Applicant |
| US5257233(A) | 1993-10-01 | Schaefer | Applicant |
| US5278796(A) | 1994-01-01 | Tillinghast et al. | Applicant |
| US5282177(A) | 1994-01-01 | McLaury | Applicant |
| US5332922(A) | 1994-07-01 | Oguchi et al. | Applicant |
| US5347428(A) | 1994-09-01 | Carson et al. | Applicant |
| US5369749(A) | 1994-11-01 | Baker et al. | Applicant |
| US5384745(A) | 1995-01-01 | Konishi et al. | Applicant |
| US5388265(A) | 1995-02-01 | Volk | Applicant |
| US5390334(A) | 1995-02-01 | Harrison | 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 |
| 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 |
| 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 |
| US5608262(A) | 1997-03-01 | Degani 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 |
| USRE35733(E) | 1998-02-01 | Hernandez 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 |
| US5818788(A) | 1998-10-01 | Kimura et al. | Applicant |
| US5819065(A) | 1998-10-01 | Chilton 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 |
| US5838165(A) | 1998-11-01 | Chatter | 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 |
| US5878279(A) | 1999-03-01 | Athenes | 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 |
| US5913072(A) | 1999-06-01 | Wierenga | 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 |
| 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. | Applicant |
| 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 |
| US6001671(A) | 1999-12-01 | Fjelstad | 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 |
| US6065092(A) | 2000-05-01 | Roy | 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 |
| US6101564(A) | 2000-08-01 | Athenes 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 |
| US6125072(A) | 2000-09-01 | Wu | 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 |
| US6181640(B1) | 2001-01-01 | Kang | 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 |
| US6226709(B1) | 2001-05-01 | Goodwin et al. | Applicant |
| US6226730(B1) | 2001-05-01 | Murdoch 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 |
| US6336174(B1) | 2002-01-01 | Li et al. | 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 |
| US6343019(B1) | 2002-01-01 | Jiang 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 |
| US6424532(B2) | 2002-07-01 | Kawamura | 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 |
| US6489669(B2) | 2002-12-01 | Shimada et al. | Applicant |
| US6490161(B1) | 2002-12-01 | Johnson | Applicant |
| US6492726(B1) | 2002-12-01 | Quek et al. | Applicant |
| US6493789(B2) | 2002-12-01 | Ware et al. | Applicant |
| US6496440(B2) | 2002-12-01 | Manning | Applicant |
| US6496897(B2) | 2002-12-01 | Ware et al. | Applicant |
| US6498766(B2) | 2002-12-01 | Lee et al. | Applicant |
| US6510097(B2) | 2003-01-01 | Fukuyama | Applicant |
| US6510503(B2) | 2003-01-01 | Gillingham et al. | Applicant |
| US6512392(B2) | 2003-01-01 | Fleury et al. | Applicant |
| US6521984(B2) | 2003-02-01 | Matsuura | 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. | Applicant |
| US6560158(B2) | 2003-05-01 | Choi et al. | Applicant |
| US6563337(B2) | 2003-05-01 | Dour | Applicant |
| US6563759(B2) | 2003-05-01 | Yahata et al. | Applicant |
| US6564281(B2) | 2003-05-01 | Farmwald et al. | Applicant |
| US6564285(B1) | 2003-05-01 | Mills et al. | Applicant |
| US6574150(B2) | 2003-06-01 | Suyama et al. | Applicant |
| US6584037(B2) | 2003-06-01 | Farmwald et al. | Applicant |
| US6587912(B2) | 2003-07-01 | Leddige et al. | Applicant |
| US6590822(B2) | 2003-07-01 | Hwang et al. | Applicant |
| US6594770(B1) | 2003-07-01 | Sato et al. | Applicant |
| 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 |
| US6628538(B2) | 2003-09-01 | Funaba et al. | Applicant |
| US6630729(B2) | 2003-10-01 | Huang | 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 | Applicant |
| US6650594(B1) | 2003-11-01 | Lee et al. | Applicant |
| US6657634(B1) | 2003-12-01 | Sinclair 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 |
| US6668242(B1) | 2003-12-01 | Reynov et al. | 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 |
| US6713856(B2) | 2004-03-01 | Tsai et al. | Applicant |
| US6714891(B2) | 2004-03-01 | Dendinger | Applicant |
| US6724684(B2) | 2004-04-01 | Kim | Applicant |
| US6730540(B2) | 2004-05-01 | Siniaguine | Applicant |
| US6731009(B1) | 2004-05-01 | Jones et al. | Applicant |
| US6731527(B2) | 2004-05-01 | Brown | Applicant |
| US6742098(B1) | 2004-05-01 | Halbert et al. | 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. | Applicant |
| US6839290(B2) | 2005-01-01 | Ahmad et al. | Applicant |
| US6845027(B2) | 2005-01-01 | Mayer et al. | Applicant |
| US6845055(B1) | 2005-01-01 | Koga et al. | Applicant |
| US6847582(B2) | 2005-01-01 | Pan | Applicant |
| US6850449(B2) | 2005-02-01 | Takahashi | Applicant |
| 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 |
| US6878570(B2) | 2005-04-01 | Lyu 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 |
| US6914786(B1) | 2005-07-01 | Paulsen et al. | Applicant |
| US6917219(B2) | 2005-07-01 | New | Applicant |
| US6922371(B2) | 2005-07-01 | Takahashi et al. | Applicant |
| 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 |
| US6943450(B2) | 2005-09-01 | Fee et al. | Applicant |
| US6944748(B2) | 2005-09-01 | Sanches et al. | Applicant |
| US6947341(B2) | 2005-09-01 | Stubbs et al. | Applicant |
| US6951982(B2) | 2005-10-01 | Chye 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 |
| US7043611(B2) | 2006-05-01 | McClannahan et al. | Applicant |
| US7045396(B2) | 2006-05-01 | Crowley et al. | Applicant |
| US7045901(B2) | 2006-05-01 | Lin et al. | Applicant |
| US7046538(B2) | 2006-05-01 | Kinsley et al. | Applicant |
| US7053470(B1) | 2006-05-01 | Sellers et al. | Applicant |
| US7053478(B2) | 2006-05-01 | Roper 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 |
| US7066741(B2) | 2006-06-01 | Burns et al. | Applicant |
| US7075175(B2) | 2006-07-01 | Kazi et al. | Applicant |
| US7079396(B2) | 2006-07-01 | Gates 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 |
| US7110322(B2) | 2006-09-01 | Farmwald 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 |
| US7138823(B2) | 2006-11-01 | Janzen 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 |
| US7337293(B2) | 2008-02-01 | Brittain 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 |
| US7457122(B2) | 2008-11-01 | Lai et al. | 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 |
| US7480147(B2) | 2009-01-01 | Hoss 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 |
| US7934070(B2) | 2011-04-01 | Brittain et al. | Applicant |
| US7990797(B2) | 2011-08-01 | Moshayedi 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. | Examiner |
| 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 |
| US2001/0046163(A1) | 2001-11-01 | Yanagawa | 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 | Applicant |
| US2002/0060945(A1) | 2002-05-01 | Ikeda | Applicant |
| US2002/0060948(A1) | 2002-05-01 | Chang et al. | Applicant |
| 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/0129204(A1) | 2002-09-01 | Leighnor et al. | 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/0011993(A1) | 2003-01-01 | Summers et al. | Applicant |
| US2003/0021175(A1) | 2003-01-01 | Tae Kwak | Applicant |
| US2003/0026155(A1) | 2003-02-01 | Yamagata | 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/0083855(A1) | 2003-05-01 | Fukuyama | Applicant |
| US2003/0088743(A1) | 2003-05-01 | Rader | 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. | Applicant |
| US2003/0158995(A1) | 2003-08-01 | Lee et al. | Applicant |
| US2003/0164539(A1) | 2003-09-01 | Yau | Applicant |
| US2003/0164543(A1) | 2003-09-01 | Kheng Lee | Applicant |
| US2003/0182513(A1) | 2003-09-01 | Dodd et al. | Applicant |
| US2003/0183934(A1) | 2003-10-01 | Barrett | 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/0205802(A1) | 2003-11-01 | Segaram et al. | 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/0042503(A1) | 2004-03-01 | Shaeffer 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/0083324(A1) | 2004-04-01 | Rabinovitz 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/0195682(A1) | 2004-10-01 | Kimura | 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/0250989(A1) | 2004-12-01 | Im et al. | 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/0086548(A1) | 2005-04-01 | Haid 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/0127531(A1) | 2005-06-01 | Tay et al. | 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 et al. | 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 et al. | Applicant |
| US2005/0193183(A1) | 2005-09-01 | Barth et al. | 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/0201063(A1) | 2005-09-01 | Lee 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. | Applicant |
| US2005/0243635(A1) | 2005-11-01 | Schaefer | Applicant |
| US2005/0246558(A1) | 2005-11-01 | Ku | 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/0269715(A1) | 2005-12-01 | Yoo | 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/0286334(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/0038597(A1) | 2006-02-01 | Becker et al. | Applicant |
| US2006/0039204(A1) | 2006-02-01 | Cornelius | Applicant |
| US2006/0039205(A1) | 2006-02-01 | Cornelius | Applicant |
| US2006/0041711(A1) | 2006-02-01 | Miura et al. | Applicant |
| US2006/0041730(A1) | 2006-02-01 | Larson | Applicant |
| US2006/0044909(A1) | 2006-03-01 | Kinsley et al. | Applicant |
| US2006/0044913(A1) | 2006-03-01 | Klein et al. | Applicant |
| US2006/0049502(A1) | 2006-03-01 | Goodwin 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/0118933(A1) | 2006-06-01 | Haba | 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/0136791(A1) | 2006-06-01 | Nierle | 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/0179262(A1) | 2006-08-01 | Brittain et al. | Applicant |
| US2006/0179333(A1) | 2006-08-01 | Brittain et al. | Applicant |
| US2006/0179334(A1) | 2006-08-01 | Brittain et al. | Applicant |
| US2006/0180926(A1) | 2006-08-01 | Mullen et al. | Applicant |
| US2006/0181953(A1) | 2006-08-01 | Rotenbert 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/0188997(A1) | 2007-08-01 | Hockanson 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/0089034(A1) | 2008-04-01 | Hoss 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/0126624(A1) | 2008-05-01 | Prete 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/0155136(A1) | 2008-06-01 | Hishino | Applicant |
| US2008/0159027(A1) | 2008-07-01 | Kim | Applicant |
| US2008/0170425(A1) | 2008-07-01 | Rajan | Applicant |
| US2008/0215832(A1) | 2008-09-01 | Allen et al. | Applicant |
| US2008/0239857(A1) | 2008-10-01 | Rajan et al. | Applicant |
| US2008/0239858(A1) | 2008-10-01 | Rajan et al. | Applicant |
| US2008/0256282(A1) | 2008-10-01 | Guo et al. | Applicant |
| US2009/0024789(A1) | 2009-01-01 | Rajan et al. | Applicant |
| US2009/0024790(A1) | 2009-01-01 | Rajan et al. | Applicant |
| US2009/0109613(A1) | 2009-04-01 | Legen 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/0005218(A1) | 2010-01-01 | Gower et al. | Applicant |
| US2010/0020585(A1) | 2010-01-01 | Rajan | Applicant |
| US2010/0257304(A1) | 2010-10-01 | Rajan et al. | Applicant |
| US2010/0271888(A1) | 2010-10-01 | Rajan | Applicant |
| US2010/0281280(A1) | 2010-11-01 | Rajan et al. | Applicant |
| DE102004051345 | 2006-05-01 | Applicant | |
| DE102004053316 | 2006-05-01 | Applicant | |
| DE102005036528 | 2007-02-01 | Applicant | |
| JP62121978 | 1987-06-01 | Applicant | |
| JP1-171047 | 1989-07-01 | Applicant | |
| JP3-29357 | 1991-02-01 | Applicant | |
| JP3-276487(B2) | 1991-12-01 | Applicant | |
| JP3-286234 | 1991-12-01 | Applicant | |
| JP7-141870 | 1995-06-01 | Applicant | |
| JP8-77097 | 1996-03-01 | Applicant | |
| JP11-149775 | 1999-06-01 | Applicant | |
| JP22025255(A2) | 2002-01-01 | Applicant | |
| JP3304893(B2) | 2002-05-01 | Applicant | |
| JP2006236388 | 2006-09-01 | Applicant | |
| KR1020040062717 | 2004-07-01 | Applicant | |
| WO9900734 | 1999-01-01 | Applicant | |
| WO/45270 | 2000-08-01 | Applicant | |
| WO2004/051645 | 2004-06-01 | Applicant | |
| WO2007002324 | 2007-01-01 | Applicant | |
| WO2007/028109 | 2007-03-01 | Applicant | |
| WO2007/095080 | 2007-08-01 | Applicant | |
| WO2008063251 | 2008-05-01 | Applicant |
Non-Patent Literature (128)
- Non-final Office Action from U.S. Appl. No. 11/939,432 mailed on Feb. 19, 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, CA. Oct. 4-7, 1994. SIGARCH Computer Architecture News 22 (Special Issue Oct. 1994), SIGOPS Operating Systems Review 28(5) 1994, and SIGPLAN Notices 29 (11) 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 U.S. Appl. No. 11/461,430 Mailed Feb. 19, 2009.Applicant
- Final Office Action From U.S. Appl. No. 11/461,435 Mailed Jan. 28, 2009.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
- 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/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
- Non-Final Office Action from U.S. Appl. No. 12/378,328 Dated Jul. 15, 2011.Applicant
- Final Office Action from U.S. Appl. No. 11/461,420 Dated Jul. 20, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/461,437 Dated Jul. 25, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/702,981 Dated Aug. 5, 2011.Applicant
- Notice of Allowability from U.S. Appl. No. 11/855,826 Dated Aug. 15, 2011.Applicant
- Non-Final Office Action from U.S. Appl. No. 12/574,628 Dated Sep. 20, 2011.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/858,518 Dated Sep. 27, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/929,571 Dated Sep. 27, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/929,500 Dated Sep. 27, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/941,589 Dated Sep. 30, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 12/816,756 Dated Oct. 3, 2011.Applicant
- Non-Final Office Action from U.S. Appl. No. 12/508,496 Dated Oct. 11, 2011.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/588,739 Dated Oct. 13, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/939,432 Dated Oct. 24, 2011.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/929,631 Dated Nov. 1, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/515,223 Dated Nov. 29, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 12/769,428 Dated Nov. 29, 2011.Applicant
- Final Office Action from U.S. Appl. No. 11/939,440 Dated Dec. 12, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/762,013 Dated Feb. 23, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/929,500 Dated Feb. 24, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/763,365 Dated Mar. 1, 2011.Applicant
- Final Office Action from U.S. Appl. No. 12/574,628 Dated Mar. 3, 2011.Applicant
- Final Office Action from U.S. Appl. No. 11/929,571 Dated Mar. 3, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/611,374 Dated Mar. 4, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/929,483 Dated Mar. 4, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 11/553,399 Dated Mar. 18, 2011.Applicant
- Final Office Action from U.S. Appl. No. 12/507,682 Dated Mar. 29, 2011.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/929,403 Dated Mar. 31, 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
- Non-Final Office Action from U.S. Appl. No. 11/553,372 Dated Nov. 14, 2011.Applicant
- Notice of Allowance from U.S. Appl. No. 12/797,557 Dated Dec. 28, 2011.Applicant
- Office Action, including English translation, from co-pending Japanese application No. 2008-529353, Dated Jan. 10, 2012.Applicant
- Notice of Allowance from U.S. Appl. No. 12/838,896 Dated Jan. 18, 2012.Applicant
- Final Office Action from U.S. Appl. No. 11/929,655 Dated Jan. 19, 2012.Applicant
- Final Office Action from U.S. Appl. No. 12/378,328 Dated Feb. 3, 2012.Applicant
- Final Office Action from U.S. Appl. No. 11/672,921 Dated Feb. 16, 2012.Applicant
- Final Office Action from U.S. Appl. No. 11/672,924 Dated Feb. 16, 2012.Applicant
- Final Office Action from U.S. Appl. No. 11/929,225 Dated Feb. 16, 2012.Applicant
- International Search Report for Application No. EP12150807 Dated Feb. 16, 2012.Applicant
- Final Office Action from U.S. Appl. No. 11/828,181 Dated Feb. 23, 2012.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/461,520 Dated Feb. 29, 2012.Applicant
- Notice of Allowance from U.S. Appl. No. 12/574,628 Dated Mar. 6, 2012.Applicant
- Non-Final Office Action from U.S. Appl. No. 13/276,212 Dated Mar. 15, 2012.Applicant
- Non-Final Office Action from U.S. Appl. No. 13/343,612 Dated Mar. 29, 2012.Applicant
- Notice of Allowance from U.S. Appl. No. 11/939,440 Dated Mar. 30, 2012.Applicant
- European Search Report from co-pending European application No. 11194876.6-2212/2450798, Dated Apr. 12, 2012.Applicant
- European Search Report from co-pending European application No. 11194862.6-2212/2450800, Dated Apr. 12, 2012.Applicant
- Notice of Allowance from U.S. Appl. No. 11/929,636, Dated Apr. 17, 2012.Applicant
- Final Office Action from U.S. Appl. No. 11/858,518, Dated Apr. 17, 2012.Applicant
- European Search Report from co-pending European application No. 11194883.2-2212, Dated Apr. 27, 2012.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/553,372, Dated May 3, 2012.Applicant
- Notice of Allowance from U.S. Appl. No. 11/929,631, Dated May 3, 2012.Applicant
- Non-Final Office Action from U.S. Appl. No. 13/165,713, Dated May 22, 2012.Applicant
- Non-Final Office Action from U.S. Appl. No. 12/144,396, Dated May 29, 2012.Applicant
- Non-Final Office Action from U.S. Appl. No. 13/165,713, Dated May 31, 2012.Applicant
- Non-Final Office Action from U.S. Appl. No. 13/280,251, Dated Jun. 12, 2012.Applicant
- Final Office Action from U.S. Appl. No. 11/855,805, Dated Jun. 14, 2012.Applicant
- Office Action from U.S. Appl. No. 11/461,427 mailed on Sep. 5, 2008.Applicant
- Final Office Action from U.S. Appl. No. 11/461,430 mailed on Sep. 8, 2008.Applicant
- Notice of Allowance from U.S. Appl. No. 11/474,075 mailed on Nov. 26, 2008.Applicant
- Office Action from U.S. Appl. No. 11/474,076 mailed on Nov. 3, 2008.Applicant
- Office Action from U.S. Appl. No. 11/524,811 mailed on Sep. 17, 2008.Applicant
- Non-final Office Action from U.S. Appl. No. 11/461,430 mailed on Feb. 19, 2009.Applicant
- Final Office Action from U.S. Appl. No. 11/461,435 mailed on Jan. 28, 2009.Applicant
- Non-final Office Action from U.S. Appl. No. 11/461,437 mailed on Jan. 26, 2009.Applicant
- 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
- 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
- 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
- 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