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

This paper addresses the problem of universal synchronization primitives thatcan support scalable thread synchronization for large-scale many-corearchitectures. The universal synchronization primitives that have been deployedwidely in conventional architectures like CAS and LL/SC are expected to reachtheir scalability limits in the evolution to many-core architectures withthousands of cores. We introduce a non-blocking full/empty bit primitive, orNB-FEB for short, as a promising synchronization primitive for parallelprogramming on may-core architectures. We show that the NB-FEB primitive isuniversal, scalable, feasible and convenient to use. NB-FEB, together withregisters, can solve the consensus problem for an arbitrary number of processes(universality). NB-FEB is combinable, namely its memory requests to the samememory location can be combined into only one memory request, whichconsequently mitigates performance degradation due to synchronization "hotspots" (scalability). Since NB-FEB is a variant of the original full/empty bitthat always returns a value instead of waiting for a conditional flag, it is asfeasible as the original full/empty bit, which has been implemented in manycomputer systems (feasibility). The original full/empty bit is well-known as aspecial-purpose primitive for fast producer-consumer synchronization and hasbeen used extensively in the specific domain of applications. In this paper, weshow that NB-FEB can be deployed easily as a general-purpose primitive. UsingNB-FEB, we construct a non-blocking software transactional memory system calledNBFEB-STM, which can be used to handle concurrent threads conveniently.NBFEB-STM is space efficient: the space complexity of each object updated by$N$ concurrent threads/transactions is $\Theta(N)$, the optimal.

NB-FEB: An Easy-to-Use and Scalable Universal Synchronization Primitive for Parallel Programming