Skip to search formSkip to main contentSkip to account menu

Read–write conflict

Known as: Read-Write conflict, Unrepeatable reads 
In computer science, in the field of databases, read–write conflict, also known as unrepeatable reads, is a computational anomaly associated with… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Alice and BobComputer scienceConcurrency controlCritical section

Broader (1)

Transaction processing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
A Solution for the Risk of Non-deterministic Transactions in Hyperledger Fabric
Blockchain is one of the most popular distributed ledger technologies. In order to solve the trustless problems between… 
2019
2019
Lockless Transaction Isolation in Hyperledger Fabric
Hyperledger Fabric is a distributed operating system for permissioned blockchains hosted by the Linux Foundation. It is the first… 
2017
2017
A 32-nm Subthreshold 7T SRAM Bit Cell With Read Assist
The implementation of the six-transistor (6T) static random access memory cell in deep submicrometer region has become difficult… 
2016
2016
Research on communication technology of complex system based on FPGA dual-port RAMs
The dual-port RAM based on FPGA plays an important role in the design of complex system. This paper firstly introduces the basic… 
2015
2015
Gating techniques for 6T SRAM cell using different modes of FinFET
This paper proposes the design of incorporating fine grain and coarse grain gating techniques for the SRAM cell and SRAM array… 
2012
2012
Low Power and Enhanced Noise Margins SRAM Using Novel Asymmetric FinFETs
This paper proposes a asymmetric FinFET (Fin shaped Field Effect Transistor) for robust and low power SRAM (Static Random Access… 
2011
2011
Tri-Mode Independent-Gate FinFETs for Dynamic Voltage/Frequency Scalable 6T SRAMs
In this paper, we present tri-mode independent-gate (IG) FinFETs for dynamic voltage/frequency scalable 6T SRAMs. The proposed… 
2009
2009
Efficient Dynamic Verification of Concurrent Programs
Revealing concurrency errors in multithreaded programs is difficult. Many "unexpected" thread interactions can only be manifested… 
2008
2008
An Intelligent Multi-Port Memory
  • Wang Zuo
  • International Symposium on Intelligent…
  • 2008
  • Corpus ID: 5082194
Multi-processors systems provide excellent computing ability for varied AI applications. Because processors may issue… 
1985
1985
Cautious transaction schedulers with admission control
We propose a new class of schedulers, called cautious schedulers, that grant an input request if it will not necessitate any… 
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)