Concept
Linearizability
Related publications (78)
WarpAttack: Bypassing CFI through Compiler-Introduced Double-Fetches
Mathias Josef Payer, Flavio Toffalini, Luca Di Bartolomeo, Jianhao Xu
Code-reuse attacks are dangerous threats that attracted the attention of the security community for years. These attacks aim at corrupting important control-flow transfers for taking control of a process without injecting code. Nowadays, the combinations o ...
IEEE COMPUTER SOC2023Efficient Multi-Word Compare and Swap
Rachid Guerraoui, Mihail Igor Zablotchi
Atomic lock-free multi-word compare-and-swap (MCAS) is a powerful tool for designing concurrent algorithms. Yet, its widespread usage has been limited because lock-free implementations of MCAS make heavy use of expensive compare-and-swap (CAS) instructions ...
Schloss Dagstuhl, Leibniz-Zentrum2020PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication
Willy Zwaenepoel, Diego Didona, Kristina Spirovska
Geo-replicated data platforms are at the backbone of several large-scale online services. Transactional Causal Consistency (TCC) is an attractive consistency level for building such platforms. TCC avoids many anomalies of eventual consistency, eschews the ...
2019PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication
Willy Zwaenepoel, Diego Didona, Kristina Spirovska
Geo-replicated data platforms are the backbone of several large-scale online services. Transactional Causal Consistency (TCC) is an attractive consistency level for building such platforms. TCC avoids many anomalies of eventual consistency, eschews the syn ...
IEEE COMPUTER SOC2019The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live
Rachid Guerraoui, Victor Bushkov, Panagiota Fatourou
We establish a theorem called the PCL theorem, which states that it is impossible to design a transactional memory algorithm that ensures (1) parallelism, i.e., transactions do not need to synchronize unless they access the same application objects, (2) ve ...
ASSOC COMPUTING MACHINERY2019Rethinking General-Purpose Decentralized Computing
Bryan Alexander Ford, Eleftherios Kokoris Kogias, Georgia Fragkouli, Enis Ceyhun Alp
While showing great promise, smart contracts are difficult to program correctly, as they need a deep understanding of cryptography and distributed algorithms, and offer limited functionality, as they have to be deterministic and cannot operate on secret da ...
ASSOC COMPUTING MACHINERY2019Brief Announcement: Persistent Multi-Word Compare-and-Swap
This brief announcement presents a fundamental concurrent primitive for persistent memory - a persistent atomic multi-word compare-and-swap (PMCAS). We present a novel algorithm carefully crafted to ensure that atomic updates to a multitude of words modifi ...
ASSOC COMPUTING MACHINERY2018Reliability Mechanisms for Controllers in Real-Time Cyber-Physical Systems
Cyber-physical systems (CPSs) are real-world processes that are controlled by computer algorithms. We consider CPSs where a centralized, software-based controller maintains the process in a desired state by exchanging measurements and setpoints with proces ...
EPFL2018Atomic object reads for in-memory rack-scale computing
Babak Falsafi, Boris Robert Grot, Alexandros Daglis
A distributed memory system including a plurality of chips, a plurality of nodes that are distributed across the plurality of chips such that each node is comprised within a chip, each node includes a dedicated local memory and a processor core, and each l ...
2018Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store
Willy Zwaenepoel, Diego Didona, Kristina Spirovska
Transactional Causal Consistency (TCC) extends causal consistency, the strongest consistency model compatible with availability, with interactive read-write transactions, and is therefore particularly appealing for geo-replicated platforms. This paper pres ...
2018