{"oa":1,"date_created":"2020-09-13T22:01:17Z","conference":{"name":"PODC: Principles of Distributed Computing","end_date":"2020-08-07","location":"Virtual, Italy","start_date":"2020-08-03"},"scopus_import":"1","article_processing_charge":"No","page":"31-40","status":"public","doi":"10.1145/3382734.3406005","main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-02860087/document"}],"publication_status":"published","day":"31","publication":"Proceedings of the 39th Symposium on Principles of Distributed Computing","date_updated":"2024-02-28T12:54:30Z","month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Long-lived snapshots with polylogarithmic amortized step complexity","publisher":"Association for Computing Machinery","date_published":"2020-07-31T00:00:00Z","oa_version":"Preprint","year":"2020","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"_id":"8382","publication_identifier":{"isbn":["9781450375825"]},"citation":{"ieee":"M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived snapshots with polylogarithmic amortized step complexity,” in Proceedings of the 39th Symposium on Principles of Distributed Computing, Virtual, Italy, 2020, pp. 31–40.","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.","ama":"Baig MA, Hendler D, Milani A, Travers C. Long-lived snapshots with polylogarithmic amortized step complexity. In: Proceedings of the 39th Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:31-40. doi:10.1145/3382734.3406005","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.","mla":"Baig, Mirza Ahad, et al. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 31–40, doi:10.1145/3382734.3406005.","apa":"Baig, M. A., Hendler, D., Milani, A., & Travers, C. (2020). Long-lived snapshots with polylogarithmic amortized step complexity. In Proceedings of the 39th Symposium on Principles of Distributed Computing (pp. 31–40). Virtual, Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3406005","chicago":"Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” In Proceedings of the 39th Symposium on Principles of Distributed Computing, 31–40. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3406005."},"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","last_name":"Baig","first_name":"Mirza Ahad","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425"},{"full_name":"Hendler, Danny","last_name":"Hendler","first_name":"Danny"},{"last_name":"Milani","full_name":"Milani, Alessia","first_name":"Alessia"},{"first_name":"Corentin","last_name":"Travers","full_name":"Travers, Corentin"}]}