A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="http://ditec.um.es/~meacacio/Research_archivos/pdfs/gaona_pdp12.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/f3hr4iv3tvhrldoukhnurnloh4" style="color: black;">2012 20th Euromicro International Conference on Parallel, Distributed and Network-based Processing</a>
In the search for new paradigms to simplify multithreaded programming, Transactional Memory (TM) is currently being advocated as a promising alternative to deadlock-prone lock-based synchronization. In this way, future many-core CMP architectures may need to provide hardware support for TM. On the other hand, power dissipation constitutes a first class consideration in multicore processor designs. In this work, we propose Dynamic Serialization (DS) as a new technique to improve energy<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/pdp.2012.76">doi:10.1109/pdp.2012.76</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/pdp/Gaona-RamirezGAF12.html">dblp:conf/pdp/Gaona-RamirezGAF12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6kcibdtzrbhn5cxysvhehyurpe">fatcat:6kcibdtzrbhn5cxysvhehyurpe</a> </span>
more »... n without degrading performance in applications with conflicting transactions. Our proposal, which is implemented on top of a hardware transactional memory system with an eager conflict management policy, detects and serializes conflicting transactions dynamically. Particularly, in case of conflict one transaction is allowed to continue whilst the rest are completely stalled. Once the executing transaction has finished it wakes up several of the stalling transactions. This brings important benefits in terms of energy consumption due to the reduction in the amount of wasted work that DS implies. Results for a 16-core CMP show that Dynamic Serialization obtains reductions of 10% on average in energy consumption (more than 20% in high contention scenarios) without affecting, on average, execution time.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811083419/http://ditec.um.es/~meacacio/Research_archivos/pdfs/gaona_pdp12.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b2/73/b273d5624c9b9f59817fe45a81aae5dc1e08dacc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/pdp.2012.76"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>