Near-optimal stability for distributed transaction processing in blockchain sharding

DOI10.1016/J.TCS.2026.116239MaRDI QIDQ7396344zbMATH OpenFDO

Authors Ramesh Adhikari, Costas Busch, Dariusz R. Kowalski

Publication date 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116239

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A note on models for non-probabilistic analysis of packet switching networks.
• Adversarial models for priority‐based networks
• Adversarial queuing on the multiple access channel
• Adversarial queuing theory
• Distributed transactional memory for general networks
• Dynamic scheduling in distributed transactional memory
• Lockless blockchain sharding with multiversion control
• Maximum throughput of multiple access channels in adversarial environments
• Oblivious network design
• Stable scheduling in transactional memory
• The fault-tolerant cluster-sending problem
• Universal-stability results and performance bounds for greedy contention-resolution protocols

This page was built for publication: Near-optimal stability for distributed transaction processing in blockchain sharding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396344)