Combining funnels: A dynamic approach to software combining
From MaRDI portal
Publication:1594527
DOI10.1006/jpdc.2000.1621zbMath0968.68196OpenAlexW1991869998MaRDI QIDQ1594527
Publication date: 13 September 2001
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/88ccb23fd9e66733e72f2fdb34c51fe1ce391494
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)
Related Items (8)
Bounded-wait combining: constructing robust and high-throughput shared objects ⋮ Randomized registers and iterative algorithms ⋮ Fast and scalable rendezvousing ⋮ Read-modify-write networks ⋮ Highly-efficient wait-free synchronization ⋮ A scalable lock-free stack algorithm ⋮ Lock-free concurrent binomial heaps ⋮ Unnamed Item
This page was built for publication: Combining funnels: A dynamic approach to software combining