Nonsynchronous updating in the multiverse of cellular automata [PDF]
, 2015 In this paper we study updating effects on cellular automata rule space. We consider a subset of 6144 order-3 automata from the space of 262144 bi-dimensional outer-totalistic rules. We compare synchronous to asynchronous and sequential updatings. Focusing on two automata, we discuss how update changes destroy typical structures of these rules. Besides,
arxiv +1 more source
High-Performance Concurrency Control Mechanisms for Main-Memory Databases [PDF]
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 4, pp.
298-309 (2011), 2011 A database system optimized for in-memory storage can support much higher transaction rates than current systems. However, standard concurrency control methods used today do not scale to the high transaction rates achievable by such systems. In this paper we introduce two efficient concurrency control methods specifically designed for main-memory ...
arxiv
O$|$R$|$P$|$E -- A Data Semantics Driven Concurrency Control [PDF]
International Journal On Advances in Software, volume 9, numbers 1
and 2, 2016, 2023 This paper presents a concurrency control mechanism that does not follow a 'one concurrency control mechanism fits all needs' strategy. With the presented mechanism a transaction runs under several concurrency control mechanisms and the appropriate one is chosen based on the accessed data.
arxiv
Decentralizing MVCC by Leveraging Visibility [PDF]
arXiv, 2017 Multiversion Concurrency Control (MVCC) is a widely adopted concurrency control mechanism in database systems, which usually utilizes timestamps to resolve conflicts between transactions. However, centralized allocation of timestamps is a potential bottleneck for parallel transaction management. This bottleneck is becoming increasingly visible with the
arxiv
Multiversion Concurrency with Bounded Delay and Precise Garbage Collection [PDF]
, 2018 In this paper we are interested in bounding the number of instructions taken to process transactions. The main result is a multiversion transactional system that supports constant delay (extra instructions beyond running in isolation) for all read-only transactions, delay equal to the number of processes for writing transactions that are not concurrent
arxiv +1 more source
A TimeStamp based Multi-version STM Protocol that satisfies Opacity and Multi-Version Permissiveness [PDF]
arXiv, 2013 Software Transactional Memory Systems (STM) are a promising alternative to lock based systems for concurrency control in shared memory systems. In multiversion STM systems, each write on a transaction object produces a new version of that object. The advantage obtained by storing multiple versions is that one can ensure that read operations do not fail.
arxiv
Hate multiverse spreads malicious COVID-19 content online beyond individual platform control [PDF]
arXiv, 2020 We show that malicious COVID-19 content, including hate speech, disinformation, and misinformation, exploits the multiverse of online hate to spread quickly beyond the control of any individual social media platform. Machine learning topic analysis shows quantitatively how online hate communities are weaponizing COVID-19, with topics evolving rapidly ...
arxiv
Postgres Server Developer Bruce Momjian Discusses Multiversion Concurrency Control [PDF]
, 2022 Robert Blumen
openalex +1 more source
Creek: Low-latency, Mixed-Consistency Transactional Replication Scheme [PDF]
arXiv, 2019 In this paper we introduce Creek, a low-latency, eventually consistent replication scheme that also enables execution of strongly consistent operations (akin to ACID transactions). Operations can have arbitrary complex (but deterministic) semantics. Similarly to state machine replication (SMR), Creek totally-orders all operations, but does so using two
arxiv
Experimental Performance Analysis of a Scalable Distributed Hyperledger Fabric for a Large-Scale IoT Testbed. [PDF]
Sensors (Basel), 2022 Honar Pajooh H +3 more
europepmc +1 more source