What is it all about?
Lock-free data structures are process, thread and interrupt safe, never sleep, operate without context switches, cannot fail (no need to handle error cases, as there are none), perform and scale literally orders of magnitude better than locking data structures, and liblfds itself (as of release 7.0.0) is implemented such that it performs no allocations and compiles not just on a freestanding C89 implementation, but on a bare C89 implementation.
Key Features
The following data structures are as of the latest release (7.1.0) provided (but note support varies by processor, as atomic support varies by processor); * Binary Tree (add-only, unbalanced) * Freelist * Hash (add-only) * List (add-only, ordered, singly-linked) * List (add-only, singly-linked, unordered) * PRNG * Queue (bounded, many-producer, many-consumer) * Queue (bounded, single-producer, single-consumer) * Queue (unbounded, many-producer, many-consumer) * Ringbuffer * Stack
Pricing
Yearly
Monthly
Lifetime
Free
Freemium
Trial With Card
Trial No Card
By Quote
Description
free
){kind=logo}
){kind=logo}
){kind=logo}
){kind=logo}
){kind=logo}
){kind=logo}
Top DiscoverSDK Experts
Gilad Levi
Software developer and Cyber security expert
Networking | Security and 13 more
View Profile
Interested in becoming a DiscoverSDK Expert? Learn more
X
Compare Products
Select up to three two products to compare by clicking on the compare icon () of each product.
{{compareToolModel.Error}}Now comparing:
{{product.ProductName | createSubstring:25}} X