In the Search for Optimal Concurrency

DOI10.1007/978-3-319-48314-6_10zbMath1482.68151arXiv1603.01384OpenAlexW2547318546MaRDI QIDQ2835023

Petr Kuznetsov, Vincent Gramoli, Srivatsan Ravi

Publication date: 1 December 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.01384

zbMATH Keywords

lower boundsconcurrencysearch data structures

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

In the Search for Optimal Concurrency

Uses Software

• NOrec
• Synchrobench

Cites Work

• Unnamed Item
• Unnamed Item
• Safe locking policies for dynamic databases
• In the Search for Optimal Concurrency
• Permissiveness in Transactional Memories
• Serializability by Locking
• Commutativity-based concurrency control for abstract data types
• The serializability of concurrent database updates
• The semantics of progress in lock-based transactional memory
• Software transactional memory
• Abortable and query-abortable objects and their efficient implementation

This page was built for publication: In the Search for Optimal Concurrency