Results 261 to 270 of about 5,282,744 (302)
Some of the next articles are maybe not open access.
Lock-Free Dynamically Resizable Arrays
2006We present a first lock-free design and implementation of a dynamically resizable array (vector). The most extensively used container in the C++ Standard Template Library (STL) is vector, offering a combination of dynamic memory management and constant-time random access.
Damian Dechev +2 more
openaire +1 more source
Lock-Free Collective Operations
2003This paper describes an extension of the lock-free message passing idea to the native implementation of the MPI-2 collective operations for the shared memory based platforms. A handy notation is introduced for the description of the collective algorithms.
openaire +1 more source
2020 2nd International Conference on Computer and Information Sciences (ICCIS), 2020
One of the fundamental data structure that is commonly used in parallel and concurrent systems is first-in-first-out queue. Many studies propose lock-based concurrent queue algorithms to satisfy correctness property. However, the use of locks results in delays, contention, deadlock and some other issues.
openaire +1 more source
One of the fundamental data structure that is commonly used in parallel and concurrent systems is first-in-first-out queue. Many studies propose lock-based concurrent queue algorithms to satisfy correctness property. However, the use of locks results in delays, contention, deadlock and some other issues.
openaire +1 more source
On the implementation of memory reclamation methods in a lock-free hash trie design
J. Parallel Distributed Comput., 2021P. Moreno, M. Areias, Ricardo Rocha
semanticscholar +1 more source
Lock-Free Data-Structure Iterators
2013Concurrent data structures are often used with large concurrent software. An iterator that traverses the data structure items is a highly desirable interface that often exists for sequential data structures but is missing from almost all concurrent data-structure implementations.
Erez Petrank, Shahar Timnat
openaire +1 more source
A Portable Lock-Free Bounded Queue
2016Attaining efficient and portable lock-free containers is challenging as almost any CPU family implements slightly different memory models and atomic read-modify-write operations. C++11 offers a memory model and operation abstractions that enable portable implementations of non-blocking algorithms. In this paper, we present a first scalable and portable
Peter Pirkelbauer +2 more
openaire +1 more source
Scalable lock-free dynamic memory allocation
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation, 2004Dynamic memory allocators (malloc/free) rely on mutual exclusion locks for protecting the consistency of their shared data structures under multithreading. The use of locking has many disadvantages with respect to performance, availability, robustness, and programming flexibility.
openaire +1 more source
A persistent lock-free queue for non-volatile memory
ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 2018Michal Friedman +3 more
semanticscholar +1 more source
FEAST: A Lightweight Lock-free Concurrent Binary Search Tree
ACM Transactions on Parallel Computing, 2020Aravind Natarajan +2 more
semanticscholar +1 more source
Easy Lock-Free Indexing in Non-Volatile Memory
IEEE International Conference on Data Engineering, 2018Tianzheng Wang +2 more
semanticscholar +1 more source