How to implement any concurrent data structure

2018 ◽  
Vol 61 (12) ◽  
pp. 97-105 ◽  
Author(s):  
Irina Calciu ◽  
Siddhartha Sen ◽  
Mahesh Balakrishnan ◽  
Marcos K. Aguilera
Keyword(s):  
Data Structure ◽  
Concurrent Data Structure

How to implement any concurrent data structure for modern servers

2017 ◽  
Vol 51 (1) ◽  
pp. 24-32 ◽  
Author(s):  
Irina Calciu ◽  
Siddhartha Sen ◽  
Mahesh Balakrishnan ◽  
Marcos K. Aguilera
Keyword(s):  
Data Structure ◽  
Concurrent Data Structure

scholarly journals A simple proof system for lock-free concurrency

10.29007/n3nk ◽  
2018 ◽  
Author(s):  
Luís Caires ◽  
Carla Ferreira ◽  
António Ravara
Keyword(s):  
Data Structure ◽  
Distributed Systems ◽  
Simple Proof ◽  
Proof System ◽  
Global State ◽  
Shared Resources ◽  
Conditional Model ◽  
Low Level ◽  
Concurrent Algorithms ◽  
Concurrent Data Structure

Concurrent algorithms classically relied on locks to guarantee the absence of interference when accessing shared resources. The massive use of distributed systems and of new multi-core architectures makes this approach unfeasible, and novel techniques are needed. Lock-Free algorithms have thus gained momentum. We define a core imperative calculus, equipped with concurrency and low level lock-free synchronization primitives, based on the Load-Link/Store-Conditional model. We propose a Hoare-Separation-style system to prove correct lock-free algorithms implemented in this language. Judgements distinguish local from global state, transfering knowledge between the worlds in the rules for loading and copying variables. We present a simple yet illustrative example of a proof for a concurrent data structure.

Sign in / Sign up

Export Citation Format

Share Document