Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
microbench [2010/11/10 11:34] transactions |
microbench [2010/12/10 10:20] transactions |
||
|---|---|---|---|
| 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 ===== | ||
