Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
microbench [2010/12/10 10:20] transactions |
microbench [2012/02/24 11:27] transactions [Synchrobench] |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | Microbench | ||
| - | |||
| - | Microbench is a micro-benchmark suite to compare STMs with existing lock-free and lock-based counterparts. The current version includes three kinds of integer set implementations: linked list, skip list and hash table. | ||
| - | |||
| - | Microbench includes the implementation of several algorithms: | ||
| - | |||
| - | |||
| - | Harris T. (2001) | ||
| - | Lock-free Linked List: A Pragmatic Implementation of Non-Blocking Linked Lists. | ||
| - | //Proc. of the 15th Int'l Symposium on Distributed Computing (DISC).// p.300-314. | ||
| - | |||
| - | Heller S., Herlihy M., Luchangco V., Moir M., Scherer III, W., Shavit N. (2005) | ||
| - | Lock-based Linked List: A Lazy Concurrent List-Based Set Algorithm. | ||
| - | //Proc. of the 9th Int'l Conf. on Principles of Dist. Systems (OPODIS).// p.3-16. | ||
| - | |||
| - | K. Fraser (2003) | ||
| - | Lock-based Linked List: A Lazy Concurrent List-Based Set Algorithm. | ||
| - | //Cambridge University Technical Report UCAM-CL-TR-579.// p.3-16. | ||
| - | |||
| - | Herlihy M., Lev Y., Luchangco V., Shavit N. (2007) | ||
| - | Lock-based Linked List: A Lazy Concurrent List-Based Set Algorithm. | ||
| - | //Colloquim on Structural Information and Communication Complexity (SIROCCO).// p.124-138. | ||
| - | |||
| - | |||
| - | Microbench can be used with TinySTM, SwissTM and ε-STM. | ||
| ===== Microbench ===== | ===== Microbench ===== | ||
| - | Microbench aims at comparing STM performance against performance of lock-based and lock-free alternatives. | + | 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 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 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). | * 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 [[http://www.tmware.org/tinystm|TinySTM]] and it includes the SUN STM-based red-black tree benchmark. | * Finally, the TM benchmarks derive from the STM-based linked list test of [[http://www.tmware.org/tinystm|TinySTM]] and it includes the SUN STM-based red-black tree benchmark. | ||
| - | The current version can be downloaded [[http://lpd.epfl.ch/gramoli/php/estm.php|here]]. | + | The current version can be downloaded [[http://lpd.epfl.ch/gramoli/php/microbench.php|here]]. |
| + | |||
| + | ==== Related Publications ==== | ||
| + | |||
| + | Crain T., Gramoli, V., Raynal, M. (2009) | ||
| + | [[http://lpd.epfl.ch/gramoli/php/pub_irisa_type.php?ref=CGR12#CGR12|A Speculation-Friendly Binary Search Tree.]] | ||
| + | //Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP).// | ||
| + | |||
| + | Dragojevic A., Felber P., Gramoli V., Guerraoui R. (2011) | ||
| + | [[http://infoscience.epfl.ch/record/144052|Why STM can be more than a Research Toy.]] | ||
| + | //Communications of the ACM (CACM).// | ||
