Optimizing consistency checking for memory-intensive transactions
Justin Gottschlich, Daniel A. Connors · 2008
Transactional memory (TM) reduces parallel programming complexity while maintaining multi-threaded performance benefits. Consistency checking, the way memory conflicts are found in TM, is critical to performance and is executed through either validation or invalidation. We present a unique invalidation algorithm which boasts high transactional throughput for memory-intensive transactions.