The Community for Technology Leaders
Green Image
Issue No. 03 - March (2013 vol. 24)
ISSN: 1045-9219
pp: 506-519
Ricardo Quislant , University of Malaga, Malaga
Eladio Gutierrez , University of Malaga, Malaga
Oscar Plata , University of Malaga, Malaga
Emilio L. Zapata , University of Malaga, Malaga
Transactional Memory (TM) systems must track memory accesses made by concurrent transactions in order to detect conflicts. Many TM implementations use signatures for this purpose, which summarize reads and writes in fixed-size bit registers at the cost of false positives (detection of nonexisting conflicts). Signatures are commonly implemented as two separate same-sized Bloom filters, one for reads and other for writes. In contrast, transactions frequently exhibit read and write sets of uneven cardinality. This mismatch between data sets and filter storage introduces inefficiencies in the use of signatures that have some impact on performance. This paper presents different signature designs as alternatives to the common scheme to deal with the asymmetry in transactional data sets in an effective way. Basically, we analyze two classes of new signatures, called multiset and reconfigurable asymmetric signatures. The first class uses only one Bloom filter to track both read and write sets, while the second class uses Bloom filters of configurable size for reads and writes. The main focus of this paper is a thorough study of these alternative signature designs, including a statistical analysis of false positives and an experimental evaluation, providing performance results and hardware area, time and energy requirements.
Random access memory, Logic gates, Hardware, Arrays, Indexes, Registers, Programming, asymmetric, Hardware transactional memory, Bloom filter, signatures, conflict detection, locality, multiset

O. Plata, E. Gutierrez, R. Quislant and E. L. Zapata, "Hardware Signature Designs to Deal with Asymmetry in Transactional Data Sets," in IEEE Transactions on Parallel & Distributed Systems, vol. 24, no. , pp. 506-519, 2013.
219 ms
(Ver 3.3 (11022016))