Transactional memory: architectural support for lock-free data structures
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Software transactional memory for dynamic-sized data structures
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Language support for lightweight transactions
OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
Transactional Memory Coherence and Consistency
Proceedings of the 31st annual international symposium on Computer architecture
Communications of the ACM - Designing for the mobile device
McRT-STM: a high performance software transactional memory system for a multi-core runtime
Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Compiler and runtime support for efficient software transactional memory
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
An effective hybrid transactional memory system with strong isolation guarantees
Proceedings of the 34th annual international symposium on Computer architecture
Nested parallelism in transactional memory
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Lowering Conflicts of High Contention Software Transactional Memory
CSSE '08 Proceedings of the 2008 International Conference on Computer Science and Software Engineering - Volume 03
Implications of False Conflict Rate Trends for Robust Software Transactional Memory
IISWC '07 Proceedings of the 2007 IEEE 10th International Symposium on Workload Characterization
Refereeing conflicts in hardware transactional memory
Proceedings of the 23rd international conference on Supercomputing
DISC'06 Proceedings of the 20th international conference on Distributed Computing
| Hi-index | 0.00 |
Transactional memory (TM) continues to be the most promising approach replacing locks in concurrent programming, but TM systems based on software (STM) still lack the desired performance when compared to fine-grained lock implementations It is known that the critical operation in TM systems is to ensure the atomicity and isolation of concurrently executing threads This task is known as the read/write-set validation In attempt to make this process as fast as possible, STM systems usually use ownership tables to perform conflict detection, but this approach generates false positive occurrences, which result in false aborts This paper shows the real impact of false aborts and how its relevance increases along with the number of concurrent threads, showing it is an essential factor for TM systems We propose two different techniques to avoid false aborts, showing its benefits and limitations The first is a collision list attached to the existing hash table The second is a full associative memory mapping between the addresses and its version information We achieved significant performance improvements in some STAMP benchmark programs, resulting in speedups up to 1.5x We also show that speedups become higher when the number of parallel threads increases.