Flavju Cristian, Houtan Aghili, et al.
Information and Computation
Paper
A Bounded First-in, First-Enabled Solution to the l-Exclusion Problem
Abstract
This article presents a solution to the first-come, first-enabled[Formulla Omitted]-exclusionproblem of Fischer et al. [1979]. Unlike their solution, thissolution does not use powerful read-modify-write synchronizationprimitives and requires only bounded shared memory. Use of the concurrent timestamp system of Dolevand Shavir [1989] is key in solving the problem within bounded sharedmemory. © 1994, ACM. All rights reserved.
Related
Conference paper
Fixing convergence of Gaussian belief propagation
Jason K. Johnson, Danny Bickson, et al.
ISIT 2009
Conference paper
Non-malleable cryptography
Danny Dolev, Cynthia Dwork, et al.
STOC 1991
Danny Dolev, Michael J. Fischer, et al.
Information and Control