I'm writing a Lock-Free C library, and I'm going to implement a priority queue. However, the goal of my library is not completeness of the data structures, I just want to implement some typical ones and then write a mirco-benchmark to show that the lock-free ones perform better under some special cases than the lock-based ones. So I want to know if there're some typical applications that the priority queue plays an important roles. (open-source projects are the best.) Then I can use them as a benchmark.
A few to be listed:
1. Dijkstra’s Shortest Path Algorithm
2. Prim’s algorithm
3. Huffman codes for Data compression.
4. Heap sort
5. Load balancing on servers.
There are various applocation being pointed out in :
https://www.cdn.geeksforgeeks.org/applications-priority-queue/
Also, the wiki itself has an extensive list of application and parameters against which you can benchmark your comparision(refer section Summary of running times): https://en.wikipedia.org/wiki/Priority_queue