2011 · 112 citations · 23 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureData StructuresParallel AlgorithmsShared-memory MultiprocessingSynchronization PrimitivesComplexityLock-free AlgorithmsProgress GuaranteesShared MemoryShared Memory ManagementShared-memory AlgorithmsShared-memory ArchitectureWait-free Algorithms
We present a new simple wait-free universal construction, called Sim, that uses just a Fetch&Add and an LL/SC object and performs a constant number of shared memory accesses. We have implemented SIM in a real shared-memory machine. In theory terms, our practical version of SIM, called P-SIM, has worse complexity than its theoretical analog; in practice though, we experimentally show that P-SIM outperforms several state-of-the-art lock-based and lock-free techniques, and this given that it is wait-free, i.e., that it satisfies a stronger progress condition than all the algorithms it outperforms.
23
Maurice Herlihy · ACM Transactions on Programming Languages and Systems · 1991 · 1.8K citations · Full text