Cache directory look-up re-use as conflict check mechanism for speculative memory requests

Title: Cache directory look-up re-use as conflict check mechanism for speculative memory requests

Full Record
Other Related Research

Abstract

In a cache memory, energy and other efficiencies can be realized by saving a result of a cache directory lookup for sequential accesses to a same memory address. Where the cache is a point of coherence for speculative execution in a multiprocessor system, with directory lookups serving as the point of conflict detection, such saving becomes particularly advantageous.

Inventors:: Ohmacht, Martin

Publication Date:: 2013-09-10

Research Org.:: International Business Machines Corp., Armonk, NY (United States)

Sponsoring Org.:: USDOE

OSTI Identifier:: 1093237

Patent Number(s):: 8,533,399

Application Number:: 12/984,252

Assignee:: International Business Machines Corporation (Armonk, NY)

DOE Contract Number:: B554331

Resource Type:: Patent

Resource Relation:: Patent File Date: 2011 Jan 04

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING

Citation Formats


                    Ohmacht, Martin. Cache directory look-up re-use as conflict check mechanism for speculative memory requests.  United States: N. p., 2013. 
        Web.

Copy to clipboard


                    Ohmacht, Martin. Cache directory look-up re-use as conflict check mechanism for speculative memory requests.  United States.

Copy to clipboard


                    Ohmacht, Martin. Tue .  
        "Cache directory look-up re-use as conflict check mechanism for speculative memory requests".  United States.  https://www.osti.gov/servlets/purl/1093237.

Copy to clipboard


                    
@article{osti_1093237,

  title        = {Cache directory look-up re-use as conflict check mechanism for speculative memory requests},

  author       = {Ohmacht, Martin},

  abstractNote = {In a cache memory, energy and other efficiencies can be realized by saving a result of a cache directory lookup for sequential accesses to a same memory address. Where the cache is a point of coherence for speculative execution in a multiprocessor system, with directory lookups serving as the point of conflict detection, such saving becomes particularly advantageous.},

  doi          = {},

  url          = {https://www.osti.gov/biblio/1093237},
  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {2013},

  month        = {9}

}

Copy to clipboard

Patent:

View Patent

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

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
Reader set encoding for directory of shared cache memory in multiprocessor system

Patent Ahn, Dnaiel ; Ceze, Luis H. ; Gara, Alan ; ...

In a parallel processing system with speculative execution, conflict checking occurs in a directory lookup of a cache memory that is shared by all processors. In each case, the same physical memory address will map to the same set of that cache, no matter which processor originated that access. The directory includes a dynamic reader set encoding, indicating what speculative threads have read a particular line. This reader set encoding is used in conflict checking. A bitset encoding is used to specify particular threads that have read the line.
Full Text Available
Cache as point of coherence in multiprocessor system

Patent Blumrich, Matthias A. ; Ceze, Luis H. ; Chen, Dong ; ...

In a multiprocessor system, a conflict checking mechanism is implemented in the L2 cache memory. Different versions of speculative writes are maintained in different ways of the cache. A record of speculative writes is maintained in the cache directory. Conflict checking occurs as part of directory lookup. Speculative versions that do not conflict are aggregated into an aggregated version in a different way of the cache. Speculative memory access requests do not go to main memory.
Full Text Available
Evict on write, a management strategy for a prefetch unit and/or first level cache in a multiprocessor system with speculative execution

Patent Gara, Alan ; Ohmacht, Martin

In a multiprocessor system with at least two levels of cache, a speculative thread may run on a core processor in parallel with other threads. When the thread seeks to do a write to main memory, this access is to be written through the first level cache to the second level cache. After the write though, the corresponding line is deleted from the first level cache and/or prefetch unit, so that any further accesses to the same location in main memory have to be retrieved from the second level cache. The second level cache keeps track of multiple versions ofmore »« less
Full Text Available
Performance and scalability aspects of directory-based cache coherence in shared-memory multiprocessors

Conference Picano, S ; Meyer, D G ; Brooks, III, E D ; ...

We present a study that accentuates the performance and scalability aspects of directory-based cache coherence in multiprocessor systems. Using a multiprocessor with a software-based coherence scheme, efficient implementations rely heavily on the programmer`s ability to explicitly manage the memory system, which is typically handled by hardware support on other bus-based, shared memory multiprocessors. We describe a scalable, shared memory, cache coherent multiprocessor and present simulation results obtained on three parallel programs. This multiprocessor configuration exhibits high performance at no additional parallel programming cost.
Full Text Available

Similar Records