System, method and storage medium for providing fault detection and correction in a memory subsystem

Information

  • Patent Grant
  • 8589769
  • Patent Number
    8,589,769
  • Date Filed
    Friday, September 7, 2007
    16 years ago
  • Date Issued
    Tuesday, November 19, 2013
    10 years ago
Abstract
A memory subsystem with a memory bus and a memory assembly. The memory bus includes multiple bitlanes. The memory assembly is in communication with the memory bus and includes instructions for receiving an error code correction (ECC) word in multiple packets via the memory bus. The ECC word includes data bits and ECC bits arranged into multiple multi-bit ECC symbols. Each of the ECC symbols is associated with one of the bitlanes on the memory bus. The memory assembly also includes instructions for utilizing one of the ECC symbols to perform error detection and correction for the bits in the ECC word received via the bitlane associated with the ECC symbol.
Description
BACKGROUND OF THE INVENTION

The invention relates to a memory subsystem and in particular, to providing fault detection and correction in a memory subsystem.


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 memory bus 315 is re-driven by the buffer on module 310a to a next module, 310b, which further re-drives the memory bus 315 to module positions denoted as 310n. Each module 310a includes a DRAM 311a and a buffer 320a. The memory bus 315 may be described as having a daisy chain structure with each bus being point-to-point in nature.


A variety of factors including faulty components and inadequate design tolerances may result in errors in the data being processed by a memory subsystem. Errors may also occur during data transmission due to “noise” in the communication channel (e.g., the bus 315). As a result of these errors, one or more bits, which may be represented as X, which are to be transmitted within the system, are corrupted so as to be received as “/X” (i.e., the logical complement of the value of X). In order to protect against such errors, the data bits may be coded via an error correcting code (ECC) in such a way that the errors may be detected and possibly corrected by special ECC logic circuits. A typical ECC implementation appends a number of check bits to each data word. The appended check bits are used by the ECC logic circuits to detect errors within the data word. By appending bits (e.g., parity bits) to the data word, each bit corresponding to a subset of data bits within the data word, the parity concepts may be expanded to provide the detection of multiple bit errors or to determine the location of single or multiple bit errors. Once a data bit error is located, a logic circuit may be utilized to correct the located erroneous bit, thereby providing single error correction (SEC). Many SEC codes have the ability to detect double errors and are thus termed SEC double error detecting (SEC-DED) codes.



FIG. 8 represents a typical parallel bus ECC structure that transfers a complete ECC word in a single cycle. The structure depicted in FIG. 8 is consistent with the teachings in U.S. Pat. No. 6,044,483 to Chen et al., of common assignment herewith. FIG. 8 depicts an 88/72 ECC for computer systems having an eight bit per chip memory configuration. The lines labeled “Wire 0” through “Wire 72” each represent a wire on the memory bus 315 with seventy-two wires. For a memory subsystem with an eight bit per chip memory configuration, sixty-four bits of data and eight ECC bits are transferred every cycle. The ECC word is transferred entirely in one cycle, and a SEC-DED code may be utilized to correct any single bit failure anywhere in the ECC word, including a hard wire or bitlane failure. In the case of a hard wire or bitlane failure, every transfer has the same bitlane in error with the ECC correcting it for each transfer.



FIG. 9 depicts a typical manner of defining symbol ECCs for use in fault detection and correction in a memory subsystem. FIG. 8 is consistent with the teachings of U.S. Pat. No. 6,044,483. As shown in FIG. 9, the symbols are four bits in length and the symbols are defined across bitlanes. As is known in the art, a symbol refers to a mathematical derivation of ECC and corresponds to a group of bits that the ECC is able to correct either individually or as a group. Referring to FIG. 9, assuming that data bits one through four are sourced from the same memory chip, respectively, data errors located by “symbol 1” can be localized to a particular memory chip (e.g., a DRAM).


Busses that are protected by ECC are typically run as single transfer busses with a SEC-DED code. In other words, any single bitlane failure is corrected by the SEC code because the ECC word is completely transmitted in one cycle (or shot or transfer). Thus, if a wire, contact, or bitlane is faulty, it would be a faulty bit in every transfer, and the SEC ECC will correct the error each cycle.


Defining symbols across bitlanes may be used to effectively isolate errors to memory chips when a relatively wide parallel ECC structure is implemented and a complete ECC word is transferred in a single cycle. However, defining symbols across bitlanes may not be effective in isolating errors to a particular memory chip or bus wire when a relatively narrow parallel interface is implemented with the ECC word (made up of data bits and ECC bits) being delivered in packets over multiple cycles.


BRIEF SUMMARY OF THE INVENTION

Exemplary embodiments of the present invention include a memory subsystem with a memory bus and a memory assembly. The memory bus includes multiple bitlanes. The memory assembly is in communication with the memory bus and includes instructions (circuitry and/or software) for receiving an error code correction (ECC) word in multiple packets via the memory bus. The ECC word includes data bits and ECC bits arranged into multiple multi-bit ECC symbols. Each of the ECC symbols is associated with one of the bitlanes on the memory bus. The memory assembly also includes instructions for utilizing one of the ECC symbols to perform error detection and correction for the bits in the ECC word received via the bitlane associated with the ECC symbol.


Additional exemplary embodiments include a memory subsystem with a memory bus and a memory assembly. The memory bus includes multiple bitlanes. The memory assembly is in communication with the memory bus and includes instructions (circuitry and/or software) for creating an ECC word. The ECC word includes data bits and ECC bits arranged into multiple multi-bit ECC symbols. Each of the ECC symbols is associated with one of the bitlanes on the memory bus. The memory assembly also includes instructions for transmitting the ECC word in multiple packets via the memory bus.


Further exemplary embodiments include a method for providing error detection and correction. The method includes receiving an ECC word at a memory assembly in multiple packets via a memory bus. The ECC word includes data bits and ECC bits arranged into multiple ECC symbols. Each of the ECC symbols is associated with one bitlane on the memory bus. The method further includes utilizing one of the ECC symbols to perform error detection and correction to bits in the ECC word received via the bitlane associated with the symbol.


Still further exemplary embodiments include a storage medium encoded with machine readable computer program code for providing fault detection and correction in a memory subsystem. The storage medium includes instructions for causing a computer to implement a method. The method includes receiving an ECC word at a memory assembly in multiple packets via a memory bus. The ECC word includes data bits and ECC bits arranged into multiple ECC symbols. Each of the ECC symbols is associated with one bitlane on the memory bus. The method further includes utilizing one of the ECC symbols to perform error detection and correction to bits in the ECC word received via the bitlane associated with the symbol.


An additional exemplary embodiment of the present invention includes a communication system with a bus containing multiple bitlanes and a device in communication with the bus. The device includes instructions for receiving an ECC word in multiple packets via the bus. The ECC word includes data bits and ECC bits arranged into multiple multi-bit ECC symbols with each of the ECC symbols being associated with one of the bitlanes on the bus. One of the ECC symbols is utilized to perform error detection and correction for the bits in the ECC word received via the bitlane and associated with the ECC symbol. The number of ECC bits is greater than a second number of ECC bits in a SEC/DED implementation of equivalent bitlane dimension. In addition, the number of bitlanes utilized to transfer the ECC bits is less than a second number of bitlanes in an SEC/DED implementation of equivalent bitlane dimension.





BRIEF DESCRIPTION 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 represents a prior art parallel bus ECC structure that transfers a complete ECC word in a single cycle;



FIG. 9 depicts a prior art manner of defining symbol ECCs, for use in fault detection and correction in a memory subsystem;



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



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



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



FIG. 13 depicts a downstream frame format that is utilized by exemplary embodiments of the present invention;



FIG. 14 depicts an upstream frame format that is utilized by exemplary embodiments of the present invention;



FIG. 15 is a table with symbols defined across bitlanes, using the upstream frame format depicted in FIG. 14 as an example; and



FIG. 16 is a table with symbols defined within bitlanes, using the upstream frame format depicted in FIG. 14 as an example.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Exemplary embodiments of the present invention utilize a symbol ECC interleaved such that the symbol orientation is along the bitlanes. A relatively narrow parallel interface is utilized with data that is delivered in packets over several transfers. Thus, the ECC word is two-dimensional in that the data bits and ECC bits are delivered in multiple cycles over a parallel interface. In order to provide protection for both random noise related soft errors on the bus, as well as systematic hard errors (errors such as a contact or wire failure along the bitlane), a new ECC scheme is employed. In addition, the capability of expanding the code to a higher order of robustness, for example going from a single symbol correcting code to a double symbol correcting code by using a spare wire(s), is available in this scheme. Exemplary embodiments of the present invention are contrasted against a detect/retry scheme where once an error is detected the data is re-sent. In exemplary embodiments of the present invention, errors are corrected on the fly, and in the event of a spare being deployed, the full ECC code is still available. Exemplary embodiments of the present invention provide an 88/72 ECC code that will detect all errors on a four bit symbol, correct all four bit symbol errors and detect all double four bit symbol errors (e.g., single 4-bit error correcting/double 4-bit error detecting (S4EC/D4ED).

SEC/DED=Single Error Correcting/Double Error Detecting
S4EC/D4ED=Single 4-bit Error Correcting/Double 4-bit Error Detecting


In an exemplary embodiment of the present invention, fault correction and detection 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. The memory subsystem further includes a memory control function, one or more memory modules, one or more high speed busses operating at a 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 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. 10 depicts a cascaded memory structure that may be utilized by exemplary embodiments of the present invention when buffered memory modules 1006 (e.g., the buffer device is included within the memory module 1006) are in communication with a memory controller 1002. This memory structure includes the memory controller 1002 in communication with one or more memory modules 1006 via a high speed point-to-point bus 1004. Each bus 1004 in the exemplary embodiment depicted in FIG. 10 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. 10, provides a four to one bus speed ratio to maximize bus efficiency and 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 1006 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 to permit memory modules to be cascaded such that each memory module is interconnected to other memory modules, as well as to the memory controller 1002.



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


An exemplary embodiment of the present invention includes two unidirectional busses between the memory controller 1002 and memory module 1006a (“DIMM #1”), as well as between each successive memory module 1006b-d (“DIMM #2”, “DIMM #3” and “DIMM #4”) in the cascaded memory structure. The downstream memory bus 1104 is comprised of twenty-two single-ended signals and a differential clock pair. The downstream memory bus 1104 is used to transfer address, control, data and error code correction (ECC) bits downstream from the memory controller 1002, over several clock cycles, to one or more of the memory modules 1006 installed on the cascaded memory channel. The upstream memory bus 1102 is comprised of twenty-three single-ended signals and a differential clock pair, and is used to transfer bus-level data and ECC bits upstream from the sourcing memory module 1006 to the memory controller 1002. 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 1002 signal pincount, per memory channel, is reduced from approximately one hundred and twenty pins to about fifty pins.



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



FIG. 13 depicts a downstream frame format that is utilized by exemplary embodiments of the present invention to transfer information downstream from the memory controller 1002 to the memory modules 1006. In an exemplary embodiment of the present invention, the downstream frame consists of eight transfers with each transfer including twenty-two signals and a differential clock (twenty-four wires total). The frame further consists of eight command wires (c0 through c7) 1308, nine data wires (di0 through di8) 1306, four bus error correction code (ECC) wires (ecc0 through ecc3) 1304 and a spare wire (spare) 1302. The seventy-two data bits are shown in FIG. 13 as bits di0 through di8, and consist of nine wires with eight transfers on each wire for each frame. In exemplary embodiments of the present invention, the frame format depicted in FIG. 13 may be utilized to deliver one or two memory commands plus seventy-two bits of write data per memory clock cycle. The numbering of each data bit, as well as for other bits, is based on the wire used, as well as the specific transfer. D34 refers to data bit 3 (of bits 0 through 8) and transfer 4 (of transfer 0 through 7). The command bit field is shown as c0 through c7, and consists of sixty-four bits of information provided to the module over eight transfers.


The ECC bit field (ecc0 through ecc3) consists of thirty-two bit positions over eight transfers but is actually formatted in groups of sixteen bits. Each sixteen bit packet consists of four transfers over each of the four wires and provides the bus level fault detection and correction across each group of four bus transfers. The bus level error correcting code fault detection and correction is performed by a logic block that includes instructions to carry out the detection and correction. The spare bit position may be used to logically replace any of the twenty-one wires, also defined as bitlanes, used to transfer bits in the command, data and ECC fields should a failure occur in one of the bitlanes that results in exceeding a system-assigned failure threshold limit. The spare wire may be utilized to replace a failing segment between any two directly connected assemblies (i.e., between the memory controller 1002 and the memory module 1006a, or between any two memory modules 1006a-d), to replace a wire due to events, such as a wire failure, a connector failure, a solder interconnect failure, a driver failure and/or a receiver failure. Out of the one hundred and seventy-six possible bit positions, one hundred and sixty-eight are available for the transfer of information to the memory module 1006, and of those one hundred and sixty-eight bit positions, thirty-two bit positions are further assigned to providing ECC protection on the bus transfers themselves, thereby allowing a total of one hundred and thirty-six bit positions to be used for the transfer of information to the memory module 1006. The frame format depicted in FIG. 13 is applicable to incoming signals to the memory module 1006 from the direction of the memory controller, as well as the outgoing signals to any downstream memory modules 1006.



FIG. 14 depicts an upstream frame format that is utilized by exemplary embodiments of the present invention to transfer information upstream from the memory module 1006 to either the memory controller 1002 or an upstream memory module 1006. In an exemplary embodiment of the present invention, the upstream frame consists of eight transfers with each transfer including twenty-three signals and a differential clock (twenty-five wires total). The frame further consists of eighteen data wires (do0 through do17) 1406, four bus ECC wires (ecc0 through ecc3) 1404 and a spare wire (spare) 1402. In exemplary embodiments of the present invention, the frame format depicted in FIG. 14 may be utilized to deliver one hundred and forty-four read data bits per memory clock cycle. The numbering of each data bit, as well as for other bits, is based on the wire used, as well as the specific transfer. D34 refers to data bit 3 (of bits 0 through 17) and transfer 4 (of transfer 0 through 7).


The ECC bit field (ecc0 through ecc3) consists of thirty-two bit positions over eight transfers but is actually formatted in groups of sixteen bits. Each sixteen bit packet consists of four transfers over each of the four wires with error correction being performed every four transfers. The spare wire position may be used to logically replace any of the twenty-two wires used to transfer bits in the data and ECC fields should a failure occur in one of these wires that is consistent in nature. A failure may be considered to be consistent in nature if it exceeds a system dependent threshold value (e.g., number of times the failure is detected). Single bitlane failures may be corrected on the fly by the bus level ECC, while a system service element, such as a service processor, may decide to spare out a failing segment to repair hard (e.g., periodic, repeating and continuous) failures that may occur during system operation.



FIG. 15 is a table with symbols defined across bitlanes, using the upstream frame format depicted in FIG. 14 as an example. Each column 1506 represents the bits of a symbol (i.e., “bit 1”, “bit 2”, “bit 3”, and “bit 4”). Each row represents a symbol (i.e., “symbol 1”, “symbol 2”, etc.). Bit 1 of symbol 1 contains data bit D00 from FIG. 14, bit 2 of symbol 1 contains data bit D10 from FIG. 14, bit 3 contains data bit D20 from FIG. 14 and bit 4 contains data bit D30 from FIG. 14. All of the data bits contained in symbol 1 are transferred during the first transfer within the frame, or transfer 0. As described previously, the ECC is checked for every four transfers in a frame, or for every half frame. The ECC word, including eighty-eight bits (the spare bitlane is included in place of a failing bitlane only if it is being utilized), is transferred over multiple cycles (e.g., four) such that a hard fail in any bitlane or wire will result in a multiple-bit error. A typical single symbol correcting/double symbol detecting (SSC/DSD) ECC scheme will not be effective in correcting hard bitlane failures for the symbol scheme depicted in FIG. 15 because the bits within the symbol are not being sent on the same bitlane. Also, a SSC/DSD code would not be effective either because symbols are generally distributed among adjacent bits of a bus. This approach to forming symbols across bitlanes, as applied to the upstream format shown in FIG. 14, is shown in FIG. 15.



FIG. 16 is a table with symbols defined along the bitlanes, in accordance with exemplary embodiments of the present invention, using the upstream frame format depicted in FIG. 14 as an example. The first four columns 1604 in FIG. 16 represent the bits of a symbol (i.e., “bit 1”, “bit 2”, “bit 3”, and “bit 4”). The last column 1606 contains the bitlane being covered by the symbol. Each row represents a symbol (i.e., “symbol 1”, “symbol 2”, etc.). Bit 1 of symbol 1 contains data bit D00 from FIG. 14, bit 2 of symbol 1 contains data bit D01 from FIG. 14, bit 3 contains data bit D02 from FIG. 14 and bit 4 contains data bit D03 from FIG. 14. Symbol 1 covers bitlane 5 in FIG. 14. Bit 1 was transferred during transfer zero, bit 2 during transfer one, bit 3 during transfer two and bit 4 during transfer three. Interleaving the data bits in the ECC code such that the ECC symbol is defined along the bitlanes allows the data bits to be protected along the bitlane dimension rather than in the databit dimension depicted in FIG. 15. Again, the ECC is checked every four transfers in a frame, or for every half frame. The ECC word, including eighty-eight bits (the spare bitlane is included in place of a failing bitlane only if it is being utilized), is transferred over multiple cycles (e.g., four). The ECC word includes both data bits and ECC bits. Data bits may include, but are not limited to, command bits, write data bits and read data bits. In addition, ECC bits may be treated as data bits with the ECC processing described herein being applied to the ECC bits. Thus, in an exemplary embodiment, the ECC bits may also be data bits.


The symbols in FIG. 16 are defined to span a single bitlane, and if any of the hardware that is associated with any of the bitlanes fails, the failure will affect all four of the data bits that are transferred via the failing bitlane. Orienting the symbol along the bitlanes allows a single and/or multiple errors caused by a failing bitlane to be detected and corrected.


A further advantage of defining symbols along bitlanes is that it uncouples the requirement to have unique data/address/command format with the ECC word. Exemplary embodiments of the present invention allow data bits one through seventy-two to be any combination of data, address or command information.


Another benefit to defining symbols along bitlanes is that it is flexible and modular in that an additional bitlane can be added to the bus for the purposes of additional data, additional robustness, or even as a spare. Because the additional bitlane is dedicated to the added function, no further structural changes are required to allow the benefits of the added wire to accrue (either in more data capacity, spare capability, or a more robust ECC).


In addition, the scheme of defining symbols along bitlanes can be expanded to include an arbitrary number of transfers. This will cause the ECC symbol size to commensurately grow, but conceptually and structurally, this idea can be extended in the transfer dimension without any loss of coverage.


In general, the narrower the bus, the greater percentage of signals that must be checkbits to provide the same level of protection. For classic Hamming codes, or traditional SEC/DED bus ECC, the following table illustrates this point:














Maximum Data Signals
Checkbit Signals
Percent Overhead


















4
4
50%



11
5
31%


26
6
19%


57
7
11%


120
8
6%


247
9
4%










This can be compared to exemplary embodiments of the present invention including symbol oriented bus ECC where 4 checkbits are utilized for up to 253 data signals with a resulting overhead of 1.6%. Therefore, six checkbits could have been utilized to support 17 or 18 databits if the traditional SEC/DED had been utilized.


One drawback to using the traditional SEC/DED for read and write data busses that are daisy-chained through the support ASIC is that each additional checkbit gets multiplied by four in terms of ASIC pincount (i.e., 2 additional checkbits for each bus equals 8 additional ASIC pins). Another drawback to using the traditional SEC/DED is that the probability that a code will detect random, multibit errors is inversely proportional to the expression “2 raised to the nth power”, where n is the number of checkbits. This means that a (24,18) SEC/DED code with 6 checkbits has a figure of merit of 1/(26)=0.016. This is contrasted to exemplary embodiments of the present invention described herein that have a figure of merit of 1/(216)=0.000015, which is about 100 times better. A further advantage of exemplary embodiments of the present invention over the traditional SEC/DED approach is that the current design point described herein of 18 data bitlanes can be expanded to support up to 253 bitlanes without adding new checkbits. In contrast, the traditional SEC/DED approach would require the addition of checkcbits such that even adding 9 additional data bitlanes (for a total of 27) would require an additional checkbit.


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, the memory subsystem comprising: a memory bus comprising multiple bitlanes; anda memory assembly in communication with the memory bus, the memory assembly including instructions for:creating an error code correction (ECC) word, the ECC word including data bits and ECC bits arranged into multiple multi-bit ECC symbols, wherein each ECC symbols is comprised of four data bits, wherein each of the four data bits is transmitted sequentially on a single bit lane, the ECC symbols sent along each and every utilized bitlanes such that the number of ECC symbols equals the number of utilized bitlanes on the memory bus and the ECC word includes an 88/72 ECC code that will detect errors in the symbols, correct errors in the symbols and detect double symbol errors; andtransmitting the ECC word in four transfers via the memory bus.
CROSS-REFERENCE TO RELATED APPLICATIONS

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

US Referenced Citations (453)
Number Name Date Kind
2842682 Clapper Jul 1958 A
3333253 Sahulka Jul 1967 A
3395400 De Witt 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
4375100 Tsuji et al. Feb 1983 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
4704717 King, Jr. Nov 1987 A
4723120 Petty, Jr. Feb 1988 A
4740916 Martin Apr 1988 A
4782487 Smelser Nov 1988 A
4796231 Pinkham Jan 1989 A
4803485 Rypinkski 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
5206865 Gruender et al. Apr 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 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
5496540 Gaffar et al. Mar 1996 A
5513135 Dell et al. Apr 1996 A
5517626 Archer et al. May 1996 A
5522064 Aldereguia et al. May 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
5757823 Chen 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
5926838 Jeddeloh Jul 1999 A
5928343 Farmwald et al. Jul 1999 A
5930273 Mukojima Jul 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
5995998 Furlani et al. Nov 1999 A
6003121 Wirt Dec 1999 A
6009548 Chen et al. Dec 1999 A
6011732 Harrison et al. Jan 2000 A
6018817 Chen et al. Jan 2000 A
6038132 Tokunaga et al. Mar 2000 A
6038195 Farmwald Mar 2000 A
6044483 Chen 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 Frecker 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
6493843 Raynham Dec 2002 B1
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 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 Fuocco 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
6606692 Hill et al. Aug 2003 B2
6611905 Grundon et al. Aug 2003 B1
6622217 Gharacorloo et al. Sep 2003 B2
6622227 Zumkehr et al. Sep 2003 B2
6625687 Halber et al. Sep 2003 B1
6625702 Rentscler 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
6737589 Adachi et al. May 2004 B2
6738836 Kessler et al. May 2004 B1
6741096 Moss May 2004 B2
6748518 Guthrie et al. Jun 2004 B1
6751684 Owen et al. Jun 2004 B2
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
6879468 Nakamura et al. Apr 2005 B2
6882082 Greeff et al. Apr 2005 B2
6889284 Nizar et al. May 2005 B1
6898726 Lee May 2005 B1
6901494 Zumkehr et al. May 2005 B2
6910146 Dow Jun 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
6978419 Kantrowitz 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
7027366 Sako et al. Apr 2006 B2
7039755 Helms May 2006 B1
7047370 Jeter, Jr. et al. May 2006 B1
7047371 Dortu May 2006 B2
7051172 Mastronarde et al. May 2006 B2
7073010 Chen et al. Jul 2006 B2
7076700 Rieger Jul 2006 B2
7086949 McVicar Aug 2006 B2
7091890 Sasaki et al. Aug 2006 B1
7093078 Kondo Aug 2006 B2
7096407 Olarig Aug 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
7139965 Shah et al. 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
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 Apr 2007 B2
7210059 Jeddeloh Apr 2007 B2
7212548 Bridges et May 2007 B2
7213082 Jeddeloh May 2007 B2
7216196 Jeddeloh May 2007 B2
7216276 Azimi et al. May 2007 B1
7222213 James May 2007 B2
7234099 Gower et al. Jun 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
7300545 Ohara et al. Nov 2007 B2
7304905 Hsu et al. Dec 2007 B2
7308524 Grundy et al. Dec 2007 B2
7318130 Morrow et al. Jan 2008 B2
7319340 Jeddeloh et al. Jan 2008 B2
7321979 Lee Jan 2008 B2
7328381 Jeddeloh et al. Feb 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
7385993 Blanc et al. Jun 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
7428644 Jeddeloh et al. Sep 2008 B2
7430145 Weiss et al. Sep 2008 B2
7433258 Rao et al. Oct 2008 B2
7461286 James Dec 2008 B2
7481526 Inoue Jan 2009 B2
7484161 Dell et al. Jan 2009 B2
7487425 Chen Feb 2009 B1
7496777 Kapil Feb 2009 B2
7500123 Luong et al. Mar 2009 B2
7551468 Dreps et al. Jun 2009 B2
8140942 Dell et al. Mar 2012 B2
20010003839 Kondo Jun 2001 A1
20010029566 Shin Oct 2001 A1
20010029592 Walker et al. Oct 2001 A1
20020019926 Huppenthal et al. Feb 2002 A1
20020022065 Marshall Feb 2002 A1
20020059439 Arroyo et al. May 2002 A1
20020083255 Greeff et al. Jun 2002 A1
20020103988 Dornier Aug 2002 A1
20020112119 Halbert et al. Aug 2002 A1
20020112194 Uzelac Aug 2002 A1
20020124195 Nizar Sep 2002 A1
20020124201 Edwards et al. Sep 2002 A1
20020156985 Abhyankar et al. Oct 2002 A1
20020174274 Wu et al. Nov 2002 A1
20030009632 Arimilli et al. Jan 2003 A1
20030028701 Rao et al. Feb 2003 A1
20030033364 Garnett et al. Feb 2003 A1
20030051055 Parrella et al. Mar 2003 A1
20030056183 Kobayashi Mar 2003 A1
20030084309 Kohn May 2003 A1
20030090879 Doblar et al. May 2003 A1
20030105938 Cooksey et al. Jun 2003 A1
20030118044 Blanc et al. Jun 2003 A1
20030126354 Kahn et al. Jul 2003 A1
20030126363 David Jul 2003 A1
20030126373 David Jul 2003 A1
20030177314 Grimsrud et al. Sep 2003 A1
20030223303 Lamb et al. Dec 2003 A1
20030229770 Jeddeloh Dec 2003 A1
20030235222 Bridges et al. Dec 2003 A1
20030236959 Johnson et al. Dec 2003 A1
20040006674 Hargis et al. Jan 2004 A1
20040015650 Zumkehr et al. Jan 2004 A1
20040049723 Obara Mar 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
20040148482 Grundy et al. Jul 2004 A1
20040160832 Janzen et al. Aug 2004 A1
20040163028 Olarig Aug 2004 A1
20040165609 Herbst et al. Aug 2004 A1
20040199363 Bohizic et al. Oct 2004 A1
20040205433 Gower et al. Oct 2004 A1
20040230718 Polzin et al. Nov 2004 A1
20040246767 Vogt Dec 2004 A1
20040250153 Vogt Dec 2004 A1
20040260909 Lee et al. Dec 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
20050033906 Mastronarde et al. Feb 2005 A1
20050044305 Jakobs et al. Feb 2005 A1
20050050237 Jeddeloh Mar 2005 A1
20050050255 Jeddeloh Mar 2005 A1
20050066136 Schnepper 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
20050086441 Meyer Apr 2005 A1
20050097249 Oberlin et al. May 2005 A1
20050105350 Zimmerman et al. May 2005 A1
20050120157 Chen et al. Jun 2005 A1
20050125702 Huang et al. Jun 2005 A1
20050125703 Lefurgy 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
20050177677 Jeddeloh Aug 2005 A1
20050177690 LaBerge Aug 2005 A1
20050188292 Chen Aug 2005 A1
20050204216 Daily et al. Sep 2005 A1
20050216601 Yost Sep 2005 A1
20050216678 Jeddeloh Sep 2005 A1
20050216822 Kyusojin et al. Sep 2005 A1
20050220097 Swami et al. Oct 2005 A1
20050220232 Kunnari et al. Oct 2005 A1
20050223196 Knowles Oct 2005 A1
20050229132 Butt et al. Oct 2005 A1
20050235072 Smith et al. Oct 2005 A1
20050248997 Lee Nov 2005 A1
20050257005 Jeddeloh et al. Nov 2005 A1
20050259496 Hsu et al. Nov 2005 A1
20050262323 Woo et al. Nov 2005 A1
20050289292 Morrow et al. Dec 2005 A1
20050289377 Luong 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
20060039205 Cornelius Feb 2006 A1
20060050694 Bury et al. Mar 2006 A1
20060080584 Hartnett et al. Apr 2006 A1
20060085602 Huggahalli et al. Apr 2006 A1
20060095592 Borkenhagen May 2006 A1
20060095679 Edirisooriya May 2006 A1
20060104371 Schuermans et al. May 2006 A1
20060107175 Dell et al. May 2006 A1
20060112238 Jamil et al. May 2006 A1
20060156175 McClellan et al. Jul 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
20070016698 Vogt Jan 2007 A1
20070025131 Ruckerbauer et al. Feb 2007 A1
20070025304 Leelahakriengkrai et al. Feb 2007 A1
20070038907 Jeddeloh et al. Feb 2007 A1
20070061675 Holman Mar 2007 A1
20070067382 Sun Mar 2007 A1
20070083701 Kapil Apr 2007 A1
20070160053 Coteus Jul 2007 A1
20080031030 Rajan et al. Feb 2008 A1
20080043808 Hsu et al. Feb 2008 A1
20080046795 Dell et al. Feb 2008 A1
20080162807 Rothman et al. Jul 2008 A1
20080163014 Crawford et al. Jul 2008 A1
20080222379 Jeddeloh Sep 2008 A1
20090003335 Biran et al. Jan 2009 A1
20090006900 Lastras-Montano et al. Jan 2009 A1
20090300413 Chang et al. Dec 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
0114140 Jun 1989 JP
0432614 Nov 1992 JP
10011971 Jan 1998 JP
2004139552 May 2004 JP
2008003711 Jan 2008 JP
9621188 Jul 1996 WO
9812651 Mar 1998 WO
0004481 Jan 2000 WO
0223353 Mar 2002 WO
WO2005038660 Apr 2005 WO
2007109888 Oct 2007 WO
Non-Patent Literature Citations (38)
Entry
Yang, Q.; Bhuyan, L.N., “Analysis of packet-switched multiple-bus multiprocessor systems,” Computers, IEEE Transactions on, vol. 40, No. 3, pp. 352-357, Mar. 1991.
Li, P; Martinez, J.; Tang, J.; Priore, S.,; Hubbard, K.; Jie Xue; Poh, E.; Ong MeiLin; Chok KengYin; Hallmark, C.; Mendez, D.; “Development and evaluation of a high performance fine pitch SODIMM socket package.” Electronic Components and Technology Conference, 2004. Proceedings. 54th, vol. 1, pp. 1161-1166, Jun. 1-4, 2004.
PCT International Search Report PCT/EP2006/068984. Mailed Feb. 16, 2007.
PCT International Search Report PCT/EP2007/057916. Mailed Dec. 14, 2007.
Direction, [online]; [retrieved on Feb. 23, 2006]; retrieved from the Internet http://www.directron.com/directron/fsbguide.html PENROD, Understanding System Memory and CPU speeds: A Layman Guide to the Front Side of the Bus (FSB), pp. 10.
International Search Report, International Application No. PCT/EP2007/054929, International Publication No. WO2007/135144 A1, received Mar. 21, 2008.
Joe Jeddeloh, Fully Buffered DIMM (FB-DIMM), XP002490174, Advanced Systems Technology, Micron Technology, Inc. Apr. 16, 2008, 23 pages.
Timothy J. Dell, “The RAS Implications of DIMM Connector Failure Rates in Large, Highly Available Server Systems”, The 53rd IEEE Holm Conference on Electrical Contacts, IEEE, Sep. 16-19, 2007, pp. 256-261.
“Using Dual and Mappable Spare Bus”, XP000433763, IBM Technical Disclosure Bulletin, vol. 37, No. 2B, IBM Copr., NY, US, Feb. 1, 1994, pp. 59-63.
“Novel Bus Reconfiguration Scheme With Spare Lines”, XP000676205, IBM Technical Disclosure Bulletin, vol. 29, No. 12, IBM Copr., NY, US, May 12, 1987, pp. 5590-5593.
European Search Report, European Patent Application 05106700.7, received Aug. 11, 2008.
PCT Search Report PCT/EP2007/057915. Mailed Nov. 7, 2007.
International Search Report, International Patent Application No. PCT/US07/75944, mailed Sep. 23, 2008, 3 pages.
European Search Report, European Patent Application No. 05106701.5, mailed Oct. 7, 2008, 5 pages.
European Search Report, European Patent Application No. 05109837, mailed Oct. 7, 2008, 5 pages.
Benini, et al., “System-Level Powers Optimization: Techniques and Tools”, ACM Transactions on Design Automation of Electronic Systems, vol. 5, No. 2, Apr. 2000, pp. 115-192.
Boudon, et al., “Novel Bus Reconfiguration Scheme With Spare Lines”, IBM Technical Disclosure Bulletin, May 1987, vol. 29, No. 12, pp. 1-3.
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.
Ghoneima et al.; “Optimum Positioning of Interleaved Repeaters in Bidirectional Buses;” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 25, No. 3, Mar. 2005, pp. 461-469.
IEEE, “IEEE Standard Test Access Port and Boundary-Scan Architecture”, Jul. 23, 2001, IEEE Std 1149-1-2001, pp. 11-13.
JEDEC Solid State Technology Association, “JEDEC Standard: DDR2 SDRAM Specification”, Jan. 2004, JEDEC, Revision JESD79-2A, p. 10.
Jungjoon Kim et al.; “Performance and Architecture Features of Segmented Multiple Bus System;” IEEE Computer Society; 1999 International Conference on Parallel Processing (ICPP '99).
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.
Natarajan, et al., “A Study of Performance Impact of Memory Controller Features in Multi-Processor Server Environment”, pp. 80-87.
NB940259 (IBM Technical Disclosure Bulletin, Feb. 1994; vol. 37; pp. 59-64).
Nilsen, “High-Level Dynamic Memory Management for Object-Oriented Real-Time Systems”, pp. 86-93.
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.
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. [online]; [retrieved on Feb. 23, 2006]; retrieved from the Internet.
Rosenberg, “Dictionary of Computers, Information Processing & Telecommuications”, Second Edition, John Wiley & Sons, Inc. 1987. 3 pgs.
Seceleanu et al.; “Segment Arbiter as Action System;” IEEE 2003 pp. 249-252.
Singh, S., et al., “Bus Sparing for Fault-Tolerant System Design”, IBM Technical Disclosure Bulletin, Dec. 1991, vol. 34, No. 71, pp. 117-118.
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.
U.S. Appl. No. 11/419,586, filed May 22, 2006. Robert Tremaine. “Systems and Methods for Providing Remote Pre-Fetch Buffers”.
Wang, et al., “Guided Region Prefetching: A Cooperative Hardware/Software Approach”, pp. 388-398.
Wikipedia, Serial Communications, [online], [retrieved Apr. 10, 2007 from the Internet], http://en.wikipedia.org/wiki/Serial—communications,p. 1.
IBM. IBM WebSphere Enterprise Service Bus. Version 6.0.2 2006 (165-0071-USC NOA Jun. 12, 2009).
BEA Systems Inc. Integration of Clustered BEA AquaLogic Service Bus Domain and Remote Tibco Enterprise Message Service 4.2.0 for Messaging Application in SOA. BEA White Paper. 2006 (165-0071-USC NOA Jun. 12, 2009).
Oracle. Oracle Enterprise Service Bus. Oracle Data Sheet. Oct. 2006 (165-0071-USC NOA Jun. 12, 2009).
Related Publications (1)
Number Date Country
20080046795 A1 Feb 2008 US
Continuations (1)
Number Date Country
Parent 10977914 Oct 2004 US
Child 11851496 US