.png){kind=icon}
.png){kind=icon}
Return
Dito: Distributed Transactional Objects
.png){kind=icon}
PRE
AI
DOI：10.1145/3772290.3772311.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents two-phase ordering (2PO), a new asynchronous transaction coordination algorithm that does not rely on a central coordinator. Each client constructs a view of the global execution graph and deterministically schedules its own transactions globally. We formally prove the correctness of 2PO and that the resulting schedules are conflict-serializable (CSR). In our measurements, 2PO exhibits high commit rates (above 97 % under high contention) while scaling linearly with the number of nodes.
Keywords:
concurrency control
serializability
distributed transaction processing
Journal
P
PROCEEDINGS OF THE 27TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING, ICDCN 2026
IF:
0
Papers:
21
Citations:
0