Adaptive and efficient mutual exclusion
This paper presents adaptive algorithms for mutual exclusion using only read and write operations; the performance of the algorithms depends only on the point contention, i.e., the number of processes that are concurrently active during the algorithm execution (and not on n, the total number of proc...
Saved in:
| Published in: | Distributed computing Vol. 15; no. 3; pp. 177 - 189 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Heidelberg
Springer Nature B.V
01.07.2002
|
| ISSN: | 0178-2770, 1432-0452 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | This paper presents adaptive algorithms for mutual exclusion using only read and write operations; the performance of the algorithms depends only on the point contention, i.e., the number of processes that are concurrently active during the algorithm execution (and not on n, the total number of processes). Our algorithm has O(k) remote step complexity and O(log k) system response time, where k is the point contention. The remote step complexity is the maximal number of steps performed by a process where a wait is counted as one step. The system response time is the time interval between subsequent entries to the critical section, where one time unit is the minimal interval in which every active process performs at least one step. The space complexity of this algorithm is O(N log n), where N is the range of processes' names. We show how to make the space complexity of our algorithm depend solely on n, while preserving the other performance measures of the algorithm. |
|---|---|
| AbstractList | This paper presents adaptive algorithms for mutual exclusion using only read and write operations; the performance of the algorithms depends only on the point contention, i.e., the number of processes that are concurrently active during the algorithm execution (and not on n, the total number of processes). Our algorithm has O(k) remote step complexity and O(log k) system response time, where k is the point contention. The remote step complexity is the maximal number of steps performed by a process where a wait is counted as one step. The system response time is the time interval between subsequent entries to the critical section, where one time unit is the minimal interval in which every active process performs at least one step. The space complexity of this algorithm is O(N log n), where N is the range of processes' names. We show how to make the space complexity of our algorithm depend solely on n, while preserving the other performance measures of the algorithm. |
| Author | Bortnikov, Vita Attiya, Hagit |
| Author_xml | – sequence: 1 givenname: Hagit surname: Attiya fullname: Attiya, Hagit – sequence: 2 givenname: Vita surname: Bortnikov fullname: Bortnikov, Vita |
| BookMark | eNp1kL1PwzAQxS1UJNrCyB4xwBQ424kdj1XFl1SJBWbLcc6Sq9QpsYPgv8eoLFRiujf83r27tyCzMAQk5JLCLQWQdxGgqgRkDaI5IXNacVZCVbMZmQOVTcmkhDOyiHGbEU4pm5ObVWf2yX9gYUJXoHPeegyp2E1pMn2Bn7afoh_COTl1po948TuX5O3h_nX9VG5eHp_Xq01pmeKprLhSrgWLTnBlRMuoEsKA4i0YaBuFyrjaYtfKziquqEDrWooVdk4YYS1fkuvD3v04vE8Yk975aLHvTcBhippJaGoBLINXR-B2mMaQb9M5tGbQyCZD_ADZcYhxRKetTyblf9JofK8p6J_m9J_msqs8cu1HvzPj1z_8N9pjb9U |
| CitedBy_id | crossref_primary_10_1007_s00446_010_0096_2 crossref_primary_10_1007_s00446_005_0143_6 crossref_primary_10_1016_j_ic_2013_11_007 crossref_primary_10_1137_070686445 crossref_primary_10_1007_s00446_011_0152_6 crossref_primary_10_1145_2597630 crossref_primary_10_1145_792538_792541 crossref_primary_10_1016_j_jpdc_2017_05_010 |
| ContentType | Journal Article |
| Copyright | Copyright Springer-Verlag New York, Inc. Jul 2002 |
| Copyright_xml | – notice: Copyright Springer-Verlag New York, Inc. Jul 2002 |
| DBID | AAYXX CITATION 3V. 7RQ 7SC 7XB 8AL 8AO 8FD 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI Q9U U9A |
| DOI | 10.1007/s004460100068 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Career & Technical Education Database Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central (ProQuest) Technology collection ProQuest One ProQuest Central ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database ProQuest advanced technologies & aerospace journals ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central Basic |
| DatabaseTitle | CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Pharma Collection ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Career and Technical Education (Alumni Edition) Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest Career and Technical Education ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: 7RQ name: Career & Technical Education Database url: https://search.proquest.com/career sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1432-0452 |
| EndPage | 189 |
| ExternalDocumentID | 692295911 10_1007_s004460100068 |
| Genre | General Information |
| GroupedDBID | -Y2 -~C -~X .86 .VR 06D 0R~ 0VY 1N0 1SB 203 29G 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6NX 78A 7RQ 8AO 8FE 8FG 8UJ 95- 95. 95~ 96X AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYXX ABAKF ABBBX ABBRH ABBXA ABDBE ABDPE ABDZT ABECU ABFSG ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSTC ACZOJ ADHHG ADHIR ADHKG ADIMF ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFFHD AFGCZ AFHIU AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AIAKS AIGIU AILAN AITGF AIXLP AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN AZQEC B-. BA0 BDATZ BENPR BGLVJ BGNMA BPHCQ BSONS CCPQU CITATION CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EBLON EBS EIOEI EJD ESBYG ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ7 GQ8 GXS HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K6V K7- KDC KOV LAS LLZTM M4Y MA- N2Q N9A NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF0 PHGZM PHGZT PQGLB PQQKQ PROAC PT4 PT5 Q2X QOK QOS R89 R9I RHV ROL RPX RSV S16 S27 S3B SAP SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR YZZ Z45 ZCA ZMTXR ~EX 3V. 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D M0N PKEHL PQEST PQUKI Q9U U9A AAYZH AESKC PUEGO |
| ID | FETCH-LOGICAL-c293t-4399fb0cef639a6b21966a093b0a0b89e9af5cedb7dc93916ecfb1e4edf6a6cc3 |
| IEDL.DBID | 7RQ |
| ISICitedReferencesCount | 15 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000177363500004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0178-2770 |
| IngestDate | Thu Oct 02 07:39:07 EDT 2025 Tue Dec 02 13:50:36 EST 2025 Tue Nov 18 20:27:48 EST 2025 Sat Nov 29 06:13:23 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| License | http://www.springer.com/tdm |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c293t-4399fb0cef639a6b21966a093b0a0b89e9af5cedb7dc93916ecfb1e4edf6a6cc3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-General Information-1 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| PQID | 219520878 |
| PQPubID | 31799 |
| PageCount | 13 |
| ParticipantIDs | proquest_miscellaneous_27085602 proquest_journals_219520878 crossref_citationtrail_10_1007_s004460100068 crossref_primary_10_1007_s004460100068 |
| PublicationCentury | 2000 |
| PublicationDate | 2002-07-01 |
| PublicationDateYYYYMMDD | 2002-07-01 |
| PublicationDate_xml | – month: 07 year: 2002 text: 2002-07-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Heidelberg |
| PublicationPlace_xml | – name: Heidelberg |
| PublicationTitle | Distributed computing |
| PublicationYear | 2002 |
| Publisher | Springer Nature B.V |
| Publisher_xml | – name: Springer Nature B.V |
| SSID | ssj0003112 |
| Score | 1.6484772 |
| Snippet | This paper presents adaptive algorithms for mutual exclusion using only read and write operations; the performance of the algorithms depends only on the point... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 177 |
| Title | Adaptive and efficient mutual exclusion |
| URI | https://www.proquest.com/docview/219520878 https://www.proquest.com/docview/27085602 |
| Volume | 15 |
| WOSCitedRecordID | wos000177363500004&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: PRVPQU databaseName: Career & Technical Education Database customDbUrl: eissn: 1432-0452 dateEnd: 20021231 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: 7RQ dateStart: 20000701 isFulltext: true titleUrlDefault: https://search.proquest.com/career providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1432-0452 dateEnd: 20021231 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: K7- dateStart: 20000701 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest advanced technologies & aerospace journals customDbUrl: eissn: 1432-0452 dateEnd: 20021231 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: P5Z dateStart: 20000701 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central (ProQuest) customDbUrl: eissn: 1432-0452 dateEnd: 20021231 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: BENPR dateStart: 20000701 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1432-0452 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NS8MwFH_o5sGL8xPndPYgejGYrm3SnmTKhiCMOT8YXkaaJiDMbu5D_PPNy7IyD3rxEih9oeHxvpr38QM404g2ELGAiDDClhzBiOA6JMbVaeX7PAhCbcEmeKcT9_tJ19XmTF1Z5dImWkOdjSTekV8ZzYoaNObx9fiDIGgUJlcdgsY6lH38oBFn3nsoDHHg22QnAtCTBufUjdi0nXM2kUnxchuHrK66pJ8W2bqZduWfB9yGLRdfes2FQOzAmsp3obLEbvCcKu_BRTMTYzR1nsgzT9lBEsb_eO9zbCjx1JcczvEibR-e262n2zviQBOINJ57RvD_QqdUKm1iD8FScyzGBE2ClAqaxolKhI6kylKeyQS7bpXUqa9ClWkmmJTBAZTyUa4OwQsEpZlQLPGjLJQpjUOhFU0TjBIVjXUVLpd8G0g3URyBLYaDYhbyKpurcF6QjxejNH4jrC05PHAaNR0U7K3CafHWqALmN0SuRnNDwk38yGjj6M_9Ndi0iC625PYYSrPJXJ3AhvycvU0ndStBdSjftDrdnnm658Ss3ejVrL3Hl2_AdtEp |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V07b9swED44aYFkafpIUTdJo6GPJUSoFykNQWC0NWzYNTo4gDeVoo5AAVd2YquPH9X_WB4tCc7Qbh4660QIusd35PHuA3htiG0gFiFTUUwtOUowJU3ELNQZ9H0ZhpFxZBNyMklms_RzB343vTB0rbKJiS5QFwtNZ-SX1rPigCcyuV7eMiKNouJqw6CxsYoR_vphd2yrq-EHq943QdD_OH0_YDWpANMW2daM8m-Tc43GYrMSuV1XCGX39TlXPE9STJWJNRa5LHRKXamoTe5jhIURSmgd2nX34EEUJpLcaiRZG_hD3xVXifCeBVLyeqSn69RzhVNOh-k01HUbAu8jgIO1_tF_9kMew6M6f_Z6G4N_Ah0sn8JRw03h1aHqGbzrFWpJodxTZeGhG5Rh8dX7VlHDjIc_9byig8JjuNnJ5z6H_XJR4gvwQsV5oVCkflxEOudJpAzyPKUsGHliunDR6CnT9cR0Iu6YZ-2s5221duFtK77cjAr5m-BJo9GsjhirrFVnF87bp9bVqX6jSlxUVkTa_Fjw4OU_3z-Hg8H00zgbDyejEzh07DXuevEp7K_vKjyDh_r7-uvq7pWzXg--7No6_gAU6i0d |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9tAEB5RqCouPEoR4ekDlEst1rG9ax8QQtCoCBTl0EqIi1mvZyUkcAJJePw0_h0zG9uiB7hx4OzxQ57Z-WZ3Hh_AtmW2gViGvo5ibsnR0tfKRj5BncUgUGEYWUc2obrd5Pw87U3Bc90Lw2WVtU90jrroGz4j36OVFbdFopI9W1VF9I47B4NbnwmkONFas2lMLOQUnx5o9zbcPzkmVe-0253ff4_--BXBgG8I5UY-x-I2FwYt4bSWOb1DSk17_FxokScpptrGBotcFSblDlU0Ng8wwsJKLY0J6blfYEbRFpOrCXvxRQMCYeASrWTvZIhKiWq8p-vac0lUwQfrPOD1NRz-jwYO4jrzn_jnLMBcFVd7h5OFsAhTWH6H-Zqzwqtc2BLsHhZ6wC7e02XhoRugQbjr3Yy5kcbDR3M95gPEH_DvQz53GabLfokr4IVaiEKjTIO4iEwukkhbFHnK0TGKxLbgV62zzFST1JnQ4zprZkC_VnELfjbig8kIkbcE12rtZpUnGWaNaluw1VwlF8B5HV1if0wiiuJmKdqr796_Bd_IKLKzk-7pGsw6UhtXdbwO06O7MW7AV3M_uhrebTpD9uDyo43jBdLINkE |
| 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=Adaptive+and+efficient+mutual+exclusion&rft.jtitle=Distributed+computing&rft.au=Attiya%2C+Hagit&rft.au=Bortnikov%2C+Vita&rft.date=2002-07-01&rft.issn=0178-2770&rft.volume=15&rft.issue=3&rft.spage=177&rft.epage=189&rft_id=info:doi/10.1007%2Fs004460100068&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-2770&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-2770&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-2770&client=summon |