Randition: Random Blockchain Partitioning for Write Throughput

David Nguyen, Teng-Sheng Moh
2019 2019 International Conference on High Performance Computing & Simulation (HPCS)  
RANDITION: RANDOM BLOCKCHAIN PARTITIONING FOR WRITE THROUGHPUT by David Nguyen This paper proposes to support dynamic runtime partitioning of Tendermint, which is an in-development state machine replication algorithm that uses the blockchain model to provide Byzantine-fault tolerance. We call this variation Randition. We incorporate recent research from blockchain consensus and replicated state machine partitioning to allow Randition users to partition their blockchain for improved write
more » ... ance at the cost of some Byzantine fault tolerance. We conduct an experiment to compare the raw write throughput of Randition and Tendermint. Finally, we discuss the experiment results and discuss further improvements to Randition.
doi:10.1109/hpcs48598.2019.9188068 dblp:conf/ieeehpcs/NguyenM19 fatcat:sdczpf5kbfeanbpoliyf7cgn6y