Composition vs Concurrency

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.


Presented at:
2nd Workshop on the Theory of Transactional Memory, Cambridge, Massachusetts, USA, September 16, 2010
Year:
2010
Keywords:
Laboratories:




 Record created 2010-08-17, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)