Scalability Analysis of Signatures in Transactional Memory Systems

• Ricardo Quislant Universidad de Malaga
• Eladio Gutierrez Universidad de Malaga
• Oscar Plata Universidad de Malaga

Resumo

Signatures have been proposed in transactional memory systems to represent read and write sets and to decouple transaction conflict detection from private caches or to accelerate it. Generally, signatures are implemented as Bloom filters that allow unbounded read/write sets to be summarized in bounded space at the cost of false conflict detection. It is known that this behavior has great impact in parallel performance. In this work, a scalability study of state-of-the-art signature designs is presented, for different orthogonal transactional characteristics, including contention, length, concurrency and spatial locality. This study was accomplished using the Stanford EigenBench benchmark. This benchmark was modified to support spatial locality analysis using a Zipf address distribution. Experimental evaluation on a hardware transactional memory simulator shows the impact of those parameters in the behavior of state-of-the-art signatures.

Palavras-chave: Concurrent computing, Indexes, Benchmark testing, Scalability, History, Hardware, Instruction sets, Hardware transactional memory, Bloom filter, signatures, conflict detection, locality, multiset, asymmetric