@conference {europar-dias:2012,
	title = {Efficient Support for In-Place Metadata in Transactional Memory},
	booktitle = {Proceedings of the 18th International Euro-Par Conference on Parallel Processing},
	series = {{Euro-Par}},
	year = {2012},
	note = {<p>Distinguished paper award</p>
},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	address = {Berlin, Heidelberg},
	abstract = {<p>Software Transactional Memory (STM) algorithms correctness rely on metadata associated with the memory locations accessed during the transaction life-time. STM implementations may store this metadata either in-place, by wrapping the memory cells in a container that includes the memory cell itself and the corresponding metadata, or out-place, by resorting to a mapping function that associates the memory cell address to an external table with the corresponding metadata. The implementation techniques for these two approaches are very different and each STM framework is usually biased towards one of them, only allowing the efficient implementation of algorithms that fall into the appropriate category, and inhibiting the fair comparison with STM algorithms falling into the other. In this paper we introduce a technique that supports the use of in-place metadata without requiring to wrap memory cells, thus providing STM algorithms with direct access to the transactional metadata and overcoming the bias. The proposed technique is available as an extension to the DeuceSTM framework and allows the efficient implementation of a wide range of STM algorithms, thus enabling their fair (unbiased) comparison in a common STM infrastructure. We illustrate the benefits of our approach by analyzing its impact in two popular TM algorithms with two different transactional workloads, TL2 and multi-versioning, which bias to out-place and in-place respectively.</p>
},
	url = {http://dx.doi.org/10.1007/978-3-642-32820-6_59},
	attachments = {https://docentes.fct.unl.pt/sites/default/files/joao-lourenco/files/europar12.pdf},
	author = {Ricardo J. Dias and Vale, Tiago M. and Jo{\~a}o M. Louren{\c c}o}
}
