{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:47:07Z","timestamp":1743061627159,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319240237"},{"type":"electronic","value":"9783319240244"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24024-4_20","type":"book-chapter","created":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T08:00:10Z","timestamp":1441353610000},"page":"358-369","source":"Crossref","is-referenced-by-count":1,"title":["Of Concurrent Data Structures and Iterations"],"prefix":"10.1007","author":[{"given":"Yiannis","family":"Nikolakopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders","family":"Gidenstam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Papatriantafilou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippas","family":"Tsigas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"key":"20_CR1","unstructured":"Intel threading building blocks documentation. \n                      http:\/\/software.intel.com\/sites\/products\/documentation\/doclib\/tbb_sa\/help\/index.htm\n                      \n                    . Accessed on 27 November 2012"},{"key":"20_CR2","unstructured":"Java platform standard edition 7 documentation. \n                      http:\/\/docs.oracle.com\/javase\/7\/docs\/index.html\n                      \n                    . Accessed on 06 December 2012"},{"key":"20_CR3","unstructured":".NET framework class library documentation. \n                      http:\/\/msdn.microsoft.com\/en-us\/library\/gg145045.aspx\n                      \n                    . Accessed on 10 May 2013"},{"key":"20_CR4","unstructured":"Python v2.7.5 documentation. \n                      http:\/\/docs.python.org\/2\/library\/itertools.html\n                      \n                    . Accessed on 10 September 2013"},{"issue":"4","key":"20_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02280833","volume":"7","author":"JH Anderson","year":"1994","unstructured":"Anderson, J.H.: Multi-writer composite registers. Distrib. Comput. 7(4), 175\u2013195 (1994)","journal-title":"Distrib. Comput."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Avni, H., Shavit, N., Suissa, A.: Leaplist: lessons learned in designing TM-supported range queries. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, PODC 2013, pp. 299\u2013308. ACM, New York, NY, USA (2013)","DOI":"10.1145\/2484239.2484254"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-35476-2_3","volume-title":"Principles of Distributed Systems","author":"T Brown","year":"2012","unstructured":"Brown, T., Avni, H.: Range queries in non-blocking k-ary search trees. In: Baldoni, R., Flocchini, P., Binoy, R. (eds.) OPODIS 2012. LNCS, vol. 7702, pp. 31\u201345. Springer, Heidelberg (2012)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Cederman, D., Chatterjee, B., Nguyen, N., Nikolakopoulos, Y., Papatriantafilou, M., Tsigas, P.: A study of the behavior of synchronization methods in commonly used languages and systems. In: 2013 IEEE 27th International Symposium on Parallel & Distributed Processing (IPDPS), pp. 1309\u20131320, May 2013","DOI":"10.1109\/IPDPS.2013.91"},{"key":"20_CR9","unstructured":"Cederman, D., Gidenstam, A., Ha, P., Sundell, H., Papatriantafilou, M., Tsigas, P.: Lock-free concurrent data structures. \n                      arXiv:1302.2757\n                      \n                     [cs], February 2013"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Cederman, D., Gulisano, V., Nikolakopoulos, Y., Papatriantafilou, M., Tsigas, P.: Brief announcement: concurrent data structures for efficient streaming aggregation. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014, pp. 76\u201378 (2014)","DOI":"10.1145\/2612669.2612701"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Dehne, F., Kong, Q., Rau-Chaplin, A., Zaboli, H., Zhou, R.: A distributed tree data structure for real-time OLAP on cloud architectures. In: 2013 IEEE International Conference on Big Data, pp. 499\u2013505, October 2013","DOI":"10.1109\/BigData.2013.6691613"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Dehne, F., Zaboli, H.: Parallel real-time OLAP on multi-core processors. In: Proceedings of the 2012 12th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012), pp. 588\u2013594 (2012)","DOI":"10.1109\/CCGrid.2012.19"},{"issue":"5","key":"20_CR13","doi-asserted-by":"publisher","first-page":"1848","DOI":"10.1137\/S0097539793243685","volume":"28","author":"C Dwork","year":"1999","unstructured":"Dwork, C., Herlihy, M., Plotkin, S., Waarts, O.: Time-lapse snapshots. SIAM J. Comput. 28(5), 1848\u20131874 (1999)","journal-title":"SIAM J. Comput."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Fatourou, P., Fich, F.E., Ruppert, E.: Time-space tradeoffs for implementations of snapshots. In: Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 169\u2013178, ACM, New York, NY, USA (2006)","DOI":"10.1145\/1132516.1132542"},{"issue":"8","key":"20_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1145\/2370036.2145849","volume":"47","author":"P Fatourou","year":"2012","unstructured":"Fatourou, P., Kallimanis, N.D.: Revisiting the combining synchronization technique. SIGPLAN Not. 47(8), 257\u2013266 (2012)","journal-title":"SIGPLAN Not."},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-30577-4_3","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"FE Fich","year":"2005","unstructured":"Fich, F.E.: How hard is it to take a snapshot? In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 28\u201337. Springer, Heidelberg (2005)"},{"issue":"5","key":"20_CR17","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1002\/cpe.1801","volume":"25","author":"A Gidenstam","year":"2013","unstructured":"Gidenstam, A., Koldehofe, B., Papatriantafilou, M., Tsigas, P.: Scalable group communication supporting configurable levels of consistency. Concurrency Comput: Pract. Experience 25(5), 649\u2013671 (2013)","journal-title":"Concurrency Comput: Pract. Experience"},{"issue":"2","key":"20_CR18","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/s00453-008-9268-x","volume":"58","author":"A Gidenstam","year":"2010","unstructured":"Gidenstam, A., Papatriantafilou, M., Tsigas, P.: NBmalloc: allocating memory in a lock-free manner. Algorithmica 58(2), 304\u2013338 (2010)","journal-title":"Algorithmica"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Gulisano, V., Nikolakopoulos, Y., Papatriantafilou, M., Tsigas, P.: ScaleJoin: a deterministic, disjoint-parallel and skew-resilient stream join enabled by concurrent data structures. Technical Report, Chalmers University of Technology (2014)","DOI":"10.1109\/BigData.2015.7363751"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/3-540-36108-1_18","volume-title":"Distributed Computing","author":"TL Harris","year":"2002","unstructured":"Harris, T.L., Fraser, K., Pratt, I.A.: A practical multi-word compare-and-swap operation. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 265\u2013279. Springer, Heidelberg (2002)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Hendler, D., Incze, I., Shavit, N., Tzafrir, M.: Flat combining and the synchronization-parallelism tradeoff. In: Proceedings of the Twenty-second Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2010, pp. 355\u2013364. ACM, New York, NY, USA (2010)","DOI":"10.1145\/1810479.1810540"},{"issue":"1","key":"20_CR22","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Prog. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"20_CR23","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: double-ended queues as an example. In: ICDCS 2003, IEEE Computer Society (2003)"},{"key":"20_CR24","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2008","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann, Burlington (2008)"},{"issue":"3","key":"20_CR25","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Prog. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: An optimal multi-writer snapshot algorithm. In: Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing, STOC 2005, pp. 723\u2013732. ACM, New York, NY, USA (2005)","DOI":"10.1145\/1060590.1060697"},{"issue":"7","key":"20_CR27","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1109\/71.296315","volume":"5","author":"L Kirousis","year":"1994","unstructured":"Kirousis, L., Spirakis, P., Tsigas, P.: Reading many variables in one atomic operation: solutions with linear or sublinear complexity. IEEE Trans. Parallel Distrib. Syst. 5(7), 688\u2013696 (1994)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"9","key":"20_CR28","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"C\u201328","author":"L Lamport","year":"1979","unstructured":"Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers C\u201328(9), 690\u2013691 (1979)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"20_CR29","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BF01786228","volume":"1","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication. Distrib. Comput. 1(2), 86\u2013101 (1986)","journal-title":"Distrib. Comput."},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-662-45174-8_19","volume-title":"Distributed Computing","author":"K Lev-Ari","year":"2014","unstructured":"Lev-Ari, K., Chockler, G., Keidar, I.: On correctness of data structures under reads-write concurrency. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 273\u2013287. Springer, Heidelberg (2014)"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Michael, M.M.: High performance dynamic lock-free hash tables and list-based sets. In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, ACM (2002)","DOI":"10.1145\/564870.564881"},{"issue":"9","key":"20_CR32","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/2500468.2500476","volume":"56","author":"MM Michael","year":"2013","unstructured":"Michael, M.M.: The balancing act of choosing nonblocking features. Commun. ACM 56(9), 46\u201353 (2013)","journal-title":"Commun. ACM"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1996, pp. 267\u2013275. ACM, New York, NY, USA (1996)","DOI":"10.1145\/248052.248106"},{"key":"20_CR34","unstructured":"Nikolakopoulos, Y., Gidenstam, A., Papatriantafilou, M., Tsigas, P.: Enhancing concurrent data structures with concurrent iteration operations: consistency and algorithms. Technical report, Chalmers University of Technology (2013)"},{"key":"20_CR35","doi-asserted-by":"crossref","unstructured":"Nikolakopoulos, Y., Gidenstam, A., Papatriantafilou, M., Tsigas, P.: A consistency framework for iteration operations in concurrent data structures. In: 2015 IEEE 29th International Symposium on Parallel & Distributed Processing (IPDPS) (2015)","DOI":"10.1109\/IPDPS.2015.84"},{"key":"20_CR36","volume-title":"Purely Functional Data Structures","author":"C Okasaki","year":"1999","unstructured":"Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, New York (1999)"},{"key":"20_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-41527-2_16","volume-title":"Distributed Computing","author":"E Petrank","year":"2013","unstructured":"Petrank, E., Timnat, S.: Lock-free data-structure iterators. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 224\u2013238. Springer, Heidelberg (2013)"},{"key":"20_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-23397-5_14","volume-title":"Euro-Par 2011 Parallel Processing","author":"A Prokopec","year":"2011","unstructured":"Prokopec, A., Bagwell, P., Rompf, T., Odersky, M.: A generic parallel collection framework. In: Jeannot, E., Namyst, R., Roman, J. (eds.) Euro-Par 2011, Part II. LNCS, vol. 6853, pp. 136\u2013147. Springer, Heidelberg (2011)"},{"key":"20_CR39","doi-asserted-by":"crossref","unstructured":"Prokopec, A., Bronson, N.G., Bagwell, P., Odersky, M.: Concurrent tries with efficient non-blocking snapshots. In: PPoPP 2012, pp. 151\u2013160. ACM (2012)","DOI":"10.1145\/2370036.2145836"},{"key":"20_CR40","unstructured":"Sundell, H., Tsigas, P.: NOBLE: a non-blocking inter-process communication library. In: Proceedings of the 6th Workshop on Languages, Compilers and Run-time Systems for Scalable Computers, Lecture Notes in Computer Science. Springer Verlag (2002)"},{"key":"20_CR41","doi-asserted-by":"crossref","unstructured":"Watt, S.M.: A technique for generic iteration and its optimization. In: Proceedings of the 2006 ACM SIGPLAN Workshop on Generic programming, WGP 2006, pp. 76\u201386. ACM (2006)","DOI":"10.1145\/1159861.1159872"},{"issue":"1","key":"20_CR42","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1137\/0214019","volume":"14","author":"DE Willard","year":"1985","unstructured":"Willard, D.E.: New data structures for orthogonal range queries. SIAM J. Comput. 14(1), 232\u2013253 (1985)","journal-title":"SIAM J. Comput."},{"key":"20_CR43","volume-title":"Algorithms + Data Structures = Programs","author":"N Wirth","year":"1978","unstructured":"Wirth, N.: Algorithms + Data Structures = Programs. Prentice Hall PTR, Upper Saddle River (1978)"}],"container-title":["Lecture Notes in Computer Science","Algorithms, Probability, Networks, and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24024-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T17:42:59Z","timestamp":1559238179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24024-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319240237","9783319240244"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24024-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}