Scaling Up Transactions with Slower Clocks
Pedro Ramalhete, Andreia Correia · 2024
Concurrency controls with optimistic read accesses and pessimistic write accesses are among the fastest in the literature. However, during write transactions these algorithms need to increment an atomic variable, the central clock, limiting parallelism and preventing scalability at high core counts.