Concurrent Linked List

Summary

Implemented a concurrent linked list that supports search, insert and delete operations by using the following three approaches:
1. coarse-grained locking with search operation oblivious to locks
2. fine-grained locking using lazy synchronization
3. lock-free synchronization
Implemented a common test facility that could generate operations with different distribution and test linked lists by different degree of concurrency (number of threads concurrently operating on a linked list) according to the requirements of testing throughput
Compared the averaged performance of the three implementations as a function of number of threads (varied from one to the number of logical cores in the machine) under different distribution of operations

Name		Name	Last commit message	Last commit date
Latest commit History 20 Commits
report		report
src		src
.gitignore		.gitignore
LICENSE		LICENSE
README.md		README.md
build_run_on_csgrads1.sh		build_run_on_csgrads1.sh
build_run_on_tacc.sh		build_run_on_tacc.sh
readme.txt		readme.txt
release.sh		release.sh
tacc_batch.sh		tacc_batch.sh