US 7,047,351 B2Grant
Memory hub bypass circuit and method
Issue Date:2006-05-16
•34 Claims
•3 Drawing Sheets
Abstract
A computer system and a method used to access data from a plurality of memory devices with a memory hub. The computer system includes a plurality of memory modules coupled to a memory hub controller. Each of the memory modules includes the memory hub and the plurality of memory devices. The memory hub includes a sequencer and a bypass circuit. When the memory hub is busy servicing one or more memory requests, the sequencer generates and couples the memory requests to the memory devices. When the memory hub is not busy servicing multiple memory requests, the bypass circuit generates and couples a portion of each the memory requests to the memory devices and the sequencer generates and couples the remaining portion of each of the memory requests to the memory devices.
Metadata
Assignee
- Micron Technology, Inc.
Inventor
- Joseph M. Jeddeloh
Application Information
Application Number:US 11/041,071
Filing Date:2005-01-21
Priority Date:2002-08-16
Art Unit:2187
Classifications
IPC:
G06F12/00
Patent Drawings (3 sheets)
Description
Cross-Reference to Related Application
[0001] This application is a continuation of pending U.S. patent application Ser. No. 10/222,415, filed Aug. 16, 2002.
Technical Field
[0002] This invention relates to a computer system, and, more particularly, to a computer system having a memory hub coupling several memory devices to a processor or other memory access device.
Background of the Invention
[0003] Computer systems use memory devices, such as dynamic random access memory (“DRAM”) devices, to store instructions and data that are accessed by a processor. These memory devices are normally used as system memory in a computer system. In a typical computer system, the processor communicates with the system memory through a processor bus and a memory controller. The processor issues a memory request, which includes a memory command, such as a read command, and an address designating the location from which data or instructions are to be read. The memory controller uses the command and address to generate appropriate command signals as well as row and column addresses, which are applied to the system memory. In response to the commands and addresses, data is transferred between the system memory and the processor. The memory controller is often part of a system controller, which also includes bus bridge circuitry for coupling the processor bus to an expansion bus, such as a PCI bus.
[0004] Although the operating speed of memory devices has continuously increased, this increase in operating speed has not kept pace with increases in the operating speed of processors. Even slower has been the increase in operating speed of memory controllers coupling processors to memory devices. The relatively slow speed of memory controllers and memory devices limits the data bandwidth between the processor and the memory devices.
[0005] In addition to the limited bandwidth between processors and memory devices, the performance of computer systems is also limited by latency problems that increase the time required to read data from system memory devices. More specifically, when a memory device read command is coupled to a system memory device, such as a synchronous DRAM (“SDRAM”) device, the read data are output from the SDRAM device only after a delay of several clock periods. Therefore, although SDRAM devices can synchronously output burst data at a high data rate, the delay in initially providing the data can significantly slow the operating speed of a computer system using such SDRAM devices.
[0006] One approach to alleviating the memory latency problem is to use multiple memory devices coupled to the processor through a memory hub. In a memory hub architecture, a system controller or memory controller is coupled to several memory modules, each of which includes a memory hub coupled to several memory devices. The memory hub efficiently routes memory requests and responses between the controller and the memory devices. Computer systems employing this architecture can have a higher bandwidth because a processor can access one memory device while another memory device is responding to a prior memory access. For example, the processor can output write data to one of the memory devices in the system while another memory device in the system is preparing to provide read data to the processor.
[0007] Although computer systems using memory hubs may provide superior performance, they nevertheless often fail to operate at optimum speed for several reasons. For example, even though memory hubs can provide computer systems with a greater memory bandwidth, they still suffer from latency problems of the type described above. More specifically, although the processor may communicate with one memory device while another memory device is preparing to transfer data, it is sometimes necessary to receive data from one memory device before the data from another memory device can be used. In the event data must be received from one memory device before data received from another memory device can be used, the latency problem continues to slow the operating speed of such computer systems. In addition, the memory hub is designed to handle multiple memory requests. Thus, it is only when the memory hub is busy servicing more than one memory request that the benefits of communicating with multiple memory requests are actually realized. Thus, when the memory hub is not busy, the slower and more complex logic used by the memory hub to handle multiple memory requests creates additional latency when servicing only one memory request.
[0008] There is therefore a need for a memory hub that bypasses the normal logic used to handle multiple memory requests when only one memory request is being serviced.
Summary of the Invention
[0009] The present invention is directed to a computer system and method of accessing a plurality of memory devices with a memory hub. The computer system includes a plurality of memory modules coupled to a memory hub controller. Each of the memory modules includes the plurality of memory devices and the memory hub. The memory hub includes a link interface, a sequencer, a bypass circuit, and a memory device interface. The link interface receives memory requests from the memory hub controller and forwards the memory requests to either the sequencer or both the sequencer and the bypass circuit based on the status of the memory device interface. The memory device interface couples memory requests to the memory devices. When the memory device interface is busy servicing one or more memory requests, the sequencer generates memory requests and couples the memory requests to the memory device interface. When the memory device interface is not busy servicing one or more memory requests, the bypass circuit generates memory requests and couples a portion of each of the memory requests to the memory device interface. The sequencer generates and couples the remaining portion of each of the memory requests to the memory device interface. The bypass circuit allows the memory requests to more quickly access the memory devices when the memory device interface is not busy, thereby avoiding the additional latency that would otherwise be created by the sequencer.
[0010] As will be apparent, the invention is capable of modifications in various obvious aspects, all without departing from the spirit and scope of the present invention. Accordingly, the drawings and detailed description are to be regarded as illustrative in nature and not restrictive.
Brief Description of the Drawings
[0011] FIG. 1 is a block diagram of a computer system according to one example of the invention in which a memory hub is included in each of a plurality of memory modules.
[0012] FIG. 2 is a block diagram of a memory hub used in the computer system of FIG. 1 .
Detailed Description of the Invention
[0013] A computer system 100 according to one example of the invention is shown in FIG. 1 . The computer system 100 includes a processor 104 for performing various computing functions, such as executing specific software to perform specific calculations or tasks. The processor 104 includes a processor bus 106 that normally includes an address bus, a control bus, and a data bus. The processor bus 106 is typically coupled to cache memory 108, which, as previously mentioned, is usually static random access memory (“SRAM”). Finally, the processor bus 106 is coupled to a system controller 110, which is also sometimes referred to as a “North Bridge” or “memory controller.”
[0014] The system controller 110 serves as a communications path to the processor 104 for a variety of other components. More specifically, the system controller 110 includes a graphics port that is typically coupled to a graphics controller 112, which is, in turn, coupled to a video terminal 114. The system controller 110 is also coupled to one or more input devices 118, such as a keyboard or a mouse, to allow an operator to interface with the computer system 100. Typically, the computer system 100 also includes one or more output devices 120, such as a printer, coupled to the processor 104 through the system controller 110. One or more data storage devices 124 are also typically coupled to the processor 104 through the system controller 110 to allow the processor 104 to store data or retrieve data from internal or external storage media (not shown). Examples of typical storage devices 124 include hard and floppy disks, tape cassettes, and compact disk read-only memories (CD-ROMs).
[0015] The system controller 110 includes a memory hub controller 128 that is coupled to several memory modules 130a, 130b, . . . 130n, which serve as system memory for the computer system 100. The memory modules 130 are preferably coupled to the memory hub controller 128 through a high-speed link 134, which may be an optical or electrical communication path or some other type of communications path. In the event the high-speed link 134 is implemented as an optical communication path, the optical communication path may be in the form of one or more optical fibers, for example. In such case, the memory hub controller 128 and the memory modules will include an optical input/output port or separate input and output ports coupled to the optical communication path.
[0016] The memory modules 130 are shown coupled to the memory hub controller 128 in a multi-drop arrangement in which the single high-speed link 134 is coupled to all of the memory modules 130. However, it will be understood that other topologies may also be used, such as a point-to-point coupling arrangement in which a separate high-speed link (not shown) is used to couple each of the memory modules 130 to the memory hub controller 128. A switching topology may also be used in which the memory hub controller 128 is selectively coupled to each of the memory modules 130 through a switch (not shown). Other topologies that may be used will be apparent to one skilled in the art.
[0017] Each of the memory modules 130 includes a memory hub 140 for controlling access to 6 memory devices 148, which, in the example illustrated in FIG. 1 , are synchronous dynamic random access memory (“SDRAM”) devices. However, a fewer or greater number of memory devices 148 may be used, and memory devices other than SDRAM devices may, of course, also be used. The memory hub 140 is coupled to each of the system memory devices 148 through a bus system 150, which normally includes a control bus, an address bus and a data bus.
[0018] One example of the memory hub 140 of FIG. 1 is shown in FIG. 2 . The memory hub 140 includes a link interface 152 that is coupled to the high-speed link 134. The nature of the link interface 152 will depend upon the characteristics of the high-speed link 134. For example, in the event the high-speed link 134 is implemented using an optical communications path, the link interface 152 will include an optical input/output port and will convert optical signals coupled through the optical communications path into electrical signals. In any case, the link interface 152 preferably includes a buffer, such as a first-in, first-out buffer 154, for receiving and storing memory requests as they are received through the high-speed link 134. The memory requests are stored in the buffer 154 until they can be processed by the memory hub 140.
[0019] When the memory hub 140 is able to process a memory request, one of the memory requests stored in the buffer 154 is transferred to a memory sequencer 160. The memory sequencer 160 converts the memory requests from the format output by the memory hub controller 128 into a memory request having a format that can be used by the memory devices 148. These re-formatted request signals will normally include memory command signals, which are derived from memory commands contained in the memory requests received by the memory hub 140, and row and column address signals, which are derived from an address contained in the memory requests received by the memory hub 140. In the event one of the memory requests is a write memory request, the re-formatted request signals will normally include write data signals which are derived from write data contained in the memory request received by the memory hub 140. For example, where the memory devices 148 are conventional DRAM devices, the memory sequencer 160 will output row address signals, a row address strobe (“RAS”) signal, an active high write/active low read signal (“W/R*”), column address signals and a column address strobe (“CAS”) signal. The re-formatted memory requests are preferably output from the sequencer 160 in the order they will be used by the memory devices 148. However, the sequencer 160 may output the memory requests in a manner that causes one type of request, such as read requests, to be processed before other types of requests, such as write requests.
[0020] The sequencer 160 provides a relatively high bandwidth because it allows the memory hub controller 128 to send multiple memory requests to the memory module 130 containing the memory hub 140, even though previously sent memory requests have not yet been serviced. As a result, the memory requests can be sent at a rate that is faster than the rate at which the memory module 130 can service those requests. The sequencer 160 simply formats the signals of one memory request while memory devices are servicing another memory request. In addition, the sequencer 160 may reorder the memory requests, such as placing a series of read requests before previously received write requests, which reduces the memory read latency.
[0021] The memory sequencer 160 applies the re-formatted memory requests to a memory device interface 166. The nature of the memory device interface 166 will again depend upon the characteristics of the memory devices 148. In any case, the memory device interface 166 preferably includes a buffer, such as a FIFO buffer 168, for receiving and storing one or more memory requests as they are received from the link interface 152. The memory requests are stored in the buffer 168 until they can be processed by the memory devices 148.
[0022] The memory requests are described above as being received by the memory hub 140 in a format that is different from the format that the memory requests are applied to the memory devices 148. However, the memory hub controller 128 may instead re-format the memory requests from the processor 104 (FIG. 1 ) to a format that can be used by the memory devices 148. In such case, it is not necessary for the sequencer 160 to re-format the memory requests. Instead, the sequencer 160 simply schedules the re-formatted memory request signals in the order needed for use by the memory devices 148. The memory request signals for one or more memory requests are then transferred to the memory device interface 166 so they can subsequently be applied to the memory devices 148.
[0023] As previously explained, the sequencer 160 can provide a memory bandwidth that is significantly higher than the memory bandwidth of conventional computer systems. Although the sequencer 160 provides this advantage when the memory hub controller 128 is issuing memory commands at a rapid rate, the sequencer 160 does not provide this advantage when the memory hub controller 128 is issuing memory requests to a memory module 130 at a rate that can be serviced by the memory module 130. In fact, the sequencer 160 can actually increase the read latency of the memory module 130 when no unserviced memory requests are queued in the memory hub 140. The increased latency results from the need to store the memory requests in the sequencer 160, re-format the memory requests, schedule resulting control signals in the sequencer 160, and begin applying those control signals to the memory devices 148. Also, the memory sequencer 160 has a relatively slow clocking structure that can delay the memory hub 140 from issuing to the memory devices memory requests received from the memory hub controller 128.
[0024] The memory hub 140 shown in FIG. 2 avoids the potential disadvantage of using the memory sequencer 160 by including the bypass circuit 170. The bypass circuit 170 allows the memory requests to access the memory devices 148 more quickly when the memory device interface 166 is not busy servicing at least one memory request. As explained above, when multiple memory requests are not being handled by the sequencer 160, the advantages of servicing memory requests with the sequencer 160 no longer exist. Instead, the sequencer 160 increases the memory read latency. The bypass circuit 170, however, allows the memory hub 140 to decrease the access time of each memory request by handling an initial portion of the signal sequencing normally handled by the sequencer 160, and it preferably uses a faster clocking structure than the sequencer 160. Thus, the bypass circuit 170 increases the access time of the memory requests to the memory devices 148.
[0025] The bypass circuit 170 includes conventional circuitry that converts each of the memory requests from the format output by the memory hub controller 128 into a memory request with a format that can be used by the memory devices 148. While the bypass circuit 170 may handle reformatting of the entire memory request, the bypass circuit 170 preferably handles the row address portion of the memory request. Similar to the memory sequencer 160 described above, the bypass circuit 170 receives the memory request from the link interface 154. The bypass circuit 170 then reformats the address portion of the memory request into a row address signal. The bypass circuit 170 outputs the row address signal to the memory device interface 166 and then outputs a row address strobe (RAS) to the memory device interface 166. These signals allow the memory device interface 166 to access the addressed row of one of the memory devices 148. By the time the memory devices have processed the portion of the memory request provided by the bypass circuit 170, the sequencer 160 is ready to provide the remaining portion of the memory request.
[0026] As shown in FIG. 2 , the bypass circuit 170 utilizes a link-in clock 176 from the memory hub controller 128 to forward the row address and RAS signals to the memory device interface 166. The link-in clock 176 is received by the link interface 152 and forwarded to the bypass circuit 170. The bypass circuit includes logic that delays and balances the link-in clock 176 with the clock forwarded from the link interface 152 with the memory requests. More specifically, the link-in clock 176 is used to forward each memory request from the memory hub controller 128 to the memory hub 140, in particular to the link interface 152. The link-in clock 176 is then forwarded to the bypass circuit 170. The memory request output by the link interface 152 to the bypass circuit 170 uses a controller clock, which is a slower clock used by the memory hub 140 to process memory requests. The bypass circuit 170 delays and balances the link-in clock 176 with the controller clock, which allows the bypass circuit 170 to use the link-in clock 176 to service the row portion of the memory request. The faster link-in clock 176 allows the bypass circuit 170 to process and forward the row address and RAS signals more quickly than the controller clock used by the sequencer 160.
[0027] While the bypass circuit 170 handles the row portion of the memory request from the link interface 152, the remaining portion of the memory request, for example the command signal and column address, is formatted and forwarded by the sequencer 160. This allows the sequencer 160 to format the remaining portion of the memory request, as explained above, while the read address and RAS signals are accessing the addressed row of one of the memory devices 148. Thus, the sequencer 160 does not have to service the row portion of the memory request. This structure increases the overall access time to the memory devices 148, thus reducing the latency of the memory hub 140, because the bypass circuit 170 forwards the row address and RAS signals to one of the memory devices more quickly than the sequencer 160. In addition, during the clock delays used by the row address and RAS signals to access one of the memory devices 148, the sequencer 160 is formatting and ordering the remaining signals of the memory request. Thus, once the remaining signals are formatted and ordered by the sequencer 160, they can be immediately coupled to the memory device 148 that has already been accessed by the row address signal.
[0028] The bypass circuit 170 is utilized by the memory hub 140 when the memory device interface 166 is not busy servicing memory requests. The memory device interface 166 generates a high “ACTIVE/IDLE*” signal when the buffer 168 of the memory device interface 166 is active and contains, for example, one or more memory requests. The high ACTIVE/IDLE* signal indicates that the memory device interface is busy, thus memory requests can be more efficiently handled by using the sequencer 160. When the buffer 168 contains, for example, less than one memory request, the memory device interface generates a low “ACTIVE/IDLE*” signal. The low ACTIVE/IDLE* signal indicates that the memory device interface is not busy, thus the memory hub 140 uses the bypass circuit 170 and sequencer 160 to service memory requests. The ACTIVE and IDLE* conditions generated by the memory device interface 166 are not limited to the circumstances described above. For example, the memory device interface 166 may generate an ACTIVE signal based on the buffer 168 containing a certain percentage of memory requests and likewise an IDLE* signal when the number of memory requests is under a certain percentage.
[0029] The memory hub 140, shown in FIG. 2 , further includes a multiplexer 172, which works in conjunction with the memory device interface 166 to service the memory requests. The multiplexer 172 has inputs coupled to the bypass circuit 170 and the sequencer 160, an output coupled to the memory device interface 166, and a control input coupled to the memory device interface 166. The multiplexer 172 uses the ACTIVE/IDLE* signal from the memory device interface 166 to couple memory requests to the memory device interface 166. When the multiplexer 172 receives an ACTIVE signal, or a high ACTIVE/IDLE* signal, the multiplexer 172 couples memory requests from the sequencer 160 to the memory device interface 166. Likewise, when the multiplexer 172 receives an IDLE* signal, or a low ACTIVE/IDLE* signal, the multiplexer 172 couples a portion of each memory request from the bypass circuit 170 to the memory device interface 166 and a portion of each memory request from the sequencer 160 to the memory device interface 166.
[0030] The ACTIVE/IDLE* signal generated by the memory device interface 166 is also used to determine whether memory requests should be forwarded from the link interface 152 to the sequencer 160 or to both the bypass circuit 170 and the sequencer 160. Both the sequencer 160 and the bypass circuit 170 are coupled to the memory device interface 166. When the memory device interface 166 generates an ACTIVE signal, the sequencer 160 receives the memory requests from the link interface 152 and generates and couples memory requests to the multiplexer 172. When the memory device interface 166 generates an IDLE* signal, both the sequencer 160 and the bypass circuits receive the memory requests and handle specific portions of each of the memory requests, as described above.
[0031] Although the present invention has been described with reference to preferred embodiments, persons skilled in the art will recognize that changes may be made in form and detail without departing from the spirit and scope of the invention. Accordingly, the invention is not limited except as by the appended claims.
Claims
What is claimed is:
1. A memory module, comprising:
a plurality of memory devices; and
a memory hub, comprising:
a link interface operable to receive memory requests for access to at least one of the memory devices;
a memory device interface operable to couple memory requests to the plurality of memory devices; and
a memory request processing system coupled to the link interface and the memory device interface, the memory request processing system being operable responsive to receiving a memory request to determine whether or not at least one other memory request is being serviced by the memory module, the memory request processing system being operable responsive to determining that the at least one other memory request is not being serviced to cause a portion of a memory request corresponding to the memory request received by the memory request processing system to be transferred to the memory device interface, the memory request processing system further being operable responsive to determining that the at least one other memory request is being serviced to schedule at least a portion of the memory request corresponding to the memory request received by the memory request processing system to be subsequently transferred to the memory device interface.
2. The memory module of claim 1 wherein the memory request processing system is operable to determine whether or not at least one memory request is being serviced by the memory device interface.
3. The memory module of claim 1 wherein the memory request processing system comprises:
a bypass circuit coupled to the link interface and the memory device interface, the bypass circuit causing a portion of the memory request corresponding to the memory request received by the memory request processing system to be transferred to the memory device interface responsive to determining that the at least one other memory request is not being serviced; and
a sequencer coupled to the link interface and the memory device interface, the sequencer scheduling the memory request corresponding to the at least one memory request received by the memory request processing system to be subsequently transferred to the memory device interface responsive to determining that the at least one other memory request is being serviced.
4. The memory module of claim 3 wherein the memory request processing system is further operable to cause any remaining portion of the memory request corresponding to the memory request received by the memory request processing system that is not handled by the bypass circuit to be coupled to the memory device interface responsive to the memory request processing system determining that the at least one other memory request is not being serviced.
5. The memory module of claim 3 wherein, in response to the memory request processing system determining that the at least one other memory request is not being serviced, the bypass circuit is operable responsive to transfer to the memory device interface a row address corresponding to a row address in the memory request received by the memory request processing system, and the sequencer is operable to transfer to the memory device interface remaining portions of the memory request corresponding to the memory request received by the memory request processing system.
6. The memory module of claim 1 wherein the memory device interface comprises a first-in, first-out buffer that is operable to receive and store memory requests received from the link interface.
7. The memory module of claim 1 wherein the memory device interface is coupled to the link interface, the memory device interface further receiving read data responsive to the memory requests received by the memory request processing system and coupling the read data to the link interface.
8. The memory module of claim 1 wherein the link interface comprises an optical input/output port.
9. The memory module of claim 1 wherein the memory request processing system is operable to reformat memory requests received by the link interface before causing memory requests to be transferred to the memory device interface.
10. The memory module of claim 1 wherein the memory devices comprises dynamic random access memory devices.
11. The memory module of claim 1 wherein the memory request processing system is operable responsive to determining that the at least one other memory request is not being serviced to initially transfer to the memory device interface a row address corresponding to a row address in the memory request received by the memory request processing system and to subsequently transfer to the memory device interface remaining portions of the memory request corresponding to the memory request received by the memory request processing system.
12. A memory hub, comprising:
a link interface operable to receive memory requests for access to at least one of the memory devices;
a memory device interface operable to couple memory requests to the memory devices; and
a memory request processing system coupled to the link interface and the memory device interface, the memory request processing system being operable responsive to receiving a memory request to determine whether or not at least one other memory request is being serviced by the memory module, the memory request processing system being operable responsive to determining that the at least one other memory request is not being serviced to cause a portion of a memory request corresponding to the memory request received by the memory request processing system to be transferred to the memory device interface, the memory request processing system further being operable responsive to determining that the at least one other memory request is being serviced to schedule at least a portion of at least one memory request corresponding to the memory request received by the memory request processing system to be subsequently transferred to the memory device interface.
13. The memory hub of claim 12 wherein the memory request processing system is operable to determine whether or not the at least one other memory request is being serviced by the memory device interface.
14. The memory hub of claim 12 wherein the memory request processing system comprises:
a bypass circuit coupled to the link interface and the memory device interface, the bypass circuit causing a portion of the memory request corresponding to a memory request received by the memory request processing system to be transferred to the memory device interface responsive to determining that the at least one other memory request is not being serviced; and
a sequencer coupled to the link interface and the memory device interface, the sequencer scheduling the memory request corresponding to the memory request received by the memory request processing system to be subsequently transferred to the memory device interface responsive to determining that the at least one other memory request is being serviced.
15. The memory hub of claim 14 wherein the memory request processing system is further operable to cause any remaining portion of the memory request not handled by the bypass circuit to be coupled to the memory device interface responsive to the memory request processing system determining that the at least one other memory request is not being serviced.
16. The memory hub of claim 14 wherein, in response to the memory request processing system determining that the at least one other memory request is not being serviced, the bypass circuit is operable responsive to transfer to the memory device interface a row address corresponding to a row address in the memory request received by the memory request processing system, and the sequencer is operable to transfer to the memory device interface remaining portions of the memory address corresponding to the memory request received by the memory request processing system.
17. The memory hub of claim 12 wherein the memory device interface comprises a first-in, first-out buffer that is operable to receive and store memory requests received from the link interface.
18. The memory hub of claim 12 wherein the memory device interface is coupled to the link interface, the memory device interface further receiving read data responsive to the memory requests and coupling the read data to the link interface.
19. The memory hub of claim 12 wherein the link interface comprises an optical input/output port.
20. The memory hub of claim 12 wherein the memory request processing system is operable to reformat memory requests received by the link interface before causing memory requests to be transferred to the memory device interface.
21. The memory hub of claim 12 wherein the memory requests received by the link interface comprise dynamic random access memory requests.
22. The memory hub of claim 12 wherein the memory requests transmitted by the memory device interface comprise dynamic random access memory requests.
23. The memory hub of claim 12 wherein the memory request processing system is operable responsive to determining that the at least one other memory request is not being serviced to initially transfer to the memory device interface a row address corresponding to a row address in the memory request received by the memory request processing system and to subsequently transfer to the memory device interface remaining portions of the memory request corresponding to the memory request received by the memory request processing system.
24. A processor-based system, comprising:
a central processing unit (“CPU”);
a system controller coupled to the CPU, the system controller having an input port and an output port;
an input device coupled to the CPU through the system controller;
an output device coupled to the CPU through the system controller;
a storage device coupled to the CPU through the system controller; and
a plurality of memory modules, each of the memory modules comprising:
a plurality of memory devices; and
a memory hub, comprising:
a link interface operable to receive memory requests for access to at least one of the memory devices;
a memory device interface operable to couple memory requests to the plurality of memory devices; and
a memory request processing system coupled to the link interface and the memory device interface, the memory request processing system being operable responsive to receiving a memory request to determine whether or not at least one other memory request is being serviced by the memory module, the memory request processing system being operable responsive to determining that the at least one other memory request is not being serviced to cause a portion of a memory request corresponding to the memory request received by the memory request processing system to be transferred to the memory device interface, the memory request processing system further being operable responsive to determining that the at least one other memory request is being serviced to schedule at least a portion of the memory request corresponding to the memory request received by the memory request processing system to be subsequently transferred to the memory device interface.
25. The processor-based system of claim 24 wherein the memory request processing system is operable to determine whether or not at least one memory request is being serviced by the memory device interface.
26. The processor-based system of claim 24 wherein the memory request processing system comprises:
a bypass circuit coupled to the link interface and the memory device interface, the bypass circuit causing a portion of the memory request corresponding to the memory request received by the memory request processing system to be transferred to the memory device interface responsive to determining that the at least one other memory request is not being serviced; and
a sequencer coupled to the link interface and the memory device interface, the sequencer scheduling the memory request corresponding to the at least one memory request received by the memory request processing system to be subsequently transferred to the memory device interface responsive to determining that the at least one other memory request is being serviced.
27. The processor-based system of claim 26 wherein the memory request processing system is further operable to cause any remaining portion of the memory request corresponding to the memory request not handled by the bypass circuit to be coupled to the memory device interface responsive to the memory request processing system determining that the at least one other memory request is not being serviced.
28. The processor-based system of claim 26 wherein, in response to the memory request processing system determining that the at least one other memory request is not being serviced, the bypass circuit is operable responsive to transfer to the memory device interface a row address corresponding to a row address in the memory request received by the memory request processing system, and the sequencer is operable to transfer to the memory device interface remaining portions of the memory request corresponding to the memory request received by the memory request processing system.
29. The processor-based system of claim 24 wherein the memory device interface comprises a first-in, first-out buffer that is operable to receive and store memory requests received from the link interface.
30. The processor-based system of claim 24 wherein the memory device interface is coupled to the link interface, the memory device interface further receiving read data responsive to the memory requests received by the memory request processing system and coupling the read data to the link interface.
31. The processor-based system of claim 24 wherein the link interface comprises an optical input/output port.
32. The processor-based system of claim 24 wherein the memory request processing system is operable to reformat memory requests received by the link interface before causing memory requests to be transferred to the memory device interface.
33. The processor-based system of claim 24 wherein the memory devices comprise dynamic random access memory devices.
34. The processor-based system of claim 24 wherein the memory request processing system is operable responsive to determining that the at least one other memory request is not being serviced to initially transfer to the memory device interface a row address corresponding to a row address in the memory request received by the memory request processing system and to subsequently transfer to the memory device interface remaining portions of the memory request corresponding to the memory request received by the memory request processing system.
Patent Citations (233)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3742253(A) | 1973-06-01 | Kronies | Applicant |
| US4045781(A) | 1977-08-01 | Levy et al. | Applicant |
| US4240143(A) | 1980-12-01 | Besemer et al. | Applicant |
| US4245306(A) | 1981-01-01 | Besemer et al. | Applicant |
| US4253144(A) | 1981-02-01 | Bellamy et al. | Applicant |
| US4253146(A) | 1981-02-01 | Bellamy et al. | Applicant |
| US4608702(A) | 1986-08-01 | Hirzel et al. | Applicant |
| US4707823(A) | 1987-11-01 | Holdren et al. | Applicant |
| US4724520(A) | 1988-02-01 | Athanas et al. | Applicant |
| US4831520(A) | 1989-05-01 | Rubinfeld et al. | Applicant |
| US4891808(A) | 1990-01-01 | Williams | Applicant |
| US4930128(A) | 1990-05-01 | Suzuki et al. | Applicant |
| US4953930(A) | 1990-09-01 | Ramsey et al. | Applicant |
| US5241506(A) | 1993-08-01 | Motegi et al. | Applicant |
| US5243703(A) | 1993-09-01 | Farmwald et al. | Applicant |
| US5251303(A) | 1993-10-01 | Fogg, Jr. et al. | Applicant |
| US5269022(A) | 1993-12-01 | Shinjo et al. | Applicant |
| US5313590(A) | 1994-05-01 | Taylor | Applicant |
| US5317752(A) | 1994-05-01 | Jewett et al. | Applicant |
| US5319755(A) | 1994-06-01 | Farmwald et al. | Applicant |
| US5327553(A) | 1994-07-01 | Jewett et al. | Applicant |
| US5355391(A) | 1994-10-01 | Horowitz et al. | Applicant |
| US5432823(A) | 1995-07-01 | Gasbarro et al. | Applicant |
| US5432907(A) | 1995-07-01 | Picazo, Jr. et al. | Applicant |
| US5442770(A) | 1995-08-01 | Barratt | Applicant |
| US5461627(A) | 1995-10-01 | Rypinski | Applicant |
| US5465229(A) | 1995-11-01 | Bechtolsheim et al. | Applicant |
| US5479370(A) | 1995-12-01 | Furuyama et al. | Applicant |
| US5497476(A) | 1996-03-01 | Oldfield et al. | Applicant |
| US5502621(A) | 1996-03-01 | Schumacher et al. | Applicant |
| US5544319(A) | 1996-08-01 | Acton et al. | Applicant |
| US5566325(A) | 1996-10-01 | Bruce, II et al. | Applicant |
| US5577220(A) | 1996-11-01 | Combs et al. | Applicant |
| US5581767(A) | 1996-12-01 | Katsuki et al. | Applicant |
| US5606717(A) | 1997-02-01 | Farmwald et al. | Applicant |
| US5638334(A) | 1997-06-01 | Farmwald et al. | Applicant |
| US5638534(A) | 1997-06-01 | Mote, Jr. | Applicant |
| US5659798(A) | 1997-08-01 | Blumrich et al. | Applicant |
| US5687325(A) | 1997-11-01 | Chang | Applicant |
| US5706224(A) | 1998-01-01 | Srinivasan et al. | Applicant |
| US5710733(A) | 1998-01-01 | Chengson et al. | Applicant |
| US5715456(A) | 1998-02-01 | Bennett et al. | Applicant |
| US5729709(A) | 1998-03-01 | Harness | Applicant |
| US5748616(A) | 1998-05-01 | Riley | Applicant |
| US5796413(A) | 1998-08-01 | Shipp et al. | Applicant |
| US5818844(A) | 1998-10-01 | Singh et al. | Applicant |
| US5819304(A) | 1998-10-01 | Nilsen et al. | Applicant |
| US5822255(A) | 1998-10-01 | Uchida | Applicant |
| US5832250(A) | 1998-11-01 | Whittaker | Applicant |
| US5875352(A) | 1999-02-01 | Gentry et al. | Applicant |
| US5875454(A) | 1999-02-01 | Craft et al. | Applicant |
| US5928343(A) | 1999-07-01 | Farmwald et al. | Applicant |
| US5966724(A) | 1999-10-01 | Ryan | Applicant |
| US5973935(A) | 1999-10-01 | Schoenfeld et al. | Applicant |
| US5973951(A) | 1999-10-01 | Bechtolsheim et al. | Applicant |
| US5978567(A) | 1999-11-01 | Rebane et al. | Applicant |
| US5987196(A) | 1999-11-01 | Noble | Applicant |
| US6023726(A) | 2000-02-01 | Saksena | Applicant |
| US6029250(A) | 2000-02-01 | Keeth | Applicant |
| US6031241(A) | 2000-02-01 | Silfvast et al. | Applicant |
| US6033951(A) | 2000-03-01 | Chao | Applicant |
| US6038630(A) | 2000-03-01 | Foster et al. | Applicant |
| US6061263(A) | 2000-05-01 | Boaz et al. | Applicant |
| US6061296(A) | 2000-05-01 | Ternullo, Jr. et al. | Applicant |
| US6067262(A) | 2000-05-01 | Irrinki et al. | Applicant |
| US6067649(A) | 2000-05-01 | Goodwin | Applicant |
| US6073190(A) | 2000-06-01 | Rooney | Applicant |
| US6076139(A) | 2000-06-01 | Welker et al. | Applicant |
| US6079008(A) | 2000-06-01 | Clery, III | Applicant |
| US6092158(A) | 2000-07-01 | Harriman et al. | Applicant |
| US6098158(A) | 2000-08-01 | Lay et al. | Applicant |
| US6105075(A) | 2000-08-01 | Ghaffari | Applicant |
| US6125431(A) | 2000-09-01 | Kobayashi | Applicant |
| US6128703(A) | 2000-10-01 | Bourekas et al. | Applicant |
| US6131149(A) | 2000-10-01 | Lu et al. | Applicant |
| US6134624(A) | 2000-10-01 | Burns et al. | Applicant |
| US6137709(A) | 2000-10-01 | Boaz et al. | Applicant |
| US6144587(A) | 2000-11-01 | Yoshida | Applicant |
| US6167465(A) | 2000-12-01 | Parvin et al. | Applicant |
| US6167486(A) | 2000-12-01 | Lee et al. | Applicant |
| US6175571(B1) | 2001-01-01 | Haddock et al. | Applicant |
| US6185352(B1) | 2001-02-01 | Hurley | Applicant |
| US6185676(B1) | 2001-02-01 | Poplingher et al. | Applicant |
| US6186400(B1) | 2001-02-01 | Dvorkis et al. | Applicant |
| US6191663(B1) | 2001-02-01 | Hannah | Applicant |
| US6201724(B1) | 2001-03-01 | Ishizaki et al. | Applicant |
| US6208180(B1) | 2001-03-01 | Fisch et al. | Applicant |
| US6219725(B1) | 2001-04-01 | Diehl et al. | Applicant |
| US6223301(B1) | 2001-04-01 | Santeler et al. | Applicant |
| US6233376(B1) | 2001-05-01 | Updegrove | Applicant |
| US6243769(B1) | 2001-06-01 | Rooney | Applicant |
| US6243831(B1) | 2001-06-01 | Mustafa et al. | Applicant |
| US6246618(B1) | 2001-06-01 | Yamamoto et al. | Applicant |
| US6247107(B1) | 2001-06-01 | Christie | Applicant |
| US6249802(B1) | 2001-06-01 | Richardson et al. | Applicant |
| US6256692(B1) | 2001-07-01 | Yoda et al. | Applicant |
| US6272609(B1) | 2001-08-01 | Jeddeloh | Applicant |
| US6285349(B1) | 2001-09-01 | Smith | Applicant |
| US6286083(B1) | 2001-09-01 | Chin et al. | Applicant |
| US6294937(B1) | 2001-09-01 | Crafts et al. | Applicant |
| US6301637(B1) | 2001-10-01 | Krull et al. | Applicant |
| US6327642(B1) | 2001-12-01 | Lee et al. | Applicant |
| US6330205(B1) | 2001-12-01 | Shimizu et al. | Applicant |
| US6347055(B1) | 2002-02-01 | Motomura | Applicant |
| US6349363(B1) | 2002-02-01 | Cai et al. | Applicant |
| US6356573(B1) | 2002-03-01 | Jonsson et al. | Applicant |
| US6367074(B1) | 2002-04-01 | Bates et al. | Applicant |
| US6370068(B1) | 2002-04-01 | Rhee | Applicant |
| US6370611(B1) | 2002-04-01 | Callison et al. | Applicant |
| US6373777(B1) | 2002-04-01 | Suzuki | Applicant |
| US6381190(B1) | 2002-04-01 | Shinkai | Applicant |
| US6389514(B1) | 2002-05-01 | Rokicki | Applicant |
| US6392653(B1) | 2002-05-01 | Malandain et al. | Applicant |
| US6401213(B1) | 2002-06-01 | Jeddeloh | Applicant |
| US6405280(B1) | 2002-06-01 | Ryan | Applicant |
| US6421744(B1) | 2002-07-01 | Morrison et al. | Applicant |
| US6430696(B1) | 2002-08-01 | Keeth | Applicant |
| US6433785(B1) | 2002-08-01 | Garcia et al. | Applicant |
| US6434639(B1) | 2002-08-01 | Haghighi | Applicant |
| US6434696(B1) | 2002-08-01 | Kang | Applicant |
| US6434736(B1) | 2002-08-01 | Schaecher et al. | Applicant |
| US6438622(B1) | 2002-08-01 | Haghighi et al. | Applicant |
| US6438668(B1) | 2002-08-01 | Esfahani et al. | Applicant |
| US6449308(B1) | 2002-09-01 | Knight, Jr. et al. | Applicant |
| US6453393(B1) | 2002-09-01 | Holman et al. | Applicant |
| US6460114(B1) | 2002-10-01 | Jeddeloh | Applicant |
| US6462978(B1) | 2002-10-01 | Shibata et al. | Applicant |
| US6463059(B1) | 2002-10-01 | Movshovich et al. | Applicant |
| US6470422(B1) | 2002-10-01 | Cai et al. | Applicant |
| US6473828(B1) | 2002-10-01 | Matsui | Applicant |
| US6477592(B1) | 2002-11-01 | Chen et al. | Applicant |
| US6477614(B1) | 2002-11-01 | Leddige et al. | Applicant |
| US6477621(B1) | 2002-11-01 | Lee et al. | Applicant |
| US6479322(B1) | 2002-11-01 | Kawata et al. | Applicant |
| US6487556(B1) | 2002-11-01 | Downs et al. | Applicant |
| US6490188(B1) | 2002-12-01 | Nuxoll et al. | Applicant |
| US6493803(B1) | 2002-12-01 | Pham et al. | Applicant |
| US6496193(B1) | 2002-12-01 | Surti et al. | Applicant |
| US6496909(B1) | 2002-12-01 | Schimmel | Applicant |
| US6501471(B1) | 2002-12-01 | Venkataraman et al. | Applicant |
| US6505287(B1) | 2003-01-01 | Uematsu | Applicant |
| US6523092(B1) | 2003-02-01 | Fanning | Applicant |
| US6523093(B1) | 2003-02-01 | Bogin et al. | Applicant |
| US6526483(B1) | 2003-02-01 | Cho et al. | Applicant |
| US6539490(B1) | 2003-03-01 | Forbes et al. | Applicant |
| US6552564(B1) | 2003-04-01 | Forbes et al. | Applicant |
| US6564329(B1) | 2003-05-01 | Cheung et al. | Applicant |
| US6587912(B1) | 2003-07-01 | Leddige et al. | Applicant |
| US6590816(B1) | 2003-07-01 | Perner | Applicant |
| US6594713(B1) | 2003-07-01 | Fuoco et al. | Applicant |
| US6594722(B1) | 2003-07-01 | Willke, II et al. | Applicant |
| US6598154(B1) | 2003-07-01 | Vaid et al. | Applicant |
| US6615325(B1) | 2003-09-01 | Mailloux et al. | Applicant |
| US6622227(B1) | 2003-09-01 | Zumkehr et al. | Applicant |
| US6628294(B1) | 2003-09-01 | Sadowsky et al. | Applicant |
| US6629220(B1) | 2003-09-01 | Dyer | Applicant |
| US6631440(B1) | 2003-10-01 | Jenne et al. | Applicant |
| US6636110(B1) | 2003-10-01 | Ooishi et al. | Applicant |
| US6646929(B1) | 2003-11-01 | Moss et al. | Applicant |
| US6647470(B1) | 2003-11-01 | Janzen | Applicant |
| US6658509(B1) | 2003-12-01 | Bonella et al. | Applicant |
| US6662304(B1) | 2003-12-01 | Keeth et al. | Applicant |
| US6665202(B1) | 2003-12-01 | Lindahl et al. | Applicant |
| US6667895(B1) | 2003-12-01 | Jang et al. | Applicant |
| US6681292(B1) | 2004-01-01 | Creta et al. | Applicant |
| US6697926(B1) | 2004-02-01 | Johnson et al. | Applicant |
| US6715018(B1) | 2004-03-01 | Farnworth et al. | Applicant |
| US6718440(B1) | 2004-04-01 | Maiyuran et al. | Applicant |
| US6721195(B1) | 2004-04-01 | Brunelle et al. | Applicant |
| US6724685(B1) | 2004-04-01 | Braun et al. | Applicant |
| US6728800(B1) | 2004-04-01 | Lee et al. | Applicant |
| US6735679(B1) | 2004-05-01 | Herbst et al. | Applicant |
| US6735682(B1) | 2004-05-01 | Segelken et al. | Applicant |
| US6745275(B1) | 2004-06-01 | Chang | Applicant |
| US6751703(B1) | 2004-06-01 | Chilton | Applicant |
| US6754812(B1) | 2004-06-01 | Abdallah et al. | Applicant |
| US6756661(B1) | 2004-06-01 | Tsuneda et al. | Applicant |
| US6760833(B1) | 2004-07-01 | Dowling | Applicant |
| US6771538(B1) | 2004-08-01 | Shukuri et al. | Applicant |
| US6775747(B1) | 2004-08-01 | Venkatraman | Applicant |
| US6785780(B1) | 2004-08-01 | Klein et al. | Applicant |
| US6789173(B1) | 2004-09-01 | Tanaka et al. | Applicant |
| US6792059(B1) | 2004-09-01 | Yuan et al. | Applicant |
| US6792496(B1) | 2004-09-01 | Aboulenein et al. | Applicant |
| US6795899(B1) | 2004-09-01 | Dodd et al. | Applicant |
| US6799246(B1) | 2004-09-01 | Wise et al. | Applicant |
| US6799268(B1) | 2004-09-01 | Boggs et al. | Applicant |
| US6804760(B1) | 2004-10-01 | Wiliams | Applicant |
| US6804764(B1) | 2004-10-01 | LaBerge et al. | Applicant |
| US6807630(B1) | 2004-10-01 | Lay et al. | Applicant |
| US6811320(B1) | 2004-11-01 | Abbott | Applicant |
| US6816947(B1) | 2004-11-01 | Huffman | Applicant |
| US6820181(B1) | 2004-11-01 | Jeddeloh et al. | Applicant |
| US6821029(B1) | 2004-11-01 | Grung et al. | Applicant |
| US6823023(B1) | 2004-11-01 | Hannah | Applicant |
| US6845409(B1) | 2005-01-01 | Talagala et al. | Applicant |
| US6889304(B1) | 2005-05-01 | Perego et al. | Applicant |
| US6904556(B1) | 2005-06-01 | Walton et al. | Applicant |
| US6910109(B1) | 2005-06-01 | Holman et al. | Examiner |
| US6947672(B1) | 2005-09-01 | Jiang et al. | Applicant |
| US2001/0039612(A1) | 2001-11-01 | Lee | Applicant |
| US2002/0112119(A1) | 2002-08-01 | Halbert et al. | Applicant |
| US2002/0116588(A1) | 2002-08-01 | Beckert et al. | Applicant |
| US2002/0144064(A1) | 2002-10-01 | Fanning | Applicant |
| US2002/0178319(A1) | 2002-11-01 | Sanchez-Olea | Applicant |
| US2003/0005223(A1) | 2003-01-01 | Coulson et al. | Applicant |
| US2003/0043158(A1) | 2003-03-01 | Wasserman et al. | Applicant |
| US2003/0043426(A1) | 2003-03-01 | Baker et al. | Applicant |
| US2003/0093630(A1) | 2003-05-01 | Richard et al. | Applicant |
| US2003/0149809(A1) | 2003-08-01 | Jensen et al. | Applicant |
| US2003/0163649(A1) | 2003-08-01 | Kapur et al. | Applicant |
| US2003/0177320(A1) | 2003-09-01 | Sah et al. | Applicant |
| US2003/0191913(A1) | 2003-10-01 | Holman et al. | Examiner |
| US2003/0193927(A1) | 2003-10-01 | Hronik | Applicant |
| US2003/0217223(A1) | 2003-11-01 | Nino et al. | Examiner |
| US2003/0227798(A1) | 2003-12-01 | Pax | Applicant |
| US2003/0229762(A1) | 2003-12-01 | Maiyuran et al. | Applicant |
| US2003/0229770(A1) | 2003-12-01 | Jeddeloh | Applicant |
| US2004/0022094(A1) | 2004-02-01 | Radhakrishnan et al. | Applicant |
| US2004/0034753(A1) | 2004-02-01 | Jeddeloh | Examiner |
| US2004/0044833(A1) | 2004-03-01 | Ryan | Applicant |
| US2004/0064602(A1) | 2004-04-01 | George | Applicant |
| US2004/0126115(A1) | 2004-07-01 | Levy et al. | Applicant |
| US2004/0128449(A1) | 2004-07-01 | Osborne et al. | Applicant |
| US2004/0144994(A1) | 2004-07-01 | Lee et al. | Applicant |
| US2004/0236885(A1) | 2004-11-01 | Fredriksson et al. | Applicant |
| US2005/0044327(A1) | 2005-02-01 | Howard et al. | Applicant |
| US2005/0071542(A1) | 2005-03-01 | Weber et al. | Applicant |
| US2005/0166006(A1) | 2005-07-01 | Talbot et al. | Applicant |
| EP849685(A2) | 1998-06-01 | Applicant | |
| JP2001265539(A) | 2001-09-01 | Applicant | |
| WO93/19422 | 1993-09-01 | Applicant | |
| WO2/27499(A2) | 2002-04-01 | Applicant |
Non-Patent Literature (5)
- “Free On-Line Dictionary of Computing” entry Flash Erasable Programmable Read-Only Memory, online May 17, 2004 [http://foldoc.doc.ic.ac.uk/foldoc/foldoc.cgi?flash+memory].Applicant
- Intel, “Flash Memory PCI Add-In Card for Embedded Systems”, Application Note AP-758, Sep., 1997, pp. i-13.Applicant
- Intel, “Intel 840 Chipset: 82840 Memory Controller Hub (MCH)”, Datasheet, Oct. 1999, pp. 1-178.Applicant
- Micron Technology, Inc., “Synchronous DRAM Module 512MB/1GB (x72, ECC) 168-PIN Registered FBGA SDRAM DIMM”, Micron Technology, Inc., 2002, pp. 1-23.Applicant
- Shanley, T. et al., “PCI System Architecture”, Third Edition, Mindshare, Inc., 1995, pp. 24-25.Applicant