Fast and scalable rendezvousing

DOI10.1007/S00446-013-0185-0zbMath1286.68064OpenAlexW2016023031MaRDI QIDQ2441532

Michael Hakimi, Adam Morrison, Yehuda Afek

Publication date: 25 March 2014

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

Full work available at URL: https://doi.org/10.1007/s00446-013-0185-0

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Distributed systems (68M14)

Uses Software

• Flat-Combining

Cites Work

• Unnamed Item
• Unnamed Item
• A scalable lock-free stack algorithm
• Elimination trees and the construction of pools and stacks
• Combining funnels: A dynamic approach to software combining
• Nonblocking Concurrent Data Structures with Condition Synchronization

This page was built for publication: Fast and scalable rendezvousing