US20090077320A1 - Direct access of cache lock set data without backing memory - Google Patents

Direct access of cache lock set data without backing memory Download PDF

Info

Publication number
US20090077320A1
US20090077320A1 US12/274,548 US27454808A US2009077320A1 US 20090077320 A1 US20090077320 A1 US 20090077320A1 US 27454808 A US27454808 A US 27454808A US 2009077320 A1 US2009077320 A1 US 2009077320A1
Authority
US
United States
Prior art keywords
cache
processor
lock set
data
address
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US12/274,548
Inventor
Russell D. Hoover
Eric O. Mejdrich
Sandra S. Woodward
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to US12/274,548 priority Critical patent/US20090077320A1/en
Publication of US20090077320A1 publication Critical patent/US20090077320A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/08Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/12Replacement control
    • G06F12/121Replacement control using replacement algorithms
    • G06F12/126Replacement control using replacement algorithms with special data handling, e.g. priority of data or instructions, handling errors or pinning
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/08Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0806Multiuser, multiprocessor or multiprocessing cache systems
    • G06F12/084Multiuser, multiprocessor or multiprocessing cache systems with a shared cache
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/25Using a specific main memory architecture
    • G06F2212/251Local memory within processor subsystem
    • G06F2212/2515Local memory within processor subsystem being configurable for different purposes, e.g. as cache or non-cache memory

Definitions

  • CPUs central processing units
  • GPUs graphics processing units
  • the CPUs typically utilize one or more high speed caches to provide high speed local access to data being currently manipulated, thus avoiding relatively slow accesses to external main memory.
  • Many highly computationally intensive applications involve transferring data, locally cached by one processor, to another processor.
  • Input data for the graphics processors is commonly produced by one or more of the CPUs.
  • the CPUs may produce or modify graphics primitives (utilized by the GPU) which thus reside in the CPU caches. Therefore, in such multiprocessor systems, this cached data is often transferred from the CPU to the GPU. Conventionally, this data transfer has been relatively slow as the data is first written to main memory (for backing) instead of directly between the processors, in an effort to maintain coherency.
  • the principles of the present invention generally provide methods and systems for transfers of data in a shared cache between multiple processors.
  • One embodiment provides a processor generally including one or more processing cores and at least one shared cache accessible by the processing cores.
  • the shared cache generally includes a plurality of cache lines that may be allocated to a lock set, wherein data stored in cache lines allocated to the lock set is transferred directly to an external processor without writing the data to external memory.
  • Another embodiment provides a system generally including main memory, a memory controller for accessing the main memory, a first processor and a second processor.
  • the first processor is capable of accessing the main memory via the memory controller and has at least one cache capable of being placed in a lock set mode wherein a plurality of cache lines of the cache are allocated to a lock set.
  • the second processor is capable of accessing data stored in one or more cache lines allocated to a lock set of the cache on the first processor without the data being written out to main memory.
  • FIG. 1 illustrates an exemplary system in accordance with embodiments of the present invention
  • FIGS. 2A and 2B illustrate an exemplary L2 cache configuration and an exemplary lock set address mapping, respectively, in accordance with embodiments of the present invention
  • FIG. 3 is a flow diagram of exemplary operations for lock set initialization and access in accordance with embodiments of the present invention.
  • FIG. 4 is a flow diagram of exemplary operations for lock set access in accordance with embodiments of the present invention.
  • the principles of the present invention provide for quickly accessing data residing in a cache of one processor, by another processor, while avoiding lengthy accesses to main memory.
  • a portion of the cache may be placed in a lock set mode by the processor in which it resides. While in the lock set mode, this portion of the cache may be accessed directly by another processor without lengthy “backing” writes of the accessed data to main memory.
  • FIG. 1 schematically illustrates an exemplary multi-processor system 100 in which a portion (lock set 115 ) of an L2 cache 114 residing on a first processor (illustratively, a CPU 102 ) can be accessed directly by a second processor (illustratively, a GPU 104 ), without lengthy writes to main memory 138 .
  • FIG. 1 illustrates a graphics system in which main memory 138 is near a graphics processing unit (GPU) and is accessed by a memory controller 130 which, for some embodiments, is integrated with (i.e., located on) the GPU.
  • the system 100 may include an external memory controller or a memory controller integrated with a central processing unit (CPU).
  • CPU central processing unit
  • the system 100 includes a CPU 102 and a GPU 104 that communicate via a front side bus (FSB) 106 .
  • the CPU 102 illustratively includes a plurality of processor cores 108 , 110 , and 112 that perform tasks under the control of software.
  • the processor cores may each include any number of different type function units including, but not limited to arithmetic logic units (ALUs), floating point units (FPUs), and single instruction multiple data (SIMD) units. Examples of CPUs utilizing multiple processor cores include the Power PC line of CPUs, available from IBM.
  • Each individual core may have a corresponding L1 cache 160 and may communicate over a common bus 116 that connects to a core bus interface 118 .
  • the individual cores may share an L2 (secondary) cache memory 114 .
  • the core bus interface 118 communicates with the L2 cache memory 114 , and carries data transferred into and out of the CPU 102 via the FSB 106 , through a front-side bus interface 120 .
  • the GPU 104 also includes a front-side bus interface 124 that connects to the FSB 106 and that is used to pass information between the GPU 104 and the CPU 102 .
  • the GPU 104 is a high-performance video processing system that processes large amounts of data at very high speed using sophisticated data structures and processing techniques. To do so, the GPU 104 includes at least one graphics core 128 that processes data (obtained from main memory 138 or the CPU 102 ) via a memory controller 130 .
  • the memory controller 130 connects to the graphics front-side bus interface 124 via a bus interface unit (BIU) 125 . Data passes between the graphics core 128 and the memory controller 130 over a wide parallel bus 132 .
  • Connected to the memory controller 130 is a large main memory 138 .
  • the main memory 138 stores operating routines, application programs, and corresponding data that implement the operation of the system 100 in accord with the principles of the present invention.
  • the GPU 104 may also include an I/O port 140 that connects to an I/O driver 142 .
  • the I/O driver 142 passes data to and from any number of external devices, such as a mouse, video joy stick, computer board, and display.
  • the I/O driver 142 properly formats data and passes data to and from the graphic front-side bus interface 124 . That data is then passed to or from the CPU 102 or is used in the GPU 104 , possibly being stored in the main memory 138 by way of the memory controller 130 .
  • the graphics cores 128 , memory controller 130 , and I/O driver 142 may all communicate with the BIU 125 that provides access to the FSB via the GPU's FSB interface 124 .
  • the CPU may generate data for use by the GPU 104 .
  • the CPU may be used to pre-process data (e.g., performing complex mathematical operations) to generate graphics primitives for an image to be displayed on some type of display device by the GPU 104 .
  • the CPU processed data may be stored in the L2 cache 114 .
  • Such data is typically consumed by the GPU 104 and not processed further by any other processor. As a result, backing such data to main memory 138 may not be necessary and, in fact, may only result in additional latency in accessing the data by the GPU 104 .
  • latency associated with accessing the cached data by the GPU 104 may be reduced by allowing the GPU 104 to access a portion of the cache 114 containing the data (lock set 115 ) directly from the CPU 102 , without backing the cached data to main memory 138 .
  • the cache 114 may comprise a cache directory 202 , a set associative cache array 204 , and a cache controller 206 .
  • memory locations in main memory 138 may be mapped to particular associative sets 203 within the array 204 utilizing predetermined index bits within the system memory addresses.
  • the addresses of the particular cache lines 205 stored within the array 204 are recorded in the cache directory 202 , which typically contains one entry for each cache line in the array 204 .
  • Each entry in the directory 202 may include a tag field, which specifies the particular cache line stored in the array 204 , and a state field indicating the coherency state of the cache line (e.g., Modified, Exclusive, Shared, or Invalid states in accordance with the well known MESI coherency protocol).
  • a tag field which specifies the particular cache line stored in the array 204
  • a state field indicating the coherency state of the cache line (e.g., Modified, Exclusive, Shared, or Invalid states in accordance with the well known MESI coherency protocol).
  • the cache controller 206 may first examine the contents of the cache directory 204 for a match with an address supplied in the request to determine if a cache line containing the requested data is in the cache array 204 . If so, the cache controller may return the cached data to the requesting processing core. Otherwise, the cache controller 206 may initiate a request to main memory 138 .
  • a lock set 115 may be specified as one “way” spanning multiple associative sets of the cache array. Alternatively, a lock set may span a portion or all of one or more associative sets. In any case, in accordance with aspects of the present invention, to establish the lock set 115 , the cache 114 may be placed in a direct mapped mode during which a set of cache lines are allocated for the lock set 115 .
  • the cache lines in an L2 cache lock set may be mapped to some range of addresses that are non-overlapping with main memory.
  • data written, by processor instruction, to the address range allocated to the lock set may be routed directly to the corresponding portion of cache, rather than external memory.
  • FIG. 3 is a flow diagram of exemplary operations for lock set initialization and access in accordance with one embodiment of the present invention. As illustrated, the CPU 102 performs a set of operations 300 to initialize the lock set and modify data stored therein, while the GPU 104 performs another set of operations 320 to access that data.
  • the operations 300 begin, at step 302 , by placing the L2 cache 114 in a direct mapped mode.
  • cache lines to be allocated in the lock set may be addressed directly (e.g., using addresses in a range reserved for lock set cache lines as per FIG. 2B ).
  • cache lines for the lock set are allocated.
  • cache lines for the lock set may be allocated by issuing a cache instruction, such as a data cache block set to zero (DCBZ) instruction.
  • DCBZ data cache block set to zero
  • the number of DCBZ instructions may depend on how many cache lines are to be contained in the lock set, while the addresses specified with the DCBZ instructions may determine which portion of the cache 114 is used as the lock set.
  • the state for each cache line in the lock set may transition from invalid to modified (e.g., as the DCBZ instructions effectively constituted a store of zeros).
  • the cache may be placed in a class set mode.
  • the cache may be placed in the class set mode so the non-locked sets of the cache can be used for storage operations with addresses that are not in the locked set address range.
  • the CPU begins to process data, at step 308 , and store results in the lock set address range.
  • the CPU indicates the availability of data in the lock set to the GPU. As illustrated, the operations 308 and 310 may be repeated as necessary, for example, as the CPU 102 continues to process data for the GPU 104 .
  • the GPU 104 reads data directly from the lock set address range. These reads may be executed using Read With No Intent to Cache (RWNITC) requests, so that the coherency state of the requested cache line may remain unchanged (e.g., in the Modified state). As a result, because the state does not change to Shared, a cast out of the requested cache line (and associated latency) may be avoided.
  • RWNITC Read With No Intent to Cache
  • the GPU receives and processes the data. As illustrated, the operations 322 and 324 may be repeated as necessary, until all the necessary data has been retrieved from the L2 cache lock set 115 and processed. In other words, as the CPU 102 continues to process and generate new data, the GPU 104 may continue to read and further process this data.
  • the total amount of data processed by the CPU 102 for the GPU 104 may exceed the cache lines allocated for the lock set 115 .
  • the lock set 115 may be operated in a first-in, first-out (FIFO) manner allowing the CPU 102 to overwrite locations after they have been read by the GPU 104 .
  • data stored in the lock set 115 may be passed between the CPU 102 and the GPU 104 using a head pointer and tail pointer scheme.
  • FIG. 4 is a flow diagram of exemplary operations ( 400 and 420 performed by the CPU 102 and GPU 104 , respectively) for transferring data directly between the CPU 102 and GPU 104 , via the lock set 115 , utilizing head and tail pointers.
  • the CPU operations 400 begin, at step 402 , by reading a current value of a tail pointer 432 , which indicates to what address the CPU may write.
  • the tail pointer 432 may contain a value indicating an address up to which the GPU 104 has read data from the lock set 115 . In other words, the CPU 102 may safely store data up to this address without fear of overwriting data the GPU 104 has not yet read.
  • the CPU 102 stores data in the lock set 115 up the address indicated by the tail pointer 432 .
  • the CPU 102 writes a new address to a GPU 104 head pointer 436 (e.g., the value of a pointer 434 pointing to the last location in the lock set 115 modified by the CPU 102 ).
  • the GPU operations 420 begin, at step 422 , by reading the head pointer 436 , which indicates up to what lock set address the GPU 104 may read (without re-reading the same data).
  • the GPU reads data up to the address indicated by the head pointer 436 .
  • the GPU 104 writes a new address to the CPU tail pointer 432 . For example, if the GPU 104 has read up to the address stored in the head pointer 436 , the GPU 104 may write the same address back to the tail pointer on the CPU 102 .
  • the operations 400 and 420 may be repeated as the CPU 102 and GPU 104 continue to process data, all without incurring the conventional latency associated with backing such data to external memory.
  • Embodiments of the present invention are implemented as program products for use with computer systems such as, for example, the system 100 shown in FIG. 1 .
  • Those programs define functions of the embodiments (including the operations described above) and can be contained on a variety of signal-bearing media.
  • Illustrative signal-bearing media include, but are not limited to: (i) information permanently stored on non-writable storage media (e.g., read-only memory devices within a computer such as CD-ROM disks readable by a CD-ROM drive); (ii) alterable information stored on writable storage media (e.g., floppy disks within a diskette drive or hard-disk drive); and (iii) information conveyed to a computer by a communications medium, such as through a computer or telephone network, including wireless communications. The latter embodiment specifically includes information downloaded from the Internet and other networks.
  • Such signal-bearing media when carrying computer-readable instructions that direct the functions of the present invention, represent embodiments of the present invention.

Abstract

Apparatus and system for quickly accessing data residing in a cache of one processor, by another processor, while avoiding lengthy accesses to main memory are provided. A portion of the cache may be placed in a lock set mode by the processor in which it resides. While in the lock set mode, this portion of the cache may be accessed directly by another processor without lengthy “backing” writes of the accessed data to main memory.

Description

    CROSS-REFERENCE TO RELATED APPLICATIONS
  • This application is a continuation of co-pending U.S. patent application Ser. No. 10/961,752, filed Oct. 8, 2004, which is herein incorporated by reference in its entirety.
  • BACKGROUND OF THE INVENTION
  • Computer systems have been used for over 50 years to process digital information. Over that time, computers have developed into high speed devices that can process tremendous amount of information at high speeds and at low cost in a remarkable number of applications. However, new applications that demand even higher performance at lower cost continue to emerge.
  • One approach to achieving higher performance is to utilize multiple processors in a system, such as one or more central processing units (CPUs) and one or more graphics processing units (GPUs). The CPUs typically utilize one or more high speed caches to provide high speed local access to data being currently manipulated, thus avoiding relatively slow accesses to external main memory. Many highly computationally intensive applications involve transferring data, locally cached by one processor, to another processor.
  • For example, real-time rendering of graphical images is highly computationally intensive. Input data for the graphics processors is commonly produced by one or more of the CPUs. For example, the CPUs may produce or modify graphics primitives (utilized by the GPU) which thus reside in the CPU caches. Therefore, in such multiprocessor systems, this cached data is often transferred from the CPU to the GPU. Conventionally, this data transfer has been relatively slow as the data is first written to main memory (for backing) instead of directly between the processors, in an effort to maintain coherency.
  • Accordingly, there is a need for an improved method and system for speeding the transfer of data between processors, for example, without any actual backing of the data in external memory.
  • SUMMARY OF THE INVENTION
  • The principles of the present invention generally provide methods and systems for transfers of data in a shared cache between multiple processors.
  • One embodiment provides a processor generally including one or more processing cores and at least one shared cache accessible by the processing cores. The shared cache generally includes a plurality of cache lines that may be allocated to a lock set, wherein data stored in cache lines allocated to the lock set is transferred directly to an external processor without writing the data to external memory.
  • Another embodiment provides a system generally including main memory, a memory controller for accessing the main memory, a first processor and a second processor. The first processor is capable of accessing the main memory via the memory controller and has at least one cache capable of being placed in a lock set mode wherein a plurality of cache lines of the cache are allocated to a lock set. The second processor is capable of accessing data stored in one or more cache lines allocated to a lock set of the cache on the first processor without the data being written out to main memory.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • So that the manner in which the above recited features, advantages and objects of the present invention are attained and can be understood in detail, a more particular description of the invention, briefly summarized above, may be had by reference to the embodiments thereof which are illustrated in the appended drawings.
  • It is to be noted, however, that the appended drawings illustrate only typical embodiments of this invention and are therefore not to be considered limiting of its scope, for the invention may admit to other equally effective embodiments.
  • FIG. 1 illustrates an exemplary system in accordance with embodiments of the present invention;
  • FIGS. 2A and 2B illustrate an exemplary L2 cache configuration and an exemplary lock set address mapping, respectively, in accordance with embodiments of the present invention;
  • FIG. 3 is a flow diagram of exemplary operations for lock set initialization and access in accordance with embodiments of the present invention; and
  • FIG. 4 is a flow diagram of exemplary operations for lock set access in accordance with embodiments of the present invention.
  • DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
  • The principles of the present invention provide for quickly accessing data residing in a cache of one processor, by another processor, while avoiding lengthy accesses to main memory. For some embodiments, a portion of the cache may be placed in a lock set mode by the processor in which it resides. While in the lock set mode, this portion of the cache may be accessed directly by another processor without lengthy “backing” writes of the accessed data to main memory.
  • In the following description, reference is made to embodiments of the invention. However, it should be understood that the invention is not limited to specific described embodiments. Instead, any combination of the following features and elements, whether related to different embodiments or not, is contemplated to implement and practice the invention. Furthermore, in various embodiments the invention provides numerous advantages over the prior art. However, although embodiments of the invention may achieve advantages over other possible solutions and/or over the prior art, whether or not a particular advantage is achieved by a given embodiment is not limiting of the invention. Thus, the following aspects, features, embodiments and advantages are merely illustrative and, unless explicitly present, are not considered elements or limitations of the appended claims.
  • An Exemplary System
  • FIG. 1 schematically illustrates an exemplary multi-processor system 100 in which a portion (lock set 115) of an L2 cache 114 residing on a first processor (illustratively, a CPU 102) can be accessed directly by a second processor (illustratively, a GPU 104), without lengthy writes to main memory 138. FIG. 1 illustrates a graphics system in which main memory 138 is near a graphics processing unit (GPU) and is accessed by a memory controller 130 which, for some embodiments, is integrated with (i.e., located on) the GPU. For other embodiments, the system 100 may include an external memory controller or a memory controller integrated with a central processing unit (CPU). In any case, it should be noted that the techniques described herein with reference to directly accessing cache memories generally apply to any such configuration.
  • As shown, the system 100 includes a CPU 102 and a GPU 104 that communicate via a front side bus (FSB) 106. The CPU 102 illustratively includes a plurality of processor cores 108, 110, and 112 that perform tasks under the control of software. The processor cores may each include any number of different type function units including, but not limited to arithmetic logic units (ALUs), floating point units (FPUs), and single instruction multiple data (SIMD) units. Examples of CPUs utilizing multiple processor cores include the Power PC line of CPUs, available from IBM.
  • Each individual core may have a corresponding L1 cache 160 and may communicate over a common bus 116 that connects to a core bus interface 118. For some embodiments, the individual cores may share an L2 (secondary) cache memory 114. The core bus interface 118 communicates with the L2 cache memory 114, and carries data transferred into and out of the CPU 102 via the FSB 106, through a front-side bus interface 120.
  • The GPU 104 also includes a front-side bus interface 124 that connects to the FSB 106 and that is used to pass information between the GPU 104 and the CPU 102. The GPU 104 is a high-performance video processing system that processes large amounts of data at very high speed using sophisticated data structures and processing techniques. To do so, the GPU 104 includes at least one graphics core 128 that processes data (obtained from main memory 138 or the CPU 102) via a memory controller 130. The memory controller 130 connects to the graphics front-side bus interface 124 via a bus interface unit (BIU) 125. Data passes between the graphics core 128 and the memory controller 130 over a wide parallel bus 132. Connected to the memory controller 130 is a large main memory 138. The main memory 138 stores operating routines, application programs, and corresponding data that implement the operation of the system 100 in accord with the principles of the present invention.
  • For some embodiments, the GPU 104 may also include an I/O port 140 that connects to an I/O driver 142. The I/O driver 142 passes data to and from any number of external devices, such as a mouse, video joy stick, computer board, and display. The I/O driver 142 properly formats data and passes data to and from the graphic front-side bus interface 124. That data is then passed to or from the CPU 102 or is used in the GPU 104, possibly being stored in the main memory 138 by way of the memory controller 130. As illustrated, the graphics cores 128, memory controller 130, and I/O driver 142 may all communicate with the BIU 125 that provides access to the FSB via the GPU's FSB interface 124.
  • As previously described, for some applications, the CPU may generate data for use by the GPU 104. For example, the CPU may be used to pre-process data (e.g., performing complex mathematical operations) to generate graphics primitives for an image to be displayed on some type of display device by the GPU 104. In such applications, the CPU processed data may be stored in the L2 cache 114. Such data is typically consumed by the GPU 104 and not processed further by any other processor. As a result, backing such data to main memory 138 may not be necessary and, in fact, may only result in additional latency in accessing the data by the GPU 104.
  • Direct Access of Cache Lock Set Data
  • Accordingly, for such embodiments, latency associated with accessing the cached data by the GPU 104 may be reduced by allowing the GPU 104 to access a portion of the cache 114 containing the data (lock set 115) directly from the CPU 102, without backing the cached data to main memory 138.
  • As illustrated in FIG. 2A, for some embodiments, the cache 114 may comprise a cache directory 202, a set associative cache array 204, and a cache controller 206. As is well known, memory locations in main memory 138 may be mapped to particular associative sets 203 within the array 204 utilizing predetermined index bits within the system memory addresses. The addresses of the particular cache lines 205 stored within the array 204 are recorded in the cache directory 202, which typically contains one entry for each cache line in the array 204. Each entry in the directory 202 may include a tag field, which specifies the particular cache line stored in the array 204, and a state field indicating the coherency state of the cache line (e.g., Modified, Exclusive, Shared, or Invalid states in accordance with the well known MESI coherency protocol).
  • When receiving a request for data from a processing core, the cache controller 206 may first examine the contents of the cache directory 204 for a match with an address supplied in the request to determine if a cache line containing the requested data is in the cache array 204. If so, the cache controller may return the cached data to the requesting processing core. Otherwise, the cache controller 206 may initiate a request to main memory 138.
  • As illustrated, for some embodiments, a lock set 115 may be specified as one “way” spanning multiple associative sets of the cache array. Alternatively, a lock set may span a portion or all of one or more associative sets. In any case, in accordance with aspects of the present invention, to establish the lock set 115, the cache 114 may be placed in a direct mapped mode during which a set of cache lines are allocated for the lock set 115.
  • As illustrated in FIG. 2B, the cache lines in an L2 cache lock set may be mapped to some range of addresses that are non-overlapping with main memory. In other words, data written, by processor instruction, to the address range allocated to the lock set may be routed directly to the corresponding portion of cache, rather than external memory.
  • FIG. 3 is a flow diagram of exemplary operations for lock set initialization and access in accordance with one embodiment of the present invention. As illustrated, the CPU 102 performs a set of operations 300 to initialize the lock set and modify data stored therein, while the GPU 104 performs another set of operations 320 to access that data.
  • The operations 300 begin, at step 302, by placing the L2 cache 114 in a direct mapped mode. In this direct mapped mode, cache lines to be allocated in the lock set may be addressed directly (e.g., using addresses in a range reserved for lock set cache lines as per FIG. 2B). At step 304, cache lines for the lock set are allocated. For some embodiments, cache lines for the lock set may be allocated by issuing a cache instruction, such as a data cache block set to zero (DCBZ) instruction. For example, a DCBZ instruction may be issued for each cache line to be allocated to the lock set. Accordingly, the number of DCBZ instructions may depend on how many cache lines are to be contained in the lock set, while the addresses specified with the DCBZ instructions may determine which portion of the cache 114 is used as the lock set. As a result of these operations, the state for each cache line in the lock set may transition from invalid to modified (e.g., as the DCBZ instructions effectively constituted a store of zeros).
  • At step 306, the cache may be placed in a class set mode. The cache may be placed in the class set mode so the non-locked sets of the cache can be used for storage operations with addresses that are not in the locked set address range. With the lock set initialized, the CPU begins to process data, at step 308, and store results in the lock set address range. At step 310, the CPU indicates the availability of data in the lock set to the GPU. As illustrated, the operations 308 and 310 may be repeated as necessary, for example, as the CPU 102 continues to process data for the GPU 104.
  • At step 322, the GPU 104 reads data directly from the lock set address range. These reads may be executed using Read With No Intent to Cache (RWNITC) requests, so that the coherency state of the requested cache line may remain unchanged (e.g., in the Modified state). As a result, because the state does not change to Shared, a cast out of the requested cache line (and associated latency) may be avoided. At step 324, the GPU receives and processes the data. As illustrated, the operations 322 and 324 may be repeated as necessary, until all the necessary data has been retrieved from the L2 cache lock set 115 and processed. In other words, as the CPU 102 continues to process and generate new data, the GPU 104 may continue to read and further process this data.
  • For some applications, the total amount of data processed by the CPU 102 for the GPU 104 may exceed the cache lines allocated for the lock set 115. Accordingly, for some embodiments, the lock set 115 may be operated in a first-in, first-out (FIFO) manner allowing the CPU 102 to overwrite locations after they have been read by the GPU 104. In such embodiments, data stored in the lock set 115 may be passed between the CPU 102 and the GPU 104 using a head pointer and tail pointer scheme.
  • According to this scheme, the CPU 102 writes, to a head pointer on the GPU 104, an “end” address of data that has been updated and is ready to be read. In response, the GPU 104 may begin reading data from the L2 cache up to the address indicated by the head pointer. The GPU 104 may periodically write, to a tail pointer on the CPU 102, the address up to which the GPU 104 has read, in effect, notifying the CPU 102 that it may overwrite data up to this point (considering the pointers as circular). FIG. 4 is a flow diagram of exemplary operations (400 and 420 performed by the CPU 102 and GPU 104, respectively) for transferring data directly between the CPU 102 and GPU 104, via the lock set 115, utilizing head and tail pointers.
  • The CPU operations 400 begin, at step 402, by reading a current value of a tail pointer 432, which indicates to what address the CPU may write. For example, the tail pointer 432 may contain a value indicating an address up to which the GPU 104 has read data from the lock set 115. In other words, the CPU 102 may safely store data up to this address without fear of overwriting data the GPU 104 has not yet read. At step 404, the CPU 102 stores data in the lock set 115 up the address indicated by the tail pointer 432. At step 406, the CPU 102 writes a new address to a GPU 104 head pointer 436 (e.g., the value of a pointer 434 pointing to the last location in the lock set 115 modified by the CPU 102).
  • The GPU operations 420 begin, at step 422, by reading the head pointer 436, which indicates up to what lock set address the GPU 104 may read (without re-reading the same data). At step 424, the GPU reads data up to the address indicated by the head pointer 436. At step 426, the GPU 104 writes a new address to the CPU tail pointer 432. For example, if the GPU 104 has read up to the address stored in the head pointer 436, the GPU 104 may write the same address back to the tail pointer on the CPU 102. The operations 400 and 420 may be repeated as the CPU 102 and GPU 104 continue to process data, all without incurring the conventional latency associated with backing such data to external memory.
  • CONCLUSION
  • By utilizing a cache lock set with a reserved address space, data cached by one processor may be rapidly accessed by another processor, without accessing main memory. As a result, significant performance improvements may be achieved, particularly for applications in which large amounts of data are transferred from one processor to another, such as in a graphic processing system with a CPU processing data to be transferred to a GPU.
  • Embodiments of the present invention are implemented as program products for use with computer systems such as, for example, the system 100 shown in FIG. 1. Those programs define functions of the embodiments (including the operations described above) and can be contained on a variety of signal-bearing media. Illustrative signal-bearing media include, but are not limited to: (i) information permanently stored on non-writable storage media (e.g., read-only memory devices within a computer such as CD-ROM disks readable by a CD-ROM drive); (ii) alterable information stored on writable storage media (e.g., floppy disks within a diskette drive or hard-disk drive); and (iii) information conveyed to a computer by a communications medium, such as through a computer or telephone network, including wireless communications. The latter embodiment specifically includes information downloaded from the Internet and other networks. Such signal-bearing media, when carrying computer-readable instructions that direct the functions of the present invention, represent embodiments of the present invention.
  • While the foregoing is directed to embodiments of the present invention, other and further embodiments of the invention may be devised without departing from the basic scope thereof, and the scope thereof is determined by the claims that follow.

Claims (4)

1. A processor, comprising:
one or more processing cores;
at least one shared cache accessible by the one or more processing cores, the shared cache comprising a plurality of cache lines allocatable to a lock set, wherein data stored in cache lines allocated to the lock set is transferred directly to a processing core within an external processor without writing the data to external memory, and wherein the plurality of cache lines comprise only a limited portion of the cache; and
a pointer containing a value indicating a first address corresponding to the lock set, up to which the external processor has read data,
wherein data stored in a cache line allocated to the lock set is transferred to the external processor upon receiving a request from the external processor, the request being transferred to the processor upon determining that a second address supplied with the request falls within an address range of the lock set.
2. The processor of claim 1, wherein:
the shared cache comprises a plurality of associative sets; and
a portion of all of one or more of the associative sets may be allocated to the lock set.
3. The processor of claim 1, wherein the one or more processing cores comprises a plurality of processing cores, each having an associated primary cache.
4. A system, comprising:
main memory;
a memory controller for accessing the main memory;
a first processor capable of accessing the main memory via the memory controller, the first processor having at least one cache capable of being placed in a lock set mode wherein a plurality of cache lines of the cache are allocated to a lock set, wherein the plurality of cache lines comprise only a limited portion of the cache; and
a second processor capable of accessing and processing data stored in one or more cache lines allocated to a lock set of the cache on the first processor without the data being written out to main memory,
wherein the first processor is a central processing unit (CPU) having one or more processor cores that share the cache and the second processor is a graphics processing unit (GPU); and the memory controller is integrated with the GPU, and wherein:
the second processor is configured to generate a request for data to the memory controller; and
the memory controller is configured to:
determine whether an address supplied with the request falls within a first address range or a second address range, the first address range being reserved for the lock set and the second address range being reserved for the main memory;
upon determining that the address falls within the first address range, route the request to the first processor; and
upon determining that the address falls within the second address range, route the request to the main memory.
US12/274,548 2004-10-08 2008-11-20 Direct access of cache lock set data without backing memory Abandoned US20090077320A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US12/274,548 US20090077320A1 (en) 2004-10-08 2008-11-20 Direct access of cache lock set data without backing memory

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US10/961,752 US7475190B2 (en) 2004-10-08 2004-10-08 Direct access of cache lock set data without backing memory
US12/274,548 US20090077320A1 (en) 2004-10-08 2008-11-20 Direct access of cache lock set data without backing memory

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US10/961,752 Continuation US7475190B2 (en) 2004-10-08 2004-10-08 Direct access of cache lock set data without backing memory

Publications (1)

Publication Number Publication Date
US20090077320A1 true US20090077320A1 (en) 2009-03-19

Family

ID=36146682

Family Applications (2)

Application Number Title Priority Date Filing Date
US10/961,752 Expired - Fee Related US7475190B2 (en) 2004-10-08 2004-10-08 Direct access of cache lock set data without backing memory
US12/274,548 Abandoned US20090077320A1 (en) 2004-10-08 2008-11-20 Direct access of cache lock set data without backing memory

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US10/961,752 Expired - Fee Related US7475190B2 (en) 2004-10-08 2004-10-08 Direct access of cache lock set data without backing memory

Country Status (1)

Country Link
US (2) US7475190B2 (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100188411A1 (en) * 2009-01-23 2010-07-29 Advanced Micro Devices, Inc. Non-Graphics Use of Graphics Memory
US20110050710A1 (en) * 2009-09-03 2011-03-03 Advanced Micro Devices, Inc. Internal, Processing-Unit Memory For General-Purpose Use
WO2013095475A1 (en) * 2011-12-21 2013-06-27 Intel Corporation Apparatus and method for memory-hierarchy aware producer-consumer instruction
US20170031821A1 (en) * 2011-09-30 2017-02-02 Raj K. Ramanujan Apparatus and method for implementing a multi-level memory hierarchy having different operating modes
WO2024005941A1 (en) * 2022-06-28 2024-01-04 Advanced Micro Devices, Inc. Technique to enable simultaneous use of on-die sram as cache and memory

Families Citing this family (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7475190B2 (en) * 2004-10-08 2009-01-06 International Business Machines Corporation Direct access of cache lock set data without backing memory
US7937709B2 (en) 2004-12-29 2011-05-03 Intel Corporation Synchronizing multiple threads efficiently
JP4813843B2 (en) * 2005-08-04 2011-11-09 株式会社日立製作所 Storage device, disk cache control method, and disk cache capacity allocation method
US8533395B2 (en) * 2006-02-24 2013-09-10 Micron Technology, Inc. Moveable locked lines in a multi-level cache
US20080229325A1 (en) * 2007-03-15 2008-09-18 Supalov Alexander V Method and apparatus to use unmapped cache for interprocess communication
WO2010068200A1 (en) * 2008-12-10 2010-06-17 Hewlett-Packard Development Company, L.P. Shared cache access to i/o data
US20110145515A1 (en) * 2009-12-14 2011-06-16 Advanced Micro Devices, Inc. Method for modifying a shared data queue and processor configured to implement same
US8458405B2 (en) * 2010-06-23 2013-06-04 International Business Machines Corporation Cache bank modeling with variable access and busy times
CN102253919A (en) * 2011-05-25 2011-11-23 中国石油集团川庆钻探工程有限公司 Concurrent numerical simulation method and system based on GPU and CPU cooperative computing
WO2013141871A1 (en) * 2012-03-22 2013-09-26 Intel Corporation Application-reserved cache for direct i/o
TWI478055B (en) * 2012-12-11 2015-03-21 Gemtek Technology Co Ltd Asymmetrical multiprocessing multi-core system and network device
US20140267327A1 (en) 2013-03-14 2014-09-18 Microsoft Corporation Graphics Processing using Multiple Primitives
WO2014178450A1 (en) * 2013-04-30 2014-11-06 전자부품연구원 Collaboration system between cpu and gpu, and method thereof
US9684607B2 (en) 2015-02-25 2017-06-20 Microsoft Technology Licensing, Llc Automatic recovery of application cache warmth
US9684596B2 (en) * 2015-02-25 2017-06-20 Microsoft Technology Licensing, Llc Application cache replication to secondary application(s)
US9424192B1 (en) 2015-04-02 2016-08-23 International Business Machines Corporation Private memory table for reduced memory coherence traffic
US9842050B2 (en) * 2015-04-30 2017-12-12 International Business Machines Corporation Add-on memory coherence directory
US10303605B2 (en) * 2016-07-20 2019-05-28 Intel Corporation Increasing invalid to modified protocol occurrences in a computing system
US10133669B2 (en) 2016-11-15 2018-11-20 Intel Corporation Sequential data writes to increase invalid to modified protocol occurrences in a computing system
WO2019056358A1 (en) * 2017-09-25 2019-03-28 Intel Corporation Efficiently storing computer processor data structures in computer memory
CN114416387A (en) * 2021-12-06 2022-04-29 合肥杰发科技有限公司 Multi-operating system based on isomorphic multi-core, communication method and chip

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5586298A (en) * 1992-12-18 1996-12-17 Advanced Micro Devices, Inc. Effective use of memory bus in a multiprocessing environment by controlling end of data intervention by a snooping cache
US5875462A (en) * 1995-12-28 1999-02-23 Unisys Corporation Multi-processor data processing system with multiple second level caches mapable to all of addressable memory
US20030126515A1 (en) * 2002-01-02 2003-07-03 Abdo Ayman G. Automatic testing for multi-core architecture
US20040263519A1 (en) * 2003-06-30 2004-12-30 Microsoft Corporation System and method for parallel execution of data generation tasks

Family Cites Families (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3848234A (en) * 1973-04-04 1974-11-12 Sperry Rand Corp Multi-processor system with multiple cache memories
US5317716A (en) * 1988-08-16 1994-05-31 International Business Machines Corporation Multiple caches using state information indicating if cache line was previously modified and type of access rights granted to assign access rights to cache line
US5813030A (en) * 1991-12-31 1998-09-22 Compaq Computer Corp. Cache memory system with simultaneous access of cache and main memories
US5809525A (en) * 1993-09-17 1998-09-15 International Business Machines Corporation Multi-level computer cache system providing plural cache controllers associated with memory address ranges and having cache directories
US5581705A (en) 1993-12-13 1996-12-03 Cray Research, Inc. Messaging facility with hardware tail pointer and software implemented head pointer message queue for distributed memory massively parallel processing system
US6006299A (en) * 1994-03-01 1999-12-21 Intel Corporation Apparatus and method for caching lock conditions in a multi-processor system
US5692152A (en) * 1994-06-29 1997-11-25 Exponential Technology, Inc. Master-slave cache system with de-coupled data and tag pipelines and loop-back
JP3872118B2 (en) * 1995-03-20 2007-01-24 富士通株式会社 Cache coherence device
US5588110A (en) * 1995-05-23 1996-12-24 Symbios Logic Inc. Method for transferring data between two devices that insures data recovery in the event of a fault
US5841973A (en) 1996-03-13 1998-11-24 Cray Research, Inc. Messaging in distributed memory multiprocessing system having shell circuitry for atomic control of message storage queue's tail pointer structure in local memory
US5909696A (en) * 1996-06-04 1999-06-01 Intel Corporation Method and apparatus for caching system management mode information with other information
US20020103988A1 (en) * 1996-12-18 2002-08-01 Pascal Dornier Microprocessor with integrated interfaces to system memory and multiplexed input/output bus
US6055605A (en) * 1997-10-24 2000-04-25 Compaq Computer Corporation Technique for reducing latency of inter-reference ordering using commit signals in a multiprocessor system having shared caches
US6124868A (en) * 1998-03-24 2000-09-26 Ati Technologies, Inc. Method and apparatus for multiple co-processor utilization of a ring buffer
US6801207B1 (en) * 1998-10-09 2004-10-05 Advanced Micro Devices, Inc. Multimedia processor employing a shared CPU-graphics cache
US6363438B1 (en) 1999-02-03 2002-03-26 Sun Microsystems, Inc. Method of controlling DMA command buffer for holding sequence of DMA commands with head and tail pointers
US6449699B2 (en) 1999-03-29 2002-09-10 International Business Machines Corporation Apparatus and method for partitioned memory protection in cache coherent symmetric multiprocessor systems
CN1206594C (en) * 1999-12-17 2005-06-15 皇家菲利浦电子有限公司 Data processor with cache
US6791555B1 (en) * 2000-06-23 2004-09-14 Micron Technology, Inc. Apparatus and method for distributed memory control in a graphics processing system
US6801208B2 (en) * 2000-12-27 2004-10-05 Intel Corporation System and method for cache sharing
US6662275B2 (en) * 2001-02-12 2003-12-09 International Business Machines Corporation Efficient instruction cache coherency maintenance mechanism for scalable multiprocessor computer system with store-through data cache
US20020156977A1 (en) * 2001-04-23 2002-10-24 Derrick John E. Virtual caching of regenerable data
US20030005380A1 (en) * 2001-06-29 2003-01-02 Nguyen Hang T. Method and apparatus for testing multi-core processors
US6725296B2 (en) 2001-07-26 2004-04-20 International Business Machines Corporation Apparatus and method for managing work and completion queues using head and tail pointers
US6799247B1 (en) * 2001-08-23 2004-09-28 Cisco Technology, Inc. Remote memory processor architecture
US7065651B2 (en) * 2002-01-16 2006-06-20 Microsoft Corporation Secure video card methods and systems
US6820174B2 (en) 2002-01-18 2004-11-16 International Business Machines Corporation Multi-processor computer system using partition group directories to maintain cache coherence
US6839816B2 (en) * 2002-02-26 2005-01-04 International Business Machines Corporation Shared cache line update mechanism
US7103748B2 (en) 2002-12-12 2006-09-05 International Business Machines Corporation Memory management for real-time applications
US6820143B2 (en) 2002-12-17 2004-11-16 International Business Machines Corporation On-chip data transfer in multi-processor system
US6961820B2 (en) 2003-02-13 2005-11-01 International Business Machines Corporation System and method for identifying and accessing streaming data in a locked portion of a cache
US7023445B1 (en) * 2004-04-12 2006-04-04 Advanced Micro Devices, Inc. CPU and graphics unit with shared cache
US7475190B2 (en) * 2004-10-08 2009-01-06 International Business Machines Corporation Direct access of cache lock set data without backing memory

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5586298A (en) * 1992-12-18 1996-12-17 Advanced Micro Devices, Inc. Effective use of memory bus in a multiprocessing environment by controlling end of data intervention by a snooping cache
US5875462A (en) * 1995-12-28 1999-02-23 Unisys Corporation Multi-processor data processing system with multiple second level caches mapable to all of addressable memory
US20030126515A1 (en) * 2002-01-02 2003-07-03 Abdo Ayman G. Automatic testing for multi-core architecture
US20040263519A1 (en) * 2003-06-30 2004-12-30 Microsoft Corporation System and method for parallel execution of data generation tasks

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100188411A1 (en) * 2009-01-23 2010-07-29 Advanced Micro Devices, Inc. Non-Graphics Use of Graphics Memory
US8514233B2 (en) * 2009-01-23 2013-08-20 Advanced Micro Devices, Inc. Non-graphics use of graphics memory
US20110050710A1 (en) * 2009-09-03 2011-03-03 Advanced Micro Devices, Inc. Internal, Processing-Unit Memory For General-Purpose Use
JP2013504130A (en) * 2009-09-03 2013-02-04 アドバンスト・マイクロ・ディバイシズ・インコーポレイテッド Processing unit internal memory for general use
US8803897B2 (en) * 2009-09-03 2014-08-12 Advanced Micro Devices, Inc. Internal, processing-unit memory for general-purpose use
EP2473915B1 (en) * 2009-09-03 2017-03-15 Advanced Micro Devices, Inc. An internal processing-unit memory for general-purpose use
US20170031821A1 (en) * 2011-09-30 2017-02-02 Raj K. Ramanujan Apparatus and method for implementing a multi-level memory hierarchy having different operating modes
US10102126B2 (en) * 2011-09-30 2018-10-16 Intel Corporation Apparatus and method for implementing a multi-level memory hierarchy having different operating modes
US11132298B2 (en) 2011-09-30 2021-09-28 Intel Corporation Apparatus and method for implementing a multi-level memory hierarchy having different operating modes
WO2013095475A1 (en) * 2011-12-21 2013-06-27 Intel Corporation Apparatus and method for memory-hierarchy aware producer-consumer instruction
US9990287B2 (en) 2011-12-21 2018-06-05 Intel Corporation Apparatus and method for memory-hierarchy aware producer-consumer instruction
WO2024005941A1 (en) * 2022-06-28 2024-01-04 Advanced Micro Devices, Inc. Technique to enable simultaneous use of on-die sram as cache and memory

Also Published As

Publication number Publication date
US20060080398A1 (en) 2006-04-13
US7475190B2 (en) 2009-01-06

Similar Documents

Publication Publication Date Title
US20090077320A1 (en) Direct access of cache lock set data without backing memory
US10365930B2 (en) Instructions for managing a parallel cache hierarchy
JP5229968B2 (en) Multi-class data cache policy
US6801207B1 (en) Multimedia processor employing a shared CPU-graphics cache
US5649230A (en) System for transferring data using value in hardware FIFO'S unused data start pointer to update virtual FIFO'S start address pointer for fast context switching
US7120755B2 (en) Transfer of cache lines on-chip between processing cores in a multi-core system
US9952977B2 (en) Cache operations and policies for a multi-threaded client
JP3323212B2 (en) Data prefetching method and apparatus
TWI520071B (en) Sharing resources between a cpu and gpu
JP4941148B2 (en) Dedicated mechanism for page mapping in GPU
CN107506312B (en) Techniques to share information between different cache coherency domains
EP1208443B1 (en) Input/output (i/o) address translation in a bridge proximate to a local i/o bus
US6463510B1 (en) Apparatus for identifying memory requests originating on remote I/O devices as noncacheable
US6470429B1 (en) System for identifying memory requests as noncacheable or reduce cache coherence directory lookups and bus snoops
JPH11143775A (en) Cache memory system
JPH09259036A (en) Write-back cache and method for maintaining consistency in write-back cache
JP2010134929A (en) Compression status bit cache and backing storage device
US11829298B2 (en) On-demand memory allocation
US6412047B2 (en) Coherency protocol
WO2000000887A1 (en) Method and apparatus for transporting information to a graphic accelerator card
JP2003108439A (en) Processor system
JPH04102948A (en) Data processing system and method
US20030105929A1 (en) Cache status data structure
KR100569746B1 (en) Method and apparatus for optimizing data streaming in a computer system utilizing random access memory in a system logic device
US6704833B2 (en) Atomic transfer of a block of data

Legal Events

Date Code Title Description
STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION