English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In many lock-free algorithms, threads help one another, and each operationcreates a descriptor that describes how other threads should help it.Allocating and reclaiming descriptors introduces significant space and timeoverhead. We introduce the first descriptor abstract data type (ADT), whichcaptures the usage of descriptors by lock-free algorithms. We then develop aweak descriptor ADT which has weaker semantics, but can be implementedsignificantly more efficiently. We show how a large class of lock-freealgorithms can be transformed to use weak descriptors, and demonstrate ourtechnique by transforming several algorithms, including the leadingk-compare-and-swap (k-CAS) algorithm. The original k-CAS algorithm allocates atleast k+1 new descriptors per k-CAS. In contrast, our implementation allocatestwo descriptors per process, and each process simply reuses its twodescriptors. Experiments on a variety of workloads show significant performanceimprovements over implementations that reclaim descriptors, and reductions ofup to three orders of magnitude in peak memory usage.

Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away Descriptors