Energy-efficient and high-performance lock speculation hardware for embedded multicore systems
Bahar, R Iris
MetadataShow full item record
Citation (published version)Dimitra Papagiannopoulou, Giuseppe Capodanno, Tali Moreshet, Maurice Herlihy, R Iris Bahar. 2015. "Energy-Efficient and High-Performance Lock Speculation Hardware for Embedded Multicore Systems." ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Embedded Platforms for Crypto and Regular Papers TECS Homepage archive Volume 14 Issue 3, May 2015 Article No. 51 https://doi.org/10.1145/2700097
Embedded systems are becoming increasingly common in everyday life and like their general-purpose counterparts, they have shifted towards shared memory multicore architectures. However, they are much more resource constrained, and as they often run on batteries, energy efficiency becomes critically important. In such systems, achieving high concurrency is a key demand for delivering satisfactory performance at low energy cost. In order to achieve this high concurrency, consistency across the shared memory hierarchy must be accomplished in a cost-effective manner in terms of performance, energy, and implementation complexity. In this article, we propose Embedded-Spec, a hardware solution for supporting transparent lock speculation, without the requirement for special supporting instructions. Using this approach, we evaluate the energy consumption and performance of a suite of benchmarks, exploring a range of contention management and retry policies. We conclude that for resource-constrained platforms, lock speculation can provide real benefits in terms of improved concurrency and energy efficiency, as long as the underlying hardware support is carefully configured.
Rights© ACM, 2015 This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Embedded Platforms for Crypto and Regular Papers TECS Homepage archive Volume 14 Issue 3, May 2015 Article No. 51 https://doi.org/10.1145/2700097
Showing items related by title, author, creator and subject.
Canetti, Ran; Goldreich, Oded; Halevi, Shai (Association for Computing Machinery, 2004)We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called “cryptographic ...
Granger, Brian R.; Chang, Yi-Chien; Wang, Yan; DeLisi, Charles; Segre, Daniel; Hu, Zhenjun (PUBLIC LIBRARY SCIENCE, 2016-04-01)The complexity of metabolic networks in microbial communities poses an unresolved visualization and interpretation challenge. We address this challenge in the newly expanded version of a software tool for the analysis of ...
Bennett, Charles H.; Gacs, Peter; Li, Ming; Vitanyi, Paul M.B.; Zurek, Wojciech H. (IEEE, 1998-07-01)While Kolmogorov (1965) complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distance between two individual objects, ...