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
SAREK: Optimistic Parallel Ordering in Byzantine Fault Tolerance
KTH.
Show others and affiliations
2016 (English)In: 2016 12TH EUROPEAN DEPENDABLE COMPUTING CONFERENCE (EDCC 2016), IEEE conference proceedings, 2016, p. 77-88Conference paper, Published paper (Refereed)
Abstract [en]

Recently proposed Byzantine fault-tolerant (BFT) systems achieve high throughput by processing requests in parallel. However, as their agreement protocols rely on a single leader and make big efforts to establish a global total order on all requests before execution, the performance and scalability of such approaches is limited. To address this problem we present SAREK, a parallel ordering framework that partitions the service state to exploit parallelism during both agreement as well as execution. SAREK utilizes request dependency which is abstracted from application-specific knowledge for the service state partitioning. Instead of having one leader at a time for the entire system, it uses one leader per partition and only establishes an order on requests accessing the same partition. SAREK supports operations that span multiple partitions and provides a deterministic mechanism to atomically process them. To address use cases in which there is not enough application-specific knowledge to always determine a priori which partition(s) a request will operate on, SAREK provides mechanisms to even handle mis- predictions without requiring rollbacks.Our evaluation of a key-value store shows an increase in throughput performance by a factor of 2 at half the latency compared to a single-leader implementation.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2016. p. 77-88
Keywords [en]
Byzantine Failures, Multi-leader, Parallel Agreement and Execution, Generalized Consensus, State Partition
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:kth:diva-200242DOI: 10.1109/EDCC.2016.36ISI: 000390696300008ISBN: 978-1-5090-1582-5 (print)OAI: oai:DiVA.org:kth-200242DiVA, id: diva2:1071630
Conference
12th European Dependable Computing Conference (EDCC), SEP 05-09, 2016, Gothenburg, SWEDEN
Note

QC 20170206

Available from: 2017-02-06 Created: 2017-01-23 Last updated: 2017-02-06Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full texthttp://edcc2016.eu/

Search in DiVA

By author/editor
Distler, Tobias
By organisation
KTH
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 12 hits
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