Back to Search
Start Over
Lock-Free Data-Structure Iterators
- Source :
- Lecture Notes in Computer Science ISBN: 9783642415265, DISC
- Publication Year :
- 2013
- Publisher :
- Springer Berlin Heidelberg, 2013.
-
Abstract
- Concurrent data structures are often used with large concurrent software. An iterator that traverses the data structure items is a highly desirable interface that often exists for sequential data structures but is missing from almost all concurrent data-structure implementations. In this paper we introduce a technique for adding a linearizable wait-free iterator to a wait-free or a lock-free data structure that implements a set. We use this technique to implement an iterator for the wait-free and lock-free linked-lists and for the lock-free skip-list.
Details
- ISBN :
- 978-3-642-41526-5
- ISBNs :
- 9783642415265
- Database :
- OpenAIRE
- Journal :
- Lecture Notes in Computer Science ISBN: 9783642415265, DISC
- Accession number :
- edsair.doi...........b6f9876f30ce7a28ab1a1c8fdf6d100b