{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T01:41:59Z","timestamp":1709862119175},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,12,10]],"date-time":"2016-12-10T00:00:00Z","timestamp":1481328000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"ARISTEIA Action of the Operational Programme Education and Lifelong Learning","award":["1643"],"award-info":[{"award-number":["1643"]}]},{"name":"Euroserver - European Commission - 7th Framework Programme","award":["610456"],"award-info":[{"award-number":["610456"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00446-016-0286-7","type":"journal-article","created":{"date-parts":[[2016,12,10]],"date-time":"2016-12-10T14:29:52Z","timestamp":1481380192000},"page":"231-260","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Lower and upper bounds for single-scanner snapshot implementations"],"prefix":"10.1007","volume":"30","author":[{"given":"Panagiota","family":"Fatourou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos D.","family":"Kallimanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,10]]},"reference":[{"issue":"4","key":"286_CR1","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"issue":"3","key":"286_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02242703","volume":"6","author":"JH Anderson","year":"1993","unstructured":"Anderson, J.H.: Composite registers. Distrib. Comput. 6(3), 141\u2013154 (1993)","journal-title":"Distrib. Comput."},{"issue":"4","key":"286_CR3","doi-asserted-by":"crossref","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":"286_CR4","doi-asserted-by":"crossref","unstructured":"Aspnes, J.: Time-and space-efficient randomized consensus. In: Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, pp. 325\u2013331. ACM (1990)","DOI":"10.1145\/93385.93433"},{"key":"286_CR5","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Herlihy, M.: Wait-free data structures in the asynchronous PRAM model. In: Proceedings of 2nd ACM Symposium on Parallel Algorithms and Architectures, pp. 340\u2013349 (1990)","DOI":"10.1145\/97444.97701"},{"issue":"12","key":"286_CR6","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1016\/j.jpdc.2011.08.002","volume":"71","author":"H Attiya","year":"2011","unstructured":"Attiya, H., Ellen, F., Fatourou, P.: The complexity of updating snapshot objects. J. Parallel Distrib. Comput. 71(12), 1570\u20131577 (2011)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"286_CR7","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1145\/179812.179902","volume":"41","author":"H Attiya","year":"1994","unstructured":"Attiya, H., Lynch, N., Shavit, N.: Are wait-free algorithms fast? J. ACM 41(4), 725\u2013763 (1994)","journal-title":"J. ACM"},{"issue":"2","key":"286_CR8","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1137\/S0097539795279463","volume":"27","author":"H Attiya","year":"1998","unstructured":"Attiya, H., Rachman, O.: Atomic snapshots in $$O(n \\log n)$$ O ( n log n ) operations. SIAM J. Comput. 27(2), 319\u2013340 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"286_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1006\/inco.1993.1065","volume":"107","author":"J Burns","year":"1993","unstructured":"Burns, J., Lynch, N.: Bounds on shared memory for mutual exclusion. Inf. Comput. 107(2), 171\u2013184 (1993)","journal-title":"Inf. Comput."},{"key":"286_CR10","doi-asserted-by":"crossref","unstructured":"Dwork, C., Waarts, O.: Simple and efficient bounded concurrent timestamping and the traceable use abstraction. J. ACM 46(5), 633\u2013666 (1999)","DOI":"10.1145\/324133.324161"},{"issue":"6","key":"286_CR11","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/1314690.1314694","volume":"54","author":"F Ellen","year":"2007","unstructured":"Ellen, F., Fatourou, P., Ruppert, E.: Time lower bounds for implementations of multi-writer snapshots. J. ACM 54(6), 30 (2007)","journal-title":"J. ACM"},{"key":"286_CR12","doi-asserted-by":"crossref","unstructured":"Fatourou, P., Fich, F., Ruppert, E.: Space-optimal multi-writer snapshot objects are slow. In: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, pp. 13\u201320. ACM (2002)","DOI":"10.1145\/571825.571828"},{"key":"286_CR13","doi-asserted-by":"crossref","unstructured":"Fatourou, P., Fich, F., Ruppert, E.: A tight time lower bound for space-optimal implementations of multi-writer snapshots. In: Proceedings of the 35th ACM Symposium on Theory of Computing, pp. 259\u2013268 (2003)","DOI":"10.1145\/780542.780582"},{"key":"286_CR14","doi-asserted-by":"crossref","unstructured":"Fatourou, P., Fich, F., Ruppert, E.: Time-space tradeoffs for implementations of snapshots. In: Proceedings of the 38th ACM Symposium on Theory of Computing (2006)","DOI":"10.1145\/1132516.1132542"},{"issue":"5","key":"286_CR15","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1145\/290179.290183","volume":"45","author":"F Fich","year":"1998","unstructured":"Fich, F., Herlihy, M., Shavit, N.: On the space complexity of randomized synchronization. J. ACM 45(5), 843\u2013862 (1998)","journal-title":"J. ACM"},{"key":"286_CR16","doi-asserted-by":"crossref","unstructured":"Gafni, E., Merritt, M., Taubenfeld, G.: The concurrency hierarchy, and algorithms for unbounded concurrency. In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, pp. 161\u2013169. ACM (2001)","DOI":"10.1145\/383962.384008"},{"key":"286_CR17","doi-asserted-by":"crossref","unstructured":"Gawlick, R., Lynch, N., Shavit, N.: Concurrent timestamping made simple. In: Proceedings of the Israel Symposium on the Theory of Computing and Systems, LNCS, vol. 601, pp. 171\u2013183 (1992)","DOI":"10.1007\/BFb0035176"},{"issue":"3","key":"286_CR18","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"286_CR19","doi-asserted-by":"crossref","unstructured":"Inoue, M., Chen, W., Masuzawa, T., Tokura, N.: Linear time snapshots using multi-writer multi-reader registers. In: 8th International Workshop on Distributed Algorithms, LNCS, vol. 857, pp. 130\u2013140 (1994)","DOI":"10.1007\/BFb0020429"},{"issue":"5","key":"286_CR20","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/BF01185868","volume":"28","author":"A Israeli","year":"1995","unstructured":"Israeli, A., Shaham, A., Shirazi, A.: Linear-time snapshot implementations in unbalanced systems. Math. Syst. Theory 28(5), 469\u2013486 (1995)","journal-title":"Math. Syst. Theory"},{"key":"286_CR21","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: F-arrays: implementation and applications. In: Proceedings of the 21th ACM Symposium on Principles of Distributed Computing, pp. 270\u2013279 (2002)","DOI":"10.1145\/571825.571875"},{"key":"286_CR22","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: An optimal multi-writer snapshot algorithm. In: Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 723\u2013732 (2005)","DOI":"10.1145\/1060590.1060697"},{"issue":"2","key":"286_CR23","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1137\/S0097539797317299","volume":"30","author":"P Jayanti","year":"2000","unstructured":"Jayanti, P., Tan, K., Toueg, S.: Time and space lower bounds for nonblocking implementations. SIAM J. Comput. 30(2), 438\u2013456 (2000)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"286_CR24","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1109\/71.296315","volume":"5","author":"LM Kirousis","year":"1994","unstructured":"Kirousis, L.M., 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."},{"key":"286_CR25","volume-title":"Distributed Systems","author":"S Mullender","year":"1994","unstructured":"Mullender, S.: Distributed Systems. Addison-Wesley, Boston (1994)"},{"issue":"1","key":"286_CR26","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/357195.357198","volume":"5","author":"GL Peterson","year":"1983","unstructured":"Peterson, G.L.: Concurrent reading while writing. ACM Trans. Program. Lang. Syst. (TOPLAS) 5(1), 46\u201355 (1983)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"issue":"1\u20132","key":"286_CR27","first-page":"163","volume":"269","author":"Y Rianny","year":"2003","unstructured":"Rianny, Y., Shavit, N., Touitou, D.: Towards a practical snapshot algorithm. Theor. Comput. Sci. 269(1\u20132), 163\u2013201 (2003)","journal-title":"Theor. Comput. Sci."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-016-0286-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0286-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0286-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T11:49:21Z","timestamp":1568634561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-016-0286-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,10]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["286"],"URL":"https:\/\/doi.org\/10.1007\/s00446-016-0286-7","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,10]]}}}