A self‐stabilizing distributed algorithm for the local (1,|Ni|)‐critical section problem
Summary We consider the local (1,|Ni|)‐critical section (CS) problem where Ni is the set of neighboring processes for each process Pi. It dynamically maintains two disjoint dominating sets and is one of the generalizations of the mutual exclusion problem. The problem is one of controlling the system...
Gespeichert in:
| Veröffentlicht in: | Concurrency and computation Jg. 33; H. 12 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Hoboken
Wiley Subscription Services, Inc
25.06.2021
|
| Schlagworte: | |
| ISSN: | 1532-0626, 1532-0634 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Summary
We consider the local (1,|Ni|)‐critical section (CS) problem where Ni is the set of neighboring processes for each process Pi. It dynamically maintains two disjoint dominating sets and is one of the generalizations of the mutual exclusion problem. The problem is one of controlling the system in such a way that, for each process, among its neighbors and itself, at least one process must be in the CS and at least one process must be out of the CS at each time. That is, in the system G=(V,E), there are always two disjoint dominating sets A1(⊂V) and A2(=V\A1) and each process alternates between its rule A1 and A2 infinitely. It is useful for sleep scheduling or cluster head scheduling in sensor networks. In this paper, first, we show the necessary and sufficient conditions to solve the problem without any deadlock detection. To discuss the conditions, we consider an inefficient (costly) self‐stabilizing algorithm for the local (1,|Ni|)‐CS problem. After that, an efficient self‐stabilizing algorithm for the local (1,|Ni|)‐CS problem is proposed under an additional assumption that the graph does not have a special matching, which we call unpreventable colorable maximal matching. The convergence time of the proposed algorithm is O(n) rounds under the weakly fair distributed daemon. |
|---|---|
| AbstractList | We consider the local (1,|
N
i
|)‐critical section (CS) problem where
N
i
is the set of neighboring processes for each process
P
i
. It dynamically maintains two disjoint dominating sets and is one of the generalizations of the mutual exclusion problem. The problem is one of controlling the system in such a way that, for each process, among its neighbors and itself, at least one process must be in the CS and at least one process must be out of the CS at each time. That is, in the system
G
=(
V
,
E
), there are always two disjoint dominating sets
A
1
(⊂
V
) and
A
2
(=
V
\
A
1
) and each process alternates between its rule
A
1
and
A
2
infinitely. It is useful for sleep scheduling or cluster head scheduling in sensor networks. In this paper, first, we show the necessary and sufficient conditions to solve the problem without any deadlock detection. To discuss the conditions, we consider an inefficient (costly) self‐stabilizing algorithm for the local (1,|
N
i
|)‐CS problem. After that, an efficient self‐stabilizing algorithm for the local (1,|
N
i
|)‐CS problem is proposed under an additional assumption that the graph does not have a special matching, which we call unpreventable colorable maximal matching. The convergence time of the proposed algorithm is
O
(
n
) rounds under the weakly fair distributed daemon. We consider the local (1,|Ni|)‐critical section (CS) problem where Ni is the set of neighboring processes for each process Pi. It dynamically maintains two disjoint dominating sets and is one of the generalizations of the mutual exclusion problem. The problem is one of controlling the system in such a way that, for each process, among its neighbors and itself, at least one process must be in the CS and at least one process must be out of the CS at each time. That is, in the system G=(V,E), there are always two disjoint dominating sets A1(⊂V) and A2(=V\A1) and each process alternates between its rule A1 and A2 infinitely. It is useful for sleep scheduling or cluster head scheduling in sensor networks. In this paper, first, we show the necessary and sufficient conditions to solve the problem without any deadlock detection. To discuss the conditions, we consider an inefficient (costly) self‐stabilizing algorithm for the local (1,|Ni|)‐CS problem. After that, an efficient self‐stabilizing algorithm for the local (1,|Ni|)‐CS problem is proposed under an additional assumption that the graph does not have a special matching, which we call unpreventable colorable maximal matching. The convergence time of the proposed algorithm is O(n) rounds under the weakly fair distributed daemon. Summary We consider the local (1,|Ni|)‐critical section (CS) problem where Ni is the set of neighboring processes for each process Pi. It dynamically maintains two disjoint dominating sets and is one of the generalizations of the mutual exclusion problem. The problem is one of controlling the system in such a way that, for each process, among its neighbors and itself, at least one process must be in the CS and at least one process must be out of the CS at each time. That is, in the system G=(V,E), there are always two disjoint dominating sets A1(⊂V) and A2(=V\A1) and each process alternates between its rule A1 and A2 infinitely. It is useful for sleep scheduling or cluster head scheduling in sensor networks. In this paper, first, we show the necessary and sufficient conditions to solve the problem without any deadlock detection. To discuss the conditions, we consider an inefficient (costly) self‐stabilizing algorithm for the local (1,|Ni|)‐CS problem. After that, an efficient self‐stabilizing algorithm for the local (1,|Ni|)‐CS problem is proposed under an additional assumption that the graph does not have a special matching, which we call unpreventable colorable maximal matching. The convergence time of the proposed algorithm is O(n) rounds under the weakly fair distributed daemon. |
| Author | Kamei, Sayaka Kakugawa, Hirotsugu |
| Author_xml | – sequence: 1 givenname: Sayaka orcidid: 0000-0003-1716-3028 surname: Kamei fullname: Kamei, Sayaka email: s-kamei@se.hiroshima-u.ac.jp organization: Hiroshima University – sequence: 2 givenname: Hirotsugu orcidid: 0000-0003-1087-410X surname: Kakugawa fullname: Kakugawa, Hirotsugu organization: Ryukoku University |
| BookMark | eNp1kM1KAzEQx4Mo2FbBR1jwUsGtmWST7R5LqR9Q1IPehCWbTdqUdLcmKVLpwUfwGX0Sd614ED3NMPP7z8e_i_arulIInQAeAMbkQq7UgHEy3EMdYJTEmNNk_ycn_BB1vV9gDIApdNDTKPLK6o-3dx9EYax5NdUsKo0PzhTroMpI2FntTJgvI127KMxVZGspbNSH8-2t2Z41Utn0TVvzSgZTV9HK1YVVyyN0oIX16vg79tDj5eRhfB1P765uxqNpLCnLhnFKJeNpmekspcAEQJIQzUuGeQFtKwHVPFFy4EPFdJEBK3QqhZa0gIKWgvbQ6W5us_d5rXzIF_XaVc3KnDAKCcGEQEMNdpR0tfdO6VyaINp7gxPG5oDz1sG8cTBvHWwE_V-ClTNL4TZ_ofEOfTFWbf7l8vH95Iv_BOaGgvM |
| CitedBy_id | crossref_primary_10_15803_ijnc_12_1_103 |
| Cites_doi | 10.1145/365559.365617 10.1016/j.ipl.2015.01.008 10.1016/j.tcs.2015.06.004 10.1093/comjnl/47.3.289 10.1016/S0920-5489(02)00105-8 10.1007/978-3-540-89335-6_11 10.7551/mitpress/6156.001.0001 10.1109/SAHCN.2007.4292827 10.1016/S0304-3975(00)00325-X 10.3390/a10020038 10.1109/PADSW.2018.8644642 10.1016/j.ipl.2014.08.012 10.1016/j.tcs.2008.10.009 10.1016/S0304-3975(03)00130-0 10.1007/978-3-642-05118-0_2 10.1145/361179.361202 10.1006/jpdc.2001.1831 10.1016/j.jpdc.2015.01.003 10.1109/CANDARW.2018.00059 10.1007/3-540-40026-5_15 10.1016/S0020-0190(00)00056-9 10.1007/978-3-642-15277-1_51 10.1137/S0097539793254571 10.1016/0020-0190(86)90046-3 10.1016/0020-0190(91)90111-T 10.1109/CANDAR.2017.18 10.1007/3-540-48311-X_116 |
| ContentType | Journal Article |
| Copyright | 2019 John Wiley & Sons, Ltd. 2021 John Wiley & Sons, Ltd. |
| Copyright_xml | – notice: 2019 John Wiley & Sons, Ltd. – notice: 2021 John Wiley & Sons, Ltd. |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1002/cpe.5628 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | CrossRef Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1532-0634 |
| EndPage | n/a |
| ExternalDocumentID | 10_1002_cpe_5628 CPE5628 |
| Genre | article |
| GrantInformation_xml | – fundername: KAKENHI funderid: 19K11828; 19K11826 – fundername: Japan Science and Technology Agency (JST) SICORP funderid: JPMJSC1806 |
| GroupedDBID | .3N .DC .GA 05W 0R~ 10A 1L6 1OC 33P 3SF 3WU 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHHS AAHQN AAMNL AANLZ AAONW AAXRX AAYCA AAZKR ABCQN ABCUV ABEML ABIJN ACAHQ ACCFJ ACCZN ACPOU ACSCC ACXBN ACXQS ADBBV ADEOM ADIZJ ADKYN ADMGS ADOZA ADXAS ADZMN ADZOD AEEZP AEIGN AEIMD AEQDE AEUQT AEUYR AFBPY AFFPM AFGKR AFPWT AFWVQ AHBTC AITYG AIURR AIWBW AJBDE AJXKR ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ATUGU AUFTA AZBYB BAFTC BDRZF BFHJK BHBCM BMNLL BROTX BRXPI BY8 CS3 D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM EBS F00 F01 F04 F5P G-S G.N GNP GODZA HGLYW HHY HZ~ IX1 JPC KQQ LATKE LAW LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A O66 O9- OIG P2W P2X P4D PQQKQ Q.N Q11 QB0 QRW R.K ROL RWI RX1 SUPJJ TN5 UB1 V2E W8V W99 WBKPD WIH WIK WOHZO WQJ WRC WXSBR WYISQ WZISG XG1 XV2 ~IA ~WT AAYXX ADMLS AEYWJ AGHNM AGYGG CITATION O8X 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c3598-73c567d9f97315a11442f6d506b13c5641e634d6168e5fb915bf7cafc3b1b3da3 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000504005000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1532-0626 |
| IngestDate | Sun Nov 09 08:55:45 EST 2025 Tue Nov 18 21:16:21 EST 2025 Sat Nov 29 01:41:23 EST 2025 Wed Jan 22 16:29:13 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 12 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3598-73c567d9f97315a11442f6d506b13c5641e634d6168e5fb915bf7cafc3b1b3da3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0003-1087-410X 0000-0003-1716-3028 |
| PQID | 2531420221 |
| PQPubID | 2045170 |
| PageCount | 22 |
| ParticipantIDs | proquest_journals_2531420221 crossref_citationtrail_10_1002_cpe_5628 crossref_primary_10_1002_cpe_5628 wiley_primary_10_1002_cpe_5628_CPE5628 |
| PublicationCentury | 2000 |
| PublicationDate | 25 June 2021 |
| PublicationDateYYYYMMDD | 2021-06-25 |
| PublicationDate_xml | – month: 06 year: 2021 text: 25 June 2021 day: 25 |
| PublicationDecade | 2020 |
| PublicationPlace | Hoboken |
| PublicationPlace_xml | – name: Hoboken |
| PublicationTitle | Concurrency and computation |
| PublicationYear | 2021 |
| Publisher | Wiley Subscription Services, Inc |
| Publisher_xml | – name: Wiley Subscription Services, Inc |
| References | 2001; 266 1991; 39 2010 2004; 47 2015; 77 2009 2008 2007 2009; 410 2015; 129 2002 1974; 17 1999 2003; 308 2015; 115 1990 2001 2000 1965; 8 2002; 62 1986; 23 1995; 24 2017; 10 2000; 74 2015; 593 2003; 25 2018 e_1_2_9_30_1 e_1_2_9_31_1 e_1_2_9_11_1 e_1_2_9_10_1 e_1_2_9_13_1 e_1_2_9_32_1 e_1_2_9_12_1 Yadav N (e_1_2_9_4_1) 2015; 129 e_1_2_9_15_1 e_1_2_9_14_1 e_1_2_9_17_1 e_1_2_9_16_1 e_1_2_9_19_1 e_1_2_9_18_1 e_1_2_9_20_1 e_1_2_9_22_1 e_1_2_9_21_1 e_1_2_9_24_1 e_1_2_9_8_1 e_1_2_9_7_1 e_1_2_9_6_1 e_1_2_9_5_1 e_1_2_9_3_1 e_1_2_9_2_1 e_1_2_9_9_1 e_1_2_9_26_1 e_1_2_9_25_1 Garey MR (e_1_2_9_23_1) 1990 e_1_2_9_28_1 e_1_2_9_27_1 e_1_2_9_29_1 |
| References_xml | – year: 2009 – volume: 23 start-page: 77 issue: 2 year: 1986 end-page: 80 article-title: An implementation of mutual inclusion publication-title: Inf Process Lett – volume: 47 start-page: 289 issue: 3 year: 2004 end-page: 298 article-title: Self‐stabilizing mutual exclusion under arbitrary scheduler publication-title: Comput J – volume: 115 start-page: 562 issue: 6‐8 year: 2015 end-page: 569 article-title: Self‐stabilizing distributed algorithm for local mutual inclusion publication-title: Inf Process Lett – volume: 129 start-page: 11 issue: 14 year: 2015 end-page: 16 article-title: A review of various mutual exclusion algorithms in distributed environment publication-title: Int J Comput Appl – volume: 115 start-page: 28 issue: 1 year: 2015 end-page: 32 article-title: On the family of critical section problems publication-title: Inf Process Lett – year: 2007 – year: 2001 – volume: 308 start-page: 449 issue: 1‐3 year: 2003 end-page: 515 article-title: Self‐stabilizing timestamps publication-title: Theor Comput Sci – year: 2000 – year: 2018 – year: 1990 – volume: 10 start-page: 38 issue: 2 year: 2017 article-title: An asynchronous message‐passing distributed algorithm for the generalized local critical section problem publication-title: Algorithms – volume: 8 start-page: 569 issue: 9 year: 1965 article-title: Solution of a problem in concurrent programming control publication-title: Commun ACM – year: 2010 – volume: 593 start-page: 132 year: 2015 end-page: 138 article-title: A theorem of Ore and self‐stabilizing algorithms for disjoint minimal dominating sets publication-title: Theor Comput Sci – volume: 266 start-page: 653 issue: 1‐2 year: 2001 end-page: 692 article-title: Self‐stabilizing l‐exclusion publication-title: Theor Comput Sci – volume: 17 start-page: 643 issue: 11 year: 1974 end-page: 644 article-title: Self stabilizing systems in spite of distributed control publication-title: Commun ACM – volume: 77 start-page: 95 year: 2015 end-page: 104 article-title: Mutual inclusion in asynchronous message‐passing distributed systems publication-title: J Parallel Distrib Comput – volume: 74 start-page: 203 issue: 5‐6 year: 2000 end-page: 207 article-title: Randomized uniform self‐stabilizing mutual exclusion publication-title: Inf Process Lett – year: 2002 – year: 2008 – volume: 25 start-page: 159 issue: 2 year: 2003 end-page: 181 article-title: A survey of permission‐based distributed mutual exclusion algorithms publication-title: Comput Stand Interfaces – volume: 62 start-page: 885 issue: 5 year: 2002 end-page: 898 article-title: Uniform and self‐stabilizing fair mutual exclusion on unidirectional rings under unfair distributed daemon publication-title: J Parallel Distrib Comput – volume: 410 start-page: 581 issue: 6‐7 year: 2009 end-page: 594 article-title: Robust self‐stabilizing weight‐based clustering algorithm publication-title: Theor Comput Sci – volume: 39 start-page: 147 issue: 3 year: 1991 end-page: 151 article-title: A self‐stabilizing algorithm for constructing spanning trees publication-title: Inf Process Lett – volume: 24 start-page: 1259 issue: 6 year: 1995 end-page: 1277 article-title: What can be computed locally? publication-title: SIAM J Comput – year: 1999 – volume-title: Computers and Intractability: A Guide to the Theory of NP‐Completeness year: 1990 ident: e_1_2_9_23_1 – ident: e_1_2_9_2_1 doi: 10.1145/365559.365617 – ident: e_1_2_9_11_1 doi: 10.1016/j.ipl.2015.01.008 – ident: e_1_2_9_26_1 doi: 10.1016/j.tcs.2015.06.004 – ident: e_1_2_9_18_1 doi: 10.1093/comjnl/47.3.289 – ident: e_1_2_9_3_1 doi: 10.1016/S0920-5489(02)00105-8 – ident: e_1_2_9_28_1 doi: 10.1007/978-3-540-89335-6_11 – ident: e_1_2_9_20_1 – ident: e_1_2_9_31_1 doi: 10.7551/mitpress/6156.001.0001 – ident: e_1_2_9_12_1 doi: 10.1109/SAHCN.2007.4292827 – ident: e_1_2_9_5_1 doi: 10.1016/S0304-3975(00)00325-X – ident: e_1_2_9_15_1 doi: 10.3390/a10020038 – ident: e_1_2_9_27_1 doi: 10.1109/PADSW.2018.8644642 – ident: e_1_2_9_8_1 doi: 10.1016/j.ipl.2014.08.012 – ident: e_1_2_9_22_1 doi: 10.1016/j.tcs.2008.10.009 – ident: e_1_2_9_32_1 doi: 10.1016/S0304-3975(03)00130-0 – ident: e_1_2_9_25_1 doi: 10.1007/978-3-642-05118-0_2 – volume: 129 start-page: 11 issue: 14 year: 2015 ident: e_1_2_9_4_1 article-title: A review of various mutual exclusion algorithms in distributed environment publication-title: Int J Comput Appl – ident: e_1_2_9_13_1 doi: 10.1145/361179.361202 – ident: e_1_2_9_16_1 doi: 10.1006/jpdc.2001.1831 – ident: e_1_2_9_7_1 doi: 10.1016/j.jpdc.2015.01.003 – ident: e_1_2_9_9_1 doi: 10.1109/CANDARW.2018.00059 – ident: e_1_2_9_10_1 doi: 10.1007/3-540-40026-5_15 – ident: e_1_2_9_17_1 doi: 10.1016/S0020-0190(00)00056-9 – ident: e_1_2_9_21_1 doi: 10.1007/978-3-642-15277-1_51 – ident: e_1_2_9_24_1 doi: 10.1137/S0097539793254571 – ident: e_1_2_9_6_1 doi: 10.1016/0020-0190(86)90046-3 – ident: e_1_2_9_30_1 – ident: e_1_2_9_29_1 doi: 10.1016/0020-0190(91)90111-T – ident: e_1_2_9_14_1 doi: 10.1109/CANDAR.2017.18 – ident: e_1_2_9_19_1 doi: 10.1007/3-540-48311-X_116 |
| SSID | ssj0011031 |
| Score | 2.2773507 |
| Snippet | Summary
We consider the local (1,|Ni|)‐critical section (CS) problem where Ni is the set of neighboring processes for each process Pi. It dynamically maintains... We consider the local (1,| N i |)‐critical section (CS) problem where N i is the set of neighboring processes for each process P i . It dynamically maintains... We consider the local (1,|Ni|)‐critical section (CS) problem where Ni is the set of neighboring processes for each process Pi. It dynamically maintains two... |
| SourceID | proquest crossref wiley |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| SubjectTerms | Algorithms disjoint minimal dominating sets domatic partition Matching mutual exclusion mutual inclusion Scheduling self‐stabilization |
| Title | A self‐stabilizing distributed algorithm for the local (1,|Ni|)‐critical section problem |
| URI | https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fcpe.5628 https://www.proquest.com/docview/2531420221 |
| Volume | 33 |
| WOSCitedRecordID | wos000504005000001&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: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1532-0634 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011031 issn: 1532-0626 databaseCode: DRFUL dateStart: 20010101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFA46ffDFuzhvRBAvYF2TJmn6OKbDBxkiDnwQSpImOphTtumD7MGf4G_0l5i06aagIPjUh55TSpKT86U95_sA2CNKJpwnOJCE6oBgY4JE2rjSTEYChzrjyuRiE3GrxW9ukktfVel6YQp-iPEHNxcZ-X7tAlzIQW1CGqqe9IlN3nwazLieKnvwmjm9arYvxv8QnIBBwZaKg9Di9pJ6NsS10vd7MpogzK84NU80zYX_vOIimPfwEtaL9bAEpnRvGSyU0g3QR_IKuK3Dge6aj7d3iw5dfeyrTWEwcyy6TgBLZ1B07x77neH9A7SwFlqYCPO0Bw_R8ajVGR1ZV-VlEuyj8u4I6NVpVkG7eXbdOA-80EKgHIFfEEeKsjhLjNOxosIekeyksYyGTCJ3iyDNIpIxxLimRiaIShMrYVQkkYwyEa2BSu-xp9cB1KFhSBEZKU6JVlokgnNDCeKSK4FIFRyUI54qz0LuxDC6acGfjFM7aKkbtCrYHVs-FcwbP9hslZOW-tgbpNhuKwRbbIKqYD-fnl_908blmbtu_NVwE8xhV9QSsgDTLVAZ9p_1NphVL8POoL_jV-An-LPh3g |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bSxwxFD7YtVBfvPSC6zUFsS00OskkmQw-ibpYXAcpLuxDYZhkEl1YV9ldfRAf_An-Rn-JyVzWFioIPs3DnDMM5-TkfJNJvg9gg2kVSxlTrBg3mFFrcaxcXRmhwowGJpfaFmITUZLIbjc-mYKd-ixMyQ8xWXDzlVHM177A_YL09jNrqL4yW657y3cwzUQYyQZM7_9uddqTnwhewaCkS6U4cMC95p4N6Hbt-283eoaYfwPVotO05t70jvMwWwFMtFuOiAWYMoOPMFeLN6Cqlj_Bn100Mn37eP_g8KHfIXvrmhjKPY-ul8AyOcr6Z5fD3vj8AjlgixxQREXjQ9_Jz7ukd_fDuepKKME9qjgfgSp9ms_QaR2c7h3iSmoBa0_hh6NQcxHlsfVKVjxzH0kubSLngVDE32LEiJDlgghpuFUx4cpGOrM6VESFeRZ-gcbgcmAWAZnACqKZCrXkzGiTxZmUljMildQZYU34Voc81RUPuZfD6KclgzJNXdBSH7QmfJ1YXpXcG_-xWamzllbVN0qpm1gYdeiENGGzyM-L_uneyYG_Lr3WcB0-HJ4et9P2r-RoGWao3-ISCEz5CjTGw2uzCu_1zbg3Gq5Vw_EJeoXlzg |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB60injxLdZnBPEBrt1kkzSLJ1GLopQiCh6EZZNNtFBraasH8eBP8Df6S0z2URUUBE972Jllmclkvt0k3wewQZUMhQiJJynTHiXGeKG0daW5DGLi60Qok4pNVOt1cX0dNoZgvzgLk_FDDH64ucpI52tX4LqTmMona6jq6D3bvcUwjFAWMlqCkaOL2tX5YBHBKRhkdKnE8y1wL7hnfVIpfL93o0-I-RWopp2mNvmvd5yCiRxgooNsREzDkG7PwGQh3oDyWp6FmwPU0y3z_vpm8aHbIftsmxhKHI-uk8DSCYpbtw_dZv_uHllgiyxQRGnjQ9t496XefNmxrioXSrCPSs9HoFyfZg6uaseXhydeLrXgKUfh51UDxXg1CY1TsmKx_UiyaeMJ87nE7hbFmgc04ZgLzYwMMZOmqmKjAollkMTBPJTaD229AEj7hmNFZaAEo1rpOIyFMIxiIYWKMS3DVhHySOU85E4OoxVlDMokskGLXNDKsD6w7GTcGz_YLBdZi_Lq60XETiyUWHSCy7CZ5udX_-iwceyui381XIOxxlEtOj-tny3BOHE7XHzuEbYMpX73Ua_AqHrqN3vd1Xw0fgAtn-VJ |
| 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=A+self%E2%80%90stabilizing+distributed+algorithm+for+the+local+%281%2C%7CNi%7C%29%E2%80%90critical+section+problem&rft.jtitle=Concurrency+and+computation&rft.au=Kamei%2C+Sayaka&rft.au=Kakugawa%2C+Hirotsugu&rft.date=2021-06-25&rft.issn=1532-0626&rft.eissn=1532-0634&rft.volume=33&rft.issue=12&rft.epage=n%2Fa&rft_id=info:doi/10.1002%2Fcpe.5628&rft.externalDBID=10.1002%252Fcpe.5628&rft.externalDocID=CPE5628 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1532-0626&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1532-0626&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1532-0626&client=summon |