ABSTRACT
Distributed software transactional memory (DTM) is an emerging, alternative concurrency control model for distributed systems that promises to alleviate the difficulties of lock-based distributed synchronization—for example, distributed deadlocks, livelocks, and lock convoying. A complementary approach for handling conflicts is through a transactional scheduler, which orders transactional requests to avoid or minimize conflicts. This chapter focuses on the closed and open nesting models of managing inner (distributed) transactions to improve throughput on in-memory data grids and presents three transactional schedulers, called reactive transactional scheduler (RTS), dependency-aware transactional scheduler (DATS), and scheduling-based parallel-nested (SPN) transactional scheduler to support closed-, open-, and parallel-nested transactions, respectively.
