Randomized consensus with regular registers
•The randomized consensus algorithm of Aspnes and Herlihy, which was shown to work with atomic registers, works even with regular registers.•This result shows that this algorithm works if the atomic registers that it uses are replaced with linearizable register implementations.•This is perhaps surpr...
Saved in:
| Published in: | Information processing letters Vol. 174; p. 106173 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
01.03.2022
|
| Subjects: | |
| ISSN: | 0020-0190, 1872-6119 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | •The randomized consensus algorithm of Aspnes and Herlihy, which was shown to work with atomic registers, works even with regular registers.•This result shows that this algorithm works if the atomic registers that it uses are replaced with linearizable register implementations.•This is perhaps surprising because it is known that randomized consensus algorithms may require strongly linearizable registers to work.
The well-known randomized consensus algorithm by Aspnes and Herlihy (1990) for asynchronous shared-memory systems was proved to work, even against a strong adversary, under the assumption that the registers that it uses are atomic. With atomic registers every read or write operation is instantaneous (and thus indivisible). As pointed out by Golab, Higham, and Woelfel (2011), however, a randomized algorithm that works with atomic registers does not necessarily work if we replace the atomic registers that it uses with linearizable implementations of registers. This raises the following question: does the randomized consensus algorithm by Aspnes and Herlihy still work against a strong adversary if we replace its atomic registers with linearizable registers? We show that the answer is affirmative; in fact we show that even linearizable registers are not necessary. More precisely, we prove that the algorithm by Aspnes and Herlihy works against a strong adversary even if the algorithm uses only regular registers. |
|---|---|
| AbstractList | •The randomized consensus algorithm of Aspnes and Herlihy, which was shown to work with atomic registers, works even with regular registers.•This result shows that this algorithm works if the atomic registers that it uses are replaced with linearizable register implementations.•This is perhaps surprising because it is known that randomized consensus algorithms may require strongly linearizable registers to work.
The well-known randomized consensus algorithm by Aspnes and Herlihy (1990) for asynchronous shared-memory systems was proved to work, even against a strong adversary, under the assumption that the registers that it uses are atomic. With atomic registers every read or write operation is instantaneous (and thus indivisible). As pointed out by Golab, Higham, and Woelfel (2011), however, a randomized algorithm that works with atomic registers does not necessarily work if we replace the atomic registers that it uses with linearizable implementations of registers. This raises the following question: does the randomized consensus algorithm by Aspnes and Herlihy still work against a strong adversary if we replace its atomic registers with linearizable registers? We show that the answer is affirmative; in fact we show that even linearizable registers are not necessary. More precisely, we prove that the algorithm by Aspnes and Herlihy works against a strong adversary even if the algorithm uses only regular registers. |
| ArticleNumber | 106173 |
| Author | Hu, Xing Toueg, Sam Hadzilacos, Vassos |
| Author_xml | – sequence: 1 givenname: Vassos surname: Hadzilacos fullname: Hadzilacos, Vassos email: vassos@cs.toronto.edu – sequence: 2 givenname: Xing surname: Hu fullname: Hu, Xing email: xing@cs.toronto.edu – sequence: 3 givenname: Sam surname: Toueg fullname: Toueg, Sam email: sam@cs.toronto.edu |
| BookMark | eNp9j01LAzEURYNUsFV_gLvuZep7mTSZ4EqKX1AQRNchJm80ZZopSaror3dKXbno6nK5nAtnwkaxj8TYBcIMAeXVahY23YwDx6FLVPURG2OjeCUR9YiNAThUgBpO2CTnFQBIUasxu3y20ffr8EN-6vqYKeZtnn6F8jFN9L7tbNplyIVSPmPHre0ynf_lKXu9u31ZPFTLp_vHxc2yclyrUmn0aAW3jlpPBEKgrok7qQSiVa3kc6iRtNdeYtOIN2HVsDZS-9bPPfr6lKn9r0t9zola40KxJfSxJBs6g2B2zmZlBmezczZ754HEf-QmhbVN3weZ6z1Dg9JnoGSyCxQd-ZDIFeP7cID-BTHpcMo |
| CitedBy_id | crossref_primary_10_1007_s00446_021_00405_7 |
| Cites_doi | 10.1145/78969.78972 10.1007/s00446-002-0081-5 10.1145/1411509.1411510 10.1006/jagm.1993.1022 10.1016/0196-6774(90)90021-6 10.1016/S0020-0190(00)00027-2 10.1145/278298.278304 10.1145/2597630 |
| ContentType | Journal Article |
| Copyright | 2021 Elsevier B.V. |
| Copyright_xml | – notice: 2021 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ipl.2021.106173 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-6119 |
| ExternalDocumentID | 10_1016_j_ipl_2021_106173 S0020019021000880 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 E.L EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HMJ HVGLF HZ~ IHE J1W KOM LG9 M26 M41 MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SEW SME SPC SPCBC SSV SSZ T5K TN5 UQL WH7 WUQ XPP ZMT ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c297t-91d1a42acefdee044193e2c67411a7f625031e9d9d61884b4a72c6869dfd5d1d3 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000701816300008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0020-0190 |
| IngestDate | Tue Nov 18 19:49:11 EST 2025 Sat Nov 29 07:27:26 EST 2025 Fri Feb 23 02:47:42 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Randomized distributed algorithm Distributed computing Shared memory Consensus |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-91d1a42acefdee044193e2c67411a7f625031e9d9d61884b4a72c6869dfd5d1d3 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ipl_2021_106173 crossref_primary_10_1016_j_ipl_2021_106173 elsevier_sciencedirect_doi_10_1016_j_ipl_2021_106173 |
| PublicationCentury | 2000 |
| PublicationDate | March 2022 2022-03-00 |
| PublicationDateYYYYMMDD | 2022-03-01 |
| PublicationDate_xml | – month: 03 year: 2022 text: March 2022 |
| PublicationDecade | 2020 |
| PublicationTitle | Information processing letters |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Golab, Higham, Woelfel (br0030) 2011 Mostefaoui, Raynal, Tronel (br0010) 2000; 73 Alistarh, Aspnes, Censor-Hillel, Gilbert, Zadimoghaddam (br0190) 2011 Chandra (br0130) 1996 Attiya, Dolev, Shavit (br0120) 1989 Alistarh, Aspnes, Censor-Hillel, Gilbert, Guerraoui (br0180) 2014; 61 Helmi, Higham, Woelfel (br0070) 2012 Aspnes (br0150) 2003; 16 Aspnes (br0110) 1993; 14 Denysyuk, Woelfel (br0080) 2015 Aspnes (br0140) 1998; 45 Hadzilacos, Hu, Toueg (br0060) 2021 Alistarh, Attiya, Gilbert, Giurgiu, Guerraoui (br0170) 2010 Lamport (br0100) 1986; 1 Herlihy, Wing (br0050) 1990; 12 Loui, Abu-Amara (br0020) 1987; 4 Aspnes, Herlihy (br0040) 1990; 11 Attiya, Enea (br0090) 2019 Attiya, Censor (br0160) 2008; 55 Aspnes (10.1016/j.ipl.2021.106173_br0140) 1998; 45 Mostefaoui (10.1016/j.ipl.2021.106173_br0010) 2000; 73 Attiya (10.1016/j.ipl.2021.106173_br0090) 2019 Aspnes (10.1016/j.ipl.2021.106173_br0110) 1993; 14 Aspnes (10.1016/j.ipl.2021.106173_br0150) 2003; 16 Attiya (10.1016/j.ipl.2021.106173_br0160) 2008; 55 Alistarh (10.1016/j.ipl.2021.106173_br0190) 2011 Denysyuk (10.1016/j.ipl.2021.106173_br0080) 2015 Aspnes (10.1016/j.ipl.2021.106173_br0040) 1990; 11 Alistarh (10.1016/j.ipl.2021.106173_br0170) 2010 Lamport (10.1016/j.ipl.2021.106173_br0100) 1986; 1 Golab (10.1016/j.ipl.2021.106173_br0030) 2011 Hadzilacos (10.1016/j.ipl.2021.106173_br0060) 2021 Chandra (10.1016/j.ipl.2021.106173_br0130) 1996 Herlihy (10.1016/j.ipl.2021.106173_br0050) 1990; 12 Loui (10.1016/j.ipl.2021.106173_br0020) 1987; 4 Alistarh (10.1016/j.ipl.2021.106173_br0180) 2014; 61 Helmi (10.1016/j.ipl.2021.106173_br0070) 2012 Attiya (10.1016/j.ipl.2021.106173_br0120) 1989 |
| References_xml | – start-page: 385 year: 2012 end-page: 394 ident: br0070 article-title: Strongly linearizable implementations: possibilities and impossibilities publication-title: Proceedings of the 31st Annual ACM Symposium on Principles of Distributed Computing (PODC) – start-page: 281 year: 1989 end-page: 293 ident: br0120 article-title: Bounded polynomial randomized consensus publication-title: Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing (PODC) – start-page: 60 year: 2015 end-page: 74 ident: br0080 article-title: Wait-freedom is harder than lock-freedom under strong linearizability publication-title: 29th International Symposium on Distributed Computing (DISC) – volume: 1 start-page: 77 year: 1986 end-page: 101 ident: br0100 article-title: On interprocess communication parts I–II – volume: 45 year: 1998 ident: br0140 article-title: Lower bounds for distributed coin-flipping and randomized consensus publication-title: J. ACM – start-page: 239 year: 2011 end-page: 248 ident: br0190 article-title: Optimal-time adaptive strong renaming, with applications to counting publication-title: Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing (PODC) – year: 2019 ident: br0090 article-title: Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects publication-title: 33rd International Symposium on Distributed Computing (DISC) – volume: 11 start-page: 441 year: 1990 end-page: 461 ident: br0040 article-title: Fast randomized consensus using shared memory publication-title: J. Algorithms – start-page: 521 year: 2021 end-page: 531 ident: br0060 article-title: On register linearizability and termination publication-title: Proceedings of the 40th Annual ACM Symposium on Principles of Distributed Computing (PODC) – volume: 4 year: 1987 ident: br0020 article-title: Memory requirements for agreement among unreliable asynchronous processes publication-title: Adv. Comput. Res. – volume: 16 start-page: 165 year: 2003 end-page: 175 ident: br0150 article-title: Randomized protocols for asynchronous consensus publication-title: Distrib. Comput. – start-page: 166 year: 1996 end-page: 175 ident: br0130 article-title: Polylog randomized wait-free consensus publication-title: Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC) – start-page: 373 year: 2011 end-page: 382 ident: br0030 article-title: Linearizable implementations do not suffice for randomized distributed computation publication-title: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC) – volume: 12 start-page: 463 year: 1990 end-page: 492 ident: br0050 article-title: Linearizability: a correctness condition for concurrent objects publication-title: ACM Trans. Program. Lang. Syst. – volume: 73 start-page: 207 year: 2000 end-page: 212 ident: br0010 article-title: From binary consensus to multivalued consensus in asynchronous message-passing systems publication-title: Inf. Process. Lett. – volume: 55 year: 2008 ident: br0160 article-title: Tight bounds for asynchronous randomized consensus publication-title: J. ACM – volume: 61 year: 2014 ident: br0180 article-title: Tight bounds for asynchronous renaming publication-title: J. ACM – start-page: 94 year: 2010 end-page: 108 ident: br0170 article-title: Fast randomized test-and-set and renaming publication-title: 24th International Symposium on Distributed Computing (DISC) – volume: 14 start-page: 414 year: 1993 end-page: 431 ident: br0110 article-title: Time- and space-efficient randomized consensus publication-title: J. Algorithms – volume: 12 start-page: 463 issue: 3 year: 1990 ident: 10.1016/j.ipl.2021.106173_br0050 article-title: Linearizability: a correctness condition for concurrent objects publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/78969.78972 – year: 2019 ident: 10.1016/j.ipl.2021.106173_br0090 article-title: Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects – volume: 16 start-page: 165 issue: 2–3 year: 2003 ident: 10.1016/j.ipl.2021.106173_br0150 article-title: Randomized protocols for asynchronous consensus publication-title: Distrib. Comput. doi: 10.1007/s00446-002-0081-5 – start-page: 60 year: 2015 ident: 10.1016/j.ipl.2021.106173_br0080 article-title: Wait-freedom is harder than lock-freedom under strong linearizability – volume: 55 issue: 5 year: 2008 ident: 10.1016/j.ipl.2021.106173_br0160 article-title: Tight bounds for asynchronous randomized consensus publication-title: J. ACM doi: 10.1145/1411509.1411510 – volume: 4 issue: 163–183 year: 1987 ident: 10.1016/j.ipl.2021.106173_br0020 article-title: Memory requirements for agreement among unreliable asynchronous processes publication-title: Adv. Comput. Res. – start-page: 385 year: 2012 ident: 10.1016/j.ipl.2021.106173_br0070 article-title: Strongly linearizable implementations: possibilities and impossibilities – start-page: 166 year: 1996 ident: 10.1016/j.ipl.2021.106173_br0130 article-title: Polylog randomized wait-free consensus – start-page: 373 year: 2011 ident: 10.1016/j.ipl.2021.106173_br0030 article-title: Linearizable implementations do not suffice for randomized distributed computation – volume: 14 start-page: 414 issue: 3 year: 1993 ident: 10.1016/j.ipl.2021.106173_br0110 article-title: Time- and space-efficient randomized consensus publication-title: J. Algorithms doi: 10.1006/jagm.1993.1022 – volume: 11 start-page: 441 issue: 3 year: 1990 ident: 10.1016/j.ipl.2021.106173_br0040 article-title: Fast randomized consensus using shared memory publication-title: J. Algorithms doi: 10.1016/0196-6774(90)90021-6 – start-page: 94 year: 2010 ident: 10.1016/j.ipl.2021.106173_br0170 article-title: Fast randomized test-and-set and renaming – volume: 73 start-page: 207 issue: 5 year: 2000 ident: 10.1016/j.ipl.2021.106173_br0010 article-title: From binary consensus to multivalued consensus in asynchronous message-passing systems publication-title: Inf. Process. Lett. doi: 10.1016/S0020-0190(00)00027-2 – start-page: 281 year: 1989 ident: 10.1016/j.ipl.2021.106173_br0120 article-title: Bounded polynomial randomized consensus – volume: 1 start-page: 77 issue: 2 year: 1986 ident: 10.1016/j.ipl.2021.106173_br0100 article-title: On interprocess communication parts I–II – start-page: 239 year: 2011 ident: 10.1016/j.ipl.2021.106173_br0190 article-title: Optimal-time adaptive strong renaming, with applications to counting – start-page: 521 year: 2021 ident: 10.1016/j.ipl.2021.106173_br0060 article-title: On register linearizability and termination – volume: 45 issue: 3 year: 1998 ident: 10.1016/j.ipl.2021.106173_br0140 article-title: Lower bounds for distributed coin-flipping and randomized consensus publication-title: J. ACM doi: 10.1145/278298.278304 – volume: 61 issue: 3 year: 2014 ident: 10.1016/j.ipl.2021.106173_br0180 article-title: Tight bounds for asynchronous renaming publication-title: J. ACM doi: 10.1145/2597630 |
| SSID | ssj0006437 |
| Score | 2.3104784 |
| Snippet | •The randomized consensus algorithm of Aspnes and Herlihy, which was shown to work with atomic registers, works even with regular registers.•This result shows... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 106173 |
| SubjectTerms | Consensus Distributed computing Randomized distributed algorithm Shared memory |
| Title | Randomized consensus with regular registers |
| URI | https://dx.doi.org/10.1016/j.ipl.2021.106173 |
| Volume | 174 |
| WOSCitedRecordID | wos000701816300008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6119 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006437 issn: 0020-0190 databaseCode: AIEXJ dateStart: 19950113 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3JTsMwELWgcODCjiibcuBEFZTFWXysUBEghBAC1FvkLVKrNq26IMTXM44dt6yiBy5J5DhO4meNZ8YzfgidehQEIwcjBwxaz8WYMZfh0HMZixJOGOOyZIl4vk3u7tJ2m9wb4sJxSSeQFEX6-kqG_wo1lAHYKnV2Abhto1AA1wA6HAF2OP4J-AdaiEG_8yZVvpryHI-nJoVtVPLOj9RZgWvWcbpVLLvNY2wMdfaA8iL0ynSf8Zygeuv0QIpqEnXQvAeze1NV1q7mwtJ1PZXaG0378-4FAM3GV9lwfxW5pjk9rchM8JzQU1al5iP5Io-1a6B73hmqZZ7AP5_V_bj39ac5yUYKVkFo3QyayFQTmW5iGa0ESUTSGlppXrfaN3b6VSuROq5Hf3e1lF0G9X36ju-VkTkF43ETrRvLwGlqRLfQkiy20UbFuuEYIbyDGjOAHQuwowB2DMCOBXgXPV22Hi-uXEN54fKAJBOYeoRPcUC5zIWUHuiqJJQBj0Hv82mSg7EKQlgSQUTspylmmCZwN42JyEUkfBHuoVoxKOQ-cqj0A0oxpj6PMQ9yFssg4nlICY9Z5OE68qp_z7jZD17RkvSyH_u8js7sI0O9GcpvlXHVoZnR5rSWlsHg-Pmxg0XecYjWZmP2CNUmo6k8Rqv8ZdIZj07MyHgHWXlpFQ |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Randomized+consensus+with+regular+registers&rft.jtitle=Information+processing+letters&rft.au=Hadzilacos%2C+Vassos&rft.au=Hu%2C+Xing&rft.au=Toueg%2C+Sam&rft.date=2022-03-01&rft.issn=0020-0190&rft.volume=174&rft.spage=106173&rft_id=info:doi/10.1016%2Fj.ipl.2021.106173&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ipl_2021_106173 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon |