US 7,305,574 B2Grant
System, method and storage medium for bus calibration in a memory subsystem
Issue Date:2007-12-04
•22 Claims
•12 Drawing Sheets
Abstract
A cascaded interconnect system with one or more memory modules, a memory controller and a memory bus that utilizes periodic recalibration. The memory modules and the memory controller are directly interconnected by a packetized multi-transfer interface via the memory bus and provide scrambled data for use in the periodic recalibration.
Metadata
Assignee
- International Business Machines Corporation
Inventors
- Frank D. Ferraiolo
- Kevin C. Gower
Application Information
Application Number:US 10/977,048
Filing Date:2004-10-29
Priority Date:2004-10-29
Art Unit:2116
Classifications
IPC:
G11C7/10G06F1/00
Patent Drawings (12 sheets)
Description
Background of the Invention
[0001] The invention relates to a memory subsystem and in particular, to bus calibration in a memory subsystem.
[0002] 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.
[0003] 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).
[0004] 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.
[0005] 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.
[0006] 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.
[0007] 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.
[0008] 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.
[0009] In chip to chip (e.g., controller to module, module to module) communication, it is common place to design receive side circuits and/or logic to aid in the sampling of the incoming data to improve the performance of the interface. Typically the circuitry senses transitions on the incoming data. Based on the position or phase arrival of the data transitions, an algorithm determines the optimum phase of the clock to sample the incoming data. See FIG. 8 , where the clock is centered between two consecutive edges of data. The guardbands are used to sense and to equally center the clock within the data transitions. Designers may use a phased loop lock (PLL), a delay locked loop (DLL) or various other closed loop techniques to determine and then to set the optimal phase of the sampling clock. Without transitions on the incoming data, there is no information to sense or to base a relative comparison of the sampling clock to the incoming data. If long periods of time elapse without transitions on data, the sampling clock may drift with changes in temperature or power supply, thus increasing the sampling error and decreasing the performance of the interface.
[0010] In order to ensure that there is some minimum transition density within the data, designers often code the data. The 8/10 code is a well known code that encodes an eight bit data stream into ten bits to ensure transitions always exist on data. However, the impact on bandwidth is twenty percent because what would normally take eight bit times to transfer the required information now takes ten bits with the overhead of the coding function. An alternative to coding is to periodically interrupt data transfers and to send a known pattern(s). Although the impact on bandwidth may be much smaller than with the coding alternative, this approach also has its drawbacks since the system operation must be halted before the special patterns can be transmitted.
Brief Summary of the Invention
[0011] Exemplary embodiments of the present invention include a cascaded interconnect system with one or more memory modules, a memory controller and a memory bus. The memory bus utilizes periodic recalibration. The memory modules and the memory controller are directly interconnected by a packetized multi-transfer interface via the memory bus and provide scrambled data for use in the periodic recalibration.
[0012] Additional exemplary embodiments include a method for providing periodic recalibration of a memory bus in a cascaded interconnect memory system. The method includes receiving input data at a transmit side, where the transmit side includes a memory controller or a memory module within the memory system. The input data is scrambled at the transmit side, resulting in scrambled data for use in the periodic recalibration of the memory bus. The scrambled data is transmitted to a receive side via the memory bus, where the receive side includes a memory controller or a memory module directly connected to the transmit side by a packetized multi-transfer interface via the memory bus. A sampling clock and a data phase of the scrambled data is periodically synchronized at the receive side for data sampling on the memory bus. The scrambled data is de-scrambled at the receive side, resulting in the original input data.
[0013] Further exemplary embodiments include a storage medium with machine readable computer program code for providing periodic bus recalibration of a memory bus in a cascaded interconnect memory subsystem. The storage medium includes instructions for causing a computer to implement a method. The method includes receiving input data at a transmit side, where the transmit side includes a memory controller or a memory module within the memory system. The input data is scrambled at the transmit side, resulting in scrambled data for use in the periodic recalibration of the memory bus. The scrambled data is transmitted to a receive side via the memory bus, where the receive side includes a memory controller or a memory module directly connected to the transmit side by a packetized multi-transfer interface via the memory bus. A sampling clock and a data phase of the scrambled data is periodically synchronized at the receive side for data sampling on the memory bus. The scrambled data is de-scrambled at the receive side, resulting in the original input data.
Brief Description of the Drawings
[0014] Referring now to the drawings wherein like elements are numbered alike in the several FIGURES:
[0015] FIG. 1 depicts a prior art memory controller connected to two buffered memory assemblies via separate point-to-point links;
[0016] FIG. 2 depicts a prior art synchronous memory module with a buffer device;
[0017] FIG. 3 depicts a prior art memory subsystem using registered DIMMs;
[0018] FIG. 4 depicts a prior art memory subsystem with point-to-point channels, registered DIMMs, and a 2:1 bus speed multiplier;
[0019] FIG. 5 depicts a prior art memory structure that utilizes a multidrop memory ‘stub’ bus;
[0020] FIG. 6 depicts a prior art daisy chain structure in a multipoint communication structure that would otherwise require multiple ports;
[0021] FIG. 7 depicts a prior art daisy chain connection between a memory controller and memory modules;
[0022] FIG. 8 depicts a prior art data sampling schematic;
[0023] FIG. 9 depicts a cascaded memory structure that is utilized by exemplary embodiments of the present invention;
[0024] FIG. 10 depicts a memory structure with cascaded memory modules and unidirectional busses that is utilized by exemplary embodiments of the present invention;
[0025] FIG. 11 depicts a buffered module wiring system that is utilized by exemplary embodiments of the present invention;
[0026] FIG. 12 depicts a memory subsystem that is utilized by exemplary embodiments of the present invention; and
[0027] FIG. 13 depicts exemplary circuitry for providing bus calibration in accordance with exemplary embodiments of the present invention.
Detailed Description of the Preferred Embodiments
[0028] Exemplary embodiments of the present invention provide scrambled data for use in calibrating busses in a memory subsystem. Data being transferred across wires within the memory subsystem are scrambled at a transmitting memory module or controller before being transferred and then de-scrambled at a receiving memory module or controller. Data bits are scrambled by mixing the data bits with a known pattern to reduce the likelihood that the data will not switch (i.e., go from a one to a zero or from a zero to a one) within a particular number of bits (e.g., sixty-four). As described previously, transitions on the wire are used for determining an optimum phase of a clock for data sampling on the wire.
[0029] Scrambling minimizes the likelihood that the data will not switch, and it does this without impacting bandwidth or requiring system operation to be halted. When using a sixty-four bit scrambling pattern, the chance of the exact inverse pattern of raw data being transmitted (and therefore no transitions in the data after it is scrambled), is approximately two to the sixty-fourth power. Over a longer period of time (e.g., after thousands of bits are transmitted) the likelihood of no data transitions on the transmitted (i.e., scrambled) data stream approaches zero. Another advantage of the scrambling approach is that the logic and additional latency required to implement scrambling is relatively small.
[0030] FIG. 9 depicts a cascaded memory structure that may be utilized by exemplary embodiments of the present invention. This memory structure includes a memory controller 902 in communication with one or more memory modules 906 via a high speed point-to-point bus 904. Each bus 904 in the exemplary embodiment depicted in FIG. 9 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. In an exemplary embodiments of the present invention, the memory controller 902 and memory modules 906 include or have access to scrambling and de-scrambling logic and/or circuitry. 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. 9 , provides a four to one bus speed ratio to maximize bus efficiency and to minimize pincount.
[0031] Although point-to-point interconnects permit higher data rates, overall memory subsystem efficiency must be achieved by maintaining a reasonable number of memory modules 906 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 bus 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 902.
[0032] FIG. 10 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 906 in the cascade structure is a re-drive function to send signals on the memory bus to other memory modules 906 or to the memory controller 902. FIG. 10 includes the memory controller 902 and four memory modules 906a, 906b, 906c and 906d, on each of two memory busses (a downstream memory bus 1004 and an upstream memory bus 1002), connected to the memory controller 902 in either a direct or cascaded manner. Memory module 906a is connected to the memory controller 902 in a direct manner. Memory modules 906b, 906c and 906d are connected to the controller 902 in a cascaded manner.
[0033] An exemplary embodiment of the present invention includes two uni-directional busses between the memory controller 902 and memory module 906a (“DIMM #1”), as well as between each successive memory module 906b-d (“DIMM #2”, “DIMM #3” and “DIMM #4”) in the cascaded memory structure. The downstream memory bus 1004 is comprised of twenty-two single-ended signals and a differential clock pair. The downstream memory bus 1004 is used to transfer address, control, write data and bus-level error code correction (ECC) bits downstream from the memory controller 902, over several clock cycles, to one or more of the memory modules 906 installed on the cascaded memory channel. The upstream memory bus 1002 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 906 to the memory controller 902. 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 902 signal pincount, per memory channel, is reduced from approximately one hundred and twenty pins to about fifty pins.
[0034] FIG. 11 depicts a buffered module wiring system that is utilized by exemplary embodiments of the present invention. FIG. 11 is a pictorial representation of a memory module, with shaded arrows representing the primary signal flows. The signal flows include the upstream memory bus 1002, the downstream memory bus 1004, memory device address and command busses 1110 and 1106, and memory device data busses 1112 and 1108. In an exemplary embodiment of the present invention, a buffer device 1102, also referred to as a memory interface chip, provides two copies of the address and command signals to SDRAMs 1104 with the right memory device address and command bus 1106 exiting from the right side of the buffer device 1102 for the SDRAMs 1104 located to the right side and behind the buffer device 1102 on the right. The left memory device address and command bus 1110 exits from the left side of the buffer device 1102 and connects to the SDRAMs 1104 to the left side and behind the buffer device 1102 on the left. Similarly, the data bits intended for SDRAMs 1104 to the right of the buffer device 1102 exit from the right of the buffer device 1102 on the right memory device data bus 1108. The data bits intended for the left side of the buffer device 1102 exit from the left of the buffer device 1102 on the left memory device data bus 1112. The high speed upstream memory bus 1002 and downstream memory bus 1004 exit from the lower portion of the buffer device 1102, and connect to a memory controller or other memory modules either upstream or downstream of this memory module 906, depending on the application. The buffer device 1102 receives signals that are four times the memory module data rate and converts them into signals at the memory module data rate.
[0035] The memory controller 902 interfaces to the memory modules 906 via a pair of high speed busses (or channels). The downstream memory bus 1004 (outbound from the memory controller 902) interface has twenty-four pins and the upstream memory bus 1002 (inbound to the memory controller 902) 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 906 installed. For each wire within a segment of the downstream memory bus 1004 and each wire within a segment of the upstream memory bus 1002 scrambling logic and/or circuitry at a sending end and de-scrambling logic and/or circuitry at a receiving end is applied. Whenever a memory module 906 receives a packet on either bus, it re-synchronizes the command to the internal clock and re-drives (including scrambling) the command to the next memory module 906 in the chain (if one exists).
[0036] FIG. 12 depicts a memory subsystem that is utilized by exemplary embodiments of the present invention. As shown in FIG. 12 , the memory controller 902 and memory modules 906 include a scrambling pattern and scrambling functions that may be implemented by hardware circuitry and/or software logic. Scrambling functions include data scrambling and data de-scrambling, as well as keeping track of one or more pointers for determining a current placement within the scrambling pattern. In an exemplary embodiment of the present invention, the scrambling and de-scrambling functions are performed in the same manner (e.g., with the same logic and with the same circuitry). One pointer is maintained for each scramble/de-scramble pair in order to synchronize the correct location in the scrambling pattern to be utilized for the scrambling/de-scrambling.
[0037] For example, the memory controller 902 and memory module 906a in FIG. 12 include “pointer 1”. When the memory controller 902 scrambles data to be sent to memory module 906a, the memory controller uses “pointer 1” to index into the scrambling pattern to point to the bit in the scrambling pattern that is being utilized for scrambling/de-scrambling. If the value of “pointer 1” at the memory controller 902 is five for the first bit being scrambled, then the value of “pointer 1” must be five at memory module 906a when the first bit is de-scrambled in order to ensure that the correct bit within the scrambling pattern is being utilized to de-scramble the first bit from the memory controller 902 (i.e., the input data). The pointers may be synchronized at memory subsystem initialization and then re-initialized as deemed required. The second bit would be scrambled and de-scrambled using a pointer value of six, the third bit would be scrambled using a pointer value of seven, etc. The de-scrambling process on the receive side returns the raw transmitted data back to its original values. Hence, the scrambling process is transparent to both ends of the link. Other methods of synchronizing the scrambling pattern between the transmit side and receive side may be utilized by alternate exemplary embodiments of the present invention to ensure that the same values within the scrambling pattern are being utilized to perform the scrambling and the corresponding de-scrambling.
[0038] In exemplary embodiments of the present invention, the pattern used to scramble the data (i.e., the scrambling pattern) is a predetermined value stored in a sixty-four bit register. The pattern is replicated on both sides of the link. In an exemplary embodiment of the present invention, the scrambling pattern is the same for all components (i.e., memory controller 902 and memory modules 906) within the memory subsystem. In alternate exemplary embodiment of the present invention the scrambling patterns may be different between different pairs of pointers within the memory subsystem.
[0039] FIG. 13 depicts exemplary circuitry for providing bus calibration in accordance with exemplary embodiments of the present invention. The circuitry depicted in FIG. 13 is replicated for each of the twenty-three wires on the upstream memory bus 1002 and for each of the twenty-two wires on the downstream memory bus 1004. As shown in FIG. 13 , an exclusive-or (XOR) gate is used to mix the scrambling pattern with the raw data to be transmitted. The transmit side scrambles the data and the receive side de-scrambles the data. The sampling clock and data phase for the data received on the bus are synchronized to improve the sampling of the data. In the exemplary embodiment depicted in FIG. 13 , the delay line shown on the receive side is utilized to manipulate the phase of the incoming data to synchronize the clock with the incoming data and is part of the receive side clock to data optimization closed loop. In alternate exemplary embodiments of the present invention, the sampling clock and/or data phase are manipulated to perform the synchronizing. The de-scrambling circuit needs to be operated in synchronization with the transmit sequence, i.e., scramble bit number one on the transmit side must be correctly matched to de-scramble bit number one on the receive side. This may be accomplished at power on with an initialization sequence. Portions of the circuitry and/or logic may be located within the memory bus and/or within the memory modules 906 and the memory controller 902.
[0040] In an exemplary embodiment of the present invention, one property of the initialization sequence is that it is unique once every sixty-four bits (i.e., a logic one followed by sixty-three zeros). Initially, the scrambling functions (including setting the pointers) are inhibited while the initialization sequence is transmitted but the scrambling pointers are reset to count in synchronization with the initialization sequence. On the receive side, the single logic one in the initialization sequence is decoded and identified. The de-scrambling pointer on the receive side is then reset and synchronized with the initialization pattern. After initialization is complete, the scrambling/de-scrambling functions can be activated. The scrambling pattern may take on many forms; below is a sixty-three bit pattern that was generated from a sixth order pseudo random binary sequence (PRBS) generator:
1010—1011—0011—0111—0110—1001—0011—1000—1011—101013 0011—0000—1000—0011—1111.
A maximal length polynomial, p(x)=1+x+x6, was utilized to derive the above scrambling pattern but any method of deriving a scrambling pattern may be utilized by exemplary embodiments of the present invention. In addition, the scrambling pattern may be a different length (e.g., thirty-two bits or one hundred and twenty-eight bits) than the one shown above.
1010—1011—0011—0111—0110—1001—0011—1000—1011—101013 0011—0000—1000—0011—1111.
A maximal length polynomial, p(x)=1+x+x6, was utilized to derive the above scrambling pattern but any method of deriving a scrambling pattern may be utilized by exemplary embodiments of the present invention. In addition, the scrambling pattern may be a different length (e.g., thirty-two bits or one hundred and twenty-eight bits) than the one shown above.
[0041] Applying an XOR to the input data and the scrambling pattern results in scrambled data for transmission to a receiving side. An XOR is then applied to the scrambled data and the same bits in the scrambling pattern resulting in the original input data. In the following example, the scrambling pattern is as shown above, the scrambling pointer has a value of nine and the input data is equal to “0000.” The scrambled data is created by applying an XOR to “0011” (the ninth through twelfth bit in the scrambling pattern) and “0000” (the input data), resulting in the scrambled data value of “0011”. After the data is transmitted to the receiving side, it is de-scrambled by applying an XOR to “0011” (the scrambled data value) and “0011” (the ninth through twelfth bit in the scrambling pattern), resulting in the input data value of “0000.”
[0042] Exemplary embodiments of the present invention may be utilized to decrease the likelihood that data transmitted across the memory subsystem bus will not switch. This can be performed without impacting bandwidth or requiring system operation to be halted by using a scrambling pattern. Another advantage of the scrambling approach is that the logic and additional latency required to implement scrambling within the memory subsystem is relatively small.
[0043] 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.
[0044] 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
The invention claimed is:
1. A cascaded interconnect system comprising:
one or more memory modules;
a memory controller; and
a memory bus that utilizes periodic recalibration, wherein the memory modules and the memory controller are directly interconnected by a packetized multi-transfer interface via the memory bus and provide scrambled data for use in the periodic recalibration, and wherein the memory bus includes an upstream memory bus with twenty-three wires and the periodic calibration is performed for each of the wires.
2. The system of claim 1 further comprising a sampling clock, wherein the recalibration includes synchronizing the sampling clock and a data phase of the scrambled data for data sampling on the memory bus.
3. The system of claim 1 further comprising a sampling clock wherein the recalibration includes adjusting the sampling clock so that it is centered between two consecutive edges of data on the memory bus.
4. The system of claim 1 wherein the memory bus includes a segment providing a connection between one of the memory modules and the memory controller or between two of the memory modules, the segment including a transmit side where scrambling is performed on input data resulting in scrambled data and a receive side where de-scrambling is performed on the scrambled data resulting in the input data.
5. The system of claim 4 further comprising circuitry for performing the scrambling and the de-scrambling.
6. The system of claim 4 wherein the scrambling and the de-scrambling are synchronized between the transmit side and the receive side.
7. The system of claim 4 wherein input to the scrambling and the de-scrambling includes a scrambling pattern.
8. The system of claim 4 wherein the scrambling and the de-scrambling are synchronized at system initialization.
9. The system of claim 4 wherein the scrambling and the de-scrambling are synchronized periodically during system operation.
10. The system of claim 1 wherein the memory modules operate at a memory module data rate and the memory bus operates at four times the memory module data rate.
11. The system of claim 1 wherein the memory bus includes an upstream memory bus and a downstream memory bus.
12. A method for providing bus recalibration, the method comprising:
receiving input data at a transmit side, the transmit side including a memory controller or a memory module within a cascaded interconnect memory system;
scrambling the input data at the transmit side resulting in scrambled data;
transmitting the scrambled data to a receive side via a memory bus, the receive side including an other memory controller or memory module within the memory system, and the receive side directly connected to the transmit side by a packetized multi-transfer interface via the memory bus;
periodically synchronizing a sampling clock and a data phase of the scrambled data at the receive side for data sampling on the memory bus; and
de-scrambling the scrambled data at the receive side resulting in the input data, wherein the memory bus includes a downstream memory bus with twenty-two wires and the periodic synchronizing is performed for each of the wires.
13. The method of claim 12 wherein the synchronizing includes determining a phase of the sampling clock for the data sampling on the memory bus.
14. The method of claim 12 wherein the synchronizing includes adjusting a phase of the sampling clock so that it is centered between two consecutive edges of the scrambled data on the memory bus.
15. The method of claim 12 wherein the scrambling and the de-scrambling are synchronized between the transmit side and the receive side.
16. The method of claim 12 wherein input to the scrambling and the de-scrambling includes a scrambling pattern.
17. The method of claim 12 wherein the scrambling and the de-scrambling are synchronized at system initialization.
18. The method of claim 12 wherein the scrambling and the de-scrambling are synchronized periodically during system operation.
19. The method of claim 12 wherein the memory modules operate at a memory module data rate and the memory bus operates at four times the memory module data rate.
20. The method of claim 12 wherein the memory bus includes an upstream memory bus and a downstream memory bus.
21. A cascaded interconnect system comprising:
one or more memory modules;
a memory controller; and
a memory bus that utilizes periodic recalibration, wherein the memory modules and the memory controller are directly interconnected by a packetized multi-transfer interface via the memory bus and provide scrambled data for use in the periodic recalibration, and wherein the memory bus includes a downstream memory bus with twenty-two wires and the periodic calibration is performed for each of the wires.
22. A method for providing bus recalibration, the method comprising:
receiving input data at a transmit side, the transmit side including a memory controller or a memory module within a cascaded interconnect memory system;
scrambling the input data at the transmit side resulting in scrambled data;
transmitting the scrambled data to a receive side via a memory bus, the receive side including an other memory controller or memory module within the memory system, and the receive side directly connected to the transmit side by a packetized multi-transfer interface via the memory bus;
periodically synchronizing a sampling clock and a data phase of the scrambled data at the receive side for data sampling on the memory bus; and
de-scrambling the scrambled data at the receive side resulting in the input data, wherein the memory bus includes an upstream memory bus with twenty-three wires and the periodic synchronizing is performed for each of the wires.
Patent Citations (167)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3825904(A) | 1974-07-01 | Burk et al. | Applicant |
| US4028675(A) | 1977-06-01 | Frankenberg | Applicant |
| US4135240(A) | 1979-01-01 | Ritchie | Applicant |
| US4475194(A) | 1984-10-01 | LaVallee et al. | Applicant |
| US4486739(A) | 1984-12-01 | Franaszek et al. | Applicant |
| US4654857(A) | 1987-03-01 | Samson et al. | Applicant |
| US4723120(A) | 1988-02-01 | Petty, Jr. | Applicant |
| US4740916(A) | 1988-04-01 | Martin | Applicant |
| US4796231(A) | 1989-01-01 | Pinkham | Applicant |
| US4803485(A) | 1989-02-01 | Rypinski | Applicant |
| US4833605(A) | 1989-05-01 | Terada et al. | Applicant |
| US4839534(A) | 1989-06-01 | Clasen | Applicant |
| US4943984(A) | 1990-07-01 | Pechanek et al. | Applicant |
| US4985828(A) | 1991-01-01 | Shimizu et al. | Applicant |
| US5053947(A) | 1991-10-01 | Heibel et al. | Applicant |
| US5177375(A) | 1993-01-01 | Ogawa et al. | Applicant |
| US5206946(A) | 1993-04-01 | Brunk | Applicant |
| US5214747(A) | 1993-05-01 | Cok | Applicant |
| US5265049(A) | 1993-11-01 | Takasugi | Applicant |
| US5265212(A) | 1993-11-01 | Bruce, II | Examiner |
| US5287531(A) | 1994-02-01 | Rogers, Jr. et al. | Applicant |
| US5347270(A) | 1994-09-01 | Matsuda et al. | Applicant |
| US5387911(A) | 1995-02-01 | Gleichert et al. | Applicant |
| US5394535(A) | 1995-02-01 | Ohuchi | Applicant |
| US5454091(A) | 1995-09-01 | Sites et al. | Applicant |
| US5475690(A) | 1995-12-01 | Burns et al. | Applicant |
| US5513135(A) | 1996-04-01 | Dell et al. | Applicant |
| US5544309(A) | 1996-08-01 | Chang et al. | Applicant |
| US5592632(A) | 1997-01-01 | Leung et al. | Applicant |
| US5611055(A) | 1997-03-01 | Krishan et al. | Applicant |
| US5613077(A) | 1997-03-01 | Leung et al. | Applicant |
| US5627963(A) | 1997-05-01 | Gabillard et al. | Applicant |
| US5629685(A) | 1997-05-01 | Allen et al. | Applicant |
| US5661677(A) | 1997-08-01 | Rondeau, II et al. | Applicant |
| US5666480(A) | 1997-09-01 | Leung et al. | Applicant |
| US5764155(A) | 1998-06-01 | Kertesz et al. | Applicant |
| US5822749(A) | 1998-10-01 | Agarwal | Applicant |
| US5852617(A) | 1998-12-01 | Mote, Jr. | Applicant |
| US5870325(A) | 1999-02-01 | Nielsen et al. | Applicant |
| US5872996(A) | 1999-02-01 | Barth et al. | Applicant |
| US5926838(A) | 1999-07-01 | Jeddeloh | Applicant |
| US5928343(A) | 1999-07-01 | Farmwald et al. | Applicant |
| US5930273(A) | 1999-07-01 | Mukojima | Applicant |
| US5973591(A) | 1999-10-01 | Becjtolsheim et al. | Applicant |
| US5974493(A) | 1999-10-01 | Okumura et al. | Applicant |
| US5995405(A) | 1999-11-01 | Trick | Applicant |
| US6038132(A) | 2000-03-01 | Tokunaga et al. | Applicant |
| US6049476(A) | 2000-04-01 | Laudon et al. | Applicant |
| US6076158(A) | 2000-06-01 | Sites et al. | Applicant |
| US6078515(A) | 2000-06-01 | Nielsen et al. | Applicant |
| US6096091(A) | 2000-08-01 | Hartmann | Applicant |
| US6128746(A) | 2000-10-01 | Clark et al. | Applicant |
| US6170047(B1) | 2001-01-01 | Dye | Applicant |
| US6170059(B1) | 2001-01-01 | Pruett et al. | Applicant |
| US6173382(B1) | 2001-01-01 | Dell et al. | Applicant |
| US6215686(B1) | 2001-04-01 | Deneroff et al. | Applicant |
| US6219288(B1) | 2001-04-01 | Braceras et al. | Applicant |
| US6260127(B1) | 2001-07-01 | Olarig et al. | Applicant |
| US6262493(B1) | 2001-07-01 | Garnett | Applicant |
| US6292903(B1) | 2001-09-01 | Coteus et al. | Applicant |
| US6301636(B1) | 2001-10-01 | Schultz et al. | Applicant |
| US6317352(B1) | 2001-11-01 | Halbert et al. | Applicant |
| US6321343(B1) | 2001-11-01 | Toda | Applicant |
| US6338113(B1) | 2002-01-01 | Kubo et al. | Applicant |
| US6370631(B1) | 2002-04-01 | Dye | Applicant |
| US6378018(B1) | 2002-04-01 | Tsern et al. | Applicant |
| US6381685(B2) | 2002-04-01 | Dell et al. | Applicant |
| US6393528(B1) | 2002-05-01 | Arimilli et al. | Applicant |
| US6473836(B1) | 2002-10-01 | Ikeda | Applicant |
| US6477614(B1) | 2002-11-01 | Leddige et al. | Applicant |
| US6483755(B2) | 2002-11-01 | Leung et al. | Applicant |
| US6484271(B1) | 2002-11-01 | Gray | Applicant |
| US6487627(B1) | 2002-11-01 | Willke et al. | Applicant |
| US6493250(B2) | 2002-12-01 | Halbert et al. | Applicant |
| US6496540(B1) | 2002-12-01 | Windmer | Applicant |
| US6496910(B1) | 2002-12-01 | Baentsch et al. | Applicant |
| US6499070(B1) | 2002-12-01 | Whetsel | Applicant |
| US6502161(B1) | 2002-12-01 | Perego et al. | Applicant |
| US6507888(B2) | 2003-01-01 | Wu et al. | Applicant |
| US6510100(B2) | 2003-01-01 | Grundon et al. | Applicant |
| US6513091(B1) | 2003-01-01 | Blackmon et al. | Applicant |
| US6526469(B1) | 2003-02-01 | Drehmel et al. | Applicant |
| US6532525(B1) | 2003-03-01 | Aleksic et al. | Applicant |
| US6546359(B1) | 2003-04-01 | Week | Applicant |
| US6549971(B1) | 2003-04-01 | Cecchi et al. | Applicant |
| US6553450(B1) | 2003-04-01 | Dodd et al. | Applicant |
| US6557069(B1) | 2003-04-01 | Drehmel et al. | Applicant |
| US6564329(B1) | 2003-05-01 | Cheung et al. | Applicant |
| US6587912(B2) | 2003-07-01 | Leddige | Applicant |
| US6601121(B2) | 2003-07-01 | Singh et al. | Applicant |
| US6611905(B1) | 2003-08-01 | Grundon et al. | Applicant |
| US6622217(B2) | 2003-09-01 | Gharachorloo et al. | Applicant |
| US6625687(B1) | 2003-09-01 | Halbert et al. | Applicant |
| US6625702(B2) | 2003-09-01 | Rentschler et al. | Applicant |
| US6628538(B2) | 2003-09-01 | Funaba et al. | Applicant |
| US6631439(B2) | 2003-10-01 | Saulsbury et al. | Applicant |
| US6671376(B1) | 2003-12-01 | Koto et al. | Examiner |
| US6678811(B2) | 2004-01-01 | Rentschler et al. | Applicant |
| US6697919(B2) | 2004-02-01 | Gharachorloo et al. | Applicant |
| US6704842(B1) | 2004-03-01 | Janakiraman et al. | Applicant |
| US6721944(B2) | 2004-04-01 | Chaudhry et al. | Applicant |
| US6738836(B1) | 2004-05-01 | Kessler et al. | Applicant |
| US6741096(B2) | 2004-05-01 | Moss | Applicant |
| US6766389(B2) | 2004-07-01 | Hayter et al. | Applicant |
| US6775747(B2) | 2004-08-01 | Venkatraman | Applicant |
| US6791555(B1) | 2004-09-01 | Radke et al. | Applicant |
| US6839393(B1) | 2005-01-01 | Sidiropoulos | Applicant |
| US6877076(B1) | 2005-04-01 | Cho et al. | Applicant |
| US6877078(B2) | 2005-04-01 | Fujiwara et al. | Applicant |
| US6889284(B1) | 2005-05-01 | Nizar et al. | Applicant |
| US6938119(B2) | 2005-08-01 | Kohn et al. | Applicant |
| US6949950(B2) | 2005-09-01 | Takahashi et al. | Applicant |
| US6977536(B2) | 2005-12-01 | Chin-Chich et al. | Applicant |
| US7177211(B2) | 2007-02-01 | Zimmerman | Applicant |
| US7206962(B2) | 2007-04-01 | Deegan | Applicant |
| US2001/0000822(A1) | 2001-05-01 | Dell et al. | Applicant |
| US2001/0003839(A1) | 2001-06-01 | Kondo | Applicant |
| US2002/0019926(A1) | 2002-02-01 | Huppenthal et al. | Applicant |
| US2002/0038405(A1) | 2002-03-01 | Leddige et al. | Applicant |
| US2002/0083255(A1) | 2002-06-01 | Greeff et al. | Applicant |
| US2002/0103988(A1) | 2002-08-01 | Dornier | Applicant |
| US2002/0112119(A1) | 2002-08-01 | Halbert et al. | Applicant |
| US2002/0112194(A1) | 2002-08-01 | Uzelac | Applicant |
| US2002/0124195(A1) | 2002-09-01 | Nizar | Applicant |
| US2002/0147898(A1) | 2002-10-01 | Rentschler et al. | Applicant |
| US2002/0174274(A1) | 2002-11-01 | Wu et al. | Applicant |
| US2003/0033364(A1) | 2003-02-01 | Garnett et al. | Applicant |
| US2003/0056183(A1) | 2003-03-01 | Kobayahi | Applicant |
| US2003/0084309(A1) | 2003-05-01 | Kohn | Applicant |
| US2003/0090879(A1) | 2003-05-01 | Doblar et al. | Applicant |
| US2003/0223303(A1) | 2003-12-01 | Lamb et al. | Applicant |
| US2003/0236959(A1) | 2003-12-01 | Johnson et al. | Applicant |
| US2004/0006674(A1) | 2004-01-01 | Hargis et al. | Applicant |
| US2004/0049723(A1) | 2004-03-01 | Obara | Applicant |
| US2004/0098549(A1) | 2004-05-01 | Dorst | Applicant |
| US2004/0117588(A1) | 2004-06-01 | Arimilli et al. | Applicant |
| US2004/0128474(A1) | 2004-07-01 | Vorbach | Applicant |
| US2004/0163028(A1) | 2004-08-01 | Olarig | Applicant |
| US2004/0205433(A1) | 2004-10-01 | Gower et al. | Applicant |
| US2004/0230718(A1) | 2004-11-01 | Polzin et al. | Applicant |
| US2004/0246767(A1) | 2004-12-01 | Vogt | Applicant |
| US2004/0250153(A1) | 2004-12-01 | Vogt | Examiner |
| US2004/0260909(A1) | 2004-12-01 | Lee et al. | Applicant |
| US2004/0260957(A1) | 2004-12-01 | Jeddeloh et al. | Applicant |
| US2005/0023560(A1) | 2005-02-01 | Ahn et al. | Applicant |
| US2005/0044457(A1) | 2005-02-01 | Jeddeloh | Applicant |
| US2005/0050237(A1) | 2005-03-01 | Jeddeloh | Applicant |
| US2005/0050255(A1) | 2005-03-01 | Jeddeloh | Applicant |
| US2005/0066136(A1) | 2005-03-01 | Schnepper | Applicant |
| US2005/0080581(A1) | 2005-04-01 | Zimmerman et al. | Applicant |
| US2005/0097249(A1) | 2005-05-01 | Oberlin et al. | Applicant |
| US2005/0120157(A1) | 2005-06-01 | Chen et al. | Applicant |
| US2005/0125702(A1) | 2005-06-01 | Huang et al. | Applicant |
| US2005/0125703(A1) | 2005-06-01 | Lefurgy et al. | Applicant |
| US2005/0138267(A1) | 2005-06-01 | Bains et al. | Applicant |
| US2005/0144399(A1) | 2005-06-01 | Hosomi | Applicant |
| US2005/0177690(A1) | 2005-08-01 | LaBerge | Applicant |
| US2005/0204216(A1) | 2005-09-01 | Daily et al. | Applicant |
| US2005/0229132(A1) | 2005-10-01 | Butt et al. | Applicant |
| US2005/0257005(A1) | 2005-11-01 | Jeddeloh | Applicant |
| US2005/0259496(A1) | 2005-11-01 | Hsu et al. | Applicant |
| US2006/0036826(A1) | 2006-02-01 | Dell et al. | Applicant |
| US2006/0036827(A1) | 2006-02-01 | Dell et al. | Applicant |
| GB2396711(A) | 2004-06-01 | Applicant | |
| GB2396711(A) | 2004-06-01 | Applicant | |
| JP4326140(A) | 1992-11-01 | Applicant | |
| JP4326140(A) | 1992-11-01 | Applicant |
Non-Patent Literature (21)
- Brown, et al “Compiler-Based I/O Prefetching for Out-of-Core Applications”, ACM Transactions on Computer Systems, vol. 19, No. 2, May 2001, pp. 111-170.Applicant
- Wang, et al “Guided Region Prefetching: A Cooperative Hardware/Software Approach”, pp. 388-398.Applicant
- Natarajan, et al “A Study of Performance Impact of Memory Controller Features in Multi-Processor Server Environment”, pp. 80-87.Applicant
- Nilsen, “High-Level Dynamic Memory Management for Object-Oriented Real-Time Systems”, pp. 86-93.Applicant
- Understanding System Memory and CPU Speeds: A Layman's Guide to the Front Side Bus (FSB), [online]; [retrieved on Feb. 23, 2006]; retrieved from the Internet http://www.directron.com/fsbguide.html.Applicant
- JEDEC Solid State Technology Association, “JEDEC Standard: DDR2 SDRAM Specification”, Jan. 2004, JEDEC, Revision JESD79-2A, p. 10.Applicant
- Sivencrona et al.; “RedCAN™: Simulations of two Fault Recovery Algorithms for CAN;” Proceedings for the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04); 2005.Applicant
- Jungjoon Kim et al.; “Performance and Architecture Features of Segmented Multiple Bus System;” IEEE Computer Society; 1999 International Conference on Parallel Processing (ICPP '99).Applicant
- Ghoneima et al.; “Optimum Positioning of Interleaved Reapeaters in Bidirectional Buses;” IEEE Transactions on Computer-Aided Design of Integrated Cirucits and Systems, vol. 25, No. 3, Mar. 2005, pp. 461-469.Applicant
- Seceleanu et al.; “Segment Arbiter as Action System;” IEEE 2003 pp. 249-252.Applicant
- Wikipedia, Serial Communications, [online], [retrieved Apr. 10, 2007 from the Internet], http://en.wikipedia.org/wiki/Serial—communications, 3 pages.Applicant
- IEEE, “IEEE Standard Test Access Port and Boundary-Scan Architecture”, Jul. 23, 2001, IEEE Std 1149-1-2001, pp. 11-13.Applicant
- Rosenberg, “Dictionary of Computers, Information Processing & Telecommuications”, Second Edition, John Wiley & Sons, Inc. 1987. 3 pgs.Applicant
- Benini, Luca, et al. “System-Level Power Optimization: Techniques and Tools”, ACM Transactions on Design Automation of Electronic Systems, vol. 6, No. 2, Apr. 2001, pp. 149-206.Applicant
- Boudon, et al., “Novel Bus Reconfiguration Scheme With Spare Lines”, IBM Technical Disclosure Bulletin, May 1987, vol. 29, No. 12, pp. 1-3.Applicant
- Massoud Pedram, “Power Minimization in IC Design Principles and Applications”, ACM Transactions on Design Automation of Electronic Systems vol. 1, No. 1, Jan. 1996, pp. 3-56.Applicant
- P.R. Panda, “Data and Memory Optimization Techniques For Embedded Systems”, ACM Transactions on Design Automation of Electronic Systems, vol. 6, No. 2, Apr. 2001, pp. 149-206.Applicant
- Penrod, Lee, “Understanding System Memory and CPU Speeds: A laymans guide to the Front Side Bus (FSB)”, Dec. 28, 2005, Direction . Org, pp. 1-5, http://www.directron.com/directron/fsbguide.html.Applicant
- Singh, S., et al., “Bus Sparing for Fault-Tolerant System Design”, IBM Technical Disclosure Bulletin, Dec. 1991, vol. 34, No. 71, pp. 117-118.Applicant
- U.S. Appl. No. 11/419,586, filed May 22, 2006. Robert Tremaine. “Systems and Methods for Providing Remote Pre-Fetch Buffers”.Applicant
- NB940259 (IBM Technical Disclosure Bulletin, Feb. 1994; vol. 37; pp. 59-64).Applicant