An Optimal Implementation of Fetch-and-Increment
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 284-298
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Brief announcement2013
- Efficient Fetch-and-IncrementLecture Notes in Computer Science, 2012
- Optimal-time adaptive strong renaming, with applications to counting2011
- Efficiently Implementing a Large Number of LL/SC ObjectsLecture Notes in Computer Science, 2006
- A time complexity lower bound for randomized implementations of some shared objects1998
- Parallel Algorithms with Processor Failures and DelaysJournal of Algorithms, 1996
- Wait-free made fast1995
- A completeness theorem for a class of synchronization objects1993
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991