We propose Shard Scheduler, a system for object placement and migration in account-based sharded blockchains. Our system calculates optimal placement and decides of object migrations across shards and supports complex multi-account transactions caused by smart contracts. Placement and migration decisions made by Shard Scheduler are fully deterministic, verifiable, and can be made part of the consensus protocol. Shard Scheduler reduces the number of costly cross-shard transactions, ensures balanced load distribution and maximizes the number of processed transactions for the blockchain as a whole. It leverages a novel incentive model motivating miners to maximize the global throughput of the entire blockchain rather than the throughput of a specific shard. Shard Scheduler reduces the number of costly cross-shard transactions by half in our simulations, ensuring equal load and increasing the throughput 3 fold when using 60 shards. We also implement and evaluate Shard Scheduler on Chainspace, more than doubling its throughput and reducing user-perceived latency by 70% when using 10 shards.
翻译:我们建议采用硬排程器,用于在基于账户的碎块中放置和迁移物体。我们的系统计算了在碎块中最佳放置和决定物体迁移的最佳方式,并且支持智能合同引起的复杂多账户交易。 硬排程器所作的安置和迁移决定是完全确定性的、可核查的,可以成为协商一致协议的一部分。 硬排程器可以减少费用高昂的跨碎块交易的数量,确保平衡的载荷分配,并最大限度地增加整个块链的加工交易数量。 它利用一种新的激励模式,鼓励矿工最大限度地增加整个块链的全球吞吐量,而不是特定碎片的吞吐量。 硬排程器在模拟中将昂贵的跨碎块交易数量减少一半,确保同等的负荷,并在使用60块时增加3倍的负重。 我们还在链空间上实施和评估硬排程器,将它的吞吐量增加一倍以上,并在使用10块时将用户渗透的拉力减少70%。