Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,158,932 papers from all fields of science
Search
Sign In
Create Free Account
Read-modify-write
Known as:
RMW
, Read modify write
, Read–modify–write
In computer science, read-modify-write is a class of atomic operations (such as test-and-set, fetch-and-add, and compare-and-swap) that both read a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
Arbiter (electronics)
Compare-and-swap
Computer science
Consensus (computer science)
Expand
Broader (2)
Computer memory
Concurrency control
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Transactional Read-Modify-Write Without Aborts
Wenjia Ruan
,
Yujie Liu
,
Michael F. Spear
ACM Transactions on Architecture and Code…
2015
Corpus ID: 17318393
Language-level transactions are said to provide “atomicity,” implying that the order of operations within a transaction should be…
Expand
2015
2015
Space Bounds for Reliable Multi-Writer Data Store: Inherent Cost of Read/Write Primitives
G. Chockler
,
D. Dobre
,
A. Shraer
,
A. Spiegelman
arXiv.org
2015
Corpus ID: 11474260
Reliable storage emulations from fault-prone components have established themselves as an algorithmic foundation of modern…
Expand
2015
2015
Advanced electric-field scanning probe lithography on molecular resist using active cantilever
M. Kaestner
,
Cemal Aydogan
,
+10 authors
I. Rangelow
2015
Corpus ID: 124043346
Abstract. The routine “on demand” fabrication of features smaller than 10 nm opens up new possibilities for the realization of…
Expand
2011
2011
A Read-Write Aware Replacement Policy for Phase Change Memory
Xi Zhang
,
Q. Hu
,
Dongsheng Wang
,
Chongmin Li
,
Haixia Wang
Advanced Parallel Programming Technologies
2011
Corpus ID: 1161187
Scaling DRAM will be increasingly difficult due to power and cost constraint. Phase Change Memory (PCM) is an emerging memory…
Expand
2009
2009
Taking the heat off transactions: Dynamic selection of pessimistic concurrency control
Nehir Sönmez
,
T. Harris
,
A. Cristal
,
O. Unsal
,
M. Valero
IEEE International Symposium on Parallel…
2009
Corpus ID: 6381621
In this paper we investigate feedback-directed dynamic selection between different implementations of atomic blocks. We initially…
Expand
2007
2007
The Design and Implementation of the Massively Parallel Processor Based on the Matrix Architecture
H. Noda
,
M. Nakajima
,
+12 authors
Toru Shimizu
IEEE Journal of Solid-State Circuits
2007
Corpus ID: 43656055
This paper describes the design and implementation of the massively parallel processor based on the matrix architecture which is…
Expand
2007
2007
Joint formation mechanism and strength in resistance microwelding of 316L stainless steel to Pt wire
Zheng Chen
2007
Corpus ID: 55447531
Resistance microwelding of 316L stainless steel to Pt wire has been performed. The interfacial metallurgical phenomena, joint…
Expand
2002
2002
Bit-wise read-compare-write scheme for low power read-modify-write DRAM operation
Yh Park
,
Sunkyu Choi
,
H. Yoo
2002
Corpus ID: 62701934
In order to save power consumption in read-modify-write (RMW) DRAM operation, a bit-wise read-compare-write (RCW) scheme is…
Expand
1999
1999
Surface Winds at Landfall of Hurricane Andrew (1992)—A Reply
Da‐Lin Zhang
,
Yubao Liu
,
M. Yau
1999
Corpus ID: 17726634
and ocean, separately, and then merging them along the coastline without including full dynamics and physics interaction,’’ as…
Expand
1998
1998
Fast mutual exclusion algorithms using read-modify-write and atomic read/write registers
Ting-Lu Huang
Proceedings of the International Conference on…
1998
Corpus ID: 17165346
Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE