Universal constructions that ensure disjoint-access parallelism and wait-freedom

DOI10.1007/s00446-015-0261-8zbMath1386.68030MaRDI QIDQ5890930

Eleftherios Kosmas, Faith Ellen, Alessia Milani, Corentin Travers, Panagiota Fatourou

Publication date: 17 October 2016

Published in: Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

concurrent programmingdisjoint-access parallelismimpossibility resultuniversal constructionwait-freedom

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Non-blocking Patricia tries with replace operations

Uses Software

• PSim

Cites Work

• Unnamed Item
• Unnamed Item
• Highly-efficient wait-free synchronization
• Highly concurrent multi-word synchronization
• Inherent limitations on disjoint-access parallel implementations of transactional memory
• Built-in coloring for highly-concurrent doubly-linked lists
• On the liveness of transactional memory
• On the space complexity of randomized synchronization
• Improved implementations of binary universal operations
• The RedBlue Adaptive Universal Constructions
• The serializability of concurrent database updates
• The PCL Theorem
• The semantics of progress in lock-based transactional memory
• Disjoint-access-parallel implementations of strong shared memory primitives
• Universal constructions for multi-object operations
• Software transactional memory
• Disentangling multi-object operations (extended abstract)
• Distributed Computing – IWDC 2005

This page was built for publication: Universal constructions that ensure disjoint-access parallelism and wait-freedom