On designing NUMA-aware concurrency control for scalable transactional memory
Authors: 
Mohamed Mohamedin, Roberto Palmieri, Sebastiano Peluso, 
Binoy RavindranAuthors Info & Claims
Mohamed Mohamedin, Roberto Palmieri, Sebastiano Peluso, Binoy RavindranAuthors Info & ClaimsArticle No.: 45, Pages 1 - 2
Abstract
NUMA architectures posed the challenge of rethinking parallel applications due to the non-homogeneity introduced by their design, and their real benefits are limited to the characteristics of the particular workload. We name as partitionable transactional workloads such workloads that may be able to exploit the distributed nature of NUMA, such as transactional workloads where data and accesses can be easily partitioned among the so called NUMA zones. However, in case those workloads require the synchronization on shared data, we have to face the issue of exploiting the NUMA architecture also in the concurrency control for their transactions. Therefore in this paper we present a NUMA-aware concurrency control for transactional memory that we designed for promoting scalability in scenarios where both the transactional workload is prone to scale, and the characteristics of the underlying memory model are inherently non-uniform, such as NUMA architectures.
References
[1]
J. Antony, P. P. Janes, and A. P. Rendell. Exploring Thread and Memory Placement on NUMA Architectures: Solaris and Linux, Ultra-SPARC/FirePlane and Opteron/Hypertransport. In HiPC '06, 2006.
[2]
H. Avni and N. Shavit. Maintaining Consistent Transactional States Without a Global Clock. In SIROCCO '08, 2008.
[3]
L. Dalessandro, M. F. Spear, and M. L. Scott. NOrec: Streamlining STM by Abolishing Ownership Records. In PPoPP '10, 2010.
[4]
D. Dice, O. Shalev, and N. Shavit. Transactional Locking II. In DISC '06, 2006.
[5]
D. Dice, V. J. Marathe, and N. Shavit. Lock Cohorting: A General Technique for Designing NUMA Locks. In PPoPP '12, 2012.
[6]
A. Dragojević, R. Guerraoui, and M. Kapalka. Stretching Transactional Memory. In PLDI '09, 2009.
[7]
P. Felber, C. Fetzer, and T. Riegel. Dynamic Performance Tuning of Word-based Software Transactional Memory. In PPoPP '08, 2008.
[8]
T. Harris, J. Larus, and R. Rajwar. Transactional Memory, 2nd Edition. Morgan and Claypool Publishers, 2nd edition, 2010. ISBN 1608452352, 9781608452354.
[9]
A. Israeli and L. Rappoport. Disjoint-access-parallel Implementations of Strong Shared Memory Primitives. In PODC '94, 1994.
[10]
JEDEC. DDR3 SDRAM standard (revision F), 2012. http://www.jedec.org/standards-documents/docs/jesd-79-3d.
[11]
Y. Lev, V. Luchangco, V. Marathe, M. Moir, D. Nussbaum, and M. Olszewski. Anatomy of a scalable software transactional memory. In TRANSACT '09, 2009.
[12]
N. Manchanda and K. Anand. Non-Uniform Memory Access (NUMA). New York University, 2010.
[13]
S. Peluso, P. Romano, and F. Quaglia. SCORe: A Scalable One-copy Serializable Partial Replication Protocol. In Middleware '12, 2012.
[14]
M. F. Spear, M. M. Michael, and C. von Praun. RingSTM: Scalable Transactions with a Single Atomic Instruction. In SPAA '08, 2008.
[15]
TPC Council. TPC-C Benchmark, Revision 5.11. Feb. 2010.
[16]
D. Ziakas, A. Baum, R. A. Maddox, and R. J. Safranek. Intel® Quick-Path Interconnect Architectural Features Supporting Scalable System Architectures. In HOTI '10, 2010.
Index Terms
- On designing NUMA-aware concurrency control for scalable transactional memory
Recommendations
On designing NUMA-aware concurrency control for scalable transactional memory
PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel ProgrammingNUMA architectures posed the challenge of rethinking parallel applications due to the non-homogeneity introduced by their design, and their real benefits are limited to the characteristics of the particular workload. We name as partitionable ...
Applying transactional memory to concurrency bugs
ASPLOS '12Multithreaded programs often suffer from synchronization bugs such as atomicity violations and deadlocks. These bugs arise from complicated locking strategies and ad hoc synchronization methods to avoid the use of locks. A survey of the bug databases of ...
Applying transactional memory to concurrency bugs
ASPLOS '12Multithreaded programs often suffer from synchronization bugs such as atomicity violations and deadlocks. These bugs arise from complicated locking strategies and ad hoc synchronization methods to avoid the use of locks. A survey of the bug databases of ...
Comments
Information & Contributors
Information
Published In
August 2016
405 pages
February 2016420 pages
Copyright © 2016 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 27 February 2016
Published in SIGPLAN Volume 51, Issue 8
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations3Total Citations
- 558Total Downloads
- Downloads (Last 12 months)85
- Downloads (Last 6 weeks)23
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in