5,534 research outputs found
Lock-Free and Practical Deques using Single-Word Compare-And-Swap
We present an efficient and practical lock-free implementation of a
concurrent deque that is disjoint-parallel accessible and uses atomic
primitives which are available in modern computer systems. Previously known
lock-free algorithms of deques are either based on non-available atomic
synchronization primitives, only implement a subset of the functionality, or
are not designed for disjoint accesses. Our algorithm is based on a doubly
linked list, and only requires single-word compare-and-swap atomic primitives,
even for dynamic memory sizes. We have performed an empirical study using full
implementations of the most efficient algorithms of lock-free deques known. For
systems with low concurrency, the algorithm by Michael shows the best
performance. However, as our algorithm is designed for disjoint accesses, it
performs significantly better on systems with high concurrency and non-uniform
memory architecture
Tutorial: Verification and Validation for Magnetic Fusion
99ER54512. Reproduction, translation, publication, use and disposal, in whole or in part, by or for the United States government is permitted. Submitted for publication to Physics of Plasmas
My Old Kentucky Home Good-night
https://digitalcommons.library.umaine.edu/mmb-ps/2772/thumbnail.jp
Fort! Da!: Thinking Death in Freud and Faust
Senior Project submitted to The Division of Languages and Literature of Bard College
Abstract: Verdi\u27s Patriarch and Puccini\u27s Matriarch or \u27Through the Looking Glass and What Puccini Found There\u27
Recommended from our members
Long-term effects of sucrose and carbohydrate on blood glucose and aggression in mice.
- …