Randomized renaming in shared memory systems
Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m. The problem is called tight if m=n, and loose if m>n. In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memo...
Gespeichert in:
| Veröffentlicht in: | Journal of parallel and distributed computing Jg. 150; S. 112 - 120 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Inc
01.04.2021
|
| Schlagworte: | |
| ISSN: | 0743-7315, 1096-0848 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m. The problem is called tight if m=n, and loose if m>n. In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memory systems, Alistarh et al. describe a construction based on the AKS network that assigns all names within O(logn) steps per process. They also show that, depending on the size of the name space, loose renaming can be done considerably faster. For m=(1+ϵ)⋅n and constant ϵ, they achieve a step complexity of O(loglogn).
In this paper we consider tight as well as loose renaming and introduce randomized algorithms that achieve their tasks with high probability. The model assumed is the asynchronous shared-memory model against an adaptive adversary. Our algorithm for loose renaming maps n processes to a name space of size m=(1+2∕(logn)ℓ)⋅n=(1+o(1))⋅n performing O(ℓ⋅(loglogn)2) test-and-set operations. In the case of tight renaming, we present a protocol that assigns n processes to n names with step complexity O(logn), but without the overhead and impracticality of the AKS network. This algorithm utilizes modern hardware features in form of a counting device which is also described in the paper. This device may have the potential to speed up other distributed algorithms as well.
•Tight and loose renaming in the shared-memory model.•Loose renaming with (1+o(1)) * n names in poly-double-logarithmic number of steps.•Tight renaming algorithm simpler and more practical than existing one.•Tight renaming relies on new HW register with potential benefits in other areas. |
|---|---|
| AbstractList | Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m. The problem is called tight if m=n, and loose if m>n. In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memory systems, Alistarh et al. describe a construction based on the AKS network that assigns all names within O(logn) steps per process. They also show that, depending on the size of the name space, loose renaming can be done considerably faster. For m=(1+ϵ)⋅n and constant ϵ, they achieve a step complexity of O(loglogn).
In this paper we consider tight as well as loose renaming and introduce randomized algorithms that achieve their tasks with high probability. The model assumed is the asynchronous shared-memory model against an adaptive adversary. Our algorithm for loose renaming maps n processes to a name space of size m=(1+2∕(logn)ℓ)⋅n=(1+o(1))⋅n performing O(ℓ⋅(loglogn)2) test-and-set operations. In the case of tight renaming, we present a protocol that assigns n processes to n names with step complexity O(logn), but without the overhead and impracticality of the AKS network. This algorithm utilizes modern hardware features in form of a counting device which is also described in the paper. This device may have the potential to speed up other distributed algorithms as well.
•Tight and loose renaming in the shared-memory model.•Loose renaming with (1+o(1)) * n names in poly-double-logarithmic number of steps.•Tight renaming algorithm simpler and more practical than existing one.•Tight renaming relies on new HW register with potential benefits in other areas. |
| Author | Berenbrink, Petra Friedetzky, Tom Nagel, Lars Brinkmann, André Elsässer, Robert |
| Author_xml | – sequence: 1 givenname: Petra surname: Berenbrink fullname: Berenbrink, Petra email: berenbrink@informatik.uni-hamburg.de organization: Fachbereich Informatik, Universität Hamburg, 22527 Hamburg, Germany – sequence: 2 givenname: André surname: Brinkmann fullname: Brinkmann, André email: brinkman@uni-mainz.de organization: Zentrum für Datenverarbeitung, Johannes Gutenberg-Universität Mainz, 55099 Mainz, Germany – sequence: 3 givenname: Robert surname: Elsässer fullname: Elsässer, Robert email: elsa@cosy.sbg.ac.at organization: Department of Computer Sciences, University of Salzburg, 5020 Salzburg, Austria – sequence: 4 givenname: Tom orcidid: 0000-0002-1299-5514 surname: Friedetzky fullname: Friedetzky, Tom email: tom.friedetzky@durham.ac.uk organization: School of Engineering and Computing Sciences, Durham University, Durham, DH1 3LE, United Kingdom – sequence: 5 givenname: Lars surname: Nagel fullname: Nagel, Lars email: l.nagel@lboro.ac.uk organization: Department of Computer Science, Loughborough University, Loughborough, LE11 3TU, United Kingdom |
| BookMark | eNp9j9FKwzAUhoNMsJu-gFd9AFtPkrY5A29k6BQGguh1yJITTbHpSIYwn96OeS38cODA9_N_czaLYyTGrjnUHHh329f9ztlagOA1TAFxxgoOy64CbHDGClCNrJTk7QWb59wDcN4qLNjNq4luHMIPuTJRNEOIH2WIZf40aXoNNIzpUOZD3tOQL9m5N1-Zrv7ugr0_PrytnqrNy_p5db-prFi2-2qJjVdii50zSGbrhXXKofLg0SFtLYKyjbTUmaYxrUTurORo2tbzaThKuWDi1GvTmHMir3cpDCYdNAd99NW9Pvrqo6-GKSAm6O4E0bTsO1DS2QaKllxIZPfajeE__Bc7sGBB |
| Cites_doi | 10.1145/2597630 10.1007/s004460050045 10.1016/j.cosrev.2011.04.001 10.1016/S0304-3975(98)00242-4 10.1007/s00446-011-0137-5 10.1016/j.tcs.2010.06.001 |
| ContentType | Journal Article |
| Copyright | 2021 Elsevier Inc. |
| Copyright_xml | – notice: 2021 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.jpdc.2021.01.002 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1096-0848 |
| EndPage | 120 |
| ExternalDocumentID | 10_1016_j_jpdc_2021_01_002 S0743731521000022 |
| 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 |
| ID | FETCH-LOGICAL-c295t-984f72b86da8eabf2cd7d87f0f8d8ebc807c43ce6a44a5381dc318a55f1002833 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000617035700010&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 07:12:10 EST 2025 Fri Feb 23 02:48:45 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Tight renaming Loose renaming Shared memory model Randomized algorithm Distributed algorithm |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c295t-984f72b86da8eabf2cd7d87f0f8d8ebc807c43ce6a44a5381dc318a55f1002833 |
| ORCID | 0000-0002-1299-5514 |
| OpenAccessLink | http://dro.dur.ac.uk/34426/ |
| PageCount | 9 |
| ParticipantIDs | crossref_primary_10_1016_j_jpdc_2021_01_002 elsevier_sciencedirect_doi_10_1016_j_jpdc_2021_01_002 |
| PublicationCentury | 2000 |
| PublicationDate | April 2021 2021-04-00 |
| PublicationDateYYYYMMDD | 2021-04-01 |
| PublicationDate_xml | – month: 04 year: 2021 text: April 2021 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of parallel and distributed computing |
| PublicationYear | 2021 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Alistarh, Aspnes, Censor-Hillel, Gilbert, Zadimoghaddam (b2) 2011 Brdosky, Ellen, Woelfel (b8) 2011; 24 Dubhashi, Ranjan (b11) 1996 Okun (b14) 2010; 411 Alistarh, Aspnes, Censor-Hillel, Gilbert, Guerraoui (b1) 2014; 61 Berenbrink, Brinkmann, Elsässer, Friedetzky, Nagel (b7) 2015 Giakkoupis, Woelfel (b13) 2012 Castañeda, Rajsbaum, Raynal (b9) 2011; 5 Alistarh, Aspnes, Giakkoupis, Woelfel (b3) 2013 Alistarh, Aspnes, Gilbert, Guerraoui (b4) 2011 Panconesi, Papatriantafilou, Tsigas, Vitanyi (b15) 1998; 11 Alistarh, Attiya, Gilbert, Giurgiu, Guerraoui (b5) 2010; vol. 6343 Eberly, Higham, Warpechowska-Gruca (b12) 1998 Chaudhuri, Herlihy, Tuttle (b10) 1999; 220 Alistarh, Denysyuk, Rodrigues, Shavit (b6) 2014 Panconesi (10.1016/j.jpdc.2021.01.002_b15) 1998; 11 Alistarh (10.1016/j.jpdc.2021.01.002_b4) 2011 Chaudhuri (10.1016/j.jpdc.2021.01.002_b10) 1999; 220 Eberly (10.1016/j.jpdc.2021.01.002_b12) 1998 Dubhashi (10.1016/j.jpdc.2021.01.002_b11) 1996 Berenbrink (10.1016/j.jpdc.2021.01.002_b7) 2015 Alistarh (10.1016/j.jpdc.2021.01.002_b3) 2013 Alistarh (10.1016/j.jpdc.2021.01.002_b1) 2014; 61 Alistarh (10.1016/j.jpdc.2021.01.002_b6) 2014 Alistarh (10.1016/j.jpdc.2021.01.002_b2) 2011 Castañeda (10.1016/j.jpdc.2021.01.002_b9) 2011; 5 Brdosky (10.1016/j.jpdc.2021.01.002_b8) 2011; 24 Okun (10.1016/j.jpdc.2021.01.002_b14) 2010; 411 Alistarh (10.1016/j.jpdc.2021.01.002_b5) 2010; vol. 6343 Giakkoupis (10.1016/j.jpdc.2021.01.002_b13) 2012 |
| References_xml | – start-page: 718 year: 2011 end-page: 727 ident: b4 article-title: The complexity of renaming publication-title: Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science – start-page: 542 year: 2015 end-page: 549 ident: b7 article-title: Randomized renaming in shared memory systems publication-title: Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium – volume: 11 year: 1998 ident: b15 article-title: Randomized naming using wait-free shared variables publication-title: Distrib. Comput. – start-page: 200 year: 2013 end-page: 209 ident: b3 article-title: Randomized loose renaming in O(log log n) time publication-title: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing – volume: vol. 6343 start-page: 94 year: 2010 end-page: 108 ident: b5 article-title: Fast randomized test-and-set and renaming publication-title: DISC – start-page: 239 year: 2011 end-page: 248 ident: b2 article-title: Optimal-time adaptive strong renaming, with applications to counting publication-title: PODC – volume: 220 start-page: 211 year: 1999 end-page: 245 ident: b10 article-title: Wait-free implementations in message-passing systems publication-title: Theoret. Comput. Sci. – year: 1996 ident: b11 article-title: Balls and Bins: A Study in Negative Dependence – volume: 24 start-page: 119 year: 2011 end-page: 134 ident: b8 article-title: Fully-adaptive algorithms for long-lived renaming publication-title: Distrib. Comput. – volume: 411 start-page: 3787 year: 2010 end-page: 3794 ident: b14 article-title: Strong order-preserving renaming in the synchronous message passing model publication-title: Theoret. Comput. Sci. – start-page: 149 year: 1998 end-page: 160 ident: b12 article-title: Long-lived, fast, waitfree renaming with optimal name space and high throughput publication-title: DISC – start-page: 19 year: 2012 end-page: 28 ident: b13 article-title: On the time and space complexity of randomized test-and-set publication-title: PODC – start-page: 232 year: 2014 end-page: 241 ident: b6 article-title: Balls-into-leaves: Sub-logarithmic renaming in synchronous message-passing systems publication-title: Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing – volume: 61 start-page: 18:1 year: 2014 end-page: 18:51 ident: b1 article-title: Tight bounds for asynchronous renaming publication-title: J. ACM – volume: 5 start-page: 229 year: 2011 end-page: 251 ident: b9 article-title: The renaming problem in shared memory systems: An introduction publication-title: Comput. Sci. Rev. – start-page: 239 year: 2011 ident: 10.1016/j.jpdc.2021.01.002_b2 article-title: Optimal-time adaptive strong renaming, with applications to counting – volume: 61 start-page: 18:1 issue: 3 year: 2014 ident: 10.1016/j.jpdc.2021.01.002_b1 article-title: Tight bounds for asynchronous renaming publication-title: J. ACM doi: 10.1145/2597630 – start-page: 19 year: 2012 ident: 10.1016/j.jpdc.2021.01.002_b13 article-title: On the time and space complexity of randomized test-and-set – start-page: 542 year: 2015 ident: 10.1016/j.jpdc.2021.01.002_b7 article-title: Randomized renaming in shared memory systems – start-page: 232 year: 2014 ident: 10.1016/j.jpdc.2021.01.002_b6 article-title: Balls-into-leaves: Sub-logarithmic renaming in synchronous message-passing systems – start-page: 718 year: 2011 ident: 10.1016/j.jpdc.2021.01.002_b4 article-title: The complexity of renaming – volume: 11 issue: 3 year: 1998 ident: 10.1016/j.jpdc.2021.01.002_b15 article-title: Randomized naming using wait-free shared variables publication-title: Distrib. Comput. doi: 10.1007/s004460050045 – volume: 5 start-page: 229 issue: 3 year: 2011 ident: 10.1016/j.jpdc.2021.01.002_b9 article-title: The renaming problem in shared memory systems: An introduction publication-title: Comput. Sci. Rev. doi: 10.1016/j.cosrev.2011.04.001 – year: 1996 ident: 10.1016/j.jpdc.2021.01.002_b11 – volume: vol. 6343 start-page: 94 year: 2010 ident: 10.1016/j.jpdc.2021.01.002_b5 article-title: Fast randomized test-and-set and renaming – start-page: 149 year: 1998 ident: 10.1016/j.jpdc.2021.01.002_b12 article-title: Long-lived, fast, waitfree renaming with optimal name space and high throughput – start-page: 200 year: 2013 ident: 10.1016/j.jpdc.2021.01.002_b3 article-title: Randomized loose renaming in O(log log n) time – volume: 220 start-page: 211 issue: 1 year: 1999 ident: 10.1016/j.jpdc.2021.01.002_b10 article-title: Wait-free implementations in message-passing systems publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(98)00242-4 – volume: 24 start-page: 119 issue: 2 year: 2011 ident: 10.1016/j.jpdc.2021.01.002_b8 article-title: Fully-adaptive algorithms for long-lived renaming publication-title: Distrib. Comput. doi: 10.1007/s00446-011-0137-5 – volume: 411 start-page: 3787 issue: 40–42 year: 2010 ident: 10.1016/j.jpdc.2021.01.002_b14 article-title: Strong order-preserving renaming in the synchronous message passing model publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2010.06.001 |
| SSID | ssj0011578 |
| Score | 2.2979581 |
| Snippet | Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m. The problem is called tight if m=n, and loose... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 112 |
| SubjectTerms | Distributed algorithm Loose renaming Randomized algorithm Shared memory model Tight renaming |
| Title | Randomized renaming in shared memory systems |
| URI | https://dx.doi.org/10.1016/j.jpdc.2021.01.002 |
| Volume | 150 |
| WOSCitedRecordID | wos000617035700010&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/eLvHCXMwtV1Li9swEBYh20MvfZduX_jQW-vFku1IPi5lS1vKUtq05GZkS6YJiTck3mW7f2D_9s5oJDt90hYKwQSBY0UznhlpvvmGsWfgMwtuqypG7qsYAYzwzhVpbKzMGyM15y6D__mdPD5Ws1nxfjS6DLUwZ0vZtur8vFj_V1HDGAgbS2f_Qtz9j8IAfAehwxXEDtc_EvwH3ZqT1fzCYl0KtpunopXtFwc1XyGy9qsncN7-IjRFPvDl0hKLgEFqXeyKZV0B3Pq0C97OlffAM6oNbGg92Hezs8GH0ZXvwYy4ScrJD2CRrRvIEA8wYLx7fYItvLHdBR3tTmmdwvGE4DuoFndmFupmvoF1OmJUmVIh54El05sgHFoR72Zvm4mV1ltX7hHX5Ki5q6L70QfQccTiYLE2yFEpuONlTcTg8Xoc4kecCM5DuDSHAF--JyRo75jtHb45mr3tE1I8J6ceJu7rrwgq-P2Tfh7j7MQt01vshpdqdEiKcpuNbHuH3QzNPCJv2--yF4PeREFvonkbkd5EpDeR15t77NOro-nL17FvpRHXosi7uFBZI0WlJkYrq6tG1EYaJZukUUbZqlaJrLO0thOdZRp8IDc1GHud5w133azS-2zcnrT2AYuaTCdVlpo0MZiZ01rnGa_rYgLvtqrEZJ89D3--XBNjShmghIsSl6rEpSoT-CRin-VhfUof81EsV4I4f3Pfw3-87xG7PmjpYzbuNqf2CbtWn3Xz7eapl_oVd6156A |
| 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+renaming+in+shared+memory+systems&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=Berenbrink%2C+Petra&rft.au=Brinkmann%2C+Andr%C3%A9&rft.au=Els%C3%A4sser%2C+Robert&rft.au=Friedetzky%2C+Tom&rft.date=2021-04-01&rft.pub=Elsevier+Inc&rft.issn=0743-7315&rft.eissn=1096-0848&rft.volume=150&rft.spage=112&rft.epage=120&rft_id=info:doi/10.1016%2Fj.jpdc.2021.01.002&rft.externalDocID=S0743731521000022 |
| 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 |