https://dcl.epfl.ch/transactions/wiki/ 2026-04-27T21:45:39+0200 https://dcl.epfl.ch/transactions/wiki/ https://dcl.epfl.ch/transactions/wiki/lib/tpl/a_dark_divide/images/favicon.ico text/html 2015-12-17T18:02:15+0200 chatzopoulos (chatzopoulos@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=stmbench7&rev=1450371735&do=diff The STMBench7 Benchmark We have developed STMBench7: a benchmark for evaluating TM implementations. The benchmark aims at providing a workload that is both realistic and non-trivial to implement in a scalable way. The implementation (in Java and C++) contains a lock-based synchronization strategy that can serve as a baseline for comparison with various TMs. text/html 2015-12-17T17:59:30+0200 chatzopoulos (chatzopoulos@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?image=sb7_tt-20110815.tar.gz&ns=&rev=1450371570&tab_details=history&mediado=diff&do=media text/html 2012-02-24T11:57:15+0200 transactions (transactions@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=sidebar&rev=1330081035&do=diff * Transactional Memories * SwissTM * Elastic STM (ε-STM) * Benchmarks * Synchrobench * STMBench7 * LeeTM * Applications * Globulation2 * Add-ons * Scheduling * STAMP * Projects * VELOX * SoOS * TransForm * Student projects * Our publications * Related links text/html 2012-02-24T11:56:16+0200 transactions (transactions@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=publications&rev=1330080976&do=diff Related Papers 2012 Gramoli V., Guerraoui, R., Trigonakis, V. (2012) TM2C: a Software Transactional Memory for Many-Cores Proceedings of the seventh European Conference on Computer Systems (EuroSys). Crain T., Gramoli V., Raynal R. (2012) A Speculation-Friendly Binary Search Tree. Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP). text/html 2012-02-24T11:55:03+0200 transactions (transactions@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=soos&rev=1330080903&do=diff Service-oriented Operating Systems We have recently joined the S(o)OS project. Related Publications Gramoli V., Guerraoui, R., Trigonakis, V. (2012) TM2C: a Software Transactional Memory for Many-Cores Proceedings of the seventh European Conference on Computer Systems (EuroSys). Crain T., Gramoli V., Raynal R. (2012) text/html 2012-02-24T11:49:03+0200 transactions (transactions@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=transform&rev=1330080543&do=diff TransFrom Marie-Curie ITN project text/html 2012-02-24T11:46:54+0200 transactions (transactions@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=projects&rev=1330080414&do=diff * VELOX: An Integrated Approach to Transactional Memory on Multi- and Many-core Computers * S(o)OS: Service-oriented Operating Systems * TransForm: Theoretical Foundations of Transactional Memory text/html 2012-02-24T11:45:21+0200 transactions (transactions@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=menu&rev=1330080321&do=diff * STMBench7 * SwissTM * Elastic * Synchrobench * Projects * Publications * Events text/html 2012-02-24T11:43:17+0200 transactions (transactions@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=synchrobench&rev=1330080197&do=diff Synchrobench Synchrobench is a benchmark suite for comparing synchronization techniques. It comprises common data structures (e.g., linked list, skip list, hash table, arrays) that implement several abstractions (e.g., set, map, queue). These algorithms are implemented using fine-grained locking (spinlock, mutex), transactional memory (E-STM, TinySTM, SwissTM) or lock-free techniques (compare-and-swap). text/html 2012-02-24T11:27:10+0200 transactions (transactions@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=microbench&rev=1330079230&do=diff 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). text/html 2010-11-11T22:37:08+0200 transactions (transactions@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?image=epfl.jpg&ns=&rev=1289511428&tab_details=history&mediado=diff&do=media <img src="https://dcl.epfl.ch/transactions/wiki/lib/exe/fetch.php?w=500&h=241&t=1289511428&amp;tok=0e0ccb&amp;media=epfl.jpg" alt="epfl.jpg" /> text/html 2010-11-11T22:36:16+0200 transactions (transactions@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?image=epfl.png&ns=&rev=1289511376&tab_details=history&mediado=diff&do=media <img src="https://dcl.epfl.ch/transactions/wiki/lib/exe/fetch.php?w=500&h=242&t=1289511376&amp;tok=31fd16&amp;media=epfl.png" alt="epfl.png" />