5 citations · 10 across the 7 of their papers we have counts for
8 papers
Jiffy: A Lock-free Skip List with Batch Updates and Snapshots
Tadeusz Kobus, Maciej Kokociński, Paweł T. Wojciechowski
In this paper we introduce Jiffy, the first lock-free, linearizable ordered key-value index that offers both (1) batch updates, which are put and remove operations that are execute…
Creek: Low-latency, Mixed-Consistency Transactional Replication Scheme
Tadeusz Kobus, Maciej Kokociński, Paweł T. Wojciechowski
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).…
On Mixing Eventual and Strong Consistency: Acute Cloud Types
Maciej Kokociński, Tadeusz Kobus, Paweł T. Wojciechowski
In this article we study the properties of distributed systems that mix eventual and strong consistency. We formalize such systems through acute cloud types (ACTs), abstractions si…
Hybrid Transactional Replication: State-Machine and Deferred-Update Replication Combined
Tadeusz Kobus, Maciej Kokociński, Paweł T. Wojciechowski
We propose Hybrid Transactional Replication (HTR), a novel replication scheme for highly dependable services. It combines two schemes: a transaction is executed either optimistical…
Atomic RMI 2: Highly Parallel Pessimistic Distributed Transactional Memory
Konrad Siek, Paweł T. Wojciechowski
Distributed Transactional Memory (DTM) is an emerging approach to distributed synchronization based on the application of the transaction abstraction to distributed computation. DT…
The Optimal Pessimistic Transactional Memory Algorithm
Paweł T. Wojciechowski, Konrad Siek
Transactional Memory (TM) is an approach aiming to simplify concurrent programming by automating synchronization while maintaining efficiency. TM usually employs the optimistic con…
Helenos: A Realistic Benchmark for Distributed Transactional Memory
Jan Baranowski, Paweł Kobyliński, Konrad Siek +1
Transactional Memory (TM) is an approach to concurrency control that aims to make writing parallel programs both effective and simple. The approach is started in non-distributed mu…
Last-use Opacity: A Strong Safety Property for Transactional Memory with Early Release Support
Konrad Siek, Paweł T. Wojciechowski
Transaction Memory (TM) is a concurrency control abstraction that allows the programmer to specify blocks of code to be executed atomically as transactions. However, since transact…