On designing NUMA-aware concurrency control for scalable transactional memory

Mohamedin, Mohamed; Palmieri, Roberto; Peluso, Sebastiano; Ravindran, Binoy

doi:10.1145/2851141.2851189

Cited by 6 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Não há na literatura muitos trabalhos analisando o desempenho de aplicac ¸ões transacionais em arquiteturas NUMA. Uma primeira análise sobre o controle de concorrência em TM no contexto de NUMA foi apresentado por Mohamedin et al [Mohamedin et al 2018]. Mais recentemente, Pasqualin et al [Pasqualin et al 2020a] fizeram uma caracterizac ¸ão do comportamento de algumas aplicac ¸ões transacionais em arquiteturas NUMA.…”

Section: Contextualizac ¸ãO E Trabalhos Relacionadosunclassified

Caracterização Inicial do Comportamento de Aplicações Transacionais em Arquiteturas NUMA

Libório

Baldassin

2021

Anais Estendidos Do XXII Simpósio Em Sistemas Computacionais De Alto Desempenho (SSCAD Estendido 2021)

View full text Add to dashboard Cite

Este artigo busca fazer uma caracterização inicial de memória transacional em sistemas NUMA de alto desempenho e, por meio da aplicação de diferentes mecanismos de alocação de memória dinâmica e de mapeamento de threads, obter um perfil de desempenho comparativo. Os resultados mostram que existem benefícios no uso de um único socket de processador e que, para melhor explorar arquiteturas NUMA, algumas mudanças são necessárias no algoritmo transacional.

show abstract

Section: Contextualizac ¸ãO E Trabalhos Relacionadosunclassified

Caracterização Inicial do Comportamento de Aplicações Transacionais em Arquiteturas NUMA

Libório

Baldassin

2021

Anais Estendidos Do XXII Simpósio Em Sistemas Computacionais De Alto Desempenho (SSCAD Estendido 2021)

View full text Add to dashboard Cite

show abstract

“…In [12], the authors of NEMO, a NUMA-aware TM algorithm have proposed a well optimized solution for providing scalability to applications running in NUMA architectures. NEMO is tested using well-known and synthetic OLTP transactional workloads.…”

Section: Related Workmentioning

confidence: 99%

Pulsating STM – The in-memory Optimistic Concurrency Control Technique for Multi Core Systems

Jafar*,

Rajnish,

Kumar

2019

IJEAT

View full text Add to dashboard Cite

In the world of ever increasing parallelism, the problem of deadlock-free concurrency control is inevitable. As the number of processing cores is increasing, the number of processing threads is also increasing, and with this increase in the number of processing threads, there is a good chance of problems arising due to lack of proper concurrency control. The application areas under the domain of advanced graphics, cryptography, deep learning, embedded system programming, artificial intelligence and networking are prone to the problems of heavy uncontrolled concurrency of threads. This paper presents a novel Software Transactional Memory (STM) based optimistic concurrency control technique that is deadlock free for threads accessing the in-memory data structure for the purpose of reading as well as writing. The technique is lock free and is based upon timestamping. Threads involved in the proposed approach possess the transactional properties of atomicity, concurrency and isolation. Durability is not expected as the threads are working on an in-memory data source. The approach involves lazy conflict detection that ensures minimum aborts and restarts as well as maximum concurrency among transactions. Being lock free, the algorithm is better than the existing lock-based techniques. The technique is tested on Sniper-6.1 multi core simulator simulating 64 CPU cores and running 16, 32, 40 and 50 threads in our case. The results show significant improvement in throughput with the increasing number of threads over the existing lock-based techniques as well as other STM techniques based on optimistic concurrency control.

show abstract

“…Transactional memory, in software (STM) [27,49,55] or in hardware (HTM) [23,36], replaces locks with transactions as a concurrency-control mechanism. On the one hand, STMs are typically slower than locks, due to their instrumentation overhead.…”

Section: Related Work Lock Algorithmsmentioning

confidence: 99%

Locking Made Easy

Antić

Chatzopoulos

Guerraoui

et al. 2016

Proceedings of the 17th International Middleware Conference

View full text Add to dashboard Cite

A priori, locking seems easy: To protect shared data from concurrent accesses, it is sufficient to lock before accessing the data and unlock after. Nevertheless, making locking efficient requires finetuning (a) the granularity of locks and (b) the locking strategy for each lock and possibly each workload. As a result, locking can become very complicated to design and debug.We present GLS, a middleware that makes lock-based programming simple and effective. GLS offers the classic lock-unlock interface of locks. However, in contrast to classic lock libraries, GLS does not require any effort from the programmer for allocating and initializing locks, nor for selecting the appropriate locking strategy. With GLS, all these intricacies of locking are hidden from the programmer. GLS is based on GLK, a generic lock algorithm that dynamically adapts to the contention level on the lock object. GLK is able to deliver the best performance among simple spinlocks, scalable queue-based locks, and blocking locks. Furthermore, GLS offers several debugging options for easily detecting various lockrelated issues, such as deadlocks.We evaluate GLS and GLK on two modern hardware platforms, using several software systems (i.e., HamsterDB, Kyoto Cabinet, Memcached, MySQL, SQLite) and show how GLK improves their performance by 23% on average, compared to their default locking strategies. We illustrate the simplicity of using GLS and its debugging facilities by rewriting the synchronization code for Memcached and detecting two potential correctness issues. CCS Concepts•Computing methodologies → Shared memory algorithms; Concurrent algorithms; •Computer systems organization → Multicore architectures; Keywords Locking; Adaptive Locking; Locking Middleware; Locking Runtime; Synchronization; Multi-cores; Performance * Work done while the author was at EPFL. Currently at Google. † Author names appear in alphabetical order.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 the author(s) 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 permissions@acm.org.

show abstract

On designing NUMA-aware concurrency control for scalable transactional memory

Cited by 6 publications

References 10 publications

Caracterização Inicial do Comportamento de Aplicações Transacionais em Arquiteturas NUMA

Caracterização Inicial do Comportamento de Aplicações Transacionais em Arquiteturas NUMA

Pulsating STM – The in-memory Optimistic Concurrency Control Technique for Multi Core Systems

Locking Made Easy

Contact Info

Product

Resources

About