Separating lock-freedom from wait-freedom at every level of the consensus hierarchy
•Wait-freedom and lock-freedom are two standard progress conditions in concurrent implementations.•For the first time, these progress conditions are shown to be distinct, for any number of processes.•The separation holds for any level of the consensus hierarchy. A long-standing open question has bee...
Uloženo v:
| Vydáno v: | Journal of parallel and distributed computing Ročník 163; s. 181 - 197 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Inc
01.05.2022
Elsevier |
| Témata: | |
| ISSN: | 0743-7315, 1096-0848 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | •Wait-freedom and lock-freedom are two standard progress conditions in concurrent implementations.•For the first time, these progress conditions are shown to be distinct, for any number of processes.•The separation holds for any level of the consensus hierarchy.
A long-standing open question has been whether lock-freedom and wait-freedom are fundamentally different progress conditions, namely, can the former be provided in situations where the latter cannot? This paper answers the question in the affirmative, by proving that there are objects with lock-free implementations, but without wait-free implementations—using the same set of objects of any finite coordination power.
We precisely define an object called n-process long-lived approximate agreement (n-LLAA), in which two sets of processes associated with two sides, 0 or 1, need to decide on a sequence of increasingly closer outputs. We prove that 2-LLAA has a lock-free linearizable implementation using read/write objects only, and that n-LLAA has a lock-free linearizable implementation using read/write objects and (n−1)-process consensus objects. In contrast, we prove that there is no wait-free linearizable implementation of n-LLAA using read/write objects and specific (n−1)-process consensus objects, called (n−1)-window registers. |
|---|---|
| AbstractList | A long-standing open question has been whether lock-freedom and wait-freedom are fundamentally different progress conditions, namely, can the former be provided in situations where the latter cannot? This paper answers the question in the affirmative, by proving that there are objects with lock-free implementations, but without wait-free implementations—using the same set of objects of any finite coordination power.We precisely define an object called n-process long-lived approximate agreement (n-LLAA), in which two sets of processes associated with two sides, 0 or 1, need to decide on a sequence of increasingly closer outputs. We prove that 2-LLAA has a lock-free linearizable implementation using read/write objects only, and that n-LLAA has a lock-free linearizable implementation using read/write objects and (n-1) -process consensus objects. In contrast, we prove that there is no wait-free linearizable implementation of n-LLAA using read/write objects and specific (n-1) -process consensus objects, called (n-1) -window registers. •Wait-freedom and lock-freedom are two standard progress conditions in concurrent implementations.•For the first time, these progress conditions are shown to be distinct, for any number of processes.•The separation holds for any level of the consensus hierarchy. A long-standing open question has been whether lock-freedom and wait-freedom are fundamentally different progress conditions, namely, can the former be provided in situations where the latter cannot? This paper answers the question in the affirmative, by proving that there are objects with lock-free implementations, but without wait-free implementations—using the same set of objects of any finite coordination power. We precisely define an object called n-process long-lived approximate agreement (n-LLAA), in which two sets of processes associated with two sides, 0 or 1, need to decide on a sequence of increasingly closer outputs. We prove that 2-LLAA has a lock-free linearizable implementation using read/write objects only, and that n-LLAA has a lock-free linearizable implementation using read/write objects and (n−1)-process consensus objects. In contrast, we prove that there is no wait-free linearizable implementation of n-LLAA using read/write objects and specific (n−1)-process consensus objects, called (n−1)-window registers. |
| Author | Castañeda, Armando Attiya, Hagit Hendler, Danny Perrin, Matthieu |
| Author_xml | – sequence: 1 givenname: Hagit surname: Attiya fullname: Attiya, Hagit organization: Department of Computer Science, Technion, Israel – sequence: 2 givenname: Armando surname: Castañeda fullname: Castañeda, Armando email: armando.castaneda@im.unam.mx organization: Instituto de Matemáticas, UNAM, Mexico – sequence: 3 givenname: Danny surname: Hendler fullname: Hendler, Danny organization: Department of Computer Science, Ben-Gurion University, Israel – sequence: 4 givenname: Matthieu orcidid: 0000-0002-8019-0830 surname: Perrin fullname: Perrin, Matthieu organization: LS2N, Université de Nantes, France |
| BackLink | https://hal.science/hal-05339232$$DView record in HAL |
| BookMark | eNp9kE9LAzEQxYNUsFa_gKdcPeyav7tb8FKKWqHgoXoO2WTibt1uSrJW-u3NUunRyzx4vN8w867RpPc9IHRHSU4JLR62-XZvTc4IYzmhOWHyAk0pmRcZqUQ1QVNSCp6VnMordB3jlhBKZVlN0WYDex300PafuPPmK3MBwPoddiGNH90OZ0cPGA4QjrhL0mHv8NAANr6P0MfviJsWgg6mOd6gS6e7CLd_OkMfz0_vy1W2fnt5XS7WmWGVHDItuLBM1gUthdYg0nFlbbgwc2HroqwLCVRKU0kLhlROOAPSWldCaVwhKs1n6P60t9Gd2od2p8NRed2q1WKtRo9IzueMswNNWXbKmuBjDODOACVqrFBt1VihGitUhKpUYYIeTxCkLw7pPRVNC70B2wYwg7K-_Q__Bc0afL8 |
| Cites_doi | 10.1145/153724.153741 10.1006/inco.1995.1134 10.1007/s00446-007-0023-3 10.1016/j.jpdc.2018.06.004 10.1145/78969.78972 10.1145/1897852.1897873 10.1142/S0129626418500068 10.1145/114005.102808 |
| ContentType | Journal Article |
| Copyright | 2022 Elsevier Inc. Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2022 Elsevier Inc. – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 1XC |
| DOI | 10.1016/j.jpdc.2022.01.025 |
| DatabaseName | CrossRef Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1096-0848 |
| EndPage | 197 |
| ExternalDocumentID | oai:HAL:hal-05339232v1 10_1016_j_jpdc_2022_01_025 S0743731522000302 |
| GroupedDBID | --K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 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 ADFGL ADHUB ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- ~G0 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 1XC |
| ID | FETCH-LOGICAL-c285t-a434d25b6174aae43157bc34c94db67b65e155c85dec08f4fce5ddf7e7cf648a3 |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000777831100013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0743-7315 |
| IngestDate | Sat Nov 29 15:08:49 EST 2025 Sat Nov 29 07:11:30 EST 2025 Fri Feb 23 02:40:25 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Linearizability Lock-freedom Progress conditions Wait-freedom Consensus hierarchy |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c285t-a434d25b6174aae43157bc34c94db67b65e155c85dec08f4fce5ddf7e7cf648a3 |
| ORCID | 0000-0002-8019-0830 |
| PageCount | 17 |
| ParticipantIDs | hal_primary_oai_HAL_hal_05339232v1 crossref_primary_10_1016_j_jpdc_2022_01_025 elsevier_sciencedirect_doi_10_1016_j_jpdc_2022_01_025 |
| PublicationCentury | 2000 |
| PublicationDate | May 2022 2022-05-00 2022-05 |
| PublicationDateYYYYMMDD | 2022-05-01 |
| PublicationDate_xml | – month: 05 year: 2022 text: May 2022 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of parallel and distributed computing |
| PublicationYear | 2022 |
| Publisher | Elsevier Inc Elsevier |
| Publisher_xml | – name: Elsevier Inc – name: Elsevier |
| References | Afek, Attiya, Dolev, Gafni, Merritt, Shavit (br0010) Sept. 1993; 40 Herlihy, Shavit (br0130) 2008 Herlihy (br0120) Jan. 1991; 13 Herlihy, Wing (br0140) July 1990; 12 Aspnes, Herlihy (br0050) 1990 Attiya, Castañeda, Hendler (br0060) 2018; 121 Shavit (br0210) 2011; 54 Lynch, Vaandrager (br0170) 1995; 121 Ovens, Woelfel (br0190) 2019 Anderson, Moir (br0040) 1993 Kogan, Petrank (br0150) 2012 Attiya, Enea (br0070) 2019 Ellen, Gelashvili, Shavit, Zhu (br0090) 2016 Censor-Hillel, Petrank, Timnat (br0080) 2015 Perrin, Mostefaoui, Claude (br0200) 2016 Loui, Abu-Amara (br0160) 1987; 4 Afek, Weisberger, Weisman (br0030) 1993 Mostéfaoui, Perrin, Raynal (br0180) 2018; 28 Afek, Gafni, Morrison (br0020) 2007; 20 Herlihy (br0110) 1991 Golab, Higham, Woelfel (br0100) 2011 Afek (10.1016/j.jpdc.2022.01.025_br0020) 2007; 20 Golab (10.1016/j.jpdc.2022.01.025_br0100) 2011 Ovens (10.1016/j.jpdc.2022.01.025_br0190) 2019 Herlihy (10.1016/j.jpdc.2022.01.025_br0140) 1990; 12 Censor-Hillel (10.1016/j.jpdc.2022.01.025_br0080) 2015 Loui (10.1016/j.jpdc.2022.01.025_br0160) 1987; 4 Attiya (10.1016/j.jpdc.2022.01.025_br0060) 2018; 121 Herlihy (10.1016/j.jpdc.2022.01.025_br0110) 1991 Herlihy (10.1016/j.jpdc.2022.01.025_br0120) 1991; 13 Perrin (10.1016/j.jpdc.2022.01.025_br0200) 2016 Afek (10.1016/j.jpdc.2022.01.025_br0030) 1993 Attiya (10.1016/j.jpdc.2022.01.025_br0070) 2019 Anderson (10.1016/j.jpdc.2022.01.025_br0040) 1993 Kogan (10.1016/j.jpdc.2022.01.025_br0150) 2012 Aspnes (10.1016/j.jpdc.2022.01.025_br0050) 1990 Ellen (10.1016/j.jpdc.2022.01.025_br0090) 2016 Lynch (10.1016/j.jpdc.2022.01.025_br0170) 1995; 121 Afek (10.1016/j.jpdc.2022.01.025_br0010) 1993; 40 Herlihy (10.1016/j.jpdc.2022.01.025_br0130) 2008 Mostéfaoui (10.1016/j.jpdc.2022.01.025_br0180) 2018; 28 Shavit (10.1016/j.jpdc.2022.01.025_br0210) 2011; 54 |
| References_xml | – volume: 54 start-page: 76 year: 2011 end-page: 84 ident: br0210 article-title: Data structures in the multicore age publication-title: Commun. ACM – volume: 40 start-page: 873 year: Sept. 1993 end-page: 890 ident: br0010 article-title: Atomic snapshots of shared memory publication-title: J. ACM – start-page: 2:1 year: 2019 end-page: 2:17 ident: br0070 article-title: Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects publication-title: 33rd International Symposium on Distributed Computing – volume: 4 start-page: 163 year: 1987 end-page: 183 ident: br0160 article-title: Memory requirements for agreement among unreliable asynchronous processes publication-title: J. Parallel Distrib. Comput. – start-page: 373 year: 2011 end-page: 382 ident: br0100 article-title: Linearizable implementations do not suffice for randomized distributed computation publication-title: STOC – start-page: 327 year: 1991 end-page: 336 ident: br0110 article-title: Impossibility results for asynchronous pram publication-title: SPAA – volume: 28 start-page: 1850006:1 year: 2018 end-page: 1850006:9 ident: br0180 article-title: A simple object that spans the whole consensus hierarchy publication-title: Parallel Process. Lett. – volume: 20 start-page: 239 year: 2007 end-page: 252 ident: br0020 article-title: Common2 extended to stacks and unbounded concurrency publication-title: Distrib. Comput. – start-page: 159 year: 1993 end-page: 170 ident: br0030 article-title: A completeness theorem for a class of synchronization objects publication-title: PODC – start-page: 289 year: 2016 end-page: 298 ident: br0090 article-title: A complexity-based hierarchy for multiprocessor synchronization publication-title: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing – start-page: 141 year: 2012 end-page: 150 ident: br0150 article-title: A methodology for creating fast wait-free data structures publication-title: PPoPP – year: 2016 ident: br0200 article-title: Causal consistency: beyond memory publication-title: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming – volume: 12 start-page: 463 year: July 1990 end-page: 492 ident: br0140 article-title: Linearizability: a correctness condition for concurrent objects publication-title: ACM Trans. Program. Lang. Syst. – volume: 121 start-page: 214 year: 1995 end-page: 233 ident: br0170 article-title: Forward and backward simulations: I. untimed systems publication-title: Inf. Comput. – start-page: 39 year: 1993 end-page: 53 ident: br0040 article-title: Towards a necessary and sufficient condition for wait-free synchronization publication-title: WDAG – volume: 13 start-page: 124 year: Jan. 1991 end-page: 149 ident: br0120 article-title: Wait-free synchronization publication-title: ACM Trans. Program. Lang. Syst. – start-page: 197 year: 2019 end-page: 206 ident: br0190 article-title: Strongly linearizable implementations of snapshots and other types publication-title: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing – start-page: 340 year: 1990 end-page: 349 ident: br0050 article-title: Wait-free data structures in the asynchronous pram model publication-title: SPAA – start-page: 241 year: 2015 end-page: 250 ident: br0080 article-title: Help! publication-title: PODC – year: 2008 ident: br0130 article-title: The Art of Multiprocessor Programming – volume: 121 start-page: 1 year: 2018 end-page: 14 ident: br0060 article-title: Nontrivial and universal helping for wait-free queues and stacks publication-title: J. Parallel Distrib. Comput. – volume: 40 start-page: 873 issue: 4 year: 1993 ident: 10.1016/j.jpdc.2022.01.025_br0010 article-title: Atomic snapshots of shared memory publication-title: J. ACM doi: 10.1145/153724.153741 – start-page: 39 year: 1993 ident: 10.1016/j.jpdc.2022.01.025_br0040 article-title: Towards a necessary and sufficient condition for wait-free synchronization – volume: 4 start-page: 163 issue: 4 year: 1987 ident: 10.1016/j.jpdc.2022.01.025_br0160 article-title: Memory requirements for agreement among unreliable asynchronous processes publication-title: J. Parallel Distrib. Comput. – volume: 121 start-page: 214 issue: 2 year: 1995 ident: 10.1016/j.jpdc.2022.01.025_br0170 article-title: Forward and backward simulations: I. untimed systems publication-title: Inf. Comput. doi: 10.1006/inco.1995.1134 – start-page: 373 year: 2011 ident: 10.1016/j.jpdc.2022.01.025_br0100 article-title: Linearizable implementations do not suffice for randomized distributed computation – volume: 20 start-page: 239 issue: 4 year: 2007 ident: 10.1016/j.jpdc.2022.01.025_br0020 article-title: Common2 extended to stacks and unbounded concurrency publication-title: Distrib. Comput. doi: 10.1007/s00446-007-0023-3 – volume: 121 start-page: 1 year: 2018 ident: 10.1016/j.jpdc.2022.01.025_br0060 article-title: Nontrivial and universal helping for wait-free queues and stacks publication-title: J. Parallel Distrib. Comput. doi: 10.1016/j.jpdc.2018.06.004 – start-page: 340 year: 1990 ident: 10.1016/j.jpdc.2022.01.025_br0050 article-title: Wait-free data structures in the asynchronous pram model – start-page: 241 year: 2015 ident: 10.1016/j.jpdc.2022.01.025_br0080 article-title: Help! – start-page: 289 year: 2016 ident: 10.1016/j.jpdc.2022.01.025_br0090 article-title: A complexity-based hierarchy for multiprocessor synchronization – year: 2008 ident: 10.1016/j.jpdc.2022.01.025_br0130 – start-page: 327 year: 1991 ident: 10.1016/j.jpdc.2022.01.025_br0110 article-title: Impossibility results for asynchronous pram – volume: 12 start-page: 463 issue: 3 year: 1990 ident: 10.1016/j.jpdc.2022.01.025_br0140 article-title: Linearizability: a correctness condition for concurrent objects publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/78969.78972 – start-page: 159 year: 1993 ident: 10.1016/j.jpdc.2022.01.025_br0030 article-title: A completeness theorem for a class of synchronization objects – start-page: 2:1 year: 2019 ident: 10.1016/j.jpdc.2022.01.025_br0070 article-title: Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects – volume: 54 start-page: 76 issue: 3 year: 2011 ident: 10.1016/j.jpdc.2022.01.025_br0210 article-title: Data structures in the multicore age publication-title: Commun. ACM doi: 10.1145/1897852.1897873 – start-page: 141 year: 2012 ident: 10.1016/j.jpdc.2022.01.025_br0150 article-title: A methodology for creating fast wait-free data structures – volume: 28 start-page: 1850006:1 issue: 2 year: 2018 ident: 10.1016/j.jpdc.2022.01.025_br0180 article-title: A simple object that spans the whole consensus hierarchy publication-title: Parallel Process. Lett. doi: 10.1142/S0129626418500068 – year: 2016 ident: 10.1016/j.jpdc.2022.01.025_br0200 article-title: Causal consistency: beyond memory – volume: 13 start-page: 124 issue: 1 year: 1991 ident: 10.1016/j.jpdc.2022.01.025_br0120 article-title: Wait-free synchronization publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/114005.102808 – start-page: 197 year: 2019 ident: 10.1016/j.jpdc.2022.01.025_br0190 article-title: Strongly linearizable implementations of snapshots and other types |
| SSID | ssj0011578 |
| Score | 2.3285058 |
| Snippet | •Wait-freedom and lock-freedom are two standard progress conditions in concurrent implementations.•For the first time, these progress conditions are shown to... A long-standing open question has been whether lock-freedom and wait-freedom are fundamentally different progress conditions, namely, can the former be... |
| SourceID | hal crossref elsevier |
| SourceType | Open Access Repository Index Database Publisher |
| StartPage | 181 |
| SubjectTerms | Computer Science Consensus hierarchy Linearizability Lock-freedom Progress conditions Wait-freedom |
| Title | Separating lock-freedom from wait-freedom at every level of the consensus hierarchy |
| URI | https://dx.doi.org/10.1016/j.jpdc.2022.01.025 https://hal.science/hal-05339232 |
| Volume | 163 |
| WOSCitedRecordID | wos000777831100013&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: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lj9MwELZKlwMX3ojlJQvBqcqqSew6OZayqy5U1UpdpN4sx3F2W0papWnZ_Yn8K2bivBYEWg5crMpt85j57PkymQch72DJCMa0cphRAxi8yAl0PwQiJ4TxAqx5VSQKT8R0Gszn4Vmn86PKhdmvRJoGV1fh5r-qGuZA2Zg6-w_qrg8KE_AZlA4jqB3GWyl-Zmw57_SiB4bqq5NkYKDW32wiyXe1yOsZlfcM3B62jtibVRUtoDG-Ot3utj1sk43CufHmt8Vg8TyrlbHFBmKswIvNs0yRJ7fZ5ZVRRDjl-eK6oKljdbGoI21GCsnryH__wTWxdfBiDkO8bjy0WAMiK3Ph0-tmI88yW_yg6Fe-MLu29wIefOtYQetSK-1_a9fDmqnCtzmeR8buyn2MlA5sSc562y43RrvxurbxS2nDXRvz-5t5sJ6K5dFyE2P5Ss-zJVt5YwyrAIDxcCbPPp7Iyen0881vWwGM4-EExku1cjCjGaiyt4cH8QNP8DDokoPh6fH8U_1Ky-WWFlT3V2Zw2WDDXy_oTyzpzmXl7y_4z_lDcr9UOx1awD0iHZM-Jg-qpiC0tBFPyKzBH23jjyL-aBt_VOW0wB8t8EfXCQX80Rp_tMbfU_Ll5Ph8NHbKzh2OhvWdO4r5LPZ4BPSYKWWApHIRaZ_pkMXRQEQDboDH6oDHRveDhCXa8DhOhBE6GbBA-c9IN12n5jmhbpiIRHsRZ0bDMfsqYmCHlO_qKBax5oekV0lKbmyBFllFLi4lylWiXGXflSDXQ8IrYcqSYlrqKAEif_3fW5B8fQKsyQ7KlzjXqP7FbX70ktxr1sEr0s2znXlN7up9vthmb0rQ_ASzxakT |
| 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=Separating+lock-freedom+from+wait-freedom+at+every+level+of+the+consensus+hierarchy&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=Attiya%2C+Hagit&rft.au=Casta%C3%B1eda%2C+Armando&rft.au=Hendler%2C+Danny&rft.au=Perrin%2C+Matthieu&rft.date=2022-05-01&rft.pub=Elsevier&rft.issn=0743-7315&rft.eissn=1096-0848&rft.volume=163&rft.spage=181&rft.epage=197&rft_id=info:doi/10.1016%2Fj.jpdc.2022.01.025&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-05339232v1 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon |