Person
Michal Kapalka
This person is no longer with EPFL
Related publications (25)
On the liveness of transactional memory
Rachid Guerraoui, Michal Kapalka, Victor Bushkov
Despite the large amount of work on Transactional Memory (TM), little is known about how much liveness it could provide. This paper presents the first formal treatment of the question. We prove that no TM implementation can ensure local progress, the analo ...
ACM Press2012On the Liveness of Transactional Memory
Rachid Guerraoui, Michal Kapalka, Victor Bushkov
Despite the large amount of work on Transactional Memory (TM), little is known about how much liveness it could provide. This paper presents the first formal treatment of the question. We prove that no TM implementation can ensure local progress, the analo ...
2011Leveraging Parallel Nesting in Transactional Memory
Rachid Guerraoui, Michal Kapalka, Aleksandar Dragojevic
Exploiting the emerging reality of affordable multi-core architectures goes through providing programmers with simple abstractions that would enable them to easily turn their sequential programs into concurrent ones that expose as much parallelism as possi ...
ACM2010Theory of Transactional Memory
Transactional memory (TM) is a promising paradigm for concurrent programming, in which threads of an application communicate, and synchronize their actions, via inmemory transactions. Each transaction can perform any number of operations on shared data, an ...
EPFL2010The VELOX Transactional Memory Stack
Rachid Guerraoui, Vincent Gramoli, Michal Kapalka, Aleksandar Dragojevic, Pascal Felber
The adoption of multi- and many-core architectures for mainstream computing undoubtedly brings profound changes in the way software is developed. In particular, the use of fine grained locking as the multi-core programmer’s coordination methodology is cons ...
Institute of Electrical and Electronics Engineers2010Transactions in the Jungle
Rachid Guerraoui, Michal Kapalka, Vasu Singh
Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of TM executions have been proposed. Many of these definitions assumed that acce ...
Acm Order Department2010The Semantics of Progress in Lock-Based Transactional Memory
Rachid Guerraoui, Michal Kapalka
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to precisely define TM semantics, especially their progress guarantees. This pape ...
ACM2009Transactional Memory: Glimmer of a Theory
Rachid Guerraoui, Michal Kapalka
Transactional memory (TM) is a promising paradigm for concurrent programming. This paper is an overview of our recent theoretical work on defining a theory of TM. We first recall some TM correctness properties and then overview results on the inherent powe ...
ACM2009The Theory of Transactional Memory
Rachid Guerraoui, Michal Kapalka
Transactional memory (TM) is a promising paradigm for concurrent programming. This paper is an overview of our recent work on defining a theory of TM. We first present a correctness condition of a TM, ensured by most existing TM implementations. Then, we d ...
2009How Live Can a Transactional Memory Be?
Rachid Guerraoui, Michal Kapalka
This paper asks how much liveness a transactional memory (TM) implementation can guarantee. We first devise a formal framework for reasoning about liveness properties of TMs. Then, we prove that the strongest liveness property that a TM can ensure in an as ...
2009