Results 251 to 260 of about 5,282,744 (302)

Efficient Lock Free Privatization

2010
Working on shared mutable data requires synchronization through barriers, locks or transactional memory mechanisms. To avoid this overhead a thread may privatize part of the data and work on it locally. By privatizing a data item a thread is guaranteed that it is the only one accessing this data, i.e., that it accesses the data item in exclusion ...
Afek Y., Avni H., Dice D., Shavit N.
openaire   +1 more source

A Lock-Free Skiplist for Integrated Graphics Processing Units

IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum, 2019
With the advent of computing systems with on-die integrated graphics processing unit (iGPU), new general-purpose GPU programming challenges have emerged from these heterogeneous processors.
J. Fuentes, Weiyu Chen, Guei-Yuan Lueh, I. Scherson   +3 more
semanticscholar   +1 more source

Lock-free Contention Adapting Search Trees

ACM Symposium on Parallelism in Algorithms and Architectures, 2018
Concurrent key-value stores with range query support are crucial for the scalability and performance of many applications. Existing lock-free data structures of this kind use a fixed synchronization granularity.
Kjell Winblad, Konstantinos Sagonas, B. Jonsson   +2 more
semanticscholar   +1 more source

Lock-Free Parallel Computing Using Theatre

2020
Theatre 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

LOFT: lock-free transactional data structures

ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 2019
Concurrent data structures are widely used in modern multicore architectures, providing atomicity (linearizability) for each concurrent operation. However, it is often desirable to execute several operations on multiple data structures atomically.
A. Elizarov, Guy Golan-Gueta, E. Petrank
semanticscholar   +1 more source

Lock-Free Multiway Search Trees

2010 39th International Conference on Parallel Processing, 2010
We 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), 2017
We 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

Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors

International Symposium on Distributed Computing, 2017
In many lock-free algorithms, threads help one another, and each operation creates a descriptor that describes how other threads should help it. Allocating and reclaiming descriptors introduces significant space and time overhead.
Maya Arbel-Raviv, Trevor Brown
semanticscholar   +1 more source

A lock-free B+tree

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

BQ: A Lock-Free Queue with Batching

ACM Symposium on Parallelism in Algorithms and Architectures, 2018
Concurrent data structures provide fundamental building blocks for concurrent programming. Standard concurrent data structures may be extended by allowing a sequence of operations to be submitted as a batch for later execution.
Gal Milman-Sela, Alex Kogan, Yossi Lev, Victor Luchangco, E. Petrank   +4 more
semanticscholar   +1 more source