Dynamic cache bypassing

Farmahini-Farahani, Amin; Roberts, David A.

Title: Dynamic cache bypassing

Full Record
Other Related Research

Abstract

A processing system fills a memory access request for data from a processor core by bypassing a cache when a write congestion condition is detected, and when transferring the data to the cache would cause eviction of a dirty cache line. The cache is bypassed by transferring the requested data to the processor core or to a different cache. Accordingly, the processing system can temporarily bypass the cache storing the dirty cache line when filling a memory access request, thereby avoiding the eviction and write back to main memory of a dirty cache line when a write congestion condition exists.

Inventors:: Farmahini-Farahani, Amin; Roberts, David A.

Issue Date:: 2020-03-24

Research Org.:: Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

Sponsoring Org.:: USDOE

OSTI Identifier:: 1637804

Patent Number(s):: 10599578

Application Number:: 15/377,537

Assignee:: Advanced Micro Devices, Inc. (Santa Clara, CA)

Patent Classifications (CPCs):: G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING

Y - NEW / CROSS SECTIONAL TECHNOLOGIES Y02 - TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE Y02D - CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THIR OWN ENERGY USE

Show more

G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
G06F12/0888 - using selective caching, e.g. bypass
G06F2212/1024 - Latency reduction
G06F12/0804 - with main memory updating
G06F2212/6046 - Using a specific cache allocation policy other than replacement policy
G06F2201/81 - Threshold
G06F2212/502 - using adaptive policy
G06F12/0806 - Multiuser, multiprocessor or multiprocessing cache systems
G06F11/3055 - {Monitoring arrangements for monitoring the status of the computing system or of the computing system component, e.g. monitoring if the computing system is on, off, available, not available
G06F11/3037 - {where the computing system component is a memory, e.g. virtual memory, cache
G06F2201/885 - Monitoring specific for caches

Y - NEW / CROSS SECTIONAL TECHNOLOGIES Y02 - TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE Y02D - CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THIR OWN ENERGY USE
Y02D10/00 - Energy efficient computing

G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
G06F12/121 - using replacement algorithms

Show less

DOE Contract Number:: AC52-07NA27344

Resource Type:: Patent

Resource Relation:: Patent File Date: 12/13/2016

Country of Publication:: United States

Language:: English

Citation Formats


                    Farmahini-Farahani, Amin, and Roberts, David A. Dynamic cache bypassing.  United States: N. p., 2020. 
        Web.

Copy to clipboard


                    Farmahini-Farahani, Amin, & Roberts, David A. Dynamic cache bypassing.  United States.

Copy to clipboard


                    Farmahini-Farahani, Amin, and Roberts, David A. Tue .  
        "Dynamic cache bypassing".  United States.  https://www.osti.gov/servlets/purl/1637804.

Copy to clipboard


                    
@article{osti_1637804,

  title        = {Dynamic cache bypassing},

  author       = {Farmahini-Farahani, Amin and Roberts, David A.},

  abstractNote = {A processing system fills a memory access request for data from a processor core by bypassing a cache when a write congestion condition is detected, and when transferring the data to the cache would cause eviction of a dirty cache line. The cache is bypassed by transferring the requested data to the processor core or to a different cache. Accordingly, the processing system can temporarily bypass the cache storing the dirty cache line when filling a memory access request, thereby avoiding the eviction and write back to main memory of a dirty cache line when a write congestion condition exists.},

  doi          = {},

  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {2020},

  month        = {3}

}

Copy to clipboard

Patent:

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE Patents and OSTI.GOV collections:

Dynamic remapping of cache lines

Patent Kalamatianos, John; John, Johnsy Kanjirapallil; Nevius, Phillip E.; ...

A method of managing cache memory includes accessing a cache memory at a primary index that corresponds to an address specified in an access request. A determination is made that accessing the cache memory at the primary index does not result in a cache hit on a cache line with an error-free status. In response to this determination, the primary index is mapped to a secondary index and data for the address is written to a cache line at the secondary index.
Full Text Available
Using predictions of outcomes of cache memory access requests for controlling whether a request generator sends memory access requests to a memory in parallel with cache memory access requests

Patent Yin, Jieming; Eckert, Yasuko; Poremba, Matthew R.; ...

An electronic device handles memory access requests for data in a memory. The electronic device includes a memory controller for the memory, a last-level cache memory, a request generator, and a predictor. The predictor determines a likelihood that a cache memory access request for data at a given address will hit in the last-level cache memory. Based on the likelihood, the predictor determines: whether a memory access request is to be sent by the request generator to the memory controller for the data in parallel with the cache memory access request being resolved in the last-level cache memory, and, whenmore » « less
Full Text Available
Cache directory lookup reader set encoding for partial cache line speculation support

Patent Gara, Alan; Ohmacht, Martin

In a multiprocessor system, with conflict checking implemented in a directory lookup of a shared cache memory, a reader set encoding permits dynamic recordation of read accesses. The reader set encoding includes an indication of a portion of a line read, for instance by indicating boundaries of read accesses. Different encodings may apply to different types of speculative execution.
Full Text Available
Compressing data for storage in cache memories in a hierarchy of cache memories

Patent Tomei, Matthew J.; Bedoukian, Philip B.; Das, Shomit N.

An electronic device includes at least one compression-decompression functional block and a hierarchy of cache memories with a first cache memory and a second cache memory. The at least one compression-decompression functional block receives data in an uncompressed state, compresses the data using one of a first compression or a second compression, and, after compressing the data, provides the data to the first cache memory for storage therein. When the data is retrieved from the first cache memory to be stored in the second cache memory, when the data is compressed using the first compression, the compression-decompression functional block decompressesmore » « less
Full Text Available
Light-weight cache coherence for data processors with limited data sharing

Patent Jayasena, Nuwan; Boyer, Michael

A data processing system includes a plurality of processors, local memories associated with a corresponding processor, and at least one inter-processor link. In response to a first processor performing a load or store operation on an address of a corresponding local memory that is not currently in the local cache, a local cache allocates a first cache line and encodes a local state with the first cache line. In response to a load operation from an address of a remote memory that is not currently in the local cache, the local cache allocates a second cache line and encodes amore » « less
Full Text Available

Similar Records