Lifting the Barriers - Reducing Latencies with Transparent Transactional Memory

Synchronization in distributed systems is expensive because, in general, threads must stall to obtain a lock or to operate on volatile data. Transactional memory, on the other hand, allows speculative execution so that it can hide the latencies that are inherent to distributed systems. In this paper, we discuss how transactional memory can carry over to code that uses Java’s synchronization means i. e. monitors and volatiles. We show that we can guarantee correct execution according to the Java memory model (JMM) without having to stall at synchronization points. To this end, we use a multi-version software transactional memory system that executes JMM synchronization operations asynchronously. If any such execution has violated the JMM, the transaction rolls back. As a result, only blocking operations require immediate synchronization barriers.

• Type: Journal
• Year: 2012
• Where: ICDCN
• Authors: Annette Bieniusa, Thomas Fuhrmann
• Keywords: Correct Execution, Distributed And Parallel Computing, ICDCN 2012, Java Memory Model, Speculative Execution