Transactional memory (TM) has emerged as an alternative to the lock-based parallel programming model offering an effective and optimistic management of concurrency. Recently, TM is being experimented in the context of high performance computing. Many applications in that area spent a large amount of computing time in irregular reduction operations, so their efficient parallelization is of utmost importance. This paper explores how to address irregular reductions in the TM model, analyzing which support needs to be added to the TM system to deal with reductions as a special case of conflicting memory accesses.
['Miguel A. Gonzalez-Mesa', 'Ricardo Quislant', 'Eladio Gutiérrez', 'Oscar G. Plata']
Exploring Irregular Reduction Support in Transactional Memory