Bounded delay for a free address

DOI10.1007/s002360050042zbMath0849.68031OpenAlexW2109580929MaRDI QIDQ1901690

Wim H. Hesselink

Publication date: 19 November 1995

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://pure.rug.nl/ws/files/3243828/1996ActaInfHesselink.pdf

zbMATH Keywords

concurrent processescorrectness of algorithmsatomic actionsaddress searching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Related Items (2)

Lock-free dynamic hash tables with open addressing ⋮ Wait-free concurrent memory management by Create and Read until Deletion (CaRuD)

Uses Software

• NQTHM
• UNITY

Cites Work

• An axiomatic proof technique for parallel programs
• Renaming in an asynchronous environment
• Wait-free linearization with an assertional proof
• Immediate atomic snapshots and fast renaming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounded delay for a free address