Infoscience

Similar records
Presentation / Talk

Composition vs Concurrency

Gramoli, Vincent; Guerraoui, Rachid; Letia, Mihai
  • Presented at: 2nd Workshop on the Theory of Transactional Memory, Cambridge, Massachusetts, USA, September 16, 2010
  • Publication date: 2010

Composing software is notoriously difficult, especially when it is concurrent. Two fine-grained locked operations may for instance easily deadlock upon composition. One of the most appealing features of transactions is, on the other hand, that they compose. Indeed they do so, but only in their original, orthodox, form. As we discuss in the paper, as soon as we slightly relax the model to enable more concurrency, we incur the risk of breaking encapsulation.

Keywords: transactional memory ; relaxed transactional model

Reference

  • EPFL-TALK-150438

Record created on 2010-08-17, modified on 2012-03-21

Fulltext

Contacts

EPFL authors