A Generic Logic for Proving Linearizability (Extended Version) Artem Khyzha1 , Alexey Gotsman1 , and Matthew Parkinson2 1 2

Source URL: software.imdea.org

A Generic Logic for Proving Linearizability Artem Khyzha1 , Alexey Gotsman1 , and Matthew Parkinson2 1 2 IMDEA Software Institute

Source URL: software.imdea.org

Proving Linearizability Using Partial Orders Artem Khyzha1 , Mike Dodds2 , Alexey Gotsman1 , and Matthew Parkinson3 1 IMDEA Software Institute, Madrid, Spain 2

Source URL: software.imdea.org

From Linearizability to Eventual Consistency Radha Jagadeesan and James Riely DePaul University Abstract We address the fundamental issue of interfaces that arises in the context of cloud computing; namely, what does it

Source URL: fpl.cs.depaul.edu

Local Linearizability Ana Sokolova joint work with: Andreas Haas Andreas Holzer

Source URL: forsyte.at

Design of Parallel and High-Performance Computing Fall 2013 Lecture: Linearizability Motivational video: https://www.youtube.com/watch?v=qx2dRIQXnbs

Source URL: spcl.inf.ethz.ch

Linearizability: A Correctness Condition for Concurrent Objects MAURICE P. HERLIHY and JEANNETTE Carnegie Mellon University M. WING

Source URL: www.cs.cornell.edu

Exercise 11: Counting 1 The goal of this exercise is to understand the consistency properties of the bounded max register implementation from the lecture. a) Show that if one always writes to R< if i < M , regardless of

Source URL: resources.mpi-inf.mpg.de

• Concurrency control
• Computing
• Computer architecture
• Computer engineering
• Linearizability
• Safe semantics
• Processor register
• Shared register
• Atomic semantics

Reagents: Expressing and Composing Fine-grained Concurrency Aaron Turon Northeastern University

Source URL: www.mpi-sws.org

• Concurrency control
• Computing
• Transaction processing
• Data management
• Software
• Compare-and-swap
• Non-blocking algorithm
• Linearizability
• Software transactional memory
• Stack
• Reagent
• Atomicity

L8: Memory Models CSE 452 Winter 2016 “There are only two hard things in computer science: cache invalidation and naming things.”
 - Phil Karlton

Source URL: courses.cs.washington.edu

• Computing
• Computer architecture
• Transaction processing
• Concurrency control
• Consistency model
• Cache coherency
• Sequential consistency
• Linearizability
• Cache
• Eventual consistency
• Sync
• Weak consistency