The Community for Technology Leaders
RSS Icon
Denver, CO
April 4, 2005 to April 8, 2005
ISBN: 0-7695-2312-9
pp: 24b
H?kan Sundell , Chalmers University of Technology and G?teborg University, Sweden
We present a practical wait-free implementation of a garbage collection scheme based on reference counting that uses atomic primitives which are available in modern computer systems. To the best of our knowledge, this is the first wait-free algorithm of a reference counting scheme that can support dynamic concurrent data structures. As all operations of wait-free algorithms are guaranteed to always finish in a finite number of their own steps independently of the other operations' actions, the new algorithm is especially suitable for real-time systems where execution time guarantees are of significant importance. We also present a wait-free algorithm of a free-list, for supporting concurrent allocation and freeing of memory blocks. The new algorithms are linearizable and are compatible to previous implementations of non-blocking dynamic data structures.
H?kan Sundell, "Wait-Free Reference Counting and Memory Management", IPDPS, 2005, Proceedings. 19th IEEE International Parallel and Distributed Processing Symposium, Proceedings. 19th IEEE International Parallel and Distributed Processing Symposium 2005, pp. 24b, doi:10.1109/IPDPS.2005.451
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool