Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Peiyuan Yao

dblp:396/8335 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0006-9819-4633ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 87% Memory systems · 13%
Network and information security
1 paper
Blockchain and cryptocurrency security · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security › blockchain scalability
blockchain sharding
0.912025
Sparrow: Expediting Smart Contract Execution for Blockchain Sharding via Inter-Shard Caching · IEEE Trans. Parallel Distributed Syst. 2025
Blockchain and cryptocurrency security › smart contract
smart contract execution
0.912025
Sparrow: Expediting Smart Contract Execution for Blockchain Sharding via Inter-Shard Caching · IEEE Trans. Parallel Distributed Syst. 2025
Distributed systems › fault tolerance
byzantine fault tolerance
0.912025
Sparrow: Expediting Smart Contract Execution for Blockchain Sharding via Inter-Shard Caching · IEEE Trans. Parallel Distributed Syst. 2025
Distributed systems
distributed coordination and fault tolerance
0.912025
Sparrow: Expediting Smart Contract Execution for Blockchain Sharding via Inter-Shard Caching · IEEE Trans. Parallel Distributed Syst. 2025
Memory systems
cache
0.312025
Sparrow: Expediting Smart Contract Execution for Blockchain Sharding via Inter-Shard Caching · IEEE Trans. Parallel Distributed Syst. 2025

Methods — techniques the papers use, named apart from their topics

speculative dispersal cache synchronization · 1.7multi-branch exploration · 1.7conflict resolution · 1.7
YearPublicationVenuePosition
2025 Sparrow: Expediting Smart Contract Execution for Blockchain Sharding via Inter-Shard Caching
abstract
Sharding is a promising solution to scale blockchain by separating the system into multiple shards to process transactions in parallel. However, due to state separation and shard isolation, it is still challenging to efficiently support smart contracts on a blockchain sharding system where smart contracts can interact with each other, involving states maintained by multiple shards. Specifically, existing sharding systems adopt a costly multi-step collaboration mechanism to execute smart contracts, resulting in long latency and low throughput. This article proposesSparrow, a blockchain sharding protocol achieving one-step execution for smart contracts. To break shard isolation, inspired by non-local hotspot data caching in traditional databases, we propose a new idea ofinter-shard caching, allowing a shard to prefetch and cache frequently accessed contract states of other shards. The miner can thus use the inter-shard cache to pre-execute a pending transaction, retrieve all its contract invocations, and commit it to multiple shards in one step. Particularly, we first propose a speculative dispersal cache synchronisation mechanism for efficient and secure cache synchronization across shards in Byzantine environments. Then, we propose a multi-branch exploration mechanism to solve the rollback problem during the optimistic one-step execution of contract invocations with dependencies. We also present a series of conflict resolution mechanisms to decrease the rollback caused by inherent transaction conflicts. We implement prototypes forSparrowand existing sharding systems, and the evaluation shows thatSparrowimproves the throughput by$2.44\times$and reduces the transaction latency by 30% compared with the existing sharding systems.
Junyuan Liang, Peiyuan Yao, Wuhui Chen, Zicong Hong, Ting Cai 0002, Zibin Zheng
IEEE Trans. Parallel Distributed Syst.2