skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.

A faster RWLock primitive in Go, 2-3 times faster than RWMutex. A Go implementation of concurrency control algorithm in paper <Left-Right - A Concurrency Control Technique with Wait-Free Population Oblivious Reads>

Generic concurrent lock-free map for Golang

Ordered-concurrently a library for concurrent processing with ordered output in Go. Process work concurrently and returns output in a channel in the order of input. It is useful in concurrently processing items in a queue, and get output in the order provided by the queue.

🦄 LRU cache for Go @bilibili. (beats 100% submissions @ leetcode)

A light, high-performance, concurrent, thread-safe skip list implementation written in Golang.

Go Stale While Asynchronously Revalidate Memoization

An approach of Golang's Pipelines

Provides several non-blocking B+Tree data structures

In-memory immutable wait-free consistent hashing ring data structure, supporting virtual nodes & replication.

go-future provide function Go and return a result of an asynchronous computation. Methods Wait are provided to retrieve the result of the computation.

Generic optimistic concurrent container for Go

Abstract channel type

GolangDS: Data structures on Golang

Multi-producer multi-consumer queue implemented using circular buffers

Concurrent data structures.

Various implementations of linked list based set

Go safe counter is a counter which can be used by multiple go routines at same time

Set Data Structure