Optimizing Memory Transactions for Multicore Systems

Transactional Sapphire

“…Bacon et al [2003] use compiler optimisations to reduce the cost of read barriers, in particular by reducing the number of null checks; similarly, we eliminate the pointer-equality barrier, Algorithm 9(a), if either operand is null. Adl-Tabatabai et al [2009] similarly suggest opportunities for eliminating redundant operations across multiple barriers in the context of software transactional memory systems. We also rely on Jikes RVM's optimising compiler to reduce the cost of barriers.…”