This is an old revision of the document!


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.

microbench.1321011043.txt.gz · Last modified: 2011/11/11 12:30 by transactions
Trace: microbench Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0