Embodiments of the invention relate generally to the field of information processing. More particularly, embodiments of the invention relate to techniques to enable cache coherency among agents operating in at least two different cache coherency domains.
As more functionality is integrated into computing platforms and microprocessors, information sharing among different functional units tends to increase. For example, the integration of graphics or other throughput logic into the same computing platform, package, or integrated circuit as one or more host central processing units (CPUs), or “cores”, may make it desirable to share information between the one or more cores and the graphics logic. In some prior art instances, where different functional units are integrated in the same system, package, or die, the information accessed (stored or read) by one or more cores is maintained in a corresponding cache hierarchy (e.g., level-1, mid-level, level-2 caches) that is in a different coherency domain than that of other functional units, such as graphics logic.
Maintaining data in different coherency domains among different cache addresses or according to different cache coherency domains, may require more cache memory to be used, which may increase system cost and power consumption. Moreover, in situations in which information is shared among the different functional units, maintaining different corresponding cache hierarchy domains can cause each functional unit to have to access a main memory source, such as DRAM, to share information among the different functional units. Main memory sources, such as DRAM, are typically slower in terms of access speed than other memory structures, such as cache. Therefore, resorting to main memory to share information among different functional units can degrade performance of the functional units and/or system.
Embodiments of the invention are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:
Embodiments of the invention relate to computer systems and information processing. More particularly, embodiments of the invention relate to techniques to allow at least one central processing unit (CPU) to gain visibility into, and therefore some level of coherence with, information being accessed or generated by another processing logic (e.g., graphics processing logic), which may operate in a different coherency domain than the at least one CPU. In some embodiments, one or more CPUs share a level of cache, such as a “last level cache” (LLC) or “level-2” (L2) cache, with one or more processing logic (e.g., graphics logic), which may implement a different coherency protocol or otherwise operate in a different coherency domain from the one or more CPUs. In one embodiment, a CPU and graphics logic are integrated within the same die, package, or system, and the CPU may have access to at least one level of cache in the graphics logic's cache coherency hierarchy as well as an LLC, which the graphics logic may also access, thereby allowing information to be shared between the CPU and the graphics logic without accessing a main memory source, such as DRAM.
In some embodiments, information stored in the graphics L1 cache 104, which may be addressed virtually by the graphics logic, is moved or copied to the graphics MLC 108 in response to the occurrence of various events associated with rendering a graphics image. In one embodiment, the moving/copying of information from the graphics L1 cache 104 to the MLC 108 is managed and performed by a graphics driver or some other logic or software program. After an event that causes the information in the graphics L1 cache 104 to be moved or copied to the MLC 108, the information is then within the CPU coherency domain and may be addressed and accessed by the CPU using physical addresses, in one embodiment, or other addressing schemes used by the CPU (e.g., virtual addresses).
In addition to the CPU and graphics coherency domains, the system of
In one embodiment, the graphics logic 105 may have access to information available or modifiable by the CPU without resorting to system memory 120, by accessing information stored by the CPU within the LLC 110 and snooping information in CPU's L1 (103) and CPU's MLC (107). Moreover, in one embodiment, the CPU may access, or “snoop”, information stored in the graphics logic's mid-level cache 108 without resorting to the LLC 110 or system memory 120. In one embodiment, information may be shared between the CPU coherency domain and the graphics logic coherency domain without the CPU or graphics device having to access main system memory, which take a significant amount of time relative to accessing the cache hierarchy. Moreover, in one embodiment, information may be shared between the CPU and graphics logic coherency domains without significantly altering or impacting the respective CPU or graphics cache coherency protocols.
In one embodiment, the graphics logic generates virtual addresses to access data within its cache coherency domain (111). However, some of the caches within the graphics coherency domain, such as those that are only read or otherwise “owned” by the graphics logic (“RIO caches”), may use only virtual tags, whereas other caches within the graphics coherency domain, such as those that are both read and written by the graphics logic (“R/W caches”), may use both virtual and physical tags in order to support both virtual and physical addressing. In one embodiment, graphics logic accesses to the cache hierarchy will be translated from virtual to physical addresses if there is a cache miss, so that the proper physical address in system memory can be generated.
In the CPU coherency domain, at least two rules may apply. First, cache coherency rules may require that access ordering on a per location basis are sequentially consistent with each other. Sequentially consistent accesses requires global, in-order, visibility for all operations accessing a cache location. Secondly, CPU ordering rules typically require writes by a single processor be observed to be the same by all processors, but writes from different processor may be observed in different orders. However, a processor must observe its own writes in the order of execution.
Graphics cache coherency domains can differ from those of a host CPU in a number of ways. For one, in graphics cache domains, coherency may only be guaranteed at certain points in the image rendering process, whereas coherency in typical CPU cache domains is continuously maintained. In addition, because graphics coherency domain caches are typically virtually addressed and not snooped, inclusion of information stored in the L1 or mid-level caches (MLC) within the LLC is not guaranteed. Therefore, when a line is evicted from the LLC the lower level caches may not be updated. To compensate, graphics logic may use an invalid-to-modified (“ItoM”) transaction to perform these eviction write-back transactions for full line evictions and read-for-ownership (RFO) transactions for partial line evictions. Lastly, graphics devices are typically non-speculative, out-of-order machines connected to an out of order un-core fabric. Because graphics logic cannot typically reorder accesses after issuing them to the cache hierarchy or memory, dependent accesses must ensure that their predecessor has been globally observed before they are issued.
Embodiments of the invention take into account differences between the graphics and CPU cache coherency domains while allowing data to be shared between the domains without resorting to accessing main system memory. In one embodiment, CPU cache coherency rules apply to any physically addressed structure, including the graphics logic's mid-level cache, LLC, and main memory. For cross-coherency boundary accesses between the CPU and graphics domains, the CPU may snoop the graphics MLC, which will behave the same as in the CPU coherency domain. Moreover, embodiments of the invention allow for the inclusion of data stored in the graphics L1 and MLC within the LLC, so that the graphics logic may make use of the LLC without resorting the main system memory. In one embodiment, data from the graphics L1 is included in the LLC by the graphics device copying or moving L1 data to its MLC in response to a rendering event, thereby putting the graphics L1 data within the CPU coherency domain and ensuring its inclusion the LLC. The graphics logic can then access this information later from the LLC if it's not found within the graphics L1 or MLC.
In some embodiments, the processor 200 may be a general purpose CPU. In other embodiments, the processor may be either a general purpose CPU or hardware that can perform graphics-specific functions within a system that may include both general purpose CPU integrated circuits as well as graphics-specific hardware or other parallel computational hardware. As general purpose computing becomes more integrated with parallel computational hardware, such as graphics engines, texture samples, etc., the more versatile and location-independent the logic 219 becomes. As a result, logic 219 could include hardware/software or any combination thereof and be located or integrated within or outside of any portion of the processor 200.
In one embodiment, logic 219 includes logic for enabling a CPU to snoop a graphics MLC without significantly modifying the cache coherency rules of either the CPU or the graphics logic. Moreover, logic 219 may include logic to allow the graphics device to access information within an LLC without first resorting to main memory. In addition, logic 219 may help to inform the CPU when information stored in the graphics L1 cache is now present in the graphics MLC, so that the CPU may snoop it.
In one embodiment, the system includes logic 319 for enabling a CPU to snoop a graphics MLC without significantly modifying the cache coherency rules of either the CPU or the graphics logic. Moreover, logic 319 may include logic to allow the graphics device to access information within an LLC without first resorting to main memory. In addition, logic 219 may help to inform the CPU when information stored in the graphics L1 cache is now present in the graphics MLC, so that the CPU may snoop it.
In some embodiments, some or all of the elements illustrated in
Furthermore, the cache memory may contain relatively fast memory cells, such as a six-transistor (6T) cell, or other memory cell of approximately equal or faster access speed.
In addition to the shared-bus computer system illustrated in
In one embodiment,
One or more aspects of at least one embodiment may be implemented by representative data stored on a machine-readable medium which represents various logic within the processor, which when read by a machine causes the machine to fabricate logic to perform the techniques described herein. Such representations, known as “IP cores” may be stored on a tangible, machine readable medium (“tape”) and supplied to various customers or manufacturing facilities to load into the fabrication machines that actually make the logic or processor.
Thus, a method and apparatus for directing micro-architectural memory region accesses has been described. It is to be understood that the above description is intended to be illustrative and not restrictive. Many other embodiments will be apparent to those of skill in the art upon reading and understanding the above description. The scope of the invention should, therefore, be determined with reference to the appended claims, along with the full scope of equivalents to which such claims are entitled.
This application is a Continuation of application Ser. No. 14/158,865, filed Jan. 20, 2014; which is a Continuation of application Ser. No. 13/722,440, filed Dec. 20, 2012, now U.S. Pat. No. 8,643,660 issued on Feb. 4, 2014; which is a Continuation of application Ser. No. 13/447,279, filed Apr. 15, 2012, now U.S. Pat. No. 9,035,960 issued on May 19, 2015; which is a Continuation of application Ser. No. 12/057,601, filed Mar. 28, 2008, now U.S. Pat. No. 9,035,959 issued on May 19, 2015. U.S. Pat. No. 9,035,959 is hereby incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4991081 | Bosshart | Feb 1991 | A |
6237064 | Kumar et al. | May 2001 | B1 |
6483516 | Tischler | Nov 2002 | B1 |
6801207 | Tischler et al. | Oct 2004 | B1 |
6891543 | Wyatt | May 2005 | B2 |
7023445 | Sell | Apr 2006 | B1 |
7814279 | Clark et al. | Oct 2010 | B2 |
20020116576 | Keshava et al. | Aug 2002 | A1 |
20030210248 | Wyatt | Nov 2003 | A1 |
20050240850 | Ohwada et al. | Oct 2005 | A1 |
20060080508 | Hoover et al. | Apr 2006 | A1 |
20060095672 | Andrews et al. | May 2006 | A1 |
20060098022 | Andrews et al. | May 2006 | A1 |
20060271743 | Clark et al. | Nov 2006 | A1 |
20070186057 | Moll et al. | Aug 2007 | A1 |
20070214321 | Shannon et al. | Sep 2007 | A1 |
20080046658 | Goodman et al. | Feb 2008 | A1 |
20090153211 | Hendin et al. | Jun 2009 | A1 |
20100235542 | Visharam et al. | Sep 2010 | A1 |
Number | Date | Country |
---|---|---|
1666182 | Sep 2005 | CN |
101042679 | Sep 2007 | CN |
102007012058 | Jan 2008 | DE |
2487328 | Jul 2012 | GB |
2490821 | Nov 2012 | GB |
10-214222 | Aug 1998 | JP |
2000-305841 | Nov 2000 | JP |
2004-326633 | Nov 2004 | JP |
2007-80266 | Mar 2007 | JP |
2007-207223 | Aug 2007 | JP |
2007-257631 | Oct 2007 | JP |
2007-257637 | Oct 2007 | JP |
2008-97598 | Apr 2008 | JP |
2011-515001 | May 2011 | JP |
2009120997 | Oct 2009 | WO |
2009120997 | Dec 2009 | WO |
Entry |
---|
Office Action received for Chinese Patent Application No. 201410024970.5, dated Mar. 8, 2017, 7 pages of Chinese Office Action including 3 pages of English Translation. |
Office Action received for Chinese Patent Application No. 201410024970.5, dated Mar. 29, 2017, 6 pages of Chinese Office Action including 3 pages of English Translation. |
Office Action received for Japanese Patent Application No. 2016-028904, dated Apr. 4, 2017, 6 pages of Japanese Office Action including 3 pages of English Translation. |
Non-Final Office Action received for U.S. Appl. No. 15/393,921, dated Jun. 16, 2017, 8 pages. |
Notice of Allowance received for Chinese Patent Application No. 201410024970.5, dated Jun. 15, 2017, 4 pages of Chinese Notice of Allowance including 2 pages of English Translation. |
Third-Party Submission Under 37 CFR 1.290 filed in U.S. Appl. No. 15/393,883 dated Aug. 8, 2017, 10 pages. |
Archibald, et al., “An Economical Solution to the Cache Coherence Problem”, In Proceedings of the 11th Symposium on Computer Architecture, 1984, pp. 355-362. |
Baer, et al., “On the Inclusion Properties for Multi-Level Cache Hierarchies”, The 15th Annual International Symposium on Computer Architecture, Conference Proceedings, Honolulu, HI, 1988, pp. 73-80. |
Censier, et al., “A New Solution to Coherence Problems in Multicache Systems”, IEEE Transactions on Computers, vol. C-27, No. 12, Dec. 1978, pp. 1112-1118. |
Shinji, Shiota, “Details—Sandy Bridge Architecture”, ASCII Technologies, ASCII Media Works Co., Ltd, No. 4, vol. 16, Feb. 24, 2011, 13 pages including 1 page of English Abstract. |
Office Action received for German Patent Application No. 112009000373.7, dated Apr. 8, 2011, 3 pages of Office Action and 2 pages of English Translation. |
Final Office Action received for U.S. Appl. No. 12/057,601, dated Aug. 16, 2011, 9 Pages. |
Non-Final Office Action received for U.S. Appl. No. 12/057,601, dated Jan. 31, 2011, 9 Pages. |
Notice of Allowance received for U.S. Appl. No. 12/057,601, dated Apr. 14, 2015, 5 Pages. |
Office Action received for Great Britain Application No. 1207247.6, dated May 11, 2012, 4 Pages. |
Notice of Allowance received for Great Britain Patent Application No. 1214187.5, dated Jan. 2, 2013, 2 pages. |
Office Action received for Great Britain Application No. 1214187.5, dated Sep. 5, 2012, 4 Pages. |
Notice of Allowance received for Great Britain Patent Application No. 1221421.9, dated Feb. 26, 2013, 2 pages. |
Office Action received for Great Britain Application No. 1221421.9, dated Dec. 12, 2012, 8 Pages. |
Office Action received for Great Britain Application No. 1222945.6, dated Jan. 18, 2013, 6 Pages. |
Final Office Action received for U.S. Appl. No. 13/447,279, dated Apr. 5, 2013, 8 pages. |
Final Office Action received for U.S. Appl. No. 13/447,279, dated Aug. 1, 2014, 10 Pages. |
Non-Final Office Action received for U.S. Appl. No. 13/447,279, dated Jan. 30, 2014, 12 Pages. |
Non-Final Office Action received for U.S. Appl. No. 13/447,279, dated Oct. 15, 2012, 8 Pages. |
Notice of Allowance received for U.S. Appl. No. 13/447,279, dated Mar. 30, 2015, 5 Pages. |
Notice of Allowance received for U.S. Appl. No. 13/447,279 dated Dec. 17, 2014, 5 Pages. |
Notice of Allowance received for U.S. Appl. No. 13/722,440, dated Oct. 2, 2013, 8 Pages. |
Office Action Received for U.S. Appl. No. 13/722,440, dated Apr. 22, 2013, 6 Pages. |
Notice of Allowance received for U.S. Appl. No. 13/844,214, dated Mar. 24, 2015, 5 Pages. |
Office Action received for U.S. Appl. No. 13/844,214, dated Oct. 23, 2014, 8 Pages. |
Final Office Action Received for U.S. Appl. No. 14/158,865, dated Jun. 3, 2016, 12 pages. |
Non Final Office Action received for U.S. Appl. No. 14/158,865, dated Sep. 10, 2015, 14 pages. |
Notice of Allowance received for U.S. Appl. No. 14/158,865, dated Jan. 27, 2017, 8 pages. |
Notice of Allowance received for Chinese Patent Application No. 200980110677.8, dated Dec. 18, 2014, 4 pages (2 pages of English translation and 2 pages of Official copy). |
Office Action received for Chinese Application No. 200980110677.8, dated Nov. 14, 2012, 13 pages (5 Pages of Chinese Office Action and 8 Pages of English Translation). |
Dffice Action Received for Chinese Patent Application No. 200980110677.8, dated Feb. 15, 2012, 11 Pages , (5 Pages of Chinese Office Action and 6 Pages of English Translation). |
Office Action received for Chinese Patent Application No. 200980110677.8, dated Jul. 17, 2013, 3 pages of Chinese Office Action and 4 page of English Translation. |
Office action received for the Chinese application No. 200980110677.8, dated Apr. 8, 2014 7 pages of Chinese Office Action including 4 pages of English Translation. |
Office Action received for Japanese Application No. 2010-550927, dated Jul. 30, 2013, 3 pages of Chinese Office Action and 3 pages of English Translation. |
Office Action received for Japanese Application No. 2010-550927, dated Sep. 11, 2012, 4 Pages of Japanese Office Action and 3 Pages of English Translation. |
Office Action received for Japanese Application No. 2010-550927, dated Feb. 5, 2013, 3 Pages of Japanese Office Action and 3 Pages of English Translation. |
Notice of Allowance received for Chinese Patent Application No. 201210576427.7, dated Nov. 11, 2016, 4 pages (2 pages of English translation and 2 pages of Official copy). |
Office Action received for Chinese Patent Application No. 201210576427.7, dated Apr. 5, 2016, 7 pages (4 pages of English translation and 3 pages of Official copy). |
Office Action and Search Report received for Chinese Patent Application No. 201210576427.7, dated Jun. 2, 2015, 7 pages of Chinese Office Action and 7 pages of English Translation. |
Office action received for Japanese patent application No. 2012-279612, dated Jul. 23, 2013, 7 pages of Japanese Office Action including 3 pages of English Translation. |
Office Action received for Japanese Patent Application No. 2012-279612, dated Feb. 18, 2014, 5 pages of Japanese Office Action Including 3 pages of English Translation. |
Notice of Allowance received for Japanese Patent Application No. 2013-241853, dated Jan. 19, 2016, 3 pages of official copy only. |
Office Action received for Japanese Patent Application No. 2013-241853, dated Feb. 24, 2015, 3 pages of English Translation and 3 pages of Japanese Office Action. |
Office Action received for Japanese Patent Application No. 2013-241853, dated Jul. 8, 2014, 10 pages of Japanese Office Action including 5 pages of English Translation. |
Notice of Allowance received for Japanese Patent Application No. 2014-008392, dated Jan. 19, 2016, 3 pages of official copy only. |
Office Action received for Japanese Patent application No. 2014-008392, dated Sep. 24, 2014, 5 pages of English Translation and 5 pages of Japanese Office Action. |
Office Action received for Japanese Patent Application No. 2014-008392, dated Feb. 24, 2015, 2 pages of English Translation and 2 pages of Japanese Office Action. |
Office Action received for Chinese Patent Application No. 201410024970.5, dated Apr. 5, 2016, 18 pages (11 pages of English Translation and 7 pages Of Official Copy). |
Notice of Allowance received for Japanese Patent Application No. 2014-124390 , dated Jan. 19, 2016, 3 pages of official copy only. |
Office Action received for Japanese Patent Application No. 2014-124390, dated Apr. 28, 2015, 6 pages of English Translation and 4 pages of Japanese Office Action. |
Andrews, et al., “XBox 360 System Architecture”, Microsoft Corporation, Published by IEEE Computer Society, (Document 0272-1732), 2006, 37 pages. |
Lanterman, Prof. Aron, “Architectural Comparison: Xbox 360 vs. Playstation 3”, School of Electrical and Computer Engineering, ECE4893A/CS4803MPG: Multiccore and GPU Programming for Video Games, Georgia Institute of Technology, Sep. 26, 2007, 23 pages. |
International Preliminary Report on Patentability Received for PCT Patent Application No. PCT/US2009/038627, dated Sep. 28, 2010, 5 Pages. |
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2009/038627, dated Nov. 10, 2009, 11 Pages. |
Archibald,J. and J.-L. Baer. An economical solution to the cache coherence problem. In Proc. 11th Symposium on Computer Axhitecture, pp. 355-362, 1984. |
J. L. Baer and W. H. Wang, “On the inclusion properties for multi-level cache hierarchies,” [1988] The 15th Annual International Symposium on Computer Architecture. Conference Proceedings, Honolulu, HI, 1988, pp. 73-80. doi: 10.1109/ISCA.1988.5212. |
L. M. Censier and P. Feautrier, “A New Solution to Coherence Problems in Multicache Systems,” in IEEE Transactions on Computers, vol. C-27, No. 12, pp. 1112-1118, Dec. 1978. doi: 10.1109/TC.1978.1675013. |
Number | Date | Country | |
---|---|---|---|
20170109280 A1 | Apr 2017 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14158865 | Jan 2014 | US |
Child | 15393883 | US | |
Parent | 13722440 | Dec 2012 | US |
Child | 14158865 | US | |
Parent | 13447279 | Apr 2012 | US |
Child | 13722440 | US | |
Parent | 12057601 | Mar 2008 | US |
Child | 13447279 | US |