Wait-free dynamic transactions for linked data structures

P LaBorde, L Lebanoff, C Peterson, D Zhang… - Proceedings of the 10th …, 2019 - dl.acm.org
Transactional data structures support threads executing a sequence of operations
atomically. Dynamic transactions allow operands to be generated on the fly and allows …

Co-simulation technology of mold flow and structure for injection molding reinforced thermoplastic composite (FRT) parts

M Zhiguo, S Xianzhang, H Yulong, Z Jun… - … Composites and Hybrid …, 2022 - Springer
The co-simulation of mold flow and structure plays an important role in the design of
injection molded fiber-reinforced thermoplastic (FRT) parts. The mold flow model is usually a …

Lock-free transactional transformation for linked data structures

D Zhang, P Laborde, L Lebanoff… - ACM Transactions on …, 2018 - dl.acm.org
Nonblocking data structures allow scalable and thread-safe access to shared data. They
provide individual operations that appear to execute atomically. However, it is often …

QoS monitoring in real-time streaming overlays based on lock-free data structures

F Tommasi, V De Luca, C Melle - Multimedia Tools and Applications, 2021 - Springer
Peer-to-peer streaming is a well-known technology for the large-scale distribution of real-
time audio/video contents. Delay requirements are very strict in interactive real-time …

PMap: A non-volatile lock-free hash map with open addressing

K Lamar, C Peterson, D Dechev… - 2021 IEEE 10th Non …, 2021 - ieeexplore.ieee.org
Non-volatile memory (NVM) is an emerging memory technology that provides data
persistence and higher densities than conventional DRAM. The release of Intel Optane DC …

Advances in High Performance Computing Through Concurrent Data Structures and Predictive Scheduling

KM Lamar - 2024 - stars.library.ucf.edu
Abstract Modern High Performance Computing (HPC) systems are made up of thousands of
server-grade compute nodes linked through a high-speed network interconnect. Each node …

LeCache: TowardsAdaptiveCacheMemoryAllocationviaAdmissionControl

W Li, W Wen, Z Cheng, Y Chen, A Li… - Available at SSRN … - papers.ssrn.com
As one of the most important questions in large-scale caching systems, the problem of
optimizing memory allocation needs to estimate different groups of workloads by tracing …

[PDF][PDF] Monkey Hashing: a Wait-Free Hashing Scheme with Worst-Case Constant-Time Operations

JA Junior, VGP de Sá - 2023 - vigusmao.github.io
We exploit multiple-choice hashing to create a concurrent hashing scheme with O (1) worst-
case time for lookup, insert, update and remove operations, an eventually consistent hash …

Análise de Desempenho de Hash Tables Não-Bloqueantes na Linguagem C++

DP Luiz, OM Mendizabal - Anais da XXIII Escola Regional de Alto …, 2023 - sol.sbc.org.br
Hash Tables são estruturas de dados que associam chaves de busca a valores e são
amplamente utilizadas no desenvolvimento de sistemas. Quando seu uso exigir …

Practical Dynamic Transactional Data Structures

P LaBorde - 2018 - stars.library.ucf.edu
Multicore programming presents the challenge of synchronizing multiple threads.
Traditionally, mutual exclusion locks are used to limit access to a shared resource to a single …