Script

• run_ll.sh,create_plots_ll.sh : Get linked list throughput and scability , then plot it
• run_ll2.sh,create_plots_ll2.sh : Get linked list throughput and scability with glibc memory allocaotr and my memory allocator repectively , then plot it to compare them

Note

1. Change HP_MAX_THREADS in include/hp.h if number of thread more than default(30)
2. Operate linked list with insert and delete or push and pop , don't mix them , it can modified from test function in src/main.c
3. insert and delete don't support memory reclamation
4. use -DMY_MALLOC to use my memory allocator
5. Eliminate factors that interfere with performance analysis via shell.sh
6. Lock-Free Linked List with Lockless Memory Allocation

Reference

Non-blocking singly-linked list originally implemented from gist

Lock-free linkedlist implementation based on Lock-Free Linked Lists and Skip Lists

Test program modified from concurrent-ll

Hazard Pointer modified from hp_list

linux2022-quiz11

linux2022-quiz13