Results 1 to 10 of about 5,282,744 (302)

Lock-free locks revisited [PDF]

open access: yesProceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2022
This paper presents a new and practical approach to lock-free locks based on helping, which allows the user to write code using fine-grained locks, but run it in a lock-free manner.
N. Ben-David, G. Blelloch, Yuanhao Wei
semanticscholar   +3 more sources

Efficient lock-free durable sets [PDF]

open access: yesProceedings of the ACM on Programming Languages, 2019
Non-volatile memory is expected to co-exist or replace DRAM in upcoming architectures. Durable concurrent data structures for non-volatile memories are essential building blocks for constructing adequate software for use with these architectures. In this
Yoav Zuriel   +4 more
semanticscholar   +3 more sources

FreSh: A Lock-Free Data Series Index [PDF]

open access: yes2023 42nd International Symposium on Reliable Distributed Systems (SRDS), 2023
We present FreSh, a lock-free data series index that exhibits good performance (while being robust). FreSh is based on Refresh, which is a generic approach we have developed for supporting lock-freedom in an efficient way on top of any locality-aware ...
P. Fatourou   +3 more
semanticscholar   +3 more sources

Lock-Free Hopscotch Hashing [PDF]

open access: yesSIAM Symposium on Algorithmic Principles of Computer Systems, 2019
In this paper we present a lock-free version of Hopscotch Hashing. Hopscotch Hashing is an open addressing algorithm originally proposed by Herlihy, Shavit, and Tzafrir, which is known for fast performance and excellent cache locality.
R. Kelly   +2 more
semanticscholar   +5 more sources

A Study of Lock-Free Based Concurrent Garbage Collectors for Multicore Platform [PDF]

open access: yesThe Scientific World Journal, 2014
Concurrent garbage collectors (CGC) have recently obtained extensive concern on multicore platform. Excellent designed CGC can improve the efficiency of runtime systems by exploring the full potential processing resources of multicore computers.
Hao Wu, Zhen-Zhou Ji
doaj   +2 more sources

A Lock Free Approach To Parallelize The Cellular Potts Model: Application To Ductal Carcinoma In Situ [PDF]

open access: yesJournal of Integrative Bioinformatics, 2020
In the field of computational biology, in order to simulate multiscale biological systems, the Cellular Potts Model (CPM) has been used, which determines the actions that simulated cells can perform by determining a hamiltonian of energy that takes into ...
Tomeu Antonio J., Salguero Alberto G.
doaj   +2 more sources

Lock-free parallel dynamic programming [PDF]

open access: yesJournal of Parallel and Distributed Computing, 2010
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the order in which the dynamic program computes its subproblems. This generic approach is applied to dynamic programs for knapsack, shortest paths, and RNA structure alignment, as
Alex D Stivala   +2 more
exaly   +5 more sources

Every data structure deserves lock-free memory reclamation [PDF]

open access: yesProc. ACM Program. Lang., 2018
Memory-management support for lock-free data structures is well known to be a tough problem. Recent work has successfully reduced the overhead of such schemes.
Nachshon Cohen
exaly   +2 more sources

EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation [PDF]

open access: yesInternational Conference on Principles of Distributed Systems, 2022
Multi-Version Concurrency Control (MVCC) is a common mechanism for achieving linearizable range queries in database systems and concurrent data-structures.
Gali Sheffi, P. Ramalhete, E. Petrank
semanticscholar   +1 more source

Jiffy: a lock-free skip list with batch updates and snapshots [PDF]

open access: yesACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 2021
In this paper we introduce Jiffy, the first lock-free, linearizable, ordered key-value index that offers both (1) batch updates, i.e., put and remove operations that are executed atomically, and (2) consistent snapshots used by, e.g., range scan ...
Tadeusz Kobus   +2 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy