Results 251 to 260 of about 34,934 (297)

Lock-free transactional vector

Proceedings of the Eleventh International Workshop on Programming Models and Applications for Multicores and Manycores, 2020
The vector is a fundamental data structure, offering constant-time traversal to elements and a dynamically resizable range of indices. While several concurrent vectors exist, a composition of concurrent vector operations dependent on each other can lead to undefined behavior.
Kenneth Lamar   +2 more
openaire   +1 more source

Locking-Free Degenerated Isoparametric Shell Element

Applied Mathematics and Mechanics, 2001
An 8-noded locking-free degenerated isoparametric shell element is presented. A revised interpolation for shear strain terms was constructed in natural co-ordinate system such that all necessary modes (translation, rotation and constant curvature) are preserved, which can be used to eliminate shear locking.
Zhang, Xiangming   +2 more
openaire   +1 more source

Mostly lock-free malloc

Proceedings of the third international symposium on Memory management - ISMM '02, 2002
Modern multithreaded applications, such as application servers and database engines, can severely stress the performance of user-level memory allocators like the ubiquitous malloc subsystem. Such allocators can prove to be a major scalability impediment for the applications that use them, particularly for applications with large numbers of threads ...
Dave Dice, Alex Garthwaite
openaire   +1 more source

Lock-free reference counting

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Detlefs, David L.   +3 more
openaire   +2 more sources

Lock-Free Cuckoo Hashing

2014 IEEE 34th International Conference on Distributed Computing Systems, 2014
This paper presents a lock-free cuckoo hashing algorithm, to the best of our knowledge this is the first lock-free cuckoo hashing in the literature. The algorithm allows mutating operations to operate concurrently with query ones and requires only single word compare-and-swap primitives.
Nhan Nguyen, Philippas Tsigas
openaire   +1 more source

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

Home - About - Disclaimer - Privacy