{"status":"public","day":"31","month":"07","year":"2020","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-02860087/document"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","publication_identifier":{"isbn":["9781450375825"]},"publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1145/3382734.3406005","oa":1,"date_created":"2020-09-13T22:01:17Z","page":"31-40","abstract":[{"lang":"eng","text":"We present the first deterministic wait-free long-lived snapshot algorithm, using only read and write operations, that guarantees polylogarithmic amortized step complexity in all executions. This is the first non-blocking snapshot algorithm, using reads and writes only, that has sub-linear amortized step complexity in executions of arbitrary length. The key to our construction is a novel implementation of a 2-component max array object which may be of independent interest."}],"author":[{"full_name":"Baig, Mirza Ahad","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425","first_name":"Mirza Ahad","last_name":"Baig"},{"first_name":"Danny","last_name":"Hendler","full_name":"Hendler, Danny"},{"full_name":"Milani, Alessia","last_name":"Milani","first_name":"Alessia"},{"full_name":"Travers, Corentin","last_name":"Travers","first_name":"Corentin"}],"conference":{"location":"Virtual, Italy","end_date":"2020-08-07","name":"PODC: Principles of Distributed Computing","start_date":"2020-08-03"},"oa_version":"Preprint","citation":{"mla":"Baig, Mirza Ahad, et al. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2020, pp. 31–40, doi:<a href=\"https://doi.org/10.1145/3382734.3406005\">10.1145/3382734.3406005</a>.","short":"M.A. Baig, D. Hendler, A. Milani, C. Travers, in:, Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 31–40.","apa":"Baig, M. A., Hendler, D., Milani, A., &#38; Travers, C. (2020). Long-lived snapshots with polylogarithmic amortized step complexity. In <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i> (pp. 31–40). Virtual, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3382734.3406005\">https://doi.org/10.1145/3382734.3406005</a>","chicago":"Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” In <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, 31–40. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3382734.3406005\">https://doi.org/10.1145/3382734.3406005</a>.","ieee":"M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived snapshots with polylogarithmic amortized step complexity,” in <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, Virtual, Italy, 2020, pp. 31–40.","ama":"Baig MA, Hendler D, Milani A, Travers C. Long-lived snapshots with polylogarithmic amortized step complexity. In: <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2020:31-40. doi:<a href=\"https://doi.org/10.1145/3382734.3406005\">10.1145/3382734.3406005</a>","ista":"Baig MA, Hendler D, Milani A, Travers C. 2020. Long-lived snapshots with polylogarithmic amortized step complexity. Proceedings of the 39th Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 31–40."},"publisher":"Association for Computing Machinery","publication":"Proceedings of the 39th Symposium on Principles of Distributed Computing","type":"conference","_id":"8382","date_published":"2020-07-31T00:00:00Z","title":"Long-lived snapshots with polylogarithmic amortized step complexity","date_updated":"2024-02-28T12:54:30Z","quality_controlled":"1"}