{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:26:35Z","timestamp":1775255195185,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030795269","type":"print"},{"value":"9783030795276","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79527-6_7","type":"book-chapter","created":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T11:03:43Z","timestamp":1624100623000},"page":"106-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fragmented Objects: Boosting Concurrency of Shared Large Objects"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Fern\u00e1ndez Anta","sequence":"first","affiliation":[]},{"given":"Chryssis","family":"Georgiou","sequence":"additional","affiliation":[]},{"given":"Theophanis","family":"Hadjistasi","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Nicolaou","sequence":"additional","affiliation":[]},{"given":"Efstathios","family":"Stavrakis","sequence":"additional","affiliation":[]},{"given":"Andria","family":"Trigeorgi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,20]]},"reference":[{"key":"7_CR1","unstructured":"Emulab network testbed. https:\/\/www.emulab.net\/. Accessed 7 June 2021"},{"key":"7_CR2","unstructured":"Fernandez Anta, A., Georgiou, C., Hadjistasi, T., Nicolaou, N., Stavrakis, E., Trigeorgi, A.: Fragmented objects: Boosting concurrency of shared large objects (2021). https:\/\/arxiv.org\/abs\/2102.12786"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H Attiya","year":"1996","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message passing systems. J. ACM 42(1), 124\u2013142 (1996)","journal-title":"J. ACM"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Attiya, H., Kumari, S., Somani, A., Welch, J.L.: Store-collect in the presence of continuous churn with application to snapshots and lattice agreement (2020)","DOI":"10.1145\/3382734.3405709"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.L.: Sequential consistency versus linearizability. ACM Trans. Comput. Syst. 12(2), 91\u2013122 (1994)","DOI":"10.1145\/176575.176576"},{"key":"7_CR6","unstructured":"Black, P.: Ratcliff pattern recognition. Dictionary of Algorithms and Data Structures (2021)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Cachin, C., Tessaro, S.: Optimal resilience for erasure-coded byzantine distributed storage, pp. 115\u2013124. IEEE Computer Society, Los Alamitos (2006)","DOI":"10.1007\/11561927_39"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-016-0275-x","volume":"30","author":"VR Cadambe","year":"2017","unstructured":"Cadambe, V.R., Lynch, N.A., M\u00e9dard, M., Musial, P.M.: A coded shared atomic memory algorithm for message passing architectures. Distrib. Comput. 30(1), 49\u201373 (2017)","journal-title":"Distrib. Comput."},{"issue":"9","key":"7_CR9","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1109\/TPDS.2018.2809551","volume":"29","author":"C Delporte-Gallet","year":"2018","unstructured":"Delporte-Gallet, C., Fauconnier, H., Rajsbaum, S., Raynal, M.: Implementing snapshot objects on top of crash-prone asynchronous message-passing systems. IEEE Trans. Parallel Distrib. Syst. 29(9), 2033\u20132045 (2018). https:\/\/doi.org\/10.1109\/TPDS.2018.2809551","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-540-87779-0_13","volume-title":"Distributed Computing","author":"P Dutta","year":"2008","unstructured":"Dutta, P., Guerraoui, R., Levy, R.R.: Optimistic erasure-coded distributed storage. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 182\u2013196. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87779-0_13"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Dutta, P., Guerraoui, R., Levy, R.R., Chakraborty, A.: How fast can a distributed atomic read be? In: Proceedings of PODC 2004, pp. 236\u2013245 (2004)","DOI":"10.1145\/1011767.1011802"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-39989-6_6","volume-title":"Distributed Computing","author":"R Fan","year":"2003","unstructured":"Fan, R., Lynch, N.: Efficient replication of large data objects. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 75\u201391. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39989-6_6"},{"key":"7_CR13","unstructured":"Fern\u00e1ndez Anta, A., Hadjistasi, T., Nicolaou, N.: Computationally light \u201cmulti-speed\u201d atomic memory. In: Proceedings of OPODIS 2016 (2016)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-030-05529-5_12","volume-title":"Networked Systems","author":"C Georgiou","year":"2019","unstructured":"Georgiou, C., Hadjistasi, T., Nicolaou, N., Schwarzmann, A.A.: Unleashing and speeding up readers in atomic object implementations. In: Podelski, A., Ta\u00efani, F. (eds.) NETYS 2018. LNCS, vol. 11028, pp. 175\u2013190. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05529-5_12"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jpdc.2008.05.004","volume":"1","author":"C Georgiou","year":"2009","unstructured":"Georgiou, C., Nicolaou, N., Shvartsman, A.A.: Fault-tolerant semifast implementations of atomic read\/write registers. J. Parallel Distrib. Comput. 1, 62\u201379 (2009)","journal-title":"J. Parallel Distrib. Comput."},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-59647-1_10","volume-title":"Networked Systems","author":"T Hadjistasi","year":"2017","unstructured":"Hadjistasi, T., Nicolaou, N., Schwarzmann, A.A.: Oh-RAM! one and a half round atomic memory. In: El Abbadi, A., Garbinato, B. (eds.) NETYS 2017. LNCS, vol. 10299, pp. 117\u2013132. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59647-1_10"},{"issue":"3","key":"7_CR17","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 TOPLAS 12(3), 463\u2013492 (1990)","journal-title":"ACM TOPLAS"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Konwar, K.M., Prakash, N., Kantor, E., Lynch, N., M\u00e9dard, M., Schwarzmann, A.A.: Storage-optimized data-atomic algorithms for handling erasures and errors in distributed storage systems. In: Proceedings of IPDPS 2016, pp. 720\u2013729, May 2016","DOI":"10.1109\/IPDPS.2016.55"},{"key":"7_CR19","unstructured":"Konwar, K.M., Prakash, N., Lynch, N., M\u00e9dard, M.: RADON: repairable atomic data object in networks. In: The International Conference on Distributed Systems (OPODIS) (2016)"},{"key":"7_CR20","unstructured":"Lynch, N., Shvartsman, A.A.: Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In: Proceedings of Symposium on Fault-Tolerant Computing (1997)"},{"key":"7_CR21","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)"},{"key":"7_CR22","unstructured":"Nicolaou, N., Cadambe, V., Prakash, N., Konwar, K., Medard, M., Lynch, N.: ARES: adaptive, reconfigurable, erasure coded, atomic storage. In: IEEE 39th ICDCS, pp. 2195\u20132205"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Nicolaou, N., Fern\u00e1ndez Anta, A., Georgiou, C.: Coverability: consistent versioning in asynchronous, fail-prone, message-passing environments. In: Proceedings of IEEE NCA 2016","DOI":"10.1109\/NCA.2016.7778622"},{"key":"7_CR24","unstructured":"Rabin, M.O.: Fingerprinting by random polynomials. In: Center for Research in Computing Techn., Aiken Computation Laboratory, Univ, pp. 15\u201318 (1981). http:\/\/scholar.google.com\/scholar?hl=en&btnG=Search&q=intitle:Fingerprinting+by+Random+Polynomials#0"},{"key":"7_CR25","unstructured":"Tridgell, A., Mackerras, P.: The rsync algorithm Andrew Tridgell and Paul Mackerras. Imagine (1996)"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"White, B., et al.: An integrated experimental environment for distributed systems and networks. In: OSDI 2002, pp. 255\u2013270. USENIX Association, Boston, December 2002","DOI":"10.1145\/1060289.1060313"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79527-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T04:43:28Z","timestamp":1725252208000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79527-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030795269","9783030795276"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79527-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2021.ii.uni.wroc.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}