First, we present the Input Acceptance of STMs as their ability to commit transactions. Interestingly, existing STMs delay or abort a transaction as soon as it presents a risk to violate consistency. Both alternatives are costly and should be avoided if consistency is actually preserved. We upper-bound the input acceptance of six existing STMs and propose, SSTM, a new serializable STM with higher input acceptance. Second, we present elastic transactions a variant of the transactional model that improves concurrency. 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. Our experiments on four common micro-benchmarks indicate that elastic transactions are particularly efficient when implementing search structures.

Biography: Vincent Gramoli is a postdoc at EPFL in the LPD laboratory, and at University of Neuchâtel, in Switzerland. His research interests span areas of distributed algorithms and distributed systems. He graduated from Université Paris 7 and Université Paris 11 before obtaining his PhD from Université Rennes 1 on the topic of large-scale dynamic systems. Prior to joining EPFL and UniNE, he has been affiliated with University of Connecticut, IRISA, INRIA Saclay, and Cornell University. His recent research achievements are related to Software Transactional Memory.