Adaptive Parallel Scheduling Scheme for Smart Contract
-
Published:2024-04-29
Issue:9
Volume:12
Page:1347
-
ISSN:2227-7390
-
Container-title:Mathematics
-
language:en
-
Short-container-title:Mathematics
Author:
Yang Wenjin12, Ao Meng2, Sun Jing3, Wang Guoan1, Li Yongxuan1, Li Chunhai4, Shao Zhuguang2
Affiliation:
1. School of Cyberspace Science & Technology, Beijing Institute of Technology, Beijing 100081, China 2. Tencent Inc., Shenzhen 518055, China 3. School of Computer Science, University of Auckland, Auckland 1023, New Zealand 4. Guangxi Engineering Research Center of Industrial Internet Security and Blockchain, Guilin University of Electronic Technology, Guilin 541004, China
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.
Funder
National Key Research and Development Program of China National Natural Science Foundation of China Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing
Reference21 articles.
1. Nakamoto, S. (2024, April 08). Bitcoin: A Peer-to-Peer Electronic Cash System. Decentralized Business Review. Available online: https://bitcoin.org/bitcoin.pdf. 2. Formalizing and securing relationships on public networks;Szabo;First Monday,1997 3. Latency and performance analyses of real-world wireless IoT-blockchain application;Alrubei;IEEE Sens. J.,2020 4. Wang, Q., Li, R., Wang, Q., and Chen, S. (2021). Non-fungible token (NFT): Overview, evaluation, opportunities and challenges. arXiv. 5. Mukhopadhyay, U., Skjellum, A., Hambolu, O., Oakley, J., Yu, L., and Brooks, R. (2016, January 12–14). A brief survey of cryptocurrency systems. Proceedings of the 2016 14th Annual Conference on Privacy, Security and Trust (PST), Auckland, New Zealand.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|