https://dcl.epfl.ch/transactions/wiki/ 2026-04-27T20:32:06+0200 https://dcl.epfl.ch/transactions/wiki/ https://dcl.epfl.ch/transactions/wiki/lib/tpl/a_dark_divide/images/favicon.ico text/html 2010-12-10T13:07:20+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=add-ons&rev=1291982840&do=diff * The Shrink scheduler with predictions and serialization affinity. * A patch for running arbitrary level of concurrency in the STAMP benchmark suite. text/html 2010-12-10T11:20:26+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=benchmarks&rev=1291976426&do=diff * STMBench7 provides a workload that is both realistic and non-trivial to implement in a scalable way. * LeeTM offers longer, realistic workloads and is based on Lee's circuit routing algorithm. * Microbench compares the performance of lock-based, lock-free, transactions, and elastic transactions on a given suite of data structures. text/html 2010-12-10T10:40:48+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=elastic&rev=1291974048&do=diff Elastic Transactions Elastic Transactions are a complementary alternative to traditional transactions, particularly appealing when implementing search structures. Both forms of transactions can safely be combined within the same application. Elastic transactions are a variant of the transactional model. Upon conflict detection, an elastic transaction might drop what it did so far within a separate transaction that immediately commits, and initiate a new transaction which might itself be elastic… text/html 2010-12-10T10:02:53+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=events&rev=1291971773&do=diff WTTM 2010 The 2nd Workshop on the Theory of Transactional Memory is a forum to foster exchanges, discussions, and disseminations among researchers of speculative solutions for concurrent programming. The objective is to discuss new theoretical challenges and recent achievements in the context of transactional computing. text/html 2011-02-17T13:55:51+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=globulation2&rev=1297947351&do=diff STM-based Globulation2 We have parallelized Globulation 2, an open source Real-Time Strategy game: Globulation2 Globulation 2 is a “real application” that might differ in complexity and diversity from previous experiments with benchmarks like e.g. red-black trees. E.g. it uses STL (precompiled code) and has output with prints, so the whole issue of irrevocability becomes interesting. Video Games have been identified as applications that could greatly benefit from using STM with curre… text/html 2011-10-17T18:50:34+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=have_fun_in_casino&rev=1318870234&do=diff have fun in casino Recession has left a profound impact on the people of the whole wide world. There is not a single person in the world that is not affected somehow by the changes that recession has left upon us. The scars of this financially unstable era are now becoming more and more visible as we see more confusion in the eyes of the people. They have become desperate and are on the lookout for any means that can make them quick money. People do not care whether it is right or wrong. They… text/html 2010-12-10T17:53:16+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=internships&rev=1291999996&do=diff Student projects We offer master, semester and internship student projects: * Transactional File System * Irrevocable Transactions * Transactional Boosting * Transactional Visible Reads * Transactional Closed Nesting * SwissTM C# * STAMP C# * STAMP Java * Concurrent Applications using Elastic Transactions * Elasticity and Boosting * Large-Scale Distributed Transactions text/html 2010-11-10T10:57:56+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=leetm&rev=1289383076&do=diff Lee-TM Lee-TM is an STM benchmark that offers longer, realistic workloads and is based on Lee's circuit routing algorithm. The algorithm takes pairs of points (e.g. on an integraged circuit) as its input and produces a non-intersecting routes between them. We helped with development of RSTM, TL2 and TinySTM versions of Lee-TM benchmark. text/html 2010-12-10T10:57:31+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=links&rev=1291975051&do=diff * the TM Bibliography page text/html 2012-02-24T11:45:21+0200 Anonymous (anonymous@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:27:10+0200 Anonymous (anonymous@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 2012-02-24T11:46:54+0200 Anonymous (anonymous@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:56:16+0200 Anonymous (anonymous@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 2010-11-10T10:49:25+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=related_links&rev=1289382565&do=diff * the TM Bibliography page text/html 2010-11-10T11:09:25+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=scheduling&rev=1289383765&do=diff Scheduling Transactions Transactional memories are typically speculative and rely on contention managers to cure conflicts. This work explores a complementary approach that prevents conflicts by scheduling transactions according to predictions on their access sets. We developed Shrink, a scheduler that (a) bases its prediction on the access patterns of the past transactions from the same threads, and (b) uses a novel heuristic, which we call serialization affinity, to schedule transactions wi… text/html 2012-02-24T11:57:15+0200 Anonymous (anonymous@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:55:03+0200 Anonymous (anonymous@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 2011-08-15T22:41:38+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=stamp&rev=1313440898&do=diff STAMP STAMP is an STM benchmark suite that consists of several realistic workloads. We modified the original version to support SwissTM. The following files are available for download: * 2011-08-15 Older versions: * 2009-09-10 We modified the STAMP benchmarks to support an arbitrary number of concurrent threads instead of only supporting thread counts that are a power of two, as in default STAMP distribution. The following files are available for download. To use them, replace the corr… text/html 2010-11-10T11:10:23+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=stamp_thread_counts&rev=1289383823&do=diff STAMP STAMP is an STM benchmark suite that consists of several realistic workloads. We modified the original version to support SwissTM. The following files are available for download: * 2009-09-10 We modified the STAMP benchmarks to support an arbitrary number of concurrent threads instead of only supporting thread counts that are a power of two, as in default STAMP distribution. The following files are available for download. To use them, replace the corresponding files in lib directory … text/html 2010-11-10T10:51:49+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=start&rev=1289382709&do=diff Transactional Memory − A Short Introduction Transactional memory (TM) is a new computation paradigm in which processes of an application communicate using lightweight, in-memory transactions. Basically, a process that wants to access a shared data structure executes some operations on this structure inside a transaction. When the transaction commits, all these operations appear as if they took place instantaneously, at some single, unique point in time. When the transaction aborts, however, all… text/html 2015-12-17T18:02:15+0200 Anonymous (anonymous@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 2011-08-15T22:07:02+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=swisstm&rev=1313438822&do=diff SwissTM We have developed SwissTM: an STM that has the goal of performing particularly well with realistic workloads, with various transaction sizes and mixed access pattern, while still achieving good performance in more traditional microbenchmarks. text/html 2012-02-24T11:43:17+0200 Anonymous (anonymous@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 2010-12-10T13:20:54+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=transactional_memories&rev=1291983654&do=diff * SwissSTM has the goal of performing particularly well with various transaction sizes and mixed access patterns. * ε-STM provides highly concurrent elastic transactions in addition to regular transactions to achieve higher concurrency. text/html 2010-12-10T11:14:53+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=transactions_epfl&rev=1291976093&do=diff Transactional memory (TM) has been proposed as a new concurrent programming paradigm well-suited for multi-core architecture and simple to reason with. In a TM, processes of an application can communicate using lightweight, in-memory transactions. Basically, a process that wants to access a shared data structure executes some operations on this structure inside a transaction. When the transaction commits, all these operations appear as if they took place instantaneously, at some single, unique … text/html 2012-02-24T11:49:03+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=transform&rev=1330080543&do=diff TransFrom Marie-Curie ITN project text/html 2011-02-17T14:07:00+0200 Anonymous (anonymous@undisclosed.example.com) https://dcl.epfl.ch/transactions/wiki/doku.php?id=velox&rev=1297948020&do=diff An Integrated Approach to TM on Multi-/Many-core We currently participate in the VELOX European Project that aims at providing an integrated Approach to Transactional Memory on Multi- and Many-core Computers. The general objective of Velox is to build an integrated hardware/software TM stack (i) to develop new and convert existing applications into real-world TM-based applications that scale easily with the number of cores, (ii) to optimize software and hardware TM-mechanisms using real-world …