scientific article; zbMATH DE number 2006660

zbMATH Open1024.68521MaRDI QIDQ4436059FDOQ4436059

Authors: Timothy L. Harris 

Publication date: 23 November 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2180/21800300.htm

Title of this publication is not available (Why is that?)

Recommendations

• Pragmatic primitives for non-blocking data structures
• Non-blocking doubly-linked lists with good amortized complexity
• Lock-free deques and doubly linked lists
• Nonblocking \(k\)-compare-single-swap
• Built-in coloring for highly-concurrent doubly-linked lists

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (38)

• Title not available (Why is that?)
• The limits of helping in non-volatile memory data structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Wait-free concurrent graph objects with dynamic traversals
• Speeding Lamport's fast mutual exclusion algorithm
• Non-blocking Patricia tries with replace operations
• Concurrent linearizable nearest neighbour search in LockFree-kD-tree
• Liveness-Preserving Atomicity Abstraction
• Performance issues in non-blocking synchronization on shared-memory multiprocessors
• Make flows small again: revisiting the flow framework
• Lock-free deques and doubly linked lists
• Local reasoning for global graph properties
• Shadowed management of free disk pages with a linked list
• An efficient approach to achieve compositionality using optimized multi-version object based transactional systems
• Abstract specifications for concurrent maps
• In the search for optimal concurrency
• Order out of chaos: proving linearizability using local views
• Lock-free search data structures: throughput modeling with Poisson processes
• Nonblocking \(k\)-compare-single-swap
• Automated flaw detection in algebraic specifications
• Lower bounds on the amortized time complexity of shared objects
• NB{\texttt{malloc}}: Allocating memory in a lock-free manner
• The ERA Theorem for Safe Memory Reclamation
• Built-in coloring for highly-concurrent doubly-linked lists
• On the correctness of a lock-free compression-based elastic mechanism for a hash trie design
• Parallel implementations of Brunotte's algorithm
• A concurrent implementation of skip graphs
• Lower bounds on the amortized time complexity of shared objects
• Pragmatic primitives for non-blocking data structures
• Leaplist: lessons learned in designing TM-supported range queries
• Non-blocking doubly-linked lists with good amortized complexity
• Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions
• TSLQueue: an efficient lock-free design for priority queues
• Achieving starvation-freedom with greater concurrency in multi-version object-based transactional memory systems
• The amortized analysis of a non-blocking chromatic tree
• Built-In Coloring for Highly-Concurrent Doubly-Linked Lists
• Contention-sensitive data structures and algorithms

Uses Software

• SPIN
• dSPIN

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436059)