Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Leader Election Using NewSQL Database Systems
KTH Royal Institute of Technology, Sweden.
KTH Royal Institute of Technology, Sweden.
RISE, Swedish ICT, SICS.ORCID iD: 0000-0003-0571-1197
RISE - Research Institutes of Sweden, ICT, SICS. KTH Royal Institute of Technology, Sweden.ORCID iD: 0000-0002-9484-6714
2015 (English)In: Distributed Applications and Interoperable Systems, Springer , 2015, 16, Vol. 9038, p. 158-172Conference paper, Published paper (Refereed)
Abstract [en]

Leader election protocols are a fundamental building block for replicated distributed services. They ease the design of leader-based coordination protocols that tolerate failures. In partially synchronous systems, designing a leader election algorithm, that does not permit multiple leaders while the system is unstable, is a complex task. As a result many production systems use third-party distributed coordination services, such as ZooKeeper and Chubby, to provide a reliable leader election service. However, adding a third-party service such as ZooKeeper to a distributed system incurs additional operational costs and complexity. ZooKeeper instances must be kept running on at least three machines to ensure its high availability. In this paper, we present a novel leader election protocol using NewSQL databases for partially synchronous systems, that ensures at most one leader at any given time. The leader election protocol uses the database as distributed shared memory. Our work enables distributed systems that already use NewSQL databases to save the operational overhead of managing an additional third-party service for leader election. Our main contribution is the design, implementation and validation of a practical leader election algorithm, based on NewSQL databases, that has performance comparable to a leader election implementation using a state-of-the-art distributed coordination service, ZooKeeper.

Place, publisher, year, edition, pages
Springer , 2015, 16. Vol. 9038, p. 158-172
Series
Lecture Notes in Computer Science (LNCS), ISSN 0302-9743, E-ISSN 1611-3349 ; 9038
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-24414DOI: 10.1007/978-3-319-19129-4_13ISBN: 978-3-319-19128-7 (print)ISBN: 978-3-319-19129-4 (electronic)OAI: oai:DiVA.org:ri-24414DiVA, id: diva2:1043495
Conference
15th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems (DAIS 2015), June 2-4, 2015, Grenoble, France
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2019-07-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full texthttp

Authority records BETA

Berthou, GautierDowling, Jim

Search in DiVA

By author/editor
Niazi, SalmanIsmail, MahmoudBerthou, GautierDowling, Jim
By organisation
SICSSICS
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.35.7