Downloads provided by UsageCounts
This artifact contains the source code of the experiments presented in the paper "The State-of-the-Art LCRQ Concurrent Queue Algorithm Does NOT Require CAS2". Implementations of the following concurrent queue algorithms are included: LPRQ (Our Algorithm) LCRQ FAAArrayQueue LSCQ CC-Queue The experiments consist of two benchmarks: Enqueue-dequeue pairs, in which threads perform pairs of Enqueue(..) and Dequeue() operations in a loop. Producer-consumer, in which threads are separated into producers and consumers, so each thread either only sends elements or retrieves them. The archive contains detailed instructions how to build and run the experiments in README.md.
benchmark, concurrent data structure, concurrent queue, LCRQ
benchmark, concurrent data structure, concurrent queue, LCRQ
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 49 | |
| downloads | 18 |

Views provided by UsageCounts
Downloads provided by UsageCounts