We present a distributed transactional memory (TM) scheduler called
that optimizes the execution order of transactional operations to minimize conflicts.
categorizes concurrent requests for a shared object into read and write intervals to maximize the parallelism of reading transactions. This allows an object to be simultaneously sent to nodes of reading transactions (in a data flow TM model), improving transactional makespan. We show that
improves the makespan competitive ratio of the Relay distributed TM cache coherence protocol to
)) for the worst-case and Θlog(
) for the average-case, for
reading transactions. Our implementation studies confirm
’s throughput improvement by as much as 200%
30%, over cache-coherence protocol-only distributed TM.