2026· IEEE Transactions on Network and Service Management· Vol 23, pp. 6849-6863· 0 citations· 39 references
Abstract
Cross-chain sharding improves interoperability and scalability, yet relay-chain execution remains constrained by dynamic dependencies and shard contention. This paper characterizes the relay-chain execution mechanism of cross-chain sharded transactions and models registration, recording, and confirmation transactions as a dynamic DAG, so that scheduling decisions respect the prerequisite dependencies required by the underlying cross-chain atomicity and consistency mechanisms. On this basis, we propose Fast Out-degree based Monte Carlo Tree Search (FO-MCTS), a dynamic DAG scheduling algorithm for cross-chain sharding. FO-MCTS uses dependency relationships to guide executable-node priority and shard-search expansion, enabling dependency-continuous scheduling while avoiding exhaustive shard-assignment search. Simulation results show that FO-MCTS improves transaction throughput by about 25% on average, reduces the cross-shard communication ratio by 65%–85%, and maintains lower scheduling-induced delay.
To address the issues of scheduling conflicts and high verification overhead in large-scale cross-chain interactions, this paper proposes an efficient cross-chain interaction mechanism. First, a unified cross-chain interaction framework is constructed to mode and constrain the cross-chain process, providing structural...
Xiaohong Deng, Jia-Yan Liu, Hui-Wen Liu et al.· Journal of King Saud Univers...· 0 citations
Purpose – This study evaluates when dependency-aware parallel scheduling improves a single-node simulated smart-contract workload for organic certification while separating scheduling effects from hash-chain and dependency-graph record representation.Methods – A deterministic Python rule engine evaluates 18 certificati...
Yuni Anggraeni, Arum Prasetyajati, A. U. Priantoro· Journal of Deep Learning, Co...· 0 citations
This paper presents AOE–CP (AON DAG with Edge-Weighted Transformation and Critical Path Scheduling), a structure-aware hybrid scheduling architecture for V2X testing that achieves performance gains through domain-specific structural reorganization rather than new scheduling rules.
Zhu-Hua Zhang, Ning Ye, Chong-Yang Wang et al.· Algorithms· 0 citations
Existing concurrency control protocols either introduce nondeterminism, resulting in a serial execution-replay dependency between primary and replica nodes, or rely on impractical prior knowledge of transaction read-write sets. In this paper, we present Lantern, a deterministic concurrency control protocol tailored for...
Deng-Long Li, Gerui Wang, Tian Guan et al.· 0 citations
LB-Louvain is presented, a coarse-to-fine account-partitioning heuristic in which standard Louvain first extracts logical communities, followed by load-aware community-to-shard assignment and restricted boundary-account refinement, and component-wise ablation confirms complementary roles for load-aware assignment and b...
Zhen-Xing Luan, Jia-Hui Du, Kuan Fan· Applied Sciences· 0 citations
As Layer 2 rollups proliferate to address Ethereum's scaling challenges, enabling atomic transactions across independent rollups has become critical for cross-chain composability. This work extends the Interlock protocol, which coordinates atomic cross-rollup transactions through a stateless shared sequencer. Interlock...
Uri Lee, William J. Knottenbelt· Distributed Ledger Technolog...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
