@inproceedings{a83b5e67a62a4302ae70de31a4e29da2,
title = "Lock-free data-structure iterators",
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.",
keywords = "Concurrent data structures, Iterator, Linked-list, Lock-freedom, Skiplist, Snapshot, Wait-freedom",
author = "Erez Petrank and Shahar Timnat",
note = "Funding Information: This work was supported by the Israeli Science Foundation grant No. 283/10.; 27th International Symposium on Distributed Computing, DISC 2013 ; Conference date: 14-10-2013 Through 18-10-2013",
year = "2013",
doi = "10.1007/978-3-642-41527-2\_16",
language = "الإنجليزيّة",
isbn = "9783642415265",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "224--238",
booktitle = "Distributed Computing - 27th International Symposium, DISC 2013, Proceedings",
}