Adaptive Parallel Scheduling Scheme for Smart Contract

Wenjin Yang, Meng Ao, Jing Sun, Guoan Wang, Yongxuan Li, Chunhai Li () and Zhuguang Shao ()
Additional contact information
Wenjin Yang: School of Cyberspace Science & Technology, Beijing Institute of Technology, Beijing 100081, China
Meng Ao: Tencent Inc., Shenzhen 518055, China
Jing Sun: School of Computer Science, University of Auckland, Auckland 1023, New Zealand
Guoan Wang: School of Cyberspace Science & Technology, Beijing Institute of Technology, Beijing 100081, China
Yongxuan Li: School of Cyberspace Science & Technology, Beijing Institute of Technology, Beijing 100081, China
Chunhai Li: Guangxi Engineering Research Center of Industrial Internet Security and Blockchain, Guilin University of Electronic Technology, Guilin 541004, China
Zhuguang Shao: Tencent Inc., Shenzhen 518055, China

Mathematics, 2024, vol. 12, issue 9, 1-17

Abstract: With the increasing demand for decentralized systems and the widespread usage of blockchain, low throughput and high latency have become the biggest stumbling blocks in the development of blockchain systems. This problem seriously hinders the expansion of blockchain and its application in production. Most existing smart contract scheduling solutions use static feature analysis to prevent contract conflicts during parallel execution. However, the conflicts between transactions are complex; static feature analysis is not accurate enough. In this paper, we first build the dependency between smart contracts by analyzing the features. After numerous experiments, we propose a conflict model to adjust the relationship between threads and conflict to achieve high throughput and low latency. Based on these works, we propose adaptive parallel scheduling for smart contracts on the blockchain. Our adaptive parallel scheduling can distinguish conflicts between smart contracts and dynamically adjust the execution strategy of smart contracts based on the conflict factors we define. We implement our scheme on ChainMaker, one of the most popular open-source permissioned blockchains, and build experiments to verify our solution. Regarding latency, our solution demonstrates remarkable efficiency compared with the fully parallel scheme, particularly in high-conflict transaction scenarios, where our solution achieves latency levels just one-twentieth of the fully parallel scheme. Regarding throughput, our solution significantly outperforms the fully parallel scheme, achieving 30 times higher throughput in high-conflict transaction scenarios. These results highlight the superior performance and effectiveness of our solution in addressing latency and throughput challenges, particularly in environments with high transaction conflicts.

Keywords: parallel scheduling; smart contract; blockchain (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/9/1347/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/9/1347/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:9:p:1347-:d:1385418

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().