Conditional load and store in a shared memory

Title: Conditional load and store in a shared memory

Full Record
Similar

A method, system and computer program product for implementing load-reserve and store-conditional instructions in a multi-processor computing system. The computing system includes a multitude of processor units and a shared memory cache, and each of the processor units has access to the memory cache. In one embodiment, the method comprises providing the memory cache with a series of reservation registers, and storing in these registers addresses reserved in the memory cache for the processor units as a result of issuing load-reserve requests. In this embodiment, when one of the processor units makes a request to store data in the memory cache using a store-conditional request, the reservation registers are checked to determine if an address in the memory cache is reserved for that processor unit. If an address in the memory cache is reserved for that processor, the data are stored at this address.

Inventors:: Blumrich, Matthias A; Ohmacht, Martin

Issue Date:: 2015-02-03

OSTI Identifier:: 1169055

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

Patent Number(s):: 8,949,539

Application Number:: 12/697,799

Contract Number:: B554331

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

Sponsoring Org:: USDOE

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING

Full Text
View Full Text

Similar records in DOepatents and OSTI.GOV collections:

Store operation with conditional push of a tag value to a queue

Patent Heidelberger, Philip ; Steinmacher-Burow, Burkhard

According to one embodiment, a method for a store operation with a conditional push of a tag value to a queue is provided. The method includes configuring a queue that is accessible by an application, setting a value at an address in a memory device including a memory and a controller, receiving a request for an operation using the value at the address and performing the operation. The method also includes the controller writing a result of the operation to the address, thus changing the value at the address, the controller determining if the result of the operation meets amore »« less
Full Text Available July 2015
Distributed metadata servers for cluster file systems using shared low latency persistent key-value metadata store

Patent Bent, John M. ; Faibish, Sorin ; Pedone, Jr., James M. ; Tzelnic, Percy ; Ting, Dennis P. J. ; Ionkov, Latchesar A. ; Grider, Gary

A cluster file system is provided having a plurality of distributed metadata servers with shared access to one or more shared low latency persistent key-value metadata stores. A metadata server comprises an abstract storage interface comprising a software interface module that communicates with at least one shared persistent key-value metadata store providing a key-value interface for persistent storage of key-value metadata. The software interface module provides the key-value metadata to the at least one shared persistent key-value metadata store in a key-value format. The shared persistent key-value metadata store is accessed by a plurality of metadata servers. A metadata requestmore »« less
Full Text Available December 2017
Silent store detection and recording in memory storage

Patent Bose, Pradip ; Cher, Chen-Yong ; Nair, Ravi

An aspect includes receiving a write request that includes a memory address and write data. Stored data is read from a memory location at the memory address. Based on determining that the memory location was not previously modified, the stored data is compared to the write data. Based on the stored data matching the write data, the write request is completed without writing the write data to the memory and a corresponding silent store bit, in a silent store bitmap is set. Based on the stored data not matching the write data, the write data is written to the memorymore »« less
Full Text Available September 2016
Partitioned key-value store with atomic memory operations

Patent Bent, John M. ; Faibish, Sorin ; Grider, Gary

A partitioned key-value store is provided that supports atomic memory operations. A server performs a memory operation in a partitioned key-value store by receiving a request from an application for at least one atomic memory operation, the atomic memory operation comprising a memory address identifier; and, in response to the atomic memory operation, performing one or more of (i) reading a client-side memory location identified by the memory address identifier and storing one or more key-value pairs from the client-side memory location in a local key-value store of the server; and (ii) obtaining one or more key-value pairs from themore »« less
Full Text Available February 2017
Silent store detection and recording in memory storage

Patent Bose, Pradip ; Cher, Chen-Yong ; Nair, Ravi

An aspect includes receiving a write request that includes a memory address and write data. Stored data is read from a memory location at the memory address. Based on determining that the memory location was not previously modified, the stored data is compared to the write data. Based on the stored data matching the write data, the write request is completed without writing the write data to the memory and a corresponding silent store bit, in a silent store bitmap is set. Based on the stored data not matching the write data, the write data is written to the memorymore »« less
Full Text Available March 2017