Developing complex data structures over partitioned state machine replication
- Eslahi-Kelorazi, Mojtaba ORCID Facoltà di scienze informatiche, Università della Svizzera italiana, Svizzera
- Le, Long Hoang Facoltà di scienze informatiche, Università della Svizzera italiana, Svizzera
- Pedone, Fernando ORCID Facoltà di scienze informatiche, Università della Svizzera italiana, Svizzera
- 2020
Published in:
- 16th European Dependable Computing Conference (EDCC), Munich, Germany, 2020. - 2020, p. 9-16
English
Modern applications require replication for availability. State machine replication (SMR) is a standard way to replicate applications over a number of servers. In SMR, increasing the number of servers improves fault tolerance, but it does not increase performance, since each replica executes all the requests. Partitioned state machine replication seeks to increase performance by partitioning the application state. In this paper, we discuss challenges involved in developing complex applications over partitioned state machine replication. In particular, we develop a distributed B+tree whose nodes are distributed over a set of partitions, and each partition is replicated. B+tree is an important data structure employed in a number of well-known applications and database systems. Moreover, the techniques used in the paper can be easily extended to other data structures and applications.
- Collections
- Language
-
- English
- Classification
- Computer science and technology
- License
- Rights reserved
- Open access status
- green
- Identifiers
-
- DOI 10.1109/EDCC51268.2020.00012
- ARK ark:/12658/srd1325347
- Persistent URL
- https://n2t.net/ark:/12658/srd1325347
Statistics
Document views: 36
File downloads:
- Pedone_2020_IEEE_EDCC.pdf: 49