This is an old revision of the document!
Microbench
Microbench aims at comparing STM performance against performance of lock-based and lock-free alternatives. It comprises common data structures: linked list, skip list, hashtable…
- It provides lock-free algorithms (e.g., harris-michael, fraser's lock-free skip-list).
- It also features fine-grained locking algorithms (e.g., lazy linked list, optimistic skip list).
- Finally, the TM benchmarks derive from the STM-based linked list test of TinySTM and it includes the SUN STM-based red-black tree benchmark.
The current version can be downloaded here.