The present invention is related to the following commonly-owned, co-pending United States patent applications filed on even date herewith, the entire contents and disclosure of each of which is expressly incorporated by reference herein as if fully set forth herein. U.S. patent application Ser. No. 11/768,777, for “A SHARED PERFORMANCE MONITOR IN A MULTIPROCESSOR SYSTEM”; U.S. patent application Ser. No. 11/768,645, for “OPTIMIZED COLLECTIVES USING A DMA ON A PARALLEL COMPUTER”; U.S. patent application Ser. No. 11/768,781, for “DMA SHARED BYTE COUNTERS IN A PARALLEL COMPUTER”; U.S. patent application Ser. No. 11/768,784, for “MULTIPLE NODE REMOTE MESSAGING”; U.S. patent application Ser. No. 11/768,697, for “A METHOD AND APPARATUS OF PREFETCHING STREAMS OF VARYING PREFETCH DEPTH”; U.S. patent application Ser. No. 11/768,532, for “PROGRAMMABLE PARTITIONING FOR HIGH-PERFORMANCE COHERENCE DOMAINS IN A MULTIPROCESSOR SYSTEM”; U.S. patent application Ser. No. 11/768,857, for “METHOD AND APPARATUS FOR SINGLE-STEPPING COHERENCE EVENTS IN A MULTIPROCESSOR SYSTEM UNDER SOFTWARE CONTROL”; U.S. patent application Ser. No. 11/768,547, for “INSERTION OF COHERENCE EVENTS INTO A MULTIPROCESSOR COHERENCE PROTOCOL”; U.S. patent application Ser. No. 11/768,791 for “METHOD AND APPARATUS TO DEBUG AN INTEGRATED CIRCUIT CHIP VIA SYNCHRONOUS CLOCK STOP AND SCAN”; U.S. patent application Ser. No. 11/768,795, for “DMA ENGINE FOR REPEATING COMMUNICATION PATTERNS”; U.S. patent application Ser. No. 11/768,799, for “METHOD AND APPARATUS FOR A CHOOSE-TWO MULTI-QUEUE ARBITER”; U.S. patent application Ser. No. 11/768,800, for “METHOD AND APPARATUS FOR EFFICIENTLY TRACKING QUEUE ENTRIES RELATIVE TO A TIMESTAMP”; U.S. patent application Ser. No. 11/768,572, for “BAD DATA PACKET CAPTURE DEVICE”; U.S. patent application Ser. No. 11/768,593, for “EXTENDED WRITE COMBINING USING A WRITE CONTINUATION HINT FLAG”; U.S. patent application Ser. No. 11/768,905, for “AN ULTRASCALABLE PETAFLOP PARALLEL SUPERCOMPUTER”; U.S. patent application Ser. No. 11/768,810, for “SDRAM DDR DATA EYE MONITOR METHOD AND APPARATUS”; U.S. patent application Ser. No. 11/768,812, for “A CONFIGURABLE MEMORY SYSTEM AND METHOD FOR PROVIDING ATOMIC COUNTING OPERATIONS IN A MEMORY DEVICE”; U.S. patent application Ser. No. 11/768,559, for “ERROR CORRECTING CODE WITH CHIP KILL CAPABILITY AND POWER SAVING ENHANCEMENT”; U.S. patent application Ser. No. 11/768,552, for “STATIC POWER REDUCTION FOR MIDPOINT-TERMINATED BUSSES”; U.S. patent application Ser. No. 11/768,527, for “COMBINED GROUP ECC PROTECTION AND SUBGROUP PARITY PROTECTION”; U.S. patent application Ser. No. 11/768,669, for “A MECHANISM TO SUPPORT GENERIC COLLECTIVE COMMUNICATION ACROSS A VARIETY OF PROGRAMMING MODELS”; U.S. patent application Ser. No. 11/768,813, for “MESSAGE PASSING WITH A LIMITED NUMBER OF DMA BYTE COUNTERS”; U.S. patent application Ser. No. 11/768,619, for “ASYNCRONOUS BROADCAST FOR ORDERED DELIVERY BETWEEN COMPUTE NODES IN A PARALLEL COMPUTING SYSTEM WHERE PACKET HEADER SPACE IS LIMITED”; U.S. patent application Ser. No. 11/768,682, for “HARDWARE PACKET PACING USING A DMA IN A PARALLEL COMPUTER”; and U.S. patent application Ser. No. 11/768,752, for “POWER THROTTLING OF COLLECTIONS OF COMPUTING ELEMENTS”.
1. Field of the Invention
The present invention generally relates to memory architectures in computer systems and, more particularly, to a novel memory storage device and system implementation for enabling a processor device access to multiple memory storage device structures, such as memory caches.
2. Description of the Prior Art
As known, banked memory architectures, e.g., memory cache, comprise a larger memory that is partitioned or divided into distinct blocks that enable more energy efficient use of memory, improves processor cache access time and better exploits parallelism.
It is known that in ASIC memory designs, key design points address the increased overhead in maintaining and implementing a partitioned memory. For example, power and area of the control logic required to implement such banked memory architecture, chip area growth, timing bottlenecks and additional power caused by multiplexed access to memory banks detract from its effectiveness and must be considered in the design.
In present cache system designs, shared banked memory caches aim at distributing accesses either evenly across banks to avoid congestion when using shared randomly accessed data or, provide memory regions assigned to processing elements to avoid congestion by separating accesses. Each of the two architectures provides benefits for a class of applications.
While a banked memory structure assigned and dedicated to each processor is a simple solution, processor access to shared or distributed banked memory architectures is more problematic (in terms of programmability, access time, processing energy, etc.).
In the prior art, U.S. Pat. No. 6,591,345 describes an implementation of a system including a processor device interfaced with a bank-interleaved memory cache, and particularly, a processor enabled to access a bank-interleaved cache containing relatively large strided vectors of data and a method for ensuring maximum access to strided vectors in a bank-interleaved cache memory.
Notwithstanding the innovations of the prior art, it would thus be highly desirable to provide an improved memory access scheme for enabling one or more processor devices to access one or more multiple shared memory banks in a simple and cost-effective manner.
It would further be highly desirable to provide a novel memory architecture that can be configured to provide access distributed across multiple cache memory banks as well as the programmatic capability to assign banks to individual processing elements (e.g., processors).
The present invention is directed to a novel memory architecture that can be configured to provide access distribution across multiple memory banks as well as the capability to assign banks to individual processing elements. This is achieved by providing programmable selection of memory address to bank mapping. The banked memory systems may comprise a single level cache subsystem, a multi-level cache subsystem or a main memory of a processor.
In accordance with one aspect of the invention, there is provided a programmable memory system and method for enabling one or more processor devices access to shared memory in a computing environment, the shared memory including one or more memory storage structures having addressable locations for storing data. The system comprises:
one or more first logic devices associated with a respective one or more processor devices, each first logic device for receiving physical memory address signals and programmable for generating a respective memory storage structure select signal upon receipt of pre-determined address bit values at selected physical memory address bit locations; and,
a second logic device responsive to each the respective select signal for generating an address signal used for selecting a memory storage structure for processor access,
the system enabling each processor device of a computing environment memory storage access distributed across the one or more memory storage structures.
Further to this aspect of the invention, there is provided a means for receiving unselected bit values of said received physical memory address signal for generating an offset bit vector signal used to enable processor device access to memory locations within a selected memory storage structure.
Moreover, further to this aspect of the invention, selected address bit values are programmable for enabling a single processor exclusive access to a single memory storage structure.
Furthermore, in one embodiment of the invention, each the associated first programmable logic device includes a multiplexer device programmed to respond to pre-determined bit values at pre-determined physical memory address bit locations.
Furthermore, in an alternate embodiment of the invention, each the associated first programmable logic device implements logic for applying a hash function to the physical memory address signals.
In accordance with a further aspect of the invention, there is provided a method for enabling one or more processor devices access to shared memory provided in a computing environment, the shared memory including one or more memory storage structures having addressable locations for storing data. The method comprises:
receiving, at a first logic device associated with each one or more processor device, a physical memory address signal and determining bit values at select bit address locations of the received physical memory address signal;
generating, at the first logic device, a respective select signal corresponding to one of the one or more memory storage structures based upon the determined address bit values selected; and,
generating, at a second logic device, in response to a corresponding select signals, an address signal used for selecting a memory storage structure for a processor device access,
wherein each processor device of the computing system is enabled memory storage access distributed across the one or more memory storage structures.
Further to this aspect of the invention, there is provided an additional step of using unselected bit values of the received physical memory address signal to enable processor device access to memory locations within a selected memory storage structure.
Moreover, further to this aspect of the invention, there is provided an additional step of programming the first logic device to provide a single processor device exclusive access to a single memory storage structure upon receipt of predetermined selected address bit values at pre-determined physical memory address bit locations.
Furthermore, there is provided an additional step of programming the first logic device to respond to pre-determined lower physical memory address bit locations used in generating a select signal for providing a single processor device with a substantially even distribution of accesses across the one or more memory storage structures.
Yet still, there is provided an additional step of programming the first logic device to respond to pre-determined higher physical memory address bit locations used for assigning a memory region in the one or more memory structures to one or more processors.
Moreover, according to these aspects of the invention, each associated first programmable logic device output select signal comprises an asserted bit value output, the method further including the step of concatenating, at the second logic device, one or more the bit value outputs from the associated first programmable logic devices and generating a bit vector comprising bit values output from associated first programmable logic devices for use as the address signal.
In accordance with a second embodiment of the invention, there is provided an apparatus and method for enabling one or more processor devices access to shared memory in a computing environment, the shared memory including one or more memory storage structures having addressable locations for storing data. The apparatus comprises:
one or more first logic devices associated with a respective a processor device, each said first logic device for receiving a different subset of address bit signals comprising said physical memory address;
gating means associated with each said one or more first logic devices and each programmable for gating off some or all selected bits of each different subset of address bit signals received at each said first logic device, wherein remaining ungated bits correspond to a desired shared memory storage structure to be accessed, each respective said one or more first logic devices receiving said remaining ungated bits for applying a hash function to said remaining ungated bits and generating a respective memory storage structure select signal; and,
a second logic device responsive to each the respective select signal for generating an address signal used for selecting a memory storage structure for processor access,
the system enabling each processor device of a computing environment memory storage access distributed across the one or more memory storage structures.
Further to this second embodiment, each associated first logic devices comprises an XOR reduction tree for applying the hash function, an output of each the XOR reduction tree comprising the generated memory storage structure select signal.
Yet further to this second embodiment, each gating means associated with each one or more first logic devices comprises a column of logic gates receiving a respective different subset of address bit signals and receiving a control signal for controlling gating of the some or all selected bits.
Still further to this second embodiment, there is provided a means receiving unselected or gated off bits of each different subset of address bit signals of the received physical memory address and for generating an offset bit vector signal used to access to memory locations within a selected memory storage structure
In accordance with a further aspect of the second embodiment of the present invention, there is provided a method for enabling one or more processor devices access to shared memory in a computing environment, the shared memory including one or more memory storage structures having addressable locations for storing data, wherein the method comprises:
receiving, at one or more first logic devices associated with a respective a processor device, a different subset of address bit signals comprising the physical memory address;
gating some or all selected bits of each different subset of address bit signals received at each the first logic device, wherein remaining ungated bits correspond to a desired shared memory storage structure to be accessed,
applying, at the one or more first logic devices, a hash function to the remaining ungated bits and generating a respective memory storage structure select signal; and,
generating, at a second logic device, in response to a corresponding select signals, an address signal used for selecting a memory storage structure for a processor device access,
wherein each processor device of the computing system is enabled memory storage access distributed across the one or more memory storage structures.
Further to this aspect of the invention, there is further implemented a step of receiving a control signal for controlling gating of the some or all selected bits at the each associated the one or more first logic devices.
Moreover, further to this aspect of the invention, there is provided a step of using unselected or gated off bit values of each different subset of address bit signals of the received physical memory address to enable processor device access to memory locations within a selected memory storage structure.
The present invention is advantageously employed in a multiprocessing computer system having a plurality of processor devices each for access a shared banked memory structure, however, can easily be adapted for use in uniprocessor computer systems.
The objects, features and advantages of the present invention will become apparent to one skilled in the art, in view of the following detailed description taken in combination with the attached drawings, in which:
The present invention provides a novel memory architecture that is configurable to provide multiple processors access to, and distribution across, multiple memory bank structures, e.g., banked memory caches. The present invention additionally provides the capability to assign memory banks to individual processing elements. This is achieved by providing a programmable memory bank system that provides a mapping of memory addresses to bank selection as will be described in greater detail herein below.
The memory bank structures may comprise any form of electronic, magnetic or optical memory storage structures. In one embodiment, the memory bank structures may comprise a memory cache structure such as found in a computing system. For instance, a computing system may comprise a single or multiprocessor system, and the memory bank structures 150a, . . . , 150k may comprises a second or third level data cache in a multi-level cache memory hierarchy. It is understood that the memory bank structures 150a, . . . , 150k comprise any addressable memory storage system, such as a main memory or a cache, where memory lines are accessed by addressed memory locations for reading and writing data from/to the processor Storage capabilities may be on the order of 64 KB to hundreds of MB for multilevel cache systems, and even up to hundreds of GB for main memory. The caches themselves may be n-way set-associative for addressability, inclusive, non-inclusive, a victim-cache or other type of cache. This memory may include, in non-limiting examples, volatile or non-volatile memory, SRAM, DRAM, DDR eDRAM, SDRAM DDR-2, and other types of memory such as found embedded in current integrated circuit technology and multi-processing System-on-Chip technology as currently known.
The interconnect network 200 may comprise a bus system, or a single-, two- or multi-staged switching network or like switched interconnect scheme. Moreover, the interconnect network 200 may comprise logic for resolving conflicts should more than one processor device seek to access the same memory location in a memory bank. In the case of such a conflict, the interconnect may arbitrate and serialize the accesses if necessary according to known techniques. Thus, in an example implementation of a high performance computing system having an ASIC multiprocessing node, as described herein below with respect to
The unit 125 shown in
Each of the address bits received and at logic device 128 are selected by a series of programmed multiplexor devices 140 that receive some or all of the address bits. In one embodiment, each multiplexor is programmable to select a specific bit of the received physical memory address register which selected bits are then concatenated by a logic device 145 to form a bit vector representing a memory bank address, output of the device and used for selecting a specific memory bank.
The concatenation may be performed by combinatorial logic that generates a bank selection address vector 149 i.e., for example, the bit address vector may be one bit wide for 2 banks, or it can be wider for multiple banks.
As such, there may be one multiplexer device 140 for every bit needed in the bank address. So there may be, in an example embodiment, an upper limit(log2(number of bank)) multiplexor devices 140. Each selector multiplexor performs the same decision for the same physical address, so each physical address ends up selecting one specific bank. Different addresses may end up in different banks. The configuration of the selector decides if, for example, subsequent addresses end up in the same bank or if they are scattered across banks.
More particularly, the bank selection address 130 is sent along with the request issued by the processor to the memory subsystem network 10 via the bus or interconnect network 200 which routes the request to the specific bank selector device from the issued physical address as determined by the selector. As only selected bits are used in selecting the memory bank, the bits of the original memory address that are not selected to form from the bank address are provided to the selected bank as bank offset signal BO where those bits are decoded to address the requested data stored within the selected memory bank.
It should be understood that, in the embodiments of the invention depicted, the bit selectors are configured statically before the memory is loaded. For programs that benefit from an even distribution of accesses across banks, the selectors are programmed to choose lower address bits to form the bank selection. For programs that benefit from non-shared memory accesses, higher address bits are selected and memory regions that are distinguishable via these high addresses are assigned to each processor or processor group.
In one implementation configuration registers are statically programmed by the processor cores or, by an external control system 99 via a Device Configuration Register (DCR) bus 98. This DCR bus is distinct from the network connecting the memory hierarchy levels.
Thus, in an example implementation, shown in
address 0->bank 0 [where a mux 140a is programmed to select bank 0 (BA0) when memory address bits A8, A7 are 0, 0 respectively];
address 128->bank 1 [where a mux 140b is programmed to select bank 1 (BA1) when memory address bits A8, A7 are 0, 1 respectively];
address 256->bank 2 [where a mux is programmed to select (BA2) when memory address bits A8, A7 are 1, 0 respectively];
address 384->bank 3 [where a mux is programmed to select (BA3) when memory address bits A8, A7 are 1,1 respectively] and, address 512->bank 0, etc.
These multiplexers 140 include processing for receiving the address bits to form the respective bank selection signals which is used to form the bank address used for selecting the memory bank. Similarly, when programming the selector multiplexer to pick bits A33 and A32, the first 4 Gigabytes of memory are mapped to bank 0, the next 4 GB to bank 1, the next to bank2 and the last to bank 3. In this manner, a processor may have a single memory bank allocated to them at these programmed memory addresses. For example, when allocating memory for processor 0, address ranges from the first 4 GB can be assigned, when allocating for processor 1, address ranges from next 4 GB can be assigned and so on. When the processors access their assigned address ranges, a unique mapping from processor to bank is provided eliminating conflicts between processors when competing for a bank.
In an alternate implementation, multiple address bits may be selected and a hashing algorithm implemented to generate a bank selector address. A hash function could for example be an XOR reduction of a group (e.g. a subset) of address bits that each generates a respective bank selector bit signal.
Accesses to two addresses that differ only in an address bit that is feeding the XOR tree and is not gated off will result in selection of different banks for the two addresses. Strided access patterns may only cause changes in a limited set of address bits. By ungating many address bits, the bank selection becomes sensitive to all these bits, distributing accesses of most strides evenly across the banks.
The present invention is advantageously employed for certain computing system architectures, such as the “BlueGene/P” high-performance computing system, such as available from International Business Machines Corp. (IBM) where a compute node is provided comprising an indivisible multi-processor unit, formed of System-on-Chip (SOC) technology, that includes, for example, a plurality of processors each with one or more levels of cache. In one embodiment, the present invention is implemented in a processing node of a Ultrascalable Petaflop Parallel Supercomputer architecture such as shown and described in greater detail in commonly-owned, co-pending U.S. patent application Ser. No. 11/768,905 that comprises multiple processing nodes organized in one form, as a three-dimensional torus interconnected and designed to deliver processing power on the order of a petaflops (a quadrillion floating-point operations per second) for a wide range of applications. In an exemplary embodiment, the Massively Parallel Supercomputer architecture comprises 72K processing nodes organized as a 72×32×32 with each compute node being connected to six (6) neighboring nodes via 6 bi-directional torus links.
As shown in
Also included in a node 400 is a Scratch SRAM 480, provided to serve as a background communication mechanism with a host system (not shown). All four cores have equal access to the SRAM which is critical for the independent exchange of messages between each core and the host system. The size of the Scratch SRAM may range on the order of 32-128 KB.
Further in
In a preferred embodiment, the same compute node ASIC may be used as an I/O node which is associated with a subset of the compute nodes (16, 32, 64, or 128 compute nodes), for handling fileserver communication and I/O operations. That is, the I/O nodes are identical to the compute nodes. The only difference is that an I/O node enables and uses an external network interface 430, such as a 10 Gigabit Ethernet. It is understood that the compute ASIC nodes may have the integrated 10 Gb Ethernet. The 10 Gb Ethernet functional units (XEMAC, ToMAL) interfaces to an arbiter 435 which arbitrates inputs to L3 level cache from torus DMA and from 10 Gb Ethernet. This allows the processor within a node to set up a transfer and return to handling messages with very little overhead.
The node ASIC additionally includes the functionality necessary to boot, debug and support RAS (reliability, availability and serviceability). On the ASIC, this functionality is provided by an extension of the IEEE1149.1-1993 standard, also known as the JTAG standard. As in the predecessor system described in commonly-owned, co-pending International Patent application PCT/US02/05571 filed Feb. 25, 2002 entitled “A Novel Massively Parallel Supercomputer, extensive use is made of these JTAG TDRs for chip self test functions, for boot code loading, for chip configuration and control, for monitoring and for debug. In particular, each of the PPC450 cores has a slave JTAG interface 490 that can be used with the IBM RiscWatch™ software for detailed debug operations of each PPC450 core.
From a full system perspective, the supercomputer as a whole is controlled by a Service Node (not shown), which is the external computer that controls power-up of the machine, partitioning, boot-up, program load, monitoring, and debug. The Service Node runs the Control System software. The Service Node communicates with the supercomputer via a dedicated, private 1 Gb/s Ethernet connection (not shown). This service node may be used for programming the multiplexor settings or configuring logic devices 140a, . . . 140d of
More particularly, with respect to the compute node memory system, there is included an on-chip cache hierarchy, an off-chip main store, and optimized on-chip support for locking and communication between the four ASIC processor cores 440a, . . . 440d. The memory system is architected for peak performance over a range of target applications. The aggregate memory of the machine is completely distributed in the style of a multi-computer with no hardware sharing between nodes. Each node may own, for example, 2 gigabytes of physical memory, resulting in a total of 144 terabytes in a 72K-node system. As shown in
Although not shown in
In one embodiment, the L3 cache is constructed of embedded DRAM (eDRAM and, in one non-limiting embodiment, is 8 Mbytes in size. Several options for the organization of the cache are possible. For example, in one embodiment, a straightforward set-associative cache, shared by four processors, is implemented. In another embodiment, two L3 caches, each of which is shared, are implemented. The cache organization enables four processors to access L3 simultaneously in the best case. The capability of partitioning off a portion of the L3 cache for direct access is additionally possible. In one advantageous embodiment, the L3 cache may be divided into multiple memory banks for processor access, which would require four banks of macros. Processor access to these memory banks is enabled in the L2 cache where the programmable memory bank selector of the present invention is advantageously implemented.
While there has been shown and described what is considered to be preferred embodiments of the invention, it will, of course, be understood that various modifications and changes in form or detail could readily be made without departing from the spirit of the invention. It is therefore intended that the invention be not limited to the exact forms described and illustrated, but should be constructed to cover all modifications that may fall within the scope of the appended claims.
The U.S. Government has a paid-up license in this invention and the right in limited circumstances to require the patent owner to license others on reasonable terms as provided for by the terms of Contract. No. B554331 awarded by the Department of Energy.
Number | Name | Date | Kind |
---|---|---|---|
4777595 | Strecker et al. | Oct 1988 | A |
5063562 | Barzilai et al. | Nov 1991 | A |
5142422 | Zook et al. | Aug 1992 | A |
5349587 | Nadeau-Dostie et al. | Sep 1994 | A |
5353412 | Douglas et al. | Oct 1994 | A |
5452432 | Macachor | Sep 1995 | A |
5524220 | Verma et al. | Jun 1996 | A |
5634007 | Calta et al. | May 1997 | A |
5659710 | Sherman et al. | Aug 1997 | A |
5708779 | Graziano et al. | Jan 1998 | A |
5761464 | Hopkins | Jun 1998 | A |
5796735 | Miller et al. | Aug 1998 | A |
5809278 | Watanabe et al. | Sep 1998 | A |
5825748 | Barleu et al. | Oct 1998 | A |
5890211 | Sokolov et al. | Mar 1999 | A |
5917828 | Thompson | Jun 1999 | A |
6023732 | Moh et al. | Feb 2000 | A |
6061511 | Marantz et al. | May 2000 | A |
6072781 | Feeney et al. | Jun 2000 | A |
6122715 | Palanca et al. | Sep 2000 | A |
6185214 | Schwartz et al. | Feb 2001 | B1 |
6219300 | Tamaki | Apr 2001 | B1 |
6263397 | Wu et al. | Jul 2001 | B1 |
6295571 | Scardamalia et al. | Sep 2001 | B1 |
6311249 | Min et al. | Oct 2001 | B1 |
6324495 | Steinman | Nov 2001 | B1 |
6356106 | Greeff et al. | Mar 2002 | B1 |
6366984 | Carmean et al. | Apr 2002 | B1 |
6442162 | O'Neill et al. | Aug 2002 | B1 |
6466227 | Pfister et al. | Oct 2002 | B1 |
6564331 | Joshi | May 2003 | B1 |
6594234 | Chard et al. | Jul 2003 | B1 |
6598123 | Anderson et al. | Jul 2003 | B1 |
6601144 | Arimilli et al. | Jul 2003 | B1 |
6631447 | Morioka et al. | Oct 2003 | B1 |
6647428 | Bannai et al. | Nov 2003 | B1 |
6662305 | Salmon et al. | Dec 2003 | B1 |
6735174 | Hefty et al. | May 2004 | B1 |
6775693 | Adams | Aug 2004 | B1 |
6799232 | Wang | Sep 2004 | B1 |
6880028 | Kurth | Apr 2005 | B2 |
6889266 | Stadler | May 2005 | B1 |
6894978 | Hashimoto | May 2005 | B1 |
6954887 | Wang et al. | Oct 2005 | B2 |
6986026 | Roth et al. | Jan 2006 | B2 |
7007123 | Golla et al. | Feb 2006 | B2 |
7058826 | Fung | Jun 2006 | B2 |
7065594 | Ripy et al. | Jun 2006 | B2 |
7143219 | Chaudhari et al. | Nov 2006 | B1 |
7191373 | Wang et al. | Mar 2007 | B2 |
7239565 | Liu | Jul 2007 | B2 |
7280477 | Jeffries et al. | Oct 2007 | B2 |
7298746 | De La Iglesia et al. | Nov 2007 | B1 |
7363629 | Springer et al. | Apr 2008 | B2 |
7373420 | Lyon | May 2008 | B1 |
7401245 | Fischer et al. | Jul 2008 | B2 |
7454640 | Wong | Nov 2008 | B1 |
7454641 | Connor et al. | Nov 2008 | B2 |
7461236 | Wentzlaff | Dec 2008 | B1 |
7463529 | Matsubara | Dec 2008 | B2 |
7539845 | Wentzlaff et al. | May 2009 | B1 |
7613971 | Asaka | Nov 2009 | B2 |
7620791 | Wentzlaff et al. | Nov 2009 | B1 |
7698581 | Oh | Apr 2010 | B2 |
20010055323 | Rowett et al. | Dec 2001 | A1 |
20020078420 | Roth et al. | Jun 2002 | A1 |
20020087801 | Bogin et al. | Jul 2002 | A1 |
20020100020 | Hunter et al. | Jul 2002 | A1 |
20020129086 | Garcia-Luna-Aceves et al. | Sep 2002 | A1 |
20020138801 | Wang et al. | Sep 2002 | A1 |
20020156979 | Rodriguez | Oct 2002 | A1 |
20020184159 | Tadayon et al. | Dec 2002 | A1 |
20030007457 | Farrell et al. | Jan 2003 | A1 |
20030028749 | Ishikawa et al. | Feb 2003 | A1 |
20030050714 | Tymchenko | Mar 2003 | A1 |
20030050954 | Tayyar et al. | Mar 2003 | A1 |
20030074616 | Dorsey | Apr 2003 | A1 |
20030105799 | Khan et al. | Jun 2003 | A1 |
20030163649 | Kapur et al. | Aug 2003 | A1 |
20030177335 | Luick | Sep 2003 | A1 |
20030188053 | Tsai | Oct 2003 | A1 |
20030235202 | Van Der Zee et al. | Dec 2003 | A1 |
20040003184 | Safranek et al. | Jan 2004 | A1 |
20040019730 | Walker et al. | Jan 2004 | A1 |
20040024925 | Cypher et al. | Feb 2004 | A1 |
20040073780 | Roth et al. | Apr 2004 | A1 |
20040103218 | Blumrich et al. | May 2004 | A1 |
20040210694 | Shenderovich | Oct 2004 | A1 |
20040243739 | Spencer | Dec 2004 | A1 |
20050007986 | Malladi et al. | Jan 2005 | A1 |
20050053057 | Deneroff et al. | Mar 2005 | A1 |
20050076163 | Malalur | Apr 2005 | A1 |
20050160238 | Steely et al. | Jul 2005 | A1 |
20050216613 | Ganapathy et al. | Sep 2005 | A1 |
20050251613 | Kissell | Nov 2005 | A1 |
20050270886 | Takashima | Dec 2005 | A1 |
20050273564 | Lakshmanamurthy et al. | Dec 2005 | A1 |
20060050737 | Hsu | Mar 2006 | A1 |
20060080513 | Beukema et al. | Apr 2006 | A1 |
20060206635 | Alexander et al. | Sep 2006 | A1 |
20060248367 | Fischer et al. | Nov 2006 | A1 |
20070055832 | Beat | Mar 2007 | A1 |
20070133536 | Kim et al. | Jun 2007 | A1 |
20070168803 | Wang et al. | Jul 2007 | A1 |
20070174529 | Rodriguez et al. | Jul 2007 | A1 |
20070195774 | Sherman et al. | Aug 2007 | A1 |
20080147987 | Cantin et al. | Jun 2008 | A1 |
Number | Date | Country | |
---|---|---|---|
20090006718 A1 | Jan 2009 | US |