Adaptive Conflict Detection Algorithm Based on Rochester Software Transactional Memory

When the transactional memory system detects conflicts, the more read-write addresses are, the higher the false positive rate of this algorithm is. This paper studies the problem and proposes a new signature based optimization algorithm, adaptive increase signature algorithm (AISA). The algorithm can calculate the saturation value of the number of read-write addresses, and dynamically adjust the size of bit string through the calculated saturation value, thus greatly reducing the false positive rate. The experimental results show that AISA can control the false positive rate at a low level on the basis of considering the space cost, and its effect is almost the same as that of 6 times of space, which will improve the performance of transactional memory system greatly.

[1]  Peng Wu,et al.  Fastpath Speculative Parallelization , 2009, LCPC.

[2]  Roger Wattenhofer,et al.  Bounds on contention management algorithms , 2009, Theor. Comput. Sci..

[3]  Rui Guo,et al.  Scalable Transactional Memory Architecture Supporting Speculative Parallelization , 2011, 2011 International Conference on Network Computing and Information Security.

[4]  A. M. Natarajan,et al.  Optimization of bloom filter using evolutionary algorithm , 2012, 2012 International Conference on Recent Advances in Computing and Software Systems.

[5]  David Black-Schaffer,et al.  Using Hardware Transactional Memory for High-Performance Computing , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[6]  Lei Bai,et al.  Using Sample and Multilayer Compressed Counting Bloom Filter Algorithm to Realize Elephant Flows Identification , 2014 .