ReduxSTM: Optimizing STM designs for Irregular Applications

摘要: Abstract The exploitation of optimistic concurrency in modern multicore architectures via Transactional Memory (TM) is becoming a mainstream programming paradigm. TM features can be leveraged to provide support for speculative parallel execution irregular applications, characterized by lack knowledge about data dependences at compile-time. This work focused on software (STM) solutions and how they adapted optimized deal efficiently with memory access patterns, mainly those caused reduction operations. With this aim, ReduxSTM introduced as specific STM system designed combining techniques algorithms. based three main design aspects: transactional commit order mechanism which available guarantee sequential semantics when needed; primitive defined expressing commutative associative operations (reductions) that leverages the underlying privatization avoid unnecessary transaction aborts patterns; an enhanced conflict resolution takes advantage two previous features.