Non-blocking doubly-linked lists with good amortized complexity

DOI10.4230/LIPICS.OPODIS.2015.35MaRDI QIDQ5363826zbMATH OpenFDO

Authors Niloufar Shafiei

Publication date 29 September 2017

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

zbMATH Keywords

amortized complexitycursordoubly-linked listnon-blocking data structureshared memory

Mathematics Subject Classification ID

Distributed systems (68M14) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 2006660
• Built-In Coloring for Highly-Concurrent Doubly-Linked Lists
• Built-in coloring for highly-concurrent doubly-linked lists
• The amortized complexity of non-blocking binary search trees
• Lock-free deques and doubly linked lists

Cited in

(9)

• The amortized analysis of a non-blocking chromatic tree
• Built-in coloring for highly-concurrent doubly-linked lists
• Built-In Coloring for Highly-Concurrent Doubly-Linked Lists
• scientific article; zbMATH DE number 17818 (Why is no real title available?)
• scientific article; zbMATH DE number 2006660 (Why is no real title available?)
• The amortized analysis of a non-blocking chromatic tree
• Backing up in singly linked lists
• A Wait-free Queue with Polylogarithmic Step Complexity
• A wait-free queue with polylogarithmic step complexity

This page was built for publication: Non-blocking doubly-linked lists with good amortized complexity

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