The present invention relates to memory systems, and more particularly, to memory modules having a data bypass for preventing data collision on a bi-direction data bus.
Computer systems use memory devices, such as dynamic random access memory (“DRAM”) devices, to store data that are accessed by a processor. These memory devices are normally used as system memory in a computer system. In a typical computer system, the processor communicates with the system memory through a processor bus and a memory controller. The memory devices of the system memory, typically arranged in memory modules having multiple memory devices, are coupled through a memory bus to the memory controller. The processor issues a memory request, which includes a memory command, such as a read command, and an address designating the location from which data or instructions are to be read. The memory controller uses the command and address to generate appropriate command signals as well as row and column addresses, which are applied to the system memory through the memory bus. In response to the commands and addresses, data are transferred between the system memory and the processor. The memory controller is often part of a system controller, which also includes bus bridge circuitry for coupling the processor bus to an expansion bus, such as a PCI bus.
In memory systems, high data bandwidth is desirable. Generally, bandwidth limitations are not related to the memory controllers since the memory controllers sequence data to and from the system memory as fast as the memory devices allow. One approach that has been taken to increase bandwidth is to increase the speed of the memory data bus coupling the memory controller to the memory devices. Thus, the same amount of information can be moved over the memory data bus in less time. However, despite increasing memory data bus speeds, a corresponding increase in bandwidth does not result. One reason for the non-linear relationship between data bus speed and bandwidth is the hardware limitations within the memory devices themselves. That is, the memory controller has to schedule all memory commands to the memory devices such that the hardware limitations are honored. Although these hardware limitations can be reduced to some degree through the design of the memory device, a compromise must be made because reducing the hardware limitations typically adds cost, power, and/or size to the memory devices, all of which are undesirable alternatives. Thus, given these constraints, although it is easy for memory devices to move “well-behaved” traffic at ever increasing rates, for example, sequel traffic to the same page of a memory device, it is much more difficult for the memory devices to resolve “badly-behaved traffic,” such as bouncing between different pages or banks of the memory device. As a result, the increase in memory data bus bandwidth does not yield a corresponding increase in information bandwidth.
In addition to the limited bandwidth between processors and memory devices, the performance of computer systems is also limited by latency problems that increase the time required to read data from system memory devices. More specifically, when a memory device read command is coupled to a system memory device, such as a synchronous DRAM (“SDRAM”) device, the read data are output from the SDRAM device only after a delay of several clock periods. Therefore, although SDRAM devices can synchronously output burst data at a high data rate, the delay in initially providing the data can significantly slow the operating speed of a computer system using such SDRAM devices. Increasing the memory data bus speed can be used to help alleviate the latency issue. However, as with bandwidth, the increase in memory data bus speeds do not yield a linear reduction of latency, for essentially the same reasons previously discussed.
Although increasing memory data bus speed has, to some degree, been successful in increasing bandwidth and reducing latency, other issues are raised by this approach. For example, as the speed of the memory data bus increases, loading on the memory bus needs to be decreased in order to maintain signal integrity since traditionally, there has only been wire between the memory controller and the memory slots into which the memory modules are plugged. Several approaches have been taken to accommodate the increase in memory data bus speed. For example, reducing the number of memory slots, adding buffer circuits on a memory module in order to provide sufficient fanout of control signals to the memory devices on the memory module, and providing multiple memory device interfaces on the memory module since there are too few memory module connectors on a single memory device interface. The effectiveness of these conventional approaches are, however, limited. A reason why these techniques were used in the past is that it was cost-effective to do so. However, when only one memory module can be plugged in per interface, it becomes too costly to add a separate memory interface for each required memory slot. In other words, it pushes the system controllers package out of the commodity range and into the boutique range, thereby, greatly adding cost.
One recent approach that allows for increased memory data bus speed in a cost effective manner is the use of multiple memory devices coupled to the processor through a memory hub. In a memory hub architecture, or a hub-based memory sub-system, a system controller or memory controller is coupled over a high speed bi-directional or unidirectional memory controller/hub interface to several memory modules. Typically, the memory modules are coupled in a point-to-point or daisy chain architecture such that the memory modules are connected one to another in series. Thus, the memory controller is coupled to a first memory module, with the first memory module connected to a second memory module, and the second memory module coupled to a third memory module, and so on in a daisy chain fashion.
Each memory module includes a memory hub that is coupled to the memory controller/hub interface and a number of memory devices on the module, with the memory hubs efficiently routing memory requests and responses between the controller and the memory devices over the memory controller/hub interface. Computer systems employing this architecture can use a high-speed memory data bus since signal integrity can be maintained on the memory data bus. Moreover, this architecture also provides for easy expansion of the system memory without concern for degradation in signal quality as more memory modules are added, such as occurs in conventional memory bus architectures.
Although computer systems using memory hubs may provide superior performance, they may often fail to operate at optimum efficiency for a variety of reasons. One such reason is the issue of managing data collision between data flowing to and from the memory controller through the memory hubs. In conventional memory controllers, one approach taken to avoid data collision is to delay the execution of one memory command until the completion of another memory command. For example, with a conventional memory controller, a write command issued after a read command is not allowed to begin until the read command is nearly completed in order to avoid the read (i.e., inbound) data colliding with the write (i.e., outbound) data on the memory bus. However, forcing the write command to wait effectively reduces bandwidth, which is inconsistent with what is typically desired in a memory system.
One aspect of the present invention is directed to a memory hub having a data bypass circuit. The memory hub includes first and second link interfaces for coupling to respective data busses, a data path coupled to the first and second link interfaces and through which data is transferred between the first and second link interfaces. The memory hub further includes a write bypass circuit coupled to the data path for coupling write data on the data path and temporarily storing the write data to allow read data to be transferred through the data path while the write data is temporarily stored. In another aspect of the invention, a method for writing data to a memory location in a memory system coupled to a memory bus is provided. The method includes accessing read data in the memory system, providing write data to the memory system on the memory bus, and coupling the write data to a register for temporary storage of the write data. While the data is temporarily stored, the read data is coupled from the memory bus and provided for reading. The write data is recoupled to the memory bus and written to the memory location.
Embodiments of the present invention are directed to a memory hub having bypass circuitry that provides data bypass for a bi-directional data bus in a hub-based memory sub-system. Certain details are set forth below to provide a sufficient understanding of various embodiments of the invention. However, it will be clear to one skilled in the art that the invention may be practiced without these particular details. In other instances, well-known circuits, control signals, and timing protocols have not been shown in detail in order to avoid unnecessarily obscuring the invention.
The system controller 110 serves as a communications path to the processor 104 for a variety of other components. For example, as shown in
The system controller 110 includes a memory hub controller 128 that is coupled to memory hubs 140 of several memory modules 130a, 130b, 130c, . . . 130n. The memory modules 130 serve as system memory for the computer system 100, and are preferably coupled to the memory hub controller 128 through a high-speed bi-directional memory controller/hub interface 134. The memory modules 130 are shown coupled to the memory hub controller 128 in a point-to-point arrangement in which the memory controller/hub interface 134 is coupled through the memory hubs 140 of the memory modules 130. That is, the memory controller/hub interface 134 is a bi-directional bus that couples the memory hubs 140 in series. Thus, information on the memory controller/hub interface 134 must travel through the memory hubs 140 of “upstream” memory modules 130 to reach a “downstream” destination. For example, with specific reference to
It will be appreciated, however, that topologies other than the point-to-point arrangement of
The memory hubs 140 control access to memory devices 148 of the respective memory module 130. In
As previously discussed, one approach taken by conventional memory sub-systems to avoid data collision is to delay the execution of one memory command until the completion of another memory command. For example, in typical memory systems a write command issued after a read command would not have been allowed to start until near the completion of the read command in order to avoid the read (i.e., inbound) data colliding with the write (i.e., outbound) data on the memory controller/hub interface 134. In contrast, by employing the memory hub 140 having the data bypass circuit 286, write commands issued after a read command can be sequenced earlier than compared with conventional memory systems, and consequently, memory commands scheduled after the earlier scheduled write command can be executed sooner as well.
In operation, WR_DATA_IN received by the data bypass circuit 300 is driven through the input buffer 302 and is provided to the first input of the multiplexer 306. The WR_DATA_IN is also saved in the bypass register/FIFO 304. In response to an inactive BYPASS_EN signal, an active EN signal is generated by the bypass select logic 308. The active EN signal enables output by the input/output buffer 310 and couples the output of the input buffer 302 to the input of the input/output buffer 310 through the multiplexer 306. As a result, the WR_DATA_IN is provided directly to the input of the input/output buffer 310 and the WR_DATA_IN is provided through the data bypass circuit 300 without any bypass. However, in response to an active BYPASS_EN signal, the bypass select logic 308 generates an inactive EN signal, disabling the output function of the input/output buffer 310 and placing its output in a high-impedance state. Additionally, the inactive EN signal couples the input of the input/output buffer 310 to the output of the bypass register/FIFO 304. In this manner, the WR_DATA_IN is received by the data bypass circuit 300, stored by the bypass register/FIFO 304, and applied to the input of the input/output buffer 310. However, due to the inactive state of the EN signal, the WR_DATA_IN is not provided as output data WR_DATA_OUT by the input/output buffer 310. As a result, the WR_DATA_IN is held in a bypass state until the BYPASS_EN signal becomes inactive, at which time, the EN signal become active again, enabling the input/output buffer 310 to provide the WR_DATA_IN as WR_DATA_OUT data. The multiplexer 306 is also switched back to coupling the output of the input buffer 302 directly to the input of the input/output buffer 310 to allow WR_DATA_IN to pass through the data bypass circuit unhindered.
Operation of the data bypass circuit 286 will be described with reference to
In
In an embodiment of the present invention, coordination of the data flow of the RD and WD on the memory controller/hub interface 134 and through the data bypass circuits 286 is under the control of the memory hub controller 128. For example, in the previous example the memory hub controller ensures that any WD flowing in the opposite direction of the RD is out of the way when retrieving RD from the memory module 130b. It will be appreciated, however, that in alternative embodiments data flow through the memory controller/hub interface 134 and the data bypass circuits 286 can be managed differently, such as the memory hub controller 128 sharing coordination of the data flow with the memory hubs 140.
In the previous example, the RD is returned to the memory hub controller 128 as in a conventional memory system. That is, the RD transmitted by the memory devices 148 is provided to the memory controller without any significant delay. However, by employing the previously described data bypass mechanism, write commands can be scheduled earlier than with conventional memory systems. A write command issued after a read command would not have been allowed to start until near the completion of the read command in typical memory systems. In contrast, embodiments of the present invention allow a subsequently issued write command to be scheduled earlier, thus, reducing the time gap between read and write commands. As a result, commands scheduled behind an earlier scheduled write command have an overall reduced latency.
From the foregoing it will be appreciated that, although specific embodiments of the invention have been described herein for purposes of illustration, various modifications may be made without deviating from the spirit and scope of the invention. Accordingly, the invention is not limited except as by the appended claims.
This application is a continuation of U.S. patent application Ser. No. 10/773,583, filed Feb. 5, 2004, U.S. Pat. No. 7,788,451, which application is incorporated herein by reference, in its entirety, for any purpose.
Number | Name | Date | Kind |
---|---|---|---|
3742253 | Kronies | Jun 1973 | A |
4045781 | Levy et al. | Aug 1977 | A |
4078228 | Miyazaki | Mar 1978 | A |
4240143 | Besemer et al. | Dec 1980 | A |
4245306 | Besemer et al. | Jan 1981 | A |
4253144 | Bellamy et al. | Feb 1981 | A |
4253146 | Bellamy et al. | Feb 1981 | A |
4608702 | Hirzel et al. | Aug 1986 | A |
4707823 | Holdren et al. | Nov 1987 | A |
4724520 | Athanas et al. | Feb 1988 | A |
4831520 | Rubinfeld et al. | May 1989 | A |
4843263 | Ando | Jun 1989 | A |
4891808 | Williams | Jan 1990 | A |
4930128 | Suzuki et al. | May 1990 | A |
4953930 | Ramsey et al. | Sep 1990 | A |
4982185 | Holmberg et al. | Jan 1991 | A |
5241506 | Motegi et al. | Aug 1993 | A |
5243703 | Farmwald et al. | Sep 1993 | A |
5251303 | Fogg, Jr. et al. | Oct 1993 | A |
5269022 | Shinjo et al. | Dec 1993 | A |
5299293 | Mestdagh et al. | Mar 1994 | A |
5313590 | Taylor | May 1994 | A |
5317752 | Jewett et al. | May 1994 | A |
5319755 | Farmwald et al. | Jun 1994 | A |
5327553 | Jewett et al. | Jul 1994 | A |
5355391 | Horowitz et al. | Oct 1994 | A |
5432823 | Gasbarro et al. | Jul 1995 | A |
5432907 | Picazo, Jr. et al. | Jul 1995 | A |
5442770 | Barratt | Aug 1995 | A |
5461627 | Rypinski | Oct 1995 | A |
5465229 | Bechtolsheim et al. | Nov 1995 | A |
5479370 | Furuyama et al. | Dec 1995 | A |
5497476 | Oldfield et al. | Mar 1996 | A |
5502621 | Schumacher et al. | Mar 1996 | A |
5544319 | Acton et al. | Aug 1996 | A |
5566325 | Bruce, II et al. | Oct 1996 | A |
5577220 | Combs et al. | Nov 1996 | A |
5581767 | Katsuki et al. | Dec 1996 | A |
5606717 | Farmwald et al. | Feb 1997 | A |
5638334 | Farmwald et al. | Jun 1997 | A |
5638534 | Mote, Jr. | Jun 1997 | A |
5659798 | Blumrich et al. | Aug 1997 | A |
5687325 | Chang | Nov 1997 | A |
5706224 | Srinivasan et al. | Jan 1998 | A |
5715456 | Bennett et al. | Feb 1998 | A |
5729709 | Harness | Mar 1998 | A |
5748616 | Riley | May 1998 | A |
5818844 | Singh et al. | Oct 1998 | A |
5819304 | Nilsen et al. | Oct 1998 | A |
5822255 | Uchida | Oct 1998 | A |
5832250 | Whittaker | Nov 1998 | A |
5875352 | Gentry et al. | Feb 1999 | A |
5875454 | Craft et al. | Feb 1999 | A |
5900020 | Safranek et al. | May 1999 | A |
5928343 | Farmwald et al. | Jul 1999 | A |
5966724 | Ryan | Oct 1999 | A |
5973935 | Schoenfeld et al. | Oct 1999 | A |
5973951 | Bechtolsheim et al. | Oct 1999 | A |
5978567 | Rebane et al. | Nov 1999 | A |
5987196 | Noble | Nov 1999 | A |
6014721 | Arimilli et al. | Jan 2000 | A |
6023726 | Saksena | Feb 2000 | A |
6029250 | Keeth | Feb 2000 | A |
6031241 | Silfvast et al. | Feb 2000 | A |
6033951 | Chao | Mar 2000 | A |
6038630 | Foster et al. | Mar 2000 | A |
6038687 | Ho | Mar 2000 | A |
6061263 | Boaz et al. | May 2000 | A |
6061296 | Ternullo, Jr. et al. | May 2000 | A |
6064706 | Driskill et al. | May 2000 | A |
6067262 | Irrinki et al. | May 2000 | A |
6067649 | Goodwin | May 2000 | A |
6073190 | Rooney | Jun 2000 | A |
6076139 | Welker et al. | Jun 2000 | A |
6079008 | Clery, III | Jun 2000 | A |
6098158 | Lay et al. | Aug 2000 | A |
6100735 | Lu | Aug 2000 | A |
6105075 | Ghaffari | Aug 2000 | A |
6125431 | Kobayashi | Sep 2000 | A |
6131149 | Lu et al. | Oct 2000 | A |
6134624 | Burns et al. | Oct 2000 | A |
6137709 | Boaz et al. | Oct 2000 | A |
6144587 | Yoshida | Nov 2000 | A |
6167465 | Parvin et al. | Dec 2000 | A |
6167486 | Lee et al. | Dec 2000 | A |
6175571 | Haddock et al. | Jan 2001 | B1 |
6185352 | Hurley | Feb 2001 | B1 |
6186400 | Dvorkis et al. | Feb 2001 | B1 |
6191663 | Hannah | Feb 2001 | B1 |
6201724 | Ishizaki et al. | Mar 2001 | B1 |
6208180 | Fisch et al. | Mar 2001 | B1 |
6219725 | Diehl et al. | Apr 2001 | B1 |
6233376 | Updegrove | May 2001 | B1 |
6243769 | Rooney | Jun 2001 | B1 |
6243831 | Mustafa et al. | Jun 2001 | B1 |
6246618 | Yamamoto et al. | Jun 2001 | B1 |
6247107 | Christie | Jun 2001 | B1 |
6249802 | Richardson et al. | Jun 2001 | B1 |
6256325 | Park | Jul 2001 | B1 |
6256692 | Yoda et al. | Jul 2001 | B1 |
6272600 | Talbot et al. | Aug 2001 | B1 |
6272609 | Jeddeloh | Aug 2001 | B1 |
6278755 | Baba et al. | Aug 2001 | B1 |
6285349 | Smith | Sep 2001 | B1 |
6286083 | Chin et al. | Sep 2001 | B1 |
6289068 | Hassoun et al. | Sep 2001 | B1 |
6294937 | Crafts et al. | Sep 2001 | B1 |
6301637 | Krull et al. | Oct 2001 | B1 |
6324485 | Ellis | Nov 2001 | B1 |
6327642 | Lee et al. | Dec 2001 | B1 |
6327650 | Bapst et al. | Dec 2001 | B1 |
6330205 | Shimizu et al. | Dec 2001 | B2 |
6347055 | Motomura | Feb 2002 | B1 |
6349363 | Cai et al. | Feb 2002 | B2 |
6356573 | Jonsson et al. | Mar 2002 | B1 |
6367074 | Bates et al. | Apr 2002 | B1 |
6370068 | Rhee | Apr 2002 | B2 |
6373777 | Suzuki | Apr 2002 | B1 |
6381190 | Shinkai | Apr 2002 | B1 |
6392653 | Malandain et al. | May 2002 | B1 |
6401213 | Jeddeloh | Jun 2002 | B1 |
6405280 | Ryan | Jun 2002 | B1 |
6421744 | Morrison et al. | Jul 2002 | B1 |
6430696 | Keeth | Aug 2002 | B1 |
6434639 | Haghighi | Aug 2002 | B1 |
6434696 | Kang | Aug 2002 | B1 |
6434736 | Schaecher et al. | Aug 2002 | B1 |
6438622 | Haghighi et al. | Aug 2002 | B1 |
6438668 | Esfahani et al. | Aug 2002 | B1 |
6449308 | Knight, Jr. et al. | Sep 2002 | B1 |
6453393 | Holman et al. | Sep 2002 | B1 |
6462978 | Shibata et al. | Oct 2002 | B2 |
6463059 | Movshovich et al. | Oct 2002 | B1 |
6467013 | Nizar | Oct 2002 | B1 |
6470422 | Cai et al. | Oct 2002 | B2 |
6473828 | Matsui | Oct 2002 | B1 |
6477592 | Chen et al. | Nov 2002 | B1 |
6477614 | Leddige et al. | Nov 2002 | B1 |
6477621 | Lee et al. | Nov 2002 | B1 |
6479322 | Kawata et al. | Nov 2002 | B2 |
6487556 | Downs et al. | Nov 2002 | B1 |
6490188 | Nuxoll et al. | Dec 2002 | B2 |
6493803 | Pham et al. | Dec 2002 | B1 |
6496909 | Schimmel | Dec 2002 | B1 |
6501471 | Venkataraman et al. | Dec 2002 | B1 |
6505287 | Uematsu | Jan 2003 | B2 |
6523092 | Fanning | Feb 2003 | B1 |
6523093 | Bogin et al. | Feb 2003 | B1 |
6526483 | Cho et al. | Feb 2003 | B1 |
6539490 | Forbes et al. | Mar 2003 | B1 |
6552564 | Forbes et al. | Apr 2003 | B1 |
6564329 | Cheung et al. | May 2003 | B1 |
6587912 | Leddige et al. | Jul 2003 | B2 |
6590816 | Perner | Jul 2003 | B2 |
6594713 | Fuoco et al. | Jul 2003 | B1 |
6594722 | Willke, II et al. | Jul 2003 | B1 |
6598154 | Vaid et al. | Jul 2003 | B1 |
6615325 | Mailloux et al. | Sep 2003 | B2 |
6622186 | Moniot et al. | Sep 2003 | B1 |
6622188 | Goodwin et al. | Sep 2003 | B1 |
6622227 | Zumkehr et al. | Sep 2003 | B2 |
6628294 | Sadowsky et al. | Sep 2003 | B1 |
6629220 | Dyer | Sep 2003 | B1 |
6631440 | Jenne et al. | Oct 2003 | B2 |
6633576 | Melaragni et al. | Oct 2003 | B1 |
6636110 | Ooishi et al. | Oct 2003 | B1 |
6636912 | Ajanovic et al. | Oct 2003 | B2 |
6646929 | Moss et al. | Nov 2003 | B1 |
6658509 | Bonella et al. | Dec 2003 | B1 |
6662304 | Keeth et al. | Dec 2003 | B2 |
6665202 | Lindahl et al. | Dec 2003 | B2 |
6667895 | Jang et al. | Dec 2003 | B2 |
6667926 | Chen et al. | Dec 2003 | B1 |
6670833 | Kurd et al. | Dec 2003 | B2 |
6681292 | Creta et al. | Jan 2004 | B2 |
6697926 | Johnson et al. | Feb 2004 | B2 |
6715018 | Farnworth et al. | Mar 2004 | B2 |
6718440 | Maiyuran et al. | Apr 2004 | B2 |
6721195 | Brunelle et al. | Apr 2004 | B2 |
6721860 | Klein | Apr 2004 | B2 |
6724685 | Braun et al. | Apr 2004 | B2 |
6728800 | Lee et al. | Apr 2004 | B1 |
6735679 | Herbst et al. | May 2004 | B1 |
6735682 | Segelken et al. | May 2004 | B2 |
6742098 | Halbert et al. | May 2004 | B1 |
6745275 | Chang | Jun 2004 | B2 |
6751703 | Chilton | Jun 2004 | B2 |
6754812 | Abdallah et al. | Jun 2004 | B1 |
6756661 | Tsuneda et al. | Jun 2004 | B2 |
6760833 | Dowling | Jul 2004 | B1 |
6771538 | Shukuri et al. | Aug 2004 | B2 |
6775747 | Venkatraman | Aug 2004 | B2 |
6782435 | Garcia et al. | Aug 2004 | B2 |
6789173 | Tanaka et al. | Sep 2004 | B1 |
6792059 | Yuan et al. | Sep 2004 | B2 |
6792496 | Aboulenein et al. | Sep 2004 | B2 |
6795899 | Dodd et al. | Sep 2004 | B2 |
6799246 | Wise et al. | Sep 2004 | B1 |
6799268 | Boggs et al. | Sep 2004 | B1 |
6804760 | Wiliams | Oct 2004 | B2 |
6804764 | LaBerge et al. | Oct 2004 | B2 |
6807630 | Lay et al. | Oct 2004 | B2 |
6811320 | Abbott | Nov 2004 | B1 |
6816947 | Huffman | Nov 2004 | B1 |
6820181 | Jeddeloh et al. | Nov 2004 | B2 |
6821029 | Grung et al. | Nov 2004 | B1 |
6823023 | Hannah | Nov 2004 | B1 |
6845409 | Talagala et al. | Jan 2005 | B1 |
6889304 | Perego et al. | May 2005 | B2 |
6901494 | Zumkehr et al. | May 2005 | B2 |
6904556 | Walton et al. | Jun 2005 | B2 |
6910109 | Holman et al. | Jun 2005 | B2 |
6912612 | Kapur et al. | Jun 2005 | B2 |
6947672 | Jiang et al. | Sep 2005 | B2 |
6980042 | LaBerge | Dec 2005 | B2 |
7046060 | Minzoni et al. | May 2006 | B1 |
7047351 | Jeddeloh | May 2006 | B2 |
7120743 | Meyer et al. | Oct 2006 | B2 |
7133991 | James | Nov 2006 | B2 |
7136958 | Jeddeloh | Nov 2006 | B2 |
7149874 | Jeddeloh | Dec 2006 | B2 |
7181584 | LaBerge | Feb 2007 | B2 |
7187742 | Logue et al. | Mar 2007 | B1 |
7251714 | James | Jul 2007 | B2 |
7257683 | Jeddeloh et al. | Aug 2007 | B2 |
7363419 | Cronin et al. | Apr 2008 | B2 |
7386649 | Jeddeloh | Jun 2008 | B2 |
7412517 | Jorgensen | Aug 2008 | B2 |
7412574 | Jeddeloh | Aug 2008 | B2 |
7415567 | Jeddeloh | Aug 2008 | B2 |
7447240 | James | Nov 2008 | B2 |
7529273 | James | May 2009 | B2 |
20010038611 | Darcie et al. | Nov 2001 | A1 |
20010039612 | Lee | Nov 2001 | A1 |
20020016885 | Ryan et al. | Feb 2002 | A1 |
20020084458 | Halbert et al. | Jul 2002 | A1 |
20020112119 | Halbert et al. | Aug 2002 | A1 |
20020116588 | Beckert et al. | Aug 2002 | A1 |
20020144064 | Fanning | Oct 2002 | A1 |
20030005223 | Coulson et al. | Jan 2003 | A1 |
20030005344 | Bhamidipati et al. | Jan 2003 | A1 |
20030043158 | Wasserman et al. | Mar 2003 | A1 |
20030043426 | Baker et al. | Mar 2003 | A1 |
20030093630 | Richard et al. | May 2003 | A1 |
20030149809 | Jensen et al. | Aug 2003 | A1 |
20030156581 | Osborne | Aug 2003 | A1 |
20030163649 | Kapur et al. | Aug 2003 | A1 |
20030177320 | Sah et al. | Sep 2003 | A1 |
20030193927 | Hronik | Oct 2003 | A1 |
20030200401 | Moriwaki et al. | Oct 2003 | A1 |
20030217223 | Nino, Jr. et al. | Nov 2003 | A1 |
20030227798 | Pax | Dec 2003 | A1 |
20030229762 | Maiyuran et al. | Dec 2003 | A1 |
20030229770 | Jeddeloh | Dec 2003 | A1 |
20040022094 | Radhakrishnan et al. | Feb 2004 | A1 |
20040024948 | Winkler et al. | Feb 2004 | A1 |
20040044833 | Ryan | Mar 2004 | A1 |
20040047169 | Lee et al. | Mar 2004 | A1 |
20040107306 | Barth et al. | Jun 2004 | A1 |
20040126115 | Levy et al. | Jul 2004 | A1 |
20040128449 | Osborne et al. | Jul 2004 | A1 |
20040144994 | Lee et al. | Jul 2004 | A1 |
20040160206 | Komaki et al. | Aug 2004 | A1 |
20040193821 | Ruhovets et al. | Sep 2004 | A1 |
20040225847 | Wastlick et al. | Nov 2004 | A1 |
20040230718 | Polzin et al. | Nov 2004 | A1 |
20040236885 | Fredriksson et al. | Nov 2004 | A1 |
20050015426 | Woodruff et al. | Jan 2005 | A1 |
20050044327 | Howard et al. | Feb 2005 | A1 |
20050071542 | Weber et al. | Mar 2005 | A1 |
20050086441 | Meyer et al. | Apr 2005 | A1 |
20050105350 | Zimmerman | May 2005 | A1 |
20050132159 | Jeddeloh | Jun 2005 | A1 |
20050149603 | DeSota et al. | Jul 2005 | A1 |
20050162882 | Reeves et al. | Jul 2005 | A1 |
20050166006 | Talbot et al. | Jul 2005 | A1 |
20050169168 | Aronson et al. | Aug 2005 | A1 |
20050177677 | Jeddeloh | Aug 2005 | A1 |
20050177695 | Larson et al. | Aug 2005 | A1 |
20050213611 | James | Sep 2005 | A1 |
20050268060 | Cronin et al. | Dec 2005 | A1 |
20060022724 | Zerbe et al. | Feb 2006 | A1 |
20060066375 | LaBerge | Mar 2006 | A1 |
20060136683 | Meyer et al. | Jun 2006 | A1 |
20060174070 | Jeddeloh | Aug 2006 | A1 |
20060218318 | James | Sep 2006 | A1 |
20060271746 | Meyer et al. | Nov 2006 | A1 |
20070300023 | Cronin et al. | Dec 2007 | A1 |
20080294856 | Jeddeloh et al. | Nov 2008 | A1 |
20080294862 | Jeddeloh | Nov 2008 | A1 |
20090013211 | Vogt et al. | Jan 2009 | A1 |
Number | Date | Country |
---|---|---|
0 709 786 | May 1996 | EP |
0849685 | Jun 1998 | EP |
0910021 | Apr 1999 | EP |
05-342084 | Dec 1993 | JP |
06-104707 | Apr 1994 | JP |
8-503800 | Apr 1996 | JP |
2001265539 | Sep 2001 | JP |
2002-530731 | Sep 2002 | JP |
2002-342161 | Nov 2002 | JP |
2006-552148 | Dec 2005 | JP |
2006-0528394 | Dec 2006 | JP |
498215 | Aug 2002 | TW |
548547 | Aug 2003 | TW |
WO 9319422 | Sep 1993 | WO |
WO-0223353 | Mar 2002 | WO |
WO 0227499 | Apr 2002 | WO |
WO-2005119457 | Dec 2005 | WO |
Number | Date | Country | |
---|---|---|---|
20100287323 A1 | Nov 2010 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10773583 | Feb 2004 | US |
Child | 12840007 | US |