{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T21:07:59Z","timestamp":1708463279017},"reference-count":2,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2017,6]]},"abstract":"<jats:p> Shared data object implementations that allow non-blocking concurrent operations are useful for in-memory data-processing, especially when they support consistent bulk operations like iterations. We propose an algorithmic implementation for concurrent iterators on shared double-ended queues (deques), building on and complementing a known lock-free deque implementation by M. Michael. The proposed construction is linearizable and wait-free. Moreover, it is read-only, so it does not execute expensive synchronization primitives and it does not interfere with update operations. <\/jats:p>","DOI":"10.1142\/s0129626417500013","type":"journal-article","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T04:11:32Z","timestamp":1497931892000},"page":"1750001","source":"Crossref","is-referenced-by-count":3,"title":["Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues"],"prefix":"10.1142","volume":"27","author":[{"given":"Panagiota","family":"Fatourou","sequence":"first","affiliation":[{"name":"Institute of Computer Science, Foundation for Research and Technology\u2013Hellas and Department of Computer Science, University of Crete, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiannis","family":"Nikolakopoulos","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Chalmers University of Technology, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Papatriantafilou","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Chalmers University of Technology, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2017,6,20]]},"reference":[{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1145\/2370036.2145849"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.167"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626417500013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T09:22:16Z","timestamp":1565083336000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626417500013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":2,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2017,6,20]]},"published-print":{"date-parts":[[2017,6]]}},"alternative-id":["10.1142\/S0129626417500013"],"URL":"https:\/\/doi.org\/10.1142\/s0129626417500013","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6]]}}}