Circular relaxed concurrent priority queue (CPQ) represents by a set of traditional priority queues connected into one circular linked list. The main idea is close to multiqueues. The priority queue consists of several traditional priority queues with fine-grained locks. For write operation thread-locks only one priority queue. Each thread can perform read operation on any structure. It allows to threads select suitable structure and prepare their operation for faster execution.

The scheme of CPQ is present on Figure:

Related Article:

https://github.com/Komdosh/Publications/blob/master/2020/Computers-orig.pdf