Accelerating Blockchain Search of Full Nodes Using GPUs

Shin Morishima, Hiroki Matsutani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Blockchain is a distributed ledger system based on P2P network and originally used for a crypto currency system. The P2P network of Blockchain is maintained by full nodes which are in charge of verifying all the transactions in the network. However, most Blockchain user nodes do not act as full nodes, because workload of full nodes is quite high for personal mobile devices. Blockchain search queries, such as confirming balance, transaction contents, and transaction histories, from many users go to the full nodes. As a result, search throughput of full nodes would be a new bottleneck of Blockchain system, because the number of full nodes is less than the number of users of Blockchain systems. In this paper, we propose an acceleration method of Blockchain search using GPUs. More specifically, we introduce an array-based Patricia tree structure suitable for GPU processing so that we can make effective use of Blockchain feature that there are no update and delete queries. In the evaluations, the proposed method is compared with an existing GPU-based key-value search and a conventional CPU-based search in terms of the throughput of Blockchain key search. As a result, the throughput of our proposal is 3.4 times higher than that of the existing GPU-based search and 14.1 times higher than that of the CPU search when the number of keys is 80 ×220 and the key length is 256-bit in Blockchain search queries.

Original languageEnglish
Title of host publicationProceedings - 26th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages244-248
Number of pages5
ISBN (Electronic)9781538649756
DOIs
Publication statusPublished - 2018 Jun 6
Event26th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2018 - Cambridge, United Kingdom
Duration: 2018 Mar 212018 Mar 23

Other

Other26th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2018
CountryUnited Kingdom
CityCambridge
Period18/3/2118/3/23

Fingerprint

Throughput
Program processors
Mobile devices
Graphics processing unit
Processing

Keywords

  • Blockchain
  • GPU
  • KVS

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Morishima, S., & Matsutani, H. (2018). Accelerating Blockchain Search of Full Nodes Using GPUs. In Proceedings - 26th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2018 (pp. 244-248). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/PDP2018.2018.00041

Accelerating Blockchain Search of Full Nodes Using GPUs. / Morishima, Shin; Matsutani, Hiroki.

Proceedings - 26th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 244-248.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Morishima, S & Matsutani, H 2018, Accelerating Blockchain Search of Full Nodes Using GPUs. in Proceedings - 26th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2018. Institute of Electrical and Electronics Engineers Inc., pp. 244-248, 26th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2018, Cambridge, United Kingdom, 18/3/21. https://doi.org/10.1109/PDP2018.2018.00041
Morishima S, Matsutani H. Accelerating Blockchain Search of Full Nodes Using GPUs. In Proceedings - 26th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2018. Institute of Electrical and Electronics Engineers Inc. 2018. p. 244-248 https://doi.org/10.1109/PDP2018.2018.00041
Morishima, Shin ; Matsutani, Hiroki. / Accelerating Blockchain Search of Full Nodes Using GPUs. Proceedings - 26th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2018. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 244-248
@inproceedings{f184f9c990e0482eb54c74be808a92de,
title = "Accelerating Blockchain Search of Full Nodes Using GPUs",
abstract = "Blockchain is a distributed ledger system based on P2P network and originally used for a crypto currency system. The P2P network of Blockchain is maintained by full nodes which are in charge of verifying all the transactions in the network. However, most Blockchain user nodes do not act as full nodes, because workload of full nodes is quite high for personal mobile devices. Blockchain search queries, such as confirming balance, transaction contents, and transaction histories, from many users go to the full nodes. As a result, search throughput of full nodes would be a new bottleneck of Blockchain system, because the number of full nodes is less than the number of users of Blockchain systems. In this paper, we propose an acceleration method of Blockchain search using GPUs. More specifically, we introduce an array-based Patricia tree structure suitable for GPU processing so that we can make effective use of Blockchain feature that there are no update and delete queries. In the evaluations, the proposed method is compared with an existing GPU-based key-value search and a conventional CPU-based search in terms of the throughput of Blockchain key search. As a result, the throughput of our proposal is 3.4 times higher than that of the existing GPU-based search and 14.1 times higher than that of the CPU search when the number of keys is 80 ×220 and the key length is 256-bit in Blockchain search queries.",
keywords = "Blockchain, GPU, KVS",
author = "Shin Morishima and Hiroki Matsutani",
year = "2018",
month = "6",
day = "6",
doi = "10.1109/PDP2018.2018.00041",
language = "English",
pages = "244--248",
booktitle = "Proceedings - 26th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Accelerating Blockchain Search of Full Nodes Using GPUs

AU - Morishima, Shin

AU - Matsutani, Hiroki

PY - 2018/6/6

Y1 - 2018/6/6

N2 - Blockchain is a distributed ledger system based on P2P network and originally used for a crypto currency system. The P2P network of Blockchain is maintained by full nodes which are in charge of verifying all the transactions in the network. However, most Blockchain user nodes do not act as full nodes, because workload of full nodes is quite high for personal mobile devices. Blockchain search queries, such as confirming balance, transaction contents, and transaction histories, from many users go to the full nodes. As a result, search throughput of full nodes would be a new bottleneck of Blockchain system, because the number of full nodes is less than the number of users of Blockchain systems. In this paper, we propose an acceleration method of Blockchain search using GPUs. More specifically, we introduce an array-based Patricia tree structure suitable for GPU processing so that we can make effective use of Blockchain feature that there are no update and delete queries. In the evaluations, the proposed method is compared with an existing GPU-based key-value search and a conventional CPU-based search in terms of the throughput of Blockchain key search. As a result, the throughput of our proposal is 3.4 times higher than that of the existing GPU-based search and 14.1 times higher than that of the CPU search when the number of keys is 80 ×220 and the key length is 256-bit in Blockchain search queries.

AB - Blockchain is a distributed ledger system based on P2P network and originally used for a crypto currency system. The P2P network of Blockchain is maintained by full nodes which are in charge of verifying all the transactions in the network. However, most Blockchain user nodes do not act as full nodes, because workload of full nodes is quite high for personal mobile devices. Blockchain search queries, such as confirming balance, transaction contents, and transaction histories, from many users go to the full nodes. As a result, search throughput of full nodes would be a new bottleneck of Blockchain system, because the number of full nodes is less than the number of users of Blockchain systems. In this paper, we propose an acceleration method of Blockchain search using GPUs. More specifically, we introduce an array-based Patricia tree structure suitable for GPU processing so that we can make effective use of Blockchain feature that there are no update and delete queries. In the evaluations, the proposed method is compared with an existing GPU-based key-value search and a conventional CPU-based search in terms of the throughput of Blockchain key search. As a result, the throughput of our proposal is 3.4 times higher than that of the existing GPU-based search and 14.1 times higher than that of the CPU search when the number of keys is 80 ×220 and the key length is 256-bit in Blockchain search queries.

KW - Blockchain

KW - GPU

KW - KVS

UR - http://www.scopus.com/inward/record.url?scp=85048765474&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85048765474&partnerID=8YFLogxK

U2 - 10.1109/PDP2018.2018.00041

DO - 10.1109/PDP2018.2018.00041

M3 - Conference contribution

SP - 244

EP - 248

BT - Proceedings - 26th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -