An embodiment of a system logic device for improving memory bandwidth utilization in a computer system with an isochronous data stream includes a FIFO for the isochronous data stream. The FIFO includes two watermarks. When the data level of the FIFO falls below a first watermark level, a low priority request is issued to a memory controller. If the data level of the FIFO falls below a second watermark level, a high priority memory request is issued to the memory controller. The low priority memory request is assigned the lowest priority level by the memory controller. The high priority request is assigned the highest priority level by the memory controller. The low priority request allows the isochronous data stream to retrieve small amounts of data from memory without negatively impacting overall system performance while the high priority request allows the isochronous data stream to retrieve larger amounts of data from memory within a fixed time in order to ensure that the FIFO never completely drains.
|
8. A method, comprising:
issuing a low priority memory request in response to a data level of a data queue for an isochronous data stream falling below a first watermark level; issuing a high priority memory request in response to the data level of the data queue for an isochronous data stream falling below a second watermark level; assigning to the low priority memory request a priority level lower than that of all other requests; and arbitrating access to a memory device among the low priority request, the high priority request, and at least one memory request for at least one additional data stream.
1. An apparatus, comprising:
a data queue for an isochronous data stream, the data queue to trigger a low priority memory request in response to a data level of the queue falling below a first watermark level and the data queue further to trigger a high priority memory request in response to the data level of the queue falling below a second watermark level; and an arbiter to receive the low priority and high priority memory requests and to receive at least one memory request for at least one additional data stream, the arbiter to arbitrate access to a memory device, the arbiter assigning to the low priority memory request a priority level lower than that of all other requests.
15. A system, comprising:
a memory device; and a system logic device coupled to the memory device, the system logic device including a data queue for an isochronous data stream, the data queue to trigger a low priority memory request in response to a data level of the queue falling below a first watermark level and the data queue further to trigger a high priority memory request in response to the data level of the queue falling below a second watermark level, and an arbiter to receive the low priority and high priority memory requests and to receive at least one memory request for at least one additional data stream the arbiter to arbitrate access to the memory device, the arbiter assigning to the low priority memory request a priority level lower than that of all other requests. 2. The apparatus of
3. The apparatus of
6. The apparatus of
7. The apparatus of
9. The method of claims 8, the first watermark level to represent a data level higher than that of the second watermark level.
10. The method of
11. The method of
12. The method of
13. The method of
14. The method of
16. The system of
17. The system of
|
The present invention pertains to the field of computer systems. More particularly, this invention pertains to the field of improving memory bandwidth utilization in systems that include isochronous data streams.
An important function of computer systems is that of processing isochronous data streams. Isochronous data streams are those data streams that have strict throughput and latency requirements. An example of one such data stream is a data stream for a video display device. Video display devices require a certain amount of data every fixed period. If the required data is not delivered to the video display device at the required rate and within the required time period, then some form of display corruption will result.
Isochronous data streams typically have very even data consumption rates, that is, for a given period of time, the amount of data consumed will always be the same. Memory access, on the other hand, is typically very uneven due to arbitration with other data streams. For example, when a video display device requires data it must arbitrate for access to memory with other system resources. The result is uneven and unpredictable access to memory. Another issue with isochronous data streams is that an isochronous data stream is likely to operate at a different clock frequency than that of the memory subsystem. These two issues can be solved by using an intermediate storage first-in, first-out buffer (FIFO). The FIFO can accept data from memory at whatever rate the memory can deliver the data and the FIFO can output data at the rate required by the isochronous data stream.
The FIFO technique works so long as the FIFO is never allowed to go empty. If the FIFO goes empty at any point, the isochronous data stream will be corrupted. To help prevent this situation, isochronous data streams are typically assigned the highest priority for arbitrating access to memory.
In order to maximize memory efficiency, the requests for data are typically made as large as possible. Because for an isochronous data stream the memory access latency, memory data rate, FIFO size, and FIFO drain rate are known, a maximum request size can be calculated as well as the FIFO data level at which the request must occur. This data level may be referred to as a "watermark". When the data level of the FIFO falls below the watermark level, a request is made to a memory arbiter for access to memory. Typically, this request will be allowed to interrupt other ongoing memory transactions in order to ensure that the FIFO receives data within the required time. While the technique of allowing the isochronous data stream memory request to interrupt other memory transactions ensures that the isochronous data stream receives data at a satisfactory rate, the interruptions result in latency penalties for other computer system functions and overall computer system performance is negatively affected.
The invention will be understood more fully from the detailed description given below and from the accompanying drawings of embodiments of the invention which, however, should not be taken to limit the invention to the specific embodiments described, but are for explanation and understanding only.
An embodiment of a system logic device for improving memory bandwidth utilization in a computer system with an isochronous data stream includes a FIFO for the isochronous data stream. The FIFO includes two watermarks. When the data level of the FIFO falls below a first watermark level, a low priority request is issued to a memory controller. If the data level of the FIFO falls below a second watermark level, a high priority memory request is issued to the memory controller. The low priority memory request is assigned the lowest priority level by the memory controller. Therefore, the low priority requests from the isochronous data stream will only utilize memory bandwidth that would otherwise go unused. The high priority request, on the other hand, is assigned the highest priority level by the memory controller. The high priority request is allowed to interrupt ongoing transactions from other data streams. Therefore, the isochronous stream is assured of receiving prompt service from the memory controller and the FIFO is never allowed to reach an empty state. The low priority request allows the isochronous data stream to retrieve small amounts of data from memory without negatively impacting overall system performance while the high priority request allows the isochronous data stream to retrieve larger amounts of data from memory in a hurry in order to ensure that the FIFO never goes empty. Further, the utilization of the first watermark and its associated low priority memory request will result in fewer high priority requests being issued by the isochronous data stream, thereby improving memory efficiency and improving overall system performance.
The system logic device 110 includes a host interface unit 111 to facilitate communication with the processor 105 and a system I/O interface 114 to allow communication with the system input/output device 140. The system logic device 110 further includes a system main memory controller 118 coupled to system main memory 120 and a graphics local memory controller 116 coupled to the graphics local memory 130.
Also included in the system logic device 140 is an isochronous data stream unit 200 coupled between a graphics controller 112 and the system main memory controller 118 and the graphics local memory controller 116. The isochronous data stream unit 200 serves to deliver data from either the system main memory controller 118 or the graphics local memory controller 116 to the graphics controller 112 under strict throughput and latency requirements.
The system main memory controller 118 and the graphics local memory controller 116 receive data transfer requests from the host interface unit 111 and the system I/O interface unit 114, as well as from the isochronous data stream unit 200. The system main memory controller 118 and the graphics local memory controller 116 each include an arbiter (not shown) to arbitrate access to the system main memory 120 or the graphics local memory 130.
The isochronous data stream unit 200 includes a low priority request watermark 212 and a high priority request watermark 214. The term "watermark" as used herein is intended to include any means of indicating a particular data level for the FIFO 210. The low priority request watermark 212 and the high priority request watermark 214 may be programmable. For this example embodiment, the low priority request watermark 212 is set to represent a data level where the FIFO 210 has 64 bytes of empty storage space. Also for this example embodiment, the high priority request watermark 214 is set to represent a data level where the FIFO 210 has 512 bytes of empty storage space.
When the data level of the FIFO falls below the level of the low priority request watermark 212, a low priority memory request is issued by the isochronous data stream unit 200 to either the system main memory controller 118 or the graphics local memory controller 116, depending on where the video display data is stored. The low priority request is for 64 bytes of data in this example. The system main memory controller 118 and the graphics local memory controller 116 assign to the low priority memory request from the isochronous data stream unit 200 an arbitration priority level lower than that of all other memory access requests. In this manner, the isochronous data stream unit 200 can receive 64 bytes of data at a time without interrupting other data streams or negatively impacting overall system performance.
In the event that the low priority request from the isochronous data stream unit 200 is not timely responded to by the either the system main memory controller 118 or the graphics local memory controller 116, the FIFO 210 data level may fall below the high priority request watermark 214. As a result of the FIFO 210 data level falling below the high priority request watermark 214, a high priority memory access request is issued to either the system main memory controller 118 or the graphics local memory controller 116, depending on where the video display data is stored. The high priority request in this example is for 512 bytes of display data. The system main memory controller 118 and the graphics local memory controller 116 assign to the high priority request from the isochronous data stream unit 200 a priority level higher than that of any other memory access request. Further, the high priority request in this example embodiment is allowed to interrupt any other memory access transaction. In this manner, the FIFO 210 is ensured of receiving data before it goes empty which would result in the FIFO 210 being unable to continue to provide valid data to the graphics controller 112. In the case where the low priority request goes unserviced and the high priority request watermark 214 level is crossed, the low priority request is merged with the high priority request.
By issuing a low priority request whenever the FIFO 210 data level falls below the low priority watermark 212, the data level of the FIFO 210 will fall below the high priority request watermark less often than in the case where a single high priority watermark is used, resulting in fewer interruptions of other memory access transactions and thereby improving memory bandwidth utilization and overall system performance.
At step 330, a determination is made as to whether the data level has fallen below a second watermark. This may be the case where the low priority request issued in step 320 goes unserviced for a period of time. If the data level has not fallen below the second watermark level at step 330, then at step 350 arbitration occurs for access to a memory device. If, however, the data level falls below the second watermark level at step 330, then at step 340 a high priority request is issued to the memory controller. In one embodiment, the high priority request is assigned an arbitration priority level higher than that of any other memory access request. Following step 340, arbitration for access to the memory device occurs at step 350.
If, however, the request acknowledge is not received at step 430, then a determination is made at step 450 as to whether the FIFO data level has fallen below a high priority watermark level. If the data level has not fallen below the high priority watermark level, then step 430 is repeated. If, however, the data level has fallen below the high priority watermark at step 450, then a high priority memory request is issued to the memory controller at step 460. The high priority request is assigned an arbitration priority level higher than that of all other memory access requests. At step 470, a determination is made as to whether a request acknowledge for the high priority request has been received. If the request acknowledge has not been received, then step 470 is repeated. If the request acknowledge is received at step 470, then a data transfer occurs at step 440. The data transfer for the high priority request is larger than that for the low priority request, perhaps 512 bytes in length.
Although the embodiments described above in connection with
In the foregoing specification the invention has been described with reference to specific exemplary embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the appended claims. The specification and drawings are, accordingly, to be regarded in an illustrative rather than in a restrictive sense.
Sreenivas, Aditya, Witter, Todd M., Jensen, Sam
Patent | Priority | Assignee | Title |
10540133, | Apr 30 2015 | DISPLAYLINK UK LIMITED | Managing display data of different types for transmission to multiple devices |
7308510, | May 07 2003 | Intel Corporation | Method and apparatus for avoiding live-lock in a multinode system |
7640381, | Oct 07 2005 | Intellectual Ventures I LLC | Input/output decoupling system method having a cache for exchanging data between non-volatile storage and plurality of clients having asynchronous transfers |
9405711, | Jan 09 2013 | International Business Machines Corporation | On-chip traffic prioritization in memory |
9405712, | Jan 09 2013 | International Business Machines Corporation | On-chip traffic prioritization in memory |
9841926, | Jan 09 2013 | International Business Machines Corporation | On-chip traffic prioritization in memory |
Patent | Priority | Assignee | Title |
4616338, | Nov 15 1982 | FIFO arrangement for temporary data storage | |
4815039, | Jan 11 1988 | Texas Instruments Incorporated; TEXAS INSTRUMENTS INCORPORATED, A CORPORATION OF DELAWARE | Fast real-time arbiter |
5371893, | Dec 27 1991 | International Business Machines Corporation | Look-ahead priority arbitration system and method |
5432919, | Jul 06 1989 | HEWLETT-PACKARD DEVELOPMENT COMPANY, L P | Sequential reference management for cache memories |
5673416, | Jun 07 1995 | Seiko Epson Corporation | Memory request and control unit including a mechanism for issuing and removing requests for memory access |
5758105, | Dec 04 1995 | International Business Machines Corporation | Method and apparatus for bus arbitration between isochronous and non-isochronous devices |
5778218, | Dec 19 1996 | GLOBALFOUNDRIES Inc | Method and apparatus for clock synchronization across an isochronous bus by adjustment of frame clock rates |
5794073, | Nov 07 1994 | HEWLETT-PACKARD DEVELOPMENT COMPANY, L P | Arbitration system for a shared DMA logic on a network adapter with a large number of competing priority requests having predicted latency field |
5796961, | Dec 19 1994 | Advanced Micro Devices, Inc. | Heuristic bus access arbiter |
5805905, | Sep 06 1995 | OPTI INC | Method and apparatus for arbitrating requests at two or more levels of priority using a single request line |
5845152, | Mar 19 1997 | Apple Computer, Inc | Method for transmission of isochronous data with two cycle look ahead |
5854638, | Feb 02 1996 | OPTi Inc. | Unified memory architecture with parallel access by host and video controller |
5860119, | Nov 25 1996 | VLSI Technology, Inc. | Data-packet fifo buffer system with end-of-packet flags |
5881248, | Mar 06 1997 | Advanced Micro Devices, Inc. | System and method for optimizing system bus bandwidth in an embedded communication system |
5903283, | Aug 27 1997 | Intel Corporation | Video memory controller with dynamic bus arbitration |
5983301, | Apr 30 1996 | Texas Instruments Incorporated | Method and system for assigning a direct memory access priority in a packetized data communications interface device |
5991304, | Feb 13 1998 | Intel Corporation | Method and apparatus for minimizing asynchronous transmit FIFO under-run and receive FIFO over-run conditions |
6076125, | Jan 09 1998 | HANGER SOLUTIONS, LLC | Single address queue for handling multiple priority requests |
6091431, | Dec 18 1997 | Intel Corporation | Method and apparatus for improving processor to graphics device local memory performance |
6101613, | Jul 06 1998 | Intel Corporation | Architecture providing isochronous access to memory in a system |
6105086, | Jun 04 1998 | AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE LIMITED | Data communication circuit and method for buffering data between a shared resource and multiple interfaces |
6134625, | Feb 18 1998 | Intel Corporation | Method and apparatus for providing arbitration between multiple data streams |
6154800, | Jan 09 1998 | HANGER SOLUTIONS, LLC | Single address queue for handling multiple priority requests |
6192428, | Feb 13 1998 | Intel Corporation | Method/apparatus for dynamically changing FIFO draining priority through asynchronous or isochronous DMA engines in response to packet type and predetermined high watermark being reached |
6247071, | Oct 04 1999 | B2C2, Inc. | System for receiving an isochronous data stream at a computer using a main memory buffer |
Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
Dec 30 1999 | Intel Corporation | (assignment on the face of the patent) | / | |||
Apr 18 2000 | WITTER, TODD M | INTEL CORPORATION, A CORPORATION OF DELAWARE | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 010842 | /0745 | |
Apr 18 2000 | SREENIVAS, ADITYA | INTEL CORPORATION, A CORPORATION OF DELAWARE | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 010842 | /0745 | |
Apr 18 2000 | JENSEN, SAM | INTEL CORPORATION, A CORPORATION OF DELAWARE | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 010842 | /0745 |
Date | Maintenance Fee Events |
Oct 06 2005 | ASPN: Payor Number Assigned. |
Mar 06 2006 | M1551: Payment of Maintenance Fee, 4th Year, Large Entity. |
Mar 18 2010 | M1552: Payment of Maintenance Fee, 8th Year, Large Entity. |
Mar 18 2010 | M1555: 7.5 yr surcharge - late pmt w/in 6 mo, Large Entity. |
Feb 19 2014 | M1553: Payment of Maintenance Fee, 12th Year, Large Entity. |
Date | Maintenance Schedule |
Sep 10 2005 | 4 years fee payment window open |
Mar 10 2006 | 6 months grace period start (w surcharge) |
Sep 10 2006 | patent expiry (for year 4) |
Sep 10 2008 | 2 years to revive unintentionally abandoned end. (for year 4) |
Sep 10 2009 | 8 years fee payment window open |
Mar 10 2010 | 6 months grace period start (w surcharge) |
Sep 10 2010 | patent expiry (for year 8) |
Sep 10 2012 | 2 years to revive unintentionally abandoned end. (for year 8) |
Sep 10 2013 | 12 years fee payment window open |
Mar 10 2014 | 6 months grace period start (w surcharge) |
Sep 10 2014 | patent expiry (for year 12) |
Sep 10 2016 | 2 years to revive unintentionally abandoned end. (for year 12) |