Memory subsystem with positional read data latency

Information

  • Patent Grant
  • 8296541
  • Patent Number
    8,296,541
  • Date Filed
    Wednesday, February 11, 2009
    15 years ago
  • Date Issued
    Tuesday, October 23, 2012
    11 years ago
Abstract
A memory subsystem with positional read data latency that includes one or more memory modules, a memory controller and one or more memory busses is provided. The memory controller includes instructions for providing positional read data latency. The memory modules and the memory controller are interconnected via the memory busses.
Description
BACKGROUND

The invention relates to a memory subsystem and in particular, to a memory subsystem with positional read data latency.


Computer memory subsystems have evolved over the years, but continue to retain many consistent attributes. Computer memory subsystems from the early 1980's, such as the one disclosed in U.S. Pat. No. 4,475,194 to LaVallee et al., of common assignment herewith, included a memory controller, a memory assembly (contemporarily called a basic storage module (BSM) by the inventors) with array devices, buffers, terminators and ancillary timing and control functions, as well as several point-to-point busses to permit each memory assembly to communicate with the memory controller via its own point-to-point address and data bus. FIG. 1 depicts an example of this early 1980 computer memory subsystem with two BSMs, a memory controller, a maintenance console, and point-to-point address and data busses connecting the BSMs and the memory controller.


FIG. 2, from U.S. Pat. No. 5,513,135 to Dell et al., of common assignment herewith, depicts an early synchronous memory module, which includes synchronous dynamic random access memories (DRAMs) 8, buffer devices 12, an optimized pinout, an interconnect and a capacitive decoupling method to facilitate operation. The patent also describes the use of clock re-drive on the module, using such devices as phase lock loops (PLLs).


FIG. 3, from U.S. Pat. No. 6,510,100 to Grundon et al., of common assignment herewith, depicts a simplified diagram and description of a memory system 10 that includes up to four registered dual inline memory modules (DIMMs) 40 on a traditional multi-drop stub bus channel. The subsystem includes a memory controller 20, an external clock buffer 30, registered DIMMs 40, an address bus 50, a control bus 60 and a data bus 70 with terminators 95 on the address bus 50 and data bus 70.


FIG. 4 depicts a 1990's memory subsystem which evolved from the structure in FIG. 1 and includes a memory controller 402, one or more high speed point-to-point channels 404, each connected to a bus-to-bus converter chip 406, and each having a synchronous memory interface 408 that enables connection to one or more registered DIMMs 410. In this implementation, the high speed, point-to-point channel 404 operated at twice the DRAM data rate, allowing the bus-to-bus converter chip 406 to operate one or two registered DIMM memory channels at the full DRAM data rate. Each registered DIMM included a PLL, registers, DRAMs, an electrically erasable programmable read-only memory (EEPROM) and terminators, in addition to other passive components.


As shown in FIG. 5, memory subsystems were often constructed with a memory controller connected either to a single memory module, or to two or more memory modules interconnected on a ‘stub’ bus. FIG. 5 is a simplified example of a multi-drop stub bus memory structure, similar to the one shown in FIG. 3. This structure offers a reasonable tradeoff between cost, performance, reliability and upgrade capability, but has inherent limits on the number of modules that may be attached to the stub bus. The limit on the number of modules that may be attached to the stub bus is directly related to the data rate of the information transferred over the bus. As data rates increase, the number and length of the stubs must be reduced to ensure robust memory operation. Increasing the speed of the bus generally results in a reduction in modules on the bus, with the optimal electrical interface being one in which a single module is directly connected to a single controller, or a point-to-point interface with few, if any, stubs that will result in reflections and impedance discontinuities. As most memory modules are sixty-four or seventy-two bits in data width, this structure also requires a large number of pins to transfer address, command, and data. One hundred and twenty pins are identified in FIG. 5 as being a representative pincount.


FIG. 6, from U.S. Pat. No. 4,723,120 to Petty, of common assignment herewith, is related to the application of a daisy chain structure in a multipoint communication structure that would otherwise require multiple ports, each connected via point-to-point interfaces to separate devices. By adopting a daisy chain structure, the controlling station can be produced with fewer ports (or channels), and each device on the channel can utilize standard upstream and downstream protocols, independent of their location in the daisy chain structure.


FIG. 7 represents a daisy chained memory bus, implemented consistent with the teachings in U.S. Pat. No. 4,723,120. A memory controller 111 is connected to a memory bus 315, which further connects to a module 310a. The information on bus 315 is re-driven by the buffer on module 310a to the next module, 310b, which further re-drives the bus 315 to module positions denoted as 310n. Each module 310a includes a DRAM 311a and a buffer 320a. The bus 315 may be described as having a daisy chain structure with each bus being point-to-point in nature.


One drawback to the use of a daisy chain bus is associated with the return of read data from a series of daisy chained memory modules. As each of the modules in the channel has a different number of intervening stages to return its read data through on its way to the memory controller, modules may have different minimum read data latencies associated with them. Variations in read data return times may be difficult for the memory controller to manage and could result in undue logic complexity. One option for simplifying this situation is to make the read data latency of modules closer to the memory controller in the channel equal to the latency of the module that is furthest away from the memory controller in the channel. Leveling the read data latency in this manner can be achieved by adding a fixed amount of delay to the return of read data based on its location in the daisy chain. In this way, the memory controller will receive all read data with the same latency from the requesting command, regardless of the position within the channel of the addressed module. A major drawback with this approach is that the read data latency is a critical metric of main memory performance. Setting the read data latency of all modules in the daisy chain to be equal to the worst latency results in higher delays incurred, while accessing data from the memory subsystem and therefore decreases system performance.


SUMMARY

Exemplary embodiments of the present invention include a memory subsystem with positional read data latency. The memory subsystem includes one or more memory modules, a memory controller and one or more memory busses. The memory controller includes instructions for providing positional read data latency. The memory modules and the memory controller are interconnected via the memory busses.


Further exemplary embodiments include a storage medium with machine readable computer program code for providing positional read data latency in a memory subsystem. The storage medium includes instructions for causing a computer to implement a method. The method includes receiving a read request for a target memory module. An additional read data latency time period is calculated for the read request. A read command including the additional read data latency time period and the read request is transmitted to the target memory module. Data from the target memory module responsive to the read command is received at a memory controller, where the target memory module has transmitted the data to the memory controller after the additional read data latency time period has expired.





BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

Referring now to the drawings wherein like elements are numbered alike in the several FIGURES:



FIG. 1 depicts a prior art memory controller connected to two buffered memory assemblies via separate point-to-point links;



FIG. 2 depicts a prior art synchronous memory module with a buffer device;



FIG. 3 depicts a prior art memory subsystem using registered DIMMs;



FIG. 4 depicts a prior art memory subsystem with point-to-point channels, registered DIMMs, and a 2:1 bus speed multiplier;



FIG. 5 depicts a prior art memory structure that utilizes a multidrop memory ‘stub’ bus;



FIG. 6 depicts a prior art daisy chain structure in a multipoint communication structure that would otherwise require multiple ports;



FIG. 7 depicts a prior art daisy chain connection between a memory controller and memory modules;



FIG. 8 depicts a cascaded memory structure that is utilized by exemplary embodiments of the present invention;



FIG. 9 depicts a memory structure with cascaded memory modules and unidirectional busses that is utilized by exemplary embodiments of the present invention;



FIG. 10 depicts a buffered module wiring system that is utilized by exemplary embodiments of the present invention;



FIG. 11 depicts a process flow for providing positional read data latency in accordance with an exemplary embodiment of the present invention; and



FIG. 12 depicts a timing diagram with four read operations, one to each memory module, in accordance with exemplary embodiments of the present invention.





DETAILED DESCRIPTION

Exemplary embodiments of the present invention provide circuits and methods that enable positional read data latency for a memory channel comprised of cascaded, buffered memory modules. The use of positional read data latency for a memory channel (also referred to herein as a memory subsystem) may lead to increased memory channel performance. Exemplary embodiments of the present invention provide positional read data latency without adding undue complexity to the memory controller or to the device logic associated with the buffered memory modules.


In an exemplary embodiment of the present invention, positional read data latency is provided by a high speed and high reliability memory subsystem architecture and interconnect structure that includes single-ended point-to-point interconnections between any two subsystem components. An alternate exemplary embodiment of the present invention utilizes differential interconnections between any two subsystem components. The memory subsystem further includes a memory control function, one or more memory modules, one or more high speed busses operating at an integer (such as four to one) speed ratio relative to a DRAM data rate and a bus-to-bus converter chip on each of one or more cascaded modules to convert the high speed bus(ses) into the conventional double data rate (DDR) memory interface. The memory modules operate as slave devices to the memory controller, responding to commands in a deterministic or non-deterministic manner, but do not self-initiate unplanned bus activity, except in cases where operational errors are reported in a real-time manner. Memory modules can be added to the cascaded bus with each module assigned an address to permit unique selection of each module on the cascaded bus. Exemplary embodiments of the present invention include a packetized multi-transfer interface which utilizes an innovative communication protocol to permit memory operation to occur on a reduced pincount, whereby address, command and data is transferred between the components on the cascaded bus over multiple cycles, and are reconstructed and errors corrected prior to being used by the intended recipient.



FIG. 8 depicts a cascaded memory structure that may be utilized by exemplary embodiments of the present invention. This memory structure includes a memory controller 802 in communication with one or more memory modules 806 via a high speed point-to-point bus 804. Each bus 804 in the exemplary embodiment depicted in FIG. 8 includes approximately fifty high speed wires for the transfer of address, command, data and clocks. By using point-to-point busses as described in the aforementioned prior art, it is possible to optimize the bus design to permit significantly increased data rates, as well as to reduce the bus pincount by transferring data over multiple cycles. Whereas FIG. 4 depicts a memory subsystem with a two to one ratio between the data rate on any one of the busses connecting the memory controller to one of the bus converters (e.g., to 1,066 Mb/s per pin) versus any one of the busses between the bus converter and one or more memory modules (e.g., to 533 Mb/s per pin), an exemplary embodiment of the present invention, as depicted in FIG. 8, provides a four to one bus speed ratio to maximize bus efficiency and to minimize pincount.


Although point-to-point interconnects permit higher data rates, overall memory subsystem efficiency must be achieved by maintaining a reasonable number of memory modules 806 and memory devices per channel (historically four memory modules with four to thirty-six chips per memory module, but as high as eight memory modules per channel and as few as one memory module per channel). Using a point-to-point bus necessitates a bus re-drive function on each memory module. The re-drive function permits memory modules to be cascaded such that each memory module is interconnected to other memory modules, as well as to the memory controller 802.



FIG. 9 depicts a memory structure with cascaded memory modules and unidirectional busses that is utilized by exemplary embodiments of the present invention. One of the functions provided by the memory modules 806 in the cascade structure is a re-drive function to send signals on the memory bus to other memory modules 806 or to the memory controller 802. FIG. 9 includes the memory controller 802 and four memory modules 806a, 806b, 806c and 806d, on each of two memory busses (a downstream memory bus 904 and an upstream memory bus 902), connected to the memory controller 802 in either a direct or cascaded manner. Memory module 806a is connected to the memory controller 802 in a direct manner. Memory modules 806b, 806c and 806d are connected to the memory controller 802 in a cascaded manner.


An exemplary embodiment of the present invention includes two unidirectional busses between the memory controller 802 and memory module 806a (“DIMM #1”), as well as between each successive memory module 806b-d (“DIMM #2”, “DIMM #3” and “DIMM #4”) in the cascaded memory structure. The downstream memory bus 904 is comprised of twenty-two single-ended signals and a differential clock pair. The downstream memory bus 904 is used to transfer address, control, write data and bus-level error code correction (ECC) bits downstream from the memory controller 802, over several clock cycles, to one or more of the memory modules 806 installed on the cascaded memory channel. The upstream memory bus 902 is comprised of twenty-three single-ended signals and a differential clock pair, and is used to transfer read data and bus-level ECC bits upstream from the sourcing memory module 806 to the memory controller 802. Using this memory structure, and a four to one data rate multiplier between the DRAM data rate (e.g., 400 to 800 Mb/s per pin) and the unidirectional memory bus data rate (e.g., 1.6 to 3.2 Gb/s per pin), the memory controller 802 signal pincount, per memory channel, is reduced from approximately one hundred and twenty pins to about fifty pins.



FIG. 10 depicts a buffered module wiring system that is utilized by exemplary embodiments of the present invention. FIG. 10 is a pictorial representation of a memory module with shaded arrows representing the primary signal flows. The signal flows include the upstream memory bus 902, the downstream memory bus 904, memory device address and command busses 1010 and 1006, and memory device data busses 1012 and 1008. In an exemplary embodiment of the present invention, the buffer device 1002, also referred to as a memory interface chip, provides two copies of the address and command signals to memory devices 1004 (e.g., synchronous DRAMs (SDRAMS)) with the right memory device address and command bus 1006 exiting from the right side of the buffer device 1002 for the memory devices 1004 located to the right side and behind the buffer device 1002 on the right. The left memory device address and command bus 1010 exits from the left side of the buffer device 1002 and connects to the memory devices 1004 to the left side and behind the buffer device 1002 on the left. Similarly, the data bits intended for memory devices 1004 to the right of the buffer device 1002 exit from the right of the buffer module 1002 on the right memory device data bus 1008. The data bits intended for the left side of the buffer device 1002 exit from the left of the buffer device 1002 on the left memory device data bus 1012. The high speed upstream memory bus 902 and downstream memory bus 904 exit from the lower portion of the buffer device 1002, and connect to a memory controller or other memory modules either upstream or downstream of this memory module 806, depending on the application. The buffer device 1002 receives signals that are four times the memory module data rate and converts them into signals at the memory module data rate.


The memory controller 802 interfaces to the memory modules 806 via a pair of high speed busses (or channels). The downstream memory bus 904 (outbound from the memory controller 802) interface has twenty-four pins and the upstream memory bus 902 (inbound to the memory controller 802) interface has twenty-five pins. The high speed channels each include a clock pair (differential), a spare bit lane, ECC syndrome bits and the remainder of the bits pass information (based on the operation underway). Due to the cascaded memory structure, all nets are point-to-point, allowing reliable high-speed communication that is independent of the number of memory modules 806 installed. Whenever a memory module 806 receives a packet on either bus, it re-synchronizes the command to the internal clock and re-drives the command to the next memory module 806 in the chain (if one exists).


In order to provide positional read data latency, the memory modules 806 include read data registers with a plurality of latches to contain read data from a plurality of read commands. The read data registers (also referred to herein as read data buffers) are arranged in a first-in-first-out (FIFO) organization such that read data will always be returned in the order in which it was requested. Each read command from the memory controller 802 to the memory module 806 includes a field of information that specifies how much additional time read data should reside in the read buffers before being sent to the memory controller 802 on the upstream memory bus 902. This additional time is referred to herein as the delay period, or the read data buffer delay (RDBD). The outstanding read latency of a memory channel is the current amount of time required to return to the last transfer of previously requested read data. The memory controller 802 uses pre-configured minimum latency information, along with counters to keep track of the current outstanding read latency of the channel, to issue read commands with RDBD values that return data on an easily predicted clock cycle and that prevent collisions between frames of returned read data on the upstream controller interface.



FIG. 11 depicts a process flow for providing positional read data latency in accordance with an exemplary embodiment of the present invention. At 1102, a minimum read data latency is determined for each memory module 806 within the memory subsystem. The minimum read data latency, or round trip delay times, for each memory module 806 may be predetermined by system timing analysis. A small set of configuration registers contain the total read data latency for accesses to each set of memory modules 806 across all of the channels within a logical memory port. This value will indicate the return cycle of the first data shot in a read data burst. In general, memory modules 806, across multiple memory subsystems of the same rank will have the same read data latency. So, a memory controller with four memory modules per memory channel within a logical memory port would be configured for a total of four read data latency values, one for each of the daisy chained memory module slots within a channel.


At block 1104, an outstanding read latency counter (ORLC) is initialized by being set to zero. The ORLC is a counter that is used by the memory controller 802 logic to keep track of the remaining latency of the latest outstanding read operation, including all transfers of data within a burst.


The processing shown in blocks 1106 through 1116 is performed once per clock cycle, while the memory subsystem is processing data. At block 1106, it is determined if a read request for a target memory module 806 was received in the new clock cycle. If it is determined at block 1106 that a read request was not received, then processing continues at block 1116. If it is determined that a read request was received, then block 1108 is performed.


At block 1108, a read data buffer delay (RDBD) (i.e., an additional delay period, also referred to herein as an additional read data latency time period) for the target memory module is calculated. Each read command will have an associated RDBD value that may be zero if conditions allow. This value is chosen to return all data to the memory controller 802 in the order in which it is requested and to prevent collisions on the read data return busses (i.e., the upstream memory bus 902). The smallest (optimal) allowed value is easily determined by subtracting the read latency configuration for the addressed, or target, memory module 806 from the current ORLC and adding one. Using the RDBD values from this formula with multiple read commands results in the back to back return of read data with no collisions. Read commands issued to an idle memory port, or memory channel, will always add zero RDBD so that data will be returned as quickly as possible. An exemplary formula for calculating a RDBD for a target memory module 806 follows:

RDBDtargetmemorymodule=MAX(ORLCcurrent−read_latencytargetmemorymodule+1,0).


At block 1110, a check is made to determine if the target memory module 806 has an available read buffer. In order to issue a new read command with a RBD value greater than zero, the memory controller 802 must ensure that the addressed memory bank is available and that there is an open read buffer within the addressed, or target, memory module 806.


In an exemplary embodiment of the present invention, this check is performed by using read buffer counters for each memory module 806 within a memory subsystem. As read commands are issued and returned to each memory module 806, the counters are modified to track the buffer usage. One problem with this approach is that an over pessimistic read buffer usage prediction may result. Read operations may be held off when, in fact, it may be allowable for them to be initiated.


Due to the FIFO nature of the read buffers, the read buffers may be utilized more efficiently by scheduling the time that the read data is actually buffered. In an alternate exemplary embodiment of the present invention, a small number of read buffers are utilized by using a simple but more advanced algorithm in order to determine if the target memory module 806 has an available read buffer. Instead of using one read buffer counter per memory module 806 that tracks buffer occupancy, the memory controller 802 uses one read buffer counter per read buffer per memory module 806. For a memory channel, or memory subsystem, with four memory modules 806 each with two read buffers, this would require a total of eight small read buffer counters.


On memory clock cycles in which a read command is not issued to a given read buffer, the read buffer counter of the given read buffer is decremented by eight (the number of bits transferred per clock cycle) with a minimum of zero. In order to issue a read command to a memory module 806, the memory controller 802 checks, at block 1110, to see that at least one of the read buffer counters associated with the addressed memory module 806 has a value of zero. On memory clock cycles in which a read command is issued, one of the read buffer counters of the target memory module 806 that is currently at zero will be loaded with the RDBD value determined at block 1108. Using this technique, there can be more memory read operations outstanding per memory module 806 than there are read data buffers per memory module 806. If none of the read buffer counters associated with the target memory module 806 are equal to zero (i.e., it is determined at block 1110 that there are no available read buffers at the target memory module 806), then block 1112 is performed to prepare the read request for re-sending during another clock cycle. For example, the one memory controller logic may reject the requested read operation, indicating that the requesting unit must retry it at a later time. Once block 1112 has completed, processing continues at block 1116.


At block 1114, a read command that includes the RDBD (i.e., the additional delay) is issued to the target memory module 806. The value of the RDBD is placed in a read buffer counter associated with the target memory module 806.


At block 1116, the ORLC is updated and read data buffer counters are updated. The ORLC is updated to be equal to the read latency for the addressed memory module 806 plus the width of the read data burst plus the added RDBD minus one. This updated, or new, ORLC indicates the return of the last transfer of data from the new read data command and may also be utilized to predict the arrival of the first transfer in the memory controller read data capture and bus error code correction (ECC) logic. On memory clock cycles in which a new read command is not issued, the ORLC will be decremented by eight (but never below zero) as there will be eight bit times per memory clock cycle. Following is an exemplary formula for calculating the new value of the ORLC:

ORLCnew=MAX(ORLCcurrent−8,0) when new_read_command=“0” ELSE
ORLCnew=read_latencytargetmemorymodule+(4×burst_length)+RDBDtargetmemorymodule−1


Following is an exemplary formula for calculating the new read buffer counters when there are two read buffers per memory module 806 and four memory modules 806 in the memory subsystem:

read_buffer counter[0 . . . 7]new=MAX(read_buffer_counter[0 . . . 7]current−8),0)WHEN new_read_command=“0” ELSE
read_buffer_counter[target_memory-module]new=RDBDtargetmemorymodule.


After block 1116 is completed, processing continues during the next clock cycle at block 1106. Processing continues in this fashion from blocks 1106 through 1116, while the memory subsystem is processing data. The processing described in reference to FIG. 11 allows all read data to be returned to the memory controller 802 in the order in which it was requested by a memory controller 802 read command on an easily predetermined cycle. No tag or valid indicator is required to be returned with the data because the return time and the source of the data is predetermined. Read data commands are sent to the memory modules 806 with an easily determined RDBD value that will prevent collisions from occurring on the read data bus (i.e., the upstream memory bus 902) back to the memory controller 802.


Also as described in reference to FIG. 11, the read data arriving from the memory devices on the memory modules 806 is captured and delayed by the FIFO read buffers by the number of delay cycles indicated in the RDBD in the read command. Read data from the memory module 806 to the memory controller 802 is sourced from the upstream, incoming data unless there is a local data packet to drive towards the memory controller 802. Further, there is no data arbitration logic or flow through buffers in the memory subsystem as all collisions are prevented through intelligent scheduling using the RDBD values.



FIG. 12 depicts a timing diagram with four read operations, one to each memory module, in accordance with exemplary embodiments of the present invention. The memory controller 802 is configured with the read latency look up configuration described in reference to FIG. 11. The memory controller 802 issues four read commands in the command field of downstream frames on signals named “mc_cmd_o(0:6)” on the downstream memory bus 904 with “mc_clk_o” representing the memory controller clock signal, “orlc_q” representing the current value of the ORLC and “mc_rd_i(0:17)” representing the returned read data in an upstream frame on the upstream memory bus 902. In this example, the read data latency for the first memory module 806 is thirty-two transfers, the read data latency for the second memory module 806 is thirty-six transfers, the read data latency for the third memory module 806 is forty transfers, and the read data latency for the fourth memory module 806 is forty-four transfers. The ORLC has an initial value of zero and two transfers occur for each clock cycle with a burst length of four.


At clock cycle five, a read command to the fourth memory module 806 is issued with a RDBD equal to zero and the ORLC is set to fifty-nine: 44 (the read latency for the fourth memory module) plus 16 (four times the burst length of four) minus 1. At clock cycle thirty-one: 9 (clock cycle nine when the read command is completed) plus 0 (for the number of cycles for the RDBD) plus 22 (the number of clock cycles for the read latency of the fourth memory module), the read data from the fourth memory module 806, “rd4”, is returned.


In an example, at clock cycle nine, a read command to the second memory module 806 is issued with a RDBD equal to sixteen: 51 (the current value of the ORLC calculated as 59) minus 8 (because 8 more transfers have occurred over the four cycles since clock cycle five) minus 36 (the read latency for the second memory module 806) plus 1. The ORLC is set to sixty seven: 36 (the read latency for the second memory module) plus 16 (the RDBD) plus 16 (four times the burst length of four) minus 1. At clock cycle thirty-nine: 13 (clock cycle thirteen when the read command is completed) plus 8 (the number of cycles for the 16 transfers in the RDBD) plus 18 (the number of cycles for thirty-two transfers in the read latency for the second memory module 806), the read data from the second memory module 806, “rd2”, is returned.


At clock cycle 13, no read commands are issued and value of the ORLC is decremented to fifty-nine. The calculations for the remaining cycles for ORLC and RDBD are similar to those described above following the process described in reference to FIG. 11.


Exemplary embodiments of the present invention provide positional read data latency within a memory channel, or memory subsystem, comprised of cascaded, buffered memory modules 806. Positional read data latency is provided without adding undue logic and control complexity. Exemplary embodiments of the present invention do not require latency adding arbitration logic or power consuming critical resource scheduling arrays. Further, the positional read data latency described herein does not slow down the memory subsystem by delaying the issuing of memory commands in order to prevent upstream controller interface collisions.


Exemplary embodiments of the present invention allows commands to be issued by the memory controller 802 as soon as possible without using gaps in the command stream to prevent read data collisions. This may allow the accessed memory cells to begin preparing for future memory accesses without delay. Exemplary embodiments of the present invention allow read data to be returned to the memory controller 802 without gaps in the upstream read data transmissions. Further, read data is returned as soon as possible without the additional delay that may be associated with levelized latency techniques.


As described above, the embodiments of the invention may be embodied in the form of computer-implemented processes and apparatuses for practicing those processes. Embodiments of the invention may also be embodied in the form of computer program code containing instructions embodied in tangible media, such as floppy diskettes, CD-ROMs, hard drives, or any other computer-readable storage medium, wherein, when the computer program code is loaded into and executed by a computer, the computer becomes an apparatus for practicing the invention. The present invention can also be embodied in the form of computer program code, for example, whether stored in a storage medium, loaded into and/or executed by a computer, or transmitted over some transmission medium, such as over electrical wiring or cabling, through fiber optics, or via electromagnetic radiation, wherein, when the computer program code is loaded into and executed by a computer, the computer becomes an apparatus for practicing the invention. When implemented on a general-purpose microprocessor, the computer program code segments configure the microprocessor to create specific logic circuits.


While the invention has been described with reference to exemplary embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from the essential scope thereof. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed as the best mode contemplated for carrying out this invention, but that the invention will include all embodiments falling within the scope of the appended claims. Moreover, the use of the terms first, second, etc. do not denote any order or importance, but rather the terms first, second, etc. are used to distinguish one element from another.

Claims
  • 1. A memory subsystem comprising: a memory module comprising: two or more memory devices; anda buffer device comprising a read data buffer for holding read data from the memory devices;a memory controller for generating read commands for reading data from the memory devices, each read command including a starting address of a memory burst read operation and a delay period for the read data to reside in the read data buffer of the buffer device prior to the buffer device sending the read data to the memory controller, the memory controller further comprising: a read buffer counter to track buffer usage at the memory controller for the read data buffer; andan outstanding read latency counter to keep track of remaining latency of a latest outstanding read operation including transfers of read data associated with the memory burst read operation; andone or more memory busses, wherein the memory module and the memory controller are interconnected via the memory busses and wherein the delay period varies and is calculated by the memory controller responsive to a minimum read latency associated with the memory module and to prevent collisions with other data expected on the memory busses from other read operations, the other read operations including at least one previous memory burst read operation,wherein the memory controller is further configured to update the outstanding read latency counter as a function of a read latency for the memory module, a width of the memory burst read operation, and an additional read data latency time period, the additional read data latency time period calculated for each read command as a read data buffer delay for the memory module.
  • 2. The system of claim 1 wherein the delay period is greater than zero.
  • 3. The system of claim 1 wherein the delay period is equal to zero.
  • 4. The system of claim 1 wherein the delay period is expressed in terms of data transfers.
  • 5. The system of claim 1 wherein the delay period is expressed in terms of clock cycles.
  • 6. The system of claim 1 wherein the memory busses are cascade interconnected by a packetized multi-transfer interface and include an upstream bus for sending data back to the controller from the memory module and a downstream bus for transmitting each read command to the memory module.
  • 7. The system of claim 1 wherein the outstanding read latency counter is decremented by a number of bit times per memory clock cycle.
  • 8. A computer readable storage medium encoded with machine readable computer program code for providing positional read data latency in a memory subsystem, the computer readable storage medium is a non-transitory computer readable storage medium and includes instructions for causing a computer to implement a method comprising: receiving a read request for a target memory module;calculating a delay period by a memory controller for the read request, wherein the delay period varies and is selected to prevent a collision with other returned read data on a memory bus used to communicate with the target memory module and an additional memory module, wherein the calculating of the delay period is responsive to one or more outstanding read commands previously issued to the memory subsystem including at least one previous burst read command and to a minimum read latency associated with the target memory module in consideration of the one or more outstanding read commands, wherein the target memory module comprises two or more memory devices and a buffer device, the buffer device comprising one or more read data buffers to hold read data from the two or more memory devices corresponding to the read request;determining if the one or more read data buffers on the target memory module are available for holding the read data for the delay period specified by the read command, the determining performed by using a read buffer counter in the memory controller associated with the target memory module to track buffer usage;transmitting a burst read command to the target memory module, the transmitting via one or more memory busses in communication with the target memory module and the memory controller, the burst read command including a starting address of a memory burst read operation and the delay period, wherein the transmitting of the burst read command is executed in response to determining that the one or more read data buffers on the target memory module are available;tracking a remaining latency of the burst read command using an outstanding read latency counter at the memory controller, including all transfers of read data associated with the burst read command;receiving the read data at the memory controller from the buffer device, the receiving via the memory busses and in response to the burst read command and after the delay period has expired; andupdating the outstanding read latency counter as a function of a read latency for the target memory module, a width of the memory burst read operation, and an additional read data latency time period, the additional read data latency time period calculated for the read request as a read data buffer delay for the target memory module.
  • 9. The computer readable storage medium of claim 8 wherein the one or more read data buffers hold the read data for a time specified by the delay period.
  • 10. The computer readable storage medium of claim 8 wherein the delay period is greater than zero.
  • 11. The computer readable storage medium of claim 8 wherein the delay period is equal to zero.
  • 12. The computer readable storage medium of claim 8 wherein the delay period is expressed in terms of data transfers.
  • 13. The computer readable storage medium of claim 8 wherein the delay period is expressed in terms of clock cycles.
  • 14. A memory subsystem comprising: two or more memory devices; anda memory buffer device external to the two or more memory devices, the memory buffer device comprising:a bus-to-bus converter to convert information from a high-speed communication bus to a memory device bus, the memory device bus in communication with the-two or more memory devices; andmemory registers to delay sending data received via the memory device bus on the high-speed communication bus by a variable amount of time determined by delay information received in each read command from a memory controller at the memory buffer device via the high-speed communication bus, each read command further comprising a starting address of a memory burst read operation, wherein the delay information comprising a delay period that varies and is calculated by the memory controller responsive to a minimum read latency associated with the memory subsystem and to prevent collisions with other data expected on the high-speed communication bus from other read operations, the other read operations including at least one previous memory burst read operation,wherein the memory buffer device is further configured to source upstream incoming data unless there is a local data packet to drive towards the memory controller, and selection between incoming data and local data is performed absent data arbitration logic, wherein collisions are prevented through the memory registers delay in sending data.
  • 15. The memory subsystem of claim 14 wherein the high-speed communication bus is a packetized multi-transfer interface supporting cascade interconnections with one or more additional memory subsystems.
  • 16. The memory subsystem of claim 14 wherein the variable amount of time is zero.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 10/977,038 filed Oct. 29, 2004, the contents of which are incorporated by reference herein in their entirety.

US Referenced Citations (374)
Number Name Date Kind
2842682 Clapper Jul 1958 A
3333253 Sahulka Jul 1967 A
3395400 De Witt et al. Jul 1968 A
3825904 Burk et al. Jul 1974 A
4028675 Frankenberg Jun 1977 A
4135240 Ritchie Jan 1979 A
4150428 Inrig et al. Apr 1979 A
4472780 Chenoweth et al. Sep 1984 A
4475194 LaVallee et al. Oct 1984 A
4479214 Ryan Oct 1984 A
4486739 Franaszek et al. Dec 1984 A
4641263 Perlman et al. Feb 1987 A
4654857 Samson et al. Mar 1987 A
4723120 Petty, Jr. Feb 1988 A
4740916 Martin Apr 1988 A
4782487 Smelser Nov 1988 A
4796231 Pinkham Jan 1989 A
4803485 Rypinski Feb 1989 A
4833605 Terada et al. May 1989 A
4839534 Clasen Jun 1989 A
4943984 Pechanek et al. Jul 1990 A
4964129 Bowden, III et al. Oct 1990 A
4964130 Bowden, III et al. Oct 1990 A
4985828 Shimizu et al. Jan 1991 A
5053947 Heibel et al. Oct 1991 A
5177375 Ogawa et al. Jan 1993 A
5206946 Brunk Apr 1993 A
5214747 Cok May 1993 A
5265212 Bruce, II Nov 1993 A
5287531 Rogers, Jr. et al. Feb 1994 A
5347270 Matsuda et al. Sep 1994 A
5357621 Cox Oct 1994 A
5375127 Leak et al. Dec 1994 A
5387911 Gleichert et al. Feb 1995 A
5394535 Ohuchi Feb 1995 A
5410545 Porter et al. Apr 1995 A
5454091 Sites et al. Sep 1995 A
5475690 Burns et al. Dec 1995 A
5513135 Dell et al. Apr 1996 A
5517626 Archer et al. May 1996 A
5522064 Aldereguia et al. May 1996 A
5537621 Charlot et al. Jul 1996 A
5544309 Chang et al. Aug 1996 A
5546023 Borkar et al. Aug 1996 A
5561826 Davies et al. Oct 1996 A
5592632 Leung et al. Jan 1997 A
5594925 Harder et al. Jan 1997 A
5611055 Krishan et al. Mar 1997 A
5613077 Leung et al. Mar 1997 A
5627963 Gabillard et al. May 1997 A
5629685 Allen et al. May 1997 A
5661677 Rondeau, II et al. Aug 1997 A
5666480 Leung et al. Sep 1997 A
5684418 Yanagiuchi Nov 1997 A
5706346 Katta et al. Jan 1998 A
5737589 Doi et al. Apr 1998 A
5754804 Cheselka et al. May 1998 A
5764155 Kertesz et al. Jun 1998 A
5822749 Agarwal Oct 1998 A
5852617 Mote, Jr. Dec 1998 A
5870320 Volkonsky Feb 1999 A
5870325 Nielsen et al. Feb 1999 A
5872996 Barth et al. Feb 1999 A
5881154 Nohara et al. Mar 1999 A
5917760 Millar Jun 1999 A
5917780 Berestov Jun 1999 A
5926838 Jeddeloh Jul 1999 A
5928343 Farmwald et al. Jul 1999 A
5930273 Mukojima Jul 1999 A
5959914 Gates et al. Sep 1999 A
5973951 Bechtolsheim et al. Oct 1999 A
5974493 Okumura et al. Oct 1999 A
5987555 Alzien et al. Nov 1999 A
5995405 Trick Nov 1999 A
6003121 Wirt Dec 1999 A
6011732 Harrison et al. Jan 2000 A
6038132 Tokunaga et al. Mar 2000 A
6038195 Farmwald et al. Mar 2000 A
6049476 Laudon et al. Apr 2000 A
6076158 Sites et al. Jun 2000 A
6078515 Nielsen et al. Jun 2000 A
6081868 Brooks Jun 2000 A
6085276 VanDoren et al. Jul 2000 A
6088817 Haulin Jul 2000 A
6096091 Hartmann Aug 2000 A
6128746 Clark et al. Oct 2000 A
6145028 Shank et al. Nov 2000 A
6158040 Ho Dec 2000 A
6170047 Dye Jan 2001 B1
6170059 Pruett et al. Jan 2001 B1
6173382 Dell et al. Jan 2001 B1
6185718 Dell et al. Feb 2001 B1
6198304 Sasaki Mar 2001 B1
6215686 Deneroff et al. Apr 2001 B1
6216247 Creta et al. Apr 2001 B1
6219288 Braceras et al. Apr 2001 B1
6219760 McMinn Apr 2001 B1
6233639 Dell et al. May 2001 B1
6260127 Olarig et al. Jul 2001 B1
6262493 Garnett Jul 2001 B1
6285172 Torbey Sep 2001 B1
6292903 Coteus et al. Sep 2001 B1
6301636 Schultz et al. Oct 2001 B1
6308247 Ackerman et al. Oct 2001 B1
6317352 Halbert et al. Nov 2001 B1
6321343 Toda Nov 2001 B1
6338113 Kubo et al. Jan 2002 B1
6349390 Dell et al. Feb 2002 B1
6357018 Stuewe et al. Mar 2002 B1
6370631 Dye Apr 2002 B1
6378018 Tsern et al. Apr 2002 B1
6381685 Dell et al. Apr 2002 B2
6393512 Chen et al. May 2002 B1
6393528 Arimilli et al. May 2002 B1
6408398 Freker et al. Jun 2002 B1
6425044 Jeddeloh Jul 2002 B1
6442698 Nizar Aug 2002 B2
6446174 Dow Sep 2002 B1
6446224 Chang et al. Sep 2002 B1
6461013 Simon Oct 2002 B1
6467013 Nizar Oct 2002 B1
6473836 Ikeda Oct 2002 B1
6477614 Leddige et al. Nov 2002 B1
6477615 Tanaka Nov 2002 B1
6483755 Leung et al. Nov 2002 B2
6484271 Gray Nov 2002 B1
6487102 Halbert et al. Nov 2002 B1
6487627 Willke et al. Nov 2002 B1
6493250 Halbert et al. Dec 2002 B2
6496540 Widmer Dec 2002 B1
6496910 Baentsch et al. Dec 2002 B1
6499070 Whetsel Dec 2002 B1
6502161 Perego et al. Dec 2002 B1
6505305 Olarig Jan 2003 B1
6507888 Wu et al. Jan 2003 B2
6510100 Grundon et al. Jan 2003 B2
6513089 Hofmann et al. Jan 2003 B1
6513091 Blackmon et al. Jan 2003 B1
6526469 Drehmel et al. Feb 2003 B1
6530007 Olarig et al. Mar 2003 B2
6532525 Aleksic et al. Mar 2003 B1
6546359 Week Apr 2003 B1
6549971 Cecchi et al. Apr 2003 B1
6553450 Dodd et al. Apr 2003 B1
6557069 Drehmel et al. Apr 2003 B1
6564329 Cheung et al. May 2003 B1
6584576 Co Jun 2003 B1
6587912 Leddige et al. Jul 2003 B2
6590827 Chang et al. Jul 2003 B2
6594713 Fuoco et al. Jul 2003 B1
6594748 Lin Jul 2003 B1
6601121 Singh et al. Jul 2003 B2
6601149 Brock et al. Jul 2003 B1
6604180 Jeddeloh Aug 2003 B2
6611902 Kuroda et al. Aug 2003 B2
6611905 Grundon et al. Aug 2003 B1
6622217 Barroso et al. Sep 2003 B2
6622227 Zumkehr et al. Sep 2003 B2
6625687 Halbert et al. Sep 2003 B1
6625702 Rentschler et al. Sep 2003 B2
6628538 Funaba et al. Sep 2003 B2
6631439 Saulsbury et al. Oct 2003 B2
6636957 Stevens et al. Oct 2003 B2
6643745 Palanca et al. Nov 2003 B1
6671376 Koto et al. Dec 2003 B1
6675280 Cooksey et al. Jan 2004 B2
6678777 Rao et al. Jan 2004 B2
6678811 Rentschler et al. Jan 2004 B2
6681292 Creta et al. Jan 2004 B2
6684320 Mohamed et al. Jan 2004 B2
6697919 Gharachorloo et al. Feb 2004 B2
6704817 Steinman et al. Mar 2004 B1
6704842 Janakiraman et al. Mar 2004 B1
6721185 Dong et al. Apr 2004 B2
6721944 Chaudhry et al. Apr 2004 B2
6735669 Shin May 2004 B2
6738836 Kessler et al. May 2004 B1
6741096 Moss May 2004 B2
6748518 Guthrie et al. Jun 2004 B1
6754762 Curley Jun 2004 B1
6760817 Arimilli et al. Jul 2004 B2
6766389 Hayter et al. Jul 2004 B2
6775747 Venkatraman Aug 2004 B2
6779075 Wu et al. Aug 2004 B2
6791555 Radke et al. Sep 2004 B1
6792495 Garney et al. Sep 2004 B1
6799241 Kahn et al. Sep 2004 B2
6807650 Lamb et al. Oct 2004 B2
6832286 Johnson et al. Dec 2004 B2
6832329 Ahrens et al. Dec 2004 B2
6834355 Uzelac Dec 2004 B2
6839393 Sidiropoulos Jan 2005 B1
6845472 Walker et al. Jan 2005 B2
6847583 Janzen et al. Jan 2005 B2
6851016 Janzen et al. Feb 2005 B2
6851036 Toda et al. Feb 2005 B1
6854043 Hargis et al. Feb 2005 B2
6865646 David Mar 2005 B2
6871253 Greeff et al. Mar 2005 B2
6874102 Doody et al. Mar 2005 B2
6877076 Cho et al. Apr 2005 B1
6877078 Fujiwara et al. Apr 2005 B2
6882082 Greeff et al. Apr 2005 B2
6889284 Nizar et al. May 2005 B1
6898726 Lee May 2005 B1
6910146 Dow Jun 2005 B2
6918068 Vail et al. Jul 2005 B2
6922658 Bohizic et al. Jul 2005 B2
6925534 David Aug 2005 B2
6938119 Kohn et al. Aug 2005 B2
6944084 Wilcox Sep 2005 B2
6948091 Bartels et al. Sep 2005 B2
6949950 Takahashi et al. Sep 2005 B2
6952761 John Oct 2005 B2
6965952 Echartea et al. Nov 2005 B2
6977536 Chin-Chieh et al. Dec 2005 B2
6977979 Hartwell et al. Dec 2005 B1
6993612 Porterfield Jan 2006 B2
6996639 Narad Feb 2006 B2
6996766 Cypher Feb 2006 B2
7017020 Herbst et al. Mar 2006 B2
7024518 Halbert et al. Apr 2006 B2
7027336 Lee Apr 2006 B2
7039755 Helms May 2006 B1
7047370 Jeter, Jr. et al. May 2006 B1
7047371 Dortu May 2006 B2
7047373 Kim May 2006 B2
7047384 Bodas et al. May 2006 B2
7051172 Mastronarde et al. May 2006 B2
7073010 Chen et al. Jul 2006 B2
7076700 Rieger Jul 2006 B2
7091890 Sasaki et al. Aug 2006 B1
7093078 Kondo Aug 2006 B2
7096407 Olarig Aug 2006 B2
7103792 Moon Sep 2006 B2
7113418 Oberlin et al. Sep 2006 B2
7114109 Daily et al. Sep 2006 B2
7120743 Meyer et al. Oct 2006 B2
7127629 Vogt Oct 2006 B2
7133790 Liou Nov 2006 B2
7133972 Jeddeloh Nov 2006 B2
7136958 Jeddeloh Nov 2006 B2
7155016 Betts et al. Dec 2006 B1
7155623 Lefurgy et al. Dec 2006 B2
7162567 Jeddeloh Jan 2007 B2
7165153 Vogt Jan 2007 B2
7177211 Zimmerman Feb 2007 B2
7181584 LaBerge Feb 2007 B2
7194593 Schnepper Mar 2007 B2
7197594 Raz et al. Mar 2007 B2
7197670 Boatright et al. Mar 2007 B2
7200832 Butt et al. Apr 2007 B2
7203318 Collum et al. Apr 2007 B2
7206887 Jeddeloh Apr 2007 B2
7206962 Deegan et al. Apr 2007 B2
7210059 Jeddeloh Apr 2007 B2
7216196 Jeddeloh May 2007 B2
7216276 Azimi et al. May 2007 B1
7222213 James May 2007 B2
7227949 Heegard et al. Jun 2007 B2
7234099 Gower et al. Jun 2007 B2
7240145 Holman Jul 2007 B2
7260685 Lee et al. Aug 2007 B2
7266634 Ware et al. Sep 2007 B2
7269765 Charlton et al. Sep 2007 B1
7290190 Obara Oct 2007 B2
7296129 Gower et al. Nov 2007 B2
7304905 Hsu et al. Dec 2007 B2
7313583 Porten et al. Dec 2007 B2
7319340 Jeddeloh et al. Jan 2008 B2
7321979 Lee Jan 2008 B2
7331010 Dell et al. Feb 2008 B2
7334070 Borkenhagen Feb 2008 B2
7334159 Callaghan Feb 2008 B1
7353316 Erdmann Apr 2008 B2
7360027 Huggahalli et al. Apr 2008 B2
7363419 Cronin et al. Apr 2008 B2
7363436 Yeh et al. Apr 2008 B1
7370134 Jeddeloh May 2008 B2
7373440 Huppenthal et al. May 2008 B2
7376146 Beverly et al. May 2008 B2
7386575 Bashant et al. Jun 2008 B2
7386696 Jakobs et al. Jun 2008 B2
7386771 Shuma Jun 2008 B2
7404118 Baguette et al. Jul 2008 B1
7412566 Lee et al. Aug 2008 B2
7412574 Jeddeloh Aug 2008 B2
7418526 Jeddeloh Aug 2008 B2
7421525 Polzin et al. Sep 2008 B2
7430145 Weiss et al. Sep 2008 B2
7433258 Rao et al. Oct 2008 B2
20010029592 Walker et al. Oct 2001 A1
20020059439 Arroyo et al. May 2002 A1
20020103988 Dornier Aug 2002 A1
20020124201 Edwards et al. Sep 2002 A1
20030033364 Garnett et al. Feb 2003 A1
20030051055 Parrella, Sr. et al. Mar 2003 A1
20030056183 Kobayashi Mar 2003 A1
20030084309 Kohn May 2003 A1
20030090879 Doblar et al. May 2003 A1
20030118044 Blanc et al. Jun 2003 A1
20030126354 Kahn et al. Jul 2003 A1
20030126373 David Jul 2003 A1
20030229770 Jeddeloh Dec 2003 A1
20030235222 Bridges et al. Dec 2003 A1
20040015650 Zumkehr et al. Jan 2004 A1
20040078615 Martin et al. Apr 2004 A1
20040098546 Bashant et al. May 2004 A1
20040098549 Dorst May 2004 A1
20040103258 Blackmon et al. May 2004 A1
20040117588 Arimilli et al. Jun 2004 A1
20040123222 Widmer Jun 2004 A1
20040128474 Vorbach Jul 2004 A1
20040130832 Nakamura et al. Jul 2004 A1
20040148482 Grundy et al. Jul 2004 A1
20040230718 Polzin et al. Nov 2004 A1
20040260957 Jeddeloh et al. Dec 2004 A1
20050022065 Dixon et al. Jan 2005 A1
20050023560 Ahn et al. Feb 2005 A1
20050027941 Wang et al. Feb 2005 A1
20050044305 Jakobs et al. Feb 2005 A1
20050050237 Jeddeloh Mar 2005 A1
20050071542 Weber et al. Mar 2005 A1
20050071707 Hampel Mar 2005 A1
20050078506 Rao et al. Apr 2005 A1
20050080581 Zimmerman et al. Apr 2005 A1
20050081085 Ellis et al. Apr 2005 A1
20050081114 Ackaret et al. Apr 2005 A1
20050081129 Shah et al. Apr 2005 A1
20050086424 Oh et al. Apr 2005 A1
20050105350 Zimmerman May 2005 A1
20050125702 Huang et al. Jun 2005 A1
20050138246 Chen et al. Jun 2005 A1
20050138267 Bains et al. Jun 2005 A1
20050144399 Hosomi Jun 2005 A1
20050149665 Wolrich et al. Jul 2005 A1
20050166006 Talbot et al. Jul 2005 A1
20050216678 Jeddeloh Sep 2005 A1
20050220097 Swami et al. Oct 2005 A1
20050223196 Knowles Oct 2005 A1
20050262323 Woo et al. Nov 2005 A1
20050289292 Morrow et al. Dec 2005 A1
20050289377 Luong et al. Dec 2005 A1
20060004953 Vogt Jan 2006 A1
20060010339 Klein Jan 2006 A1
20060015660 Nguyen et al. Jan 2006 A1
20060036826 Dell et al. Feb 2006 A1
20060036827 Dell et al. Feb 2006 A1
20060080584 Hartnett et al. Apr 2006 A1
20060095679 Edirisooriya May 2006 A1
20060104371 Schuermans et al. May 2006 A1
20060112238 Jamil et al. May 2006 A1
20060161733 Beckett et al. Jul 2006 A1
20060162882 Ohara et al. Jul 2006 A1
20060168407 Stern Jul 2006 A1
20060179208 Jeddeloh Aug 2006 A1
20060190674 Poechmueller Aug 2006 A1
20060195631 Rajamani Aug 2006 A1
20060206742 James Sep 2006 A1
20060212666 Jeddeloh Sep 2006 A1
20060224764 Shinohara et al. Oct 2006 A1
20060277365 Pong Dec 2006 A1
20060288172 Lee et al. Dec 2006 A1
20070005922 Swaminathan et al. Jan 2007 A1
20070025304 Leelahakriengkrai et al. Feb 2007 A1
20070038907 Jeddeloh et al. Feb 2007 A1
20070067382 Sun Mar 2007 A1
20070083701 Kapil Apr 2007 A1
20070160053 Coteus et al. Jul 2007 A1
20080043808 Hsu et al. Feb 2008 A1
20080162807 Rothman et al. Jul 2008 A1
20080163014 Crawford et al. Jul 2008 A1
20080222379 Jeddeloh Sep 2008 A1
20090006900 Lastras-Montano et al. Jan 2009 A1
Foreign Referenced Citations (18)
Number Date Country
0229316 Jul 1987 EP
0470734 Feb 1992 EP
0899743 Jun 1998 EP
1429340 Jun 2004 EP
2396711 Jun 2004 GB
59153353 Sep 1984 JP
59153353 Sep 1984 JP
01144140 Jun 1989 JP
0432614 Nov 1992 JP
10011971 Jan 1998 JP
2004139552 May 2004 JP
20083711 Jan 2008 JP
WO 9621188 Jul 1996 WO
WO9812651 Mar 1998 WO
0004481 Jan 2000 WO
WO0223353 Mar 2002 WO
2005038660 Apr 2005 WO
WO2007109888 Oct 2007 WO
Related Publications (1)
Number Date Country
20090150636 A1 Jun 2009 US
Continuations (1)
Number Date Country
Parent 10977038 Oct 2004 US
Child 12369037 US