Results 261 to 270 of about 34,934 (297)
Some of the next articles are maybe not open access.
Lock-Free Parallel Computing Using Theatre
2020Theatre is a control-based actor system currently developed in Java, whose design specifically addresses the development of predictable, time-constrained distributed systems. Theatre, though, can also be used for untimed concurrent applications. The control structure regulating message scheduling and dispatching can be customized by programming.
Christian Nigro, Libero Nigro
openaire +2 more sources
Lock-Free Multiway Search Trees
2010 39th International Conference on Parallel Processing, 2010We propose a lock-free multiway search tree algorithm for concurrent applications with large working set sizes. Our algorithm is a variation of the randomized skip tree. We relax the ordering constraints among the nodes in the original skip tree definition.
Michael Spiegel, Paul F. Reynolds Jr.
openaire +1 more source
Lock-free incremental coordinate descent
2017 IEEE 56th Annual Conference on Decision and Control (CDC), 2017We study a flexible algorithm for minimizing a sum of component functions, each of which depends on a large number of decision variables. The algorithm combines aspects of incremental gradient method with that of coordinate descent. In contrast to earlier algorithms of this kind, our algorithm is lock-free and does not require synchronization of access
Vien V. Mai, Mikael Johansson
openaire +1 more source
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures, 2012
Lock-free data structures provide a progress guarantee and are known for facilitating scalability, avoiding deadlocks and livelocks, and providing guaranteed system responsiveness. In this paper we present a design for a lock-free balanced tree, specifically, a B+tree.
Anastasia Braginsky, Erez Petrank
openaire +1 more source
Lock-free data structures provide a progress guarantee and are known for facilitating scalability, avoiding deadlocks and livelocks, and providing guaranteed system responsiveness. In this paper we present a design for a lock-free balanced tree, specifically, a B+tree.
Anastasia Braginsky, Erez Petrank
openaire +1 more source
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
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