Communication-efficient leader election in crash–recovery systems
• We implement Omega in crash–recovery partially synchronous distributed systems. • A first algorithm uses stable storage and is communication-efficient. • A second algorithm does not use stable storage and is near-communication-efficient. • The algorithms differ on the degree of agreement of unstab...
Uložené v:
| Vydané v: | The Journal of systems and software Ročník 84; číslo 12; s. 2186 - 2195 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Elsevier Inc
01.12.2011
Elsevier Sequoia S.A |
| Predmet: | |
| ISSN: | 0164-1212, 1873-1228 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | • We implement Omega in crash–recovery partially synchronous distributed systems. • A first algorithm uses stable storage and is communication-efficient. • A second algorithm does not use stable storage and is near-communication-efficient. • The algorithms differ on the degree of agreement of unstable processes.
This work addresses the leader election problem in partially synchronous distributed systems where processes can crash and recover. More precisely, it focuses on implementing the Omega failure detector class, which provides a leader election functionality, in the crash–recovery failure model. The concepts of communication efficiency and near-efficiency for an algorithm implementing Omega are defined. Depending on the use or not of stable storage, the property satisfied by unstable processes, i.e., those that crash and recover infinitely often, varies. Two algorithms implementing Omega are presented. In the first algorithm, which is communication-efficient and uses stable storage, eventually and permanently unstable processes agree on the leader with correct processes. In the second algorithm, which is near-communication-efficient and does not use stable storage, processes start their execution with no leader in order to avoid the disagreement among unstable processes, that will agree on the leader with correct processes after receiving a first message from the leader. |
|---|---|
| AbstractList | This work addresses the leader election problem in partially synchronous distributed systems where processes can crash and recover. More precisely, it focuses on implementing the Omega failure detector class, which provides a leader election functionality, in the crash-recovery failure model. The concepts of communication efficiency and near-efficiency for an algorithm implementing Omega are defined. Depending on the use or not of stable storage, the property satisfied by unstable processes, i.e., those that crash and recover infinitely often, varies. Two algorithms implementing Omega are presented. In the first algorithm, which is communication-efficient and uses stable storage, eventually and permanently unstable processes agree on the leader with correct processes. In the second algorithm, which is near-communication-efficient and does not use stable storage, processes start their execution with no leader in order to avoid the disagreement among unstable processes, that will agree on the leader with correct processes after receiving a first message from the leader. This work addresses the leader election problem in partially synchronous distributed systems where processes can crash and recover. More precisely, it focuses on implementing the Omega failure detector class, which provides a leader election functionality, in the crash-recovery failure model. The concepts of communication efficiency and near-efficiency for an algorithm implementing Omega are defined. Depending on the use or not of stable storage, the property satisfied by unstable processes, i.e., those that crash and recover infinitely often, varies. Two algorithms implementing Omega are presented. In the first algorithm, which is communication-efficient and uses stable storage, eventually and permanently unstable processes agree on the leader with correct processes. In the second algorithm, which is near-communication-efficient and does not use stable storage, processes start their execution with no leader in order to avoid the disagreement among unstable processes, that will agree on the leader with correct processes after receiving a first message from the leader. [PUBLICATION ABSTRACT] • We implement Omega in crash–recovery partially synchronous distributed systems. • A first algorithm uses stable storage and is communication-efficient. • A second algorithm does not use stable storage and is near-communication-efficient. • The algorithms differ on the degree of agreement of unstable processes. This work addresses the leader election problem in partially synchronous distributed systems where processes can crash and recover. More precisely, it focuses on implementing the Omega failure detector class, which provides a leader election functionality, in the crash–recovery failure model. The concepts of communication efficiency and near-efficiency for an algorithm implementing Omega are defined. Depending on the use or not of stable storage, the property satisfied by unstable processes, i.e., those that crash and recover infinitely often, varies. Two algorithms implementing Omega are presented. In the first algorithm, which is communication-efficient and uses stable storage, eventually and permanently unstable processes agree on the leader with correct processes. In the second algorithm, which is near-communication-efficient and does not use stable storage, processes start their execution with no leader in order to avoid the disagreement among unstable processes, that will agree on the leader with correct processes after receiving a first message from the leader. |
| Author | Martín, Cristian Larrea, Mikel Soraluze, Iratxe |
| Author_xml | – sequence: 1 givenname: Mikel surname: Larrea fullname: Larrea, Mikel email: mikel.larrea@ehu.es – sequence: 2 givenname: Cristian surname: Martín fullname: Martín, Cristian email: martin.cristian@gmail.com, cmartin@ikerlan.es – sequence: 3 givenname: Iratxe surname: Soraluze fullname: Soraluze, Iratxe email: iratxe.soraluze@ehu.es |
| BookMark | eNp9kMtOwzAQRS1UJNrCB7CL2LBK8Nh5WaxQxEuqxAbWluNMhKMkLnZaqTv-gT_kS0haVl10NSPNuVejsyCz3vZIyDXQCCikd03UeB8xChDRNKIgzsgc8oyHwFg-I_ORiccd2AVZeN9QSjNG2ZwUhe26TW-0GoztQ6xrow32Q9CiqtAF2KKeLoHpA-2U__z9_nGo7RbdLvA7P2DnL8l5rVqPV_9zST6eHt-Ll3D19vxaPKxCzZN0CGPgcZ3ncR5rilwxUWZYg1CV0rRMay0wy0oBLAWVZFU5flxT4EyDThKuFfAluT30rp392qAfZGe8xrZVPdqNlyLluRACxEjeHJGN3bh-fE7mIs9YQuOpLjtA2lnvHdZSm2GvYXDKtBKonNTKRo5q5aRW0lTSfT0cJdfOdMrtTmbuDxkcDW0NOukn0RorM_ocZGXNifQfqDaUiw |
| CODEN | JSSODM |
| CitedBy_id | crossref_primary_10_1007_s00607_021_01023_8 crossref_primary_10_1016_j_ipl_2016_10_007 |
| Cites_doi | 10.1142/S0129626406002575 10.1145/322186.322188 10.1145/234533.234549 10.1016/j.ipl.2009.10.011 10.1007/s00446-008-0068-y 10.1145/226643.226647 10.1142/S0129626401000452 10.1109/TC.2004.1268403 10.1016/j.jpdc.2006.06.002 10.1016/j.jpdc.2004.11.001 10.1016/S0020-0190(98)00122-7 10.1145/3149.214121 10.1007/s004460050070 10.1145/279227.279229 10.1016/j.ipl.2006.05.009 10.1016/j.jcss.2008.10.002 10.1145/42282.42283 10.1109/TPDS.2006.95 |
| ContentType | Journal Article |
| Copyright | 2011 Elsevier Inc. Copyright Elsevier Sequoia S.A. Dec 2011 |
| Copyright_xml | – notice: 2011 Elsevier Inc. – notice: Copyright Elsevier Sequoia S.A. Dec 2011 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.jss.2011.06.019 |
| 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 | Computer and Information Systems Abstracts Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1873-1228 |
| EndPage | 2195 |
| ExternalDocumentID | 2487932721 10_1016_j_jss_2011_06_019 S0164121211001476 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9M8 AABNK AACTN AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN AAYOK ABBOA ABEFU ABFNM ABFRF ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFO ACGFS ACGOD ACNNM ACRLP ACZNC ADBBV ADEZE ADHUB ADJOM ADMUD AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. 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 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W KOM LG9 M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ RXW SBC SDF SDG SDP SES SEW SPC SPCBC SSV SSZ T5K TAE TN5 TWZ UHS UNMZH VH1 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 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c356t-4134f88484c0e3a29b7ef19adac0b6fc9e77b91261a57db016f0132c1c553ca13 |
| ISICitedReferencesCount | 9 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000296415100012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0164-1212 |
| IngestDate | Sun Nov 09 09:03:57 EST 2025 Sun Nov 09 05:36:37 EST 2025 Tue Nov 18 22:40:09 EST 2025 Sat Nov 29 05:52:16 EST 2025 Fri Feb 23 02:32:34 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 12 |
| Keywords | Communication-efficient algorithm Crash–recovery Omega failure detector Fault-tolerant distributed computing Leader election Consensus |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c356t-4134f88484c0e3a29b7ef19adac0b6fc9e77b91261a57db016f0132c1c553ca13 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 898725041 |
| PQPubID | 45802 |
| PageCount | 10 |
| ParticipantIDs | proquest_miscellaneous_963899919 proquest_journals_898725041 crossref_citationtrail_10_1016_j_jss_2011_06_019 crossref_primary_10_1016_j_jss_2011_06_019 elsevier_sciencedirect_doi_10_1016_j_jss_2011_06_019 |
| PublicationCentury | 2000 |
| PublicationDate | 2011-12-01 |
| PublicationDateYYYYMMDD | 2011-12-01 |
| PublicationDate_xml | – month: 12 year: 2011 text: 2011-12-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | The Journal of systems and software |
| PublicationYear | 2011 |
| Publisher | Elsevier Inc Elsevier Sequoia S.A |
| Publisher_xml | – name: Elsevier Inc – name: Elsevier Sequoia S.A |
| References | Chandra, Hadzilacos, Toueg (bib0030) 1996; 43 Malkhi, Oprea, Zhou (bib0105) 2005 Mostéfaoui, Raynal (bib0145) 2001; 11 Dwork, Lynch, Stockmeyer (bib0045) 1988; 35 Wiesmann, Défago (bib0170) 2006 Fischer, Lynch, Paterson (bib0065) 1985; 32 Mostéfaoui, Raynal, Travers (bib0150) 2004 Fernández, Jiménez, Raynal (bib0055) 2006 Chu (bib0040) 1998; 67 Martín, Larrea (bib0110) 2008 Fernández, Raynal (bib0060) 2007 Mostéfaoui, Mourgaya, Raynal (bib0130) 2003 Aguilera, Delporte-Gallet, Fauconnier, Toueg (bib0025) 2008; 21 Chandra, Toueg (bib0035) 1996; 43 Freiling, Lambertz, Majster-Cederbaum (bib0070) 2009 Oliveira, R., Guerraoui, R., Schiper, A., 1997. Consensus in the crash–recover model. Technical Report TR-97/239. Swiss Federal Institute of Technology, Lausanne, July 1997. Mostéfaoui, Mourgaya, Raynal, Travers (bib0135) 2006; 16 Aguilera, Chen, Toueg (bib0005) 2000; 13 Hurfin, Mostéfaoui, Raynal (bib0080) 1998 Martín, Larrea, Jiménez (bib0120) 2007 Mostéfaoui, Rajsbaum, Raynal, Travers (bib0140) 2007; 67 Guerraoui, Raynal (bib0075) 2004; 53 Aguilera, Delporte-Gallet, Fauconnier, Toueg (bib0010) October 2001 Martín, Larrea (bib0115) 2010; 110 Pease, Shostak, Lamport (bib0165) 1980; 27 Fernández, Jiménez, Arévalo (bib0050) 2006 Larrea, Fernández, Arévalo (bib0100) 2005; 65 Mostéfaoui, Raynal, Travers (bib0155) 2006; 17 Larrea, Fernández, Arévalo (bib0095) 2000 Aguilera, Delporte-Gallet, Fauconnier, Toueg (bib0020) 2004 Aguilera, Delporte-Gallet, Fauconnier, Toueg (bib0015) 2003 Jiménez, Arévalo, Fernández (bib0085) 2006; 100 Lamport (bib0090) 1998; 16 Martín, Larrea, Jiménez (bib0125) 2009; 75 Guerraoui (10.1016/j.jss.2011.06.019_bib0075) 2004; 53 Aguilera (10.1016/j.jss.2011.06.019_bib0005) 2000; 13 Hurfin (10.1016/j.jss.2011.06.019_bib0080) 1998 Jiménez (10.1016/j.jss.2011.06.019_bib0085) 2006; 100 Lamport (10.1016/j.jss.2011.06.019_bib0090) 1998; 16 Martín (10.1016/j.jss.2011.06.019_bib0120) 2007 Martín (10.1016/j.jss.2011.06.019_bib0110) 2008 Aguilera (10.1016/j.jss.2011.06.019_bib0010) 2001 Pease (10.1016/j.jss.2011.06.019_bib0165) 1980; 27 Mostéfaoui (10.1016/j.jss.2011.06.019_bib0145) 2001; 11 Chandra (10.1016/j.jss.2011.06.019_bib0030) 1996; 43 Chu (10.1016/j.jss.2011.06.019_bib0040) 1998; 67 Aguilera (10.1016/j.jss.2011.06.019_bib0015) 2003 Chandra (10.1016/j.jss.2011.06.019_bib0035) 1996; 43 Aguilera (10.1016/j.jss.2011.06.019_bib0020) 2004 Larrea (10.1016/j.jss.2011.06.019_bib0100) 2005; 65 Mostéfaoui (10.1016/j.jss.2011.06.019_bib0140) 2007; 67 Mostéfaoui (10.1016/j.jss.2011.06.019_bib0135) 2006; 16 Aguilera (10.1016/j.jss.2011.06.019_bib0025) 2008; 21 Mostéfaoui (10.1016/j.jss.2011.06.019_bib0150) 2004 Mostéfaoui (10.1016/j.jss.2011.06.019_bib0130) 2003 Malkhi (10.1016/j.jss.2011.06.019_bib0105) 2005 Freiling (10.1016/j.jss.2011.06.019_bib0070) 2009 Fernández (10.1016/j.jss.2011.06.019_bib0050) 2006 Wiesmann (10.1016/j.jss.2011.06.019_bib0170) 2006 Fischer (10.1016/j.jss.2011.06.019_bib0065) 1985; 32 Martín (10.1016/j.jss.2011.06.019_bib0115) 2010; 110 Dwork (10.1016/j.jss.2011.06.019_bib0045) 1988; 35 Fernández (10.1016/j.jss.2011.06.019_bib0060) 2007 Martín (10.1016/j.jss.2011.06.019_bib0125) 2009; 75 Fernández (10.1016/j.jss.2011.06.019_bib0055) 2006 Mostéfaoui (10.1016/j.jss.2011.06.019_bib0155) 2006; 17 10.1016/j.jss.2011.06.019_bib0160 Larrea (10.1016/j.jss.2011.06.019_bib0095) 2000 |
| References_xml | – start-page: 189 year: 2007 end-page: 203 ident: bib0060 article-title: From an intermittent rotating star to a leader publication-title: Proceedings of the 11th International Conference on Principles of Distributed Systems (OPODIS’2007) – volume: 67 start-page: 125 year: 2007 end-page: 129 ident: bib0140 article-title: From omega to Omega: A simple bounded quiescent reliable broadcast-based transformation publication-title: Journal of Parallel and Distributed Computing – start-page: 199 year: 2005 end-page: 213 ident: bib0105 publication-title: Proceedings of the 19th International Symposium on Distributed Computing (DISC’2005) – start-page: 208 year: 2008 end-page: 215 ident: bib0110 article-title: Eventual leader election in the crash–recovery failure model publication-title: Proceedings of the 14th Pacific Rim International Symposium on Dependable Computing (PRDC’2008) – volume: 43 start-page: 685 year: 1996 end-page: 722 ident: bib0030 article-title: The weakest failure detector for solving consensus publication-title: Journal of the ACM – start-page: 975 year: 2007 end-page: 982 ident: bib0120 article-title: On the implementation of the Omega failure detector in the crash–recovery failure model publication-title: Proceedings of the ARES 2007 Workshop on Foundations of Fault-tolerant Distributed Computing (FOFDC’2007) – volume: 67 start-page: 289 year: 1998 end-page: 293 ident: bib0040 article-title: Reducing publication-title: Information Processing Letters – start-page: 208 year: 2004 end-page: 217 ident: bib0150 article-title: Crash–resilient time-free eventual leadership publication-title: Proceedings of the 23rd IEEE Symposium on Reliable Distributed Systems (SRDS’2004) – start-page: 52 year: 2000 end-page: 59 ident: bib0095 article-title: Optimal implementation of the weakest failure detector for solving consensus publication-title: Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems (SRDS’2000) – start-page: 351 year: 2003 end-page: 360 ident: bib0130 article-title: Asynchronous implementation of failure detectors publication-title: Proceedings of the IEEE International Conference on Dependable Systems and Networks (DSN’2003) – volume: 16 start-page: 133 year: 1998 end-page: 169 ident: bib0090 article-title: The part-time parliament publication-title: ACM Transactions on Computer Systems – volume: 53 start-page: 453 year: 2004 end-page: 466 ident: bib0075 article-title: The information structure of indulgent consensus publication-title: IEEE Transactions on Computers – start-page: 306 year: 2003 end-page: 314 ident: bib0015 article-title: On implementing Ω with weak reliability and synchrony assumptions publication-title: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC’2003) – volume: 21 start-page: 285 year: 2008 end-page: 314 ident: bib0025 article-title: On implementing omega in systems with weak reliability and synchrony assumptions publication-title: Distributed Computing – reference: Oliveira, R., Guerraoui, R., Schiper, A., 1997. Consensus in the crash–recover model. Technical Report TR-97/239. Swiss Federal Institute of Technology, Lausanne, July 1997. – start-page: 108 year: October 2001 end-page: 122 ident: bib0010 article-title: Stable leader election publication-title: Proceedings of the 15th International Symposium on Distributed Computing (DISC’2001) – start-page: 341 year: 2006 end-page: 350 ident: bib0170 article-title: End-to-end consensus using end-to-end channels publication-title: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (PRDC’2006) – volume: 27 start-page: 228 year: 1980 end-page: 234 ident: bib0165 article-title: Reaching agreement in the presence of faults publication-title: Journal of the ACM – volume: 32 start-page: 374 year: 1985 end-page: 382 ident: bib0065 article-title: Impossibility of distributed consensus with one faulty process publication-title: Journal of the ACM – volume: 35 start-page: 288 year: 1988 end-page: 323 ident: bib0045 article-title: Consensus in the presence of partial synchrony publication-title: Journal of the ACM – start-page: 280 year: 1998 end-page: 286 ident: bib0080 article-title: Consensus in asynchronous systems where processes can crash and recover publication-title: Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems (SRDS’1998) – volume: 110 start-page: 83 year: 2010 end-page: 87 ident: bib0115 article-title: A simple and communication-efficient Omega algorithm in the crash–recovery model publication-title: Information Processing Letters – start-page: 166 year: 2006 end-page: 178 ident: bib0055 article-title: Eventual leader election with weak assumptions on initial knowledge, communication reliability, and synchrony publication-title: Proceedings of the IEEE International Conference on Dependable Systems and Networks (DSN’2006) – start-page: 63 year: 2006 end-page: 72 ident: bib0050 article-title: Minimal system conditions to implement unreliable failure detectors publication-title: Proceedings of the 12th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC’2006) – volume: 13 start-page: 99 year: 2000 end-page: 125 ident: bib0005 article-title: Failure detection and consensus in the crash–recovery model publication-title: Distributed Computing – volume: 17 start-page: 656 year: 2006 end-page: 666 ident: bib0155 article-title: Time-free and timer-based assumptions can be combined to obtain eventual leadership publication-title: IEEE Transactions on Parallel and Distributed Systems – volume: 43 start-page: 225 year: 1996 end-page: 267 ident: bib0035 article-title: Unreliable failure detectors for reliable distributed systems publication-title: Journal of the ACM – volume: 100 start-page: 60 year: 2006 end-page: 63 ident: bib0085 article-title: Implementing unreliable failure detectors with unknown membership publication-title: Information Processing Letters – start-page: 287 year: 2009 end-page: 292 ident: bib0070 article-title: Modular consensus algorithms for the crash–recovery model publication-title: Proceedings of the 10th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT’2009) – volume: 75 start-page: 178 year: 2009 end-page: 189 ident: bib0125 article-title: Implementing the Omega failure detector in the crash–recovery failure model publication-title: Journal of Computer and System Sciences – volume: 16 start-page: 189 year: 2006 end-page: 208 ident: bib0135 article-title: A time-free assumption to implement eventual leadership publication-title: Parallel Processing Letters – volume: 11 start-page: 95 year: 2001 end-page: 107 ident: bib0145 article-title: Leader-based consensus publication-title: Parallel Processing Letters – start-page: 328 year: 2004 end-page: 337 ident: bib0020 article-title: Communication-efficient leader election and consensus with limited link synchrony publication-title: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC’2004) – volume: 65 start-page: 361 year: 2005 end-page: 373 ident: bib0100 article-title: Eventually consistent failure detectors publication-title: Journal of Parallel and Distributed Computing – volume: 16 start-page: 189 issue: June (2) year: 2006 ident: 10.1016/j.jss.2011.06.019_bib0135 article-title: A time-free assumption to implement eventual leadership publication-title: Parallel Processing Letters doi: 10.1142/S0129626406002575 – start-page: 306 year: 2003 ident: 10.1016/j.jss.2011.06.019_bib0015 article-title: On implementing Ω with weak reliability and synchrony assumptions – volume: 27 start-page: 228 issue: April (2) year: 1980 ident: 10.1016/j.jss.2011.06.019_bib0165 article-title: Reaching agreement in the presence of faults publication-title: Journal of the ACM doi: 10.1145/322186.322188 – start-page: 63 year: 2006 ident: 10.1016/j.jss.2011.06.019_bib0050 article-title: Minimal system conditions to implement unreliable failure detectors – volume: 43 start-page: 685 issue: July (4) year: 1996 ident: 10.1016/j.jss.2011.06.019_bib0030 article-title: The weakest failure detector for solving consensus publication-title: Journal of the ACM doi: 10.1145/234533.234549 – volume: 110 start-page: 83 issue: 3 year: 2010 ident: 10.1016/j.jss.2011.06.019_bib0115 article-title: A simple and communication-efficient Omega algorithm in the crash–recovery model publication-title: Information Processing Letters doi: 10.1016/j.ipl.2009.10.011 – volume: 21 start-page: 285 issue: 4 year: 2008 ident: 10.1016/j.jss.2011.06.019_bib0025 article-title: On implementing omega in systems with weak reliability and synchrony assumptions publication-title: Distributed Computing doi: 10.1007/s00446-008-0068-y – volume: 43 start-page: 225 issue: March (2) year: 1996 ident: 10.1016/j.jss.2011.06.019_bib0035 article-title: Unreliable failure detectors for reliable distributed systems publication-title: Journal of the ACM doi: 10.1145/226643.226647 – start-page: 351 year: 2003 ident: 10.1016/j.jss.2011.06.019_bib0130 article-title: Asynchronous implementation of failure detectors – volume: 11 start-page: 95 issue: March (1) year: 2001 ident: 10.1016/j.jss.2011.06.019_bib0145 article-title: Leader-based consensus publication-title: Parallel Processing Letters doi: 10.1142/S0129626401000452 – start-page: 52 year: 2000 ident: 10.1016/j.jss.2011.06.019_bib0095 article-title: Optimal implementation of the weakest failure detector for solving consensus – volume: 53 start-page: 453 issue: April (4) year: 2004 ident: 10.1016/j.jss.2011.06.019_bib0075 article-title: The information structure of indulgent consensus publication-title: IEEE Transactions on Computers doi: 10.1109/TC.2004.1268403 – start-page: 341 year: 2006 ident: 10.1016/j.jss.2011.06.019_bib0170 article-title: End-to-end consensus using end-to-end channels – start-page: 975 year: 2007 ident: 10.1016/j.jss.2011.06.019_bib0120 article-title: On the implementation of the Omega failure detector in the crash–recovery failure model – volume: 67 start-page: 125 issue: January (1) year: 2007 ident: 10.1016/j.jss.2011.06.019_bib0140 article-title: From omega to Omega: A simple bounded quiescent reliable broadcast-based transformation publication-title: Journal of Parallel and Distributed Computing doi: 10.1016/j.jpdc.2006.06.002 – ident: 10.1016/j.jss.2011.06.019_bib0160 – start-page: 287 year: 2009 ident: 10.1016/j.jss.2011.06.019_bib0070 article-title: Modular consensus algorithms for the crash–recovery model – volume: 65 start-page: 361 issue: March (3) year: 2005 ident: 10.1016/j.jss.2011.06.019_bib0100 article-title: Eventually consistent failure detectors publication-title: Journal of Parallel and Distributed Computing doi: 10.1016/j.jpdc.2004.11.001 – start-page: 208 year: 2008 ident: 10.1016/j.jss.2011.06.019_bib0110 article-title: Eventual leader election in the crash–recovery failure model – volume: 67 start-page: 289 issue: September (6) year: 1998 ident: 10.1016/j.jss.2011.06.019_bib0040 article-title: Reducing Ω to ♢W publication-title: Information Processing Letters doi: 10.1016/S0020-0190(98)00122-7 – volume: 32 start-page: 374 issue: April (2) year: 1985 ident: 10.1016/j.jss.2011.06.019_bib0065 article-title: Impossibility of distributed consensus with one faulty process publication-title: Journal of the ACM doi: 10.1145/3149.214121 – volume: 13 start-page: 99 issue: 2 year: 2000 ident: 10.1016/j.jss.2011.06.019_bib0005 article-title: Failure detection and consensus in the crash–recovery model publication-title: Distributed Computing doi: 10.1007/s004460050070 – volume: 16 start-page: 133 issue: May (2) year: 1998 ident: 10.1016/j.jss.2011.06.019_bib0090 article-title: The part-time parliament publication-title: ACM Transactions on Computer Systems doi: 10.1145/279227.279229 – volume: 100 start-page: 60 issue: 2 year: 2006 ident: 10.1016/j.jss.2011.06.019_bib0085 article-title: Implementing unreliable failure detectors with unknown membership publication-title: Information Processing Letters doi: 10.1016/j.ipl.2006.05.009 – volume: 75 start-page: 178 issue: May (3) year: 2009 ident: 10.1016/j.jss.2011.06.019_bib0125 article-title: Implementing the Omega failure detector in the crash–recovery failure model publication-title: Journal of Computer and System Sciences doi: 10.1016/j.jcss.2008.10.002 – start-page: 166 year: 2006 ident: 10.1016/j.jss.2011.06.019_bib0055 article-title: Eventual leader election with weak assumptions on initial knowledge, communication reliability, and synchrony – volume: 35 start-page: 288 issue: April (2) year: 1988 ident: 10.1016/j.jss.2011.06.019_bib0045 article-title: Consensus in the presence of partial synchrony publication-title: Journal of the ACM doi: 10.1145/42282.42283 – start-page: 280 year: 1998 ident: 10.1016/j.jss.2011.06.019_bib0080 article-title: Consensus in asynchronous systems where processes can crash and recover – start-page: 108 year: 2001 ident: 10.1016/j.jss.2011.06.019_bib0010 article-title: Stable leader election – start-page: 328 year: 2004 ident: 10.1016/j.jss.2011.06.019_bib0020 article-title: Communication-efficient leader election and consensus with limited link synchrony – volume: 17 start-page: 656 issue: July (7) year: 2006 ident: 10.1016/j.jss.2011.06.019_bib0155 article-title: Time-free and timer-based assumptions can be combined to obtain eventual leadership publication-title: IEEE Transactions on Parallel and Distributed Systems doi: 10.1109/TPDS.2006.95 – start-page: 189 year: 2007 ident: 10.1016/j.jss.2011.06.019_bib0060 article-title: From an intermittent rotating star to a leader – start-page: 199 year: 2005 ident: 10.1016/j.jss.2011.06.019_bib0105 article-title: Omega meets paxos: leader election and stability without eventual timely links – start-page: 208 year: 2004 ident: 10.1016/j.jss.2011.06.019_bib0150 article-title: Crash–resilient time-free eventual leadership |
| SSID | ssj0007202 |
| Score | 2.0162227 |
| Snippet | • We implement Omega in crash–recovery partially synchronous distributed systems. • A first algorithm uses stable storage and is communication-efficient. • A... This work addresses the leader election problem in partially synchronous distributed systems where processes can crash and recover. More precisely, it focuses... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 2186 |
| SubjectTerms | Algorithms Communication Communication-efficient algorithm Computer programs Consensus Crashes Crash–recovery Distributed processing Elections Failure Failure analysis Fault-tolerant distributed computing Information storage Leader election Messages Omega failure detector Receiving Studies Synchronous |
| Title | Communication-efficient leader election in crash–recovery systems |
| URI | https://dx.doi.org/10.1016/j.jss.2011.06.019 https://www.proquest.com/docview/898725041 https://www.proquest.com/docview/963899919 |
| Volume | 84 |
| WOSCitedRecordID | wos000296415100012&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: 1873-1228 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007202 issn: 0164-1212 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fb9MwELag44EXfiPKAOUB8cDkKYmT2n6spk4MVYWHTuqbdXUcsW7KStNC4a_H59jpMrEBD7xEVeo0je9yd777_B0hb1NIdRwXOeV5IWhWcqDWDTNaAGPceiRIDbhmE3wyEbOZ_OxxurVrJ8CrSmy3cvlfRW3PWWHj1tl_EHf7o_aE_WyFbo9W7Pb4V4LvbPmgxlFEYMH_woGWD1zfGw9w1Cuov1BcE9un_OFZneur8epu55iLWf2IgybbXq6_ww47O0bQLzRQ_HOzgxu2PAVH3p60SR0kB9j8dBnVE6uIW3M1BYEYuBbO4bOSAyQ_TDpmten8FtQn7RjJwH4dbGb-W2Pe5BUWh4u69lyrg8PYG9gOcfbkkzo-HY_VdDSbvlt-pdhTDGvvvsHKXbKX8lyKHtkbnoxmH1tPzVOHSW3_fqh6O_zftbveFLdc8-AuLJk-Ig-8bKJhowePyR1TPSEPQ6-OyJvup2R4g1pEjVpEQS2isyrqqkXkhf6MnB6PpkcfqG-fQTXLB2tqw5OsFCITmY4Ng1TOuSkTCQXoGLd4ScP5XCZ2CQ05L-b2qUssvOlE5znTkLDnpFddVuYFiWLBJTCsCEvI-KAQIHPDpRFFxgCM6JM4TI7SnlseW5xcqAAiXCg7nwrnUyGQMpF98r69ZNkQq9w2OAszrnxk2ER8yurKbZftB-ko_4bWSkjBkbcv6ZOo_dbaVCyUQWUuN7VCp4QLJ_nyz0P2yf3dK_GK9NarjXlN7ulv67N69cZr3C-CCZpp |
| 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=Communication-efficient+leader+election+in+crash-recovery+systems&rft.jtitle=The+Journal+of+systems+and+software&rft.au=Larrea%2C+Mikel&rft.au=Martin%2C+Cristian&rft.au=Soraluze%2C+Iratxe&rft.date=2011-12-01&rft.issn=0164-1212&rft.volume=84&rft.issue=12&rft.spage=2186&rft.epage=2195&rft_id=info:doi/10.1016%2Fj.jss.2011.06.019&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0164-1212&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0164-1212&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0164-1212&client=summon |