Publication

How Live Can a Transactional Memory Be?

Publications associées (45)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Toward a Materials Genome Approach for Ionic Liquids: Synthesis Guided by Ab Initio Property Maps

Berend Smit

The Materials Genome Approach (MGA) aims to accelerate development of new materials by incorporating computational and data-driven approaches to reduce the cost of identification of optimal structures for a given application. Here, we use the MGA to guide ...

Amer Chemical Soc2014

Speculative Linearizability

Rachid Guerraoui, Viktor Kuncak, Giuliano Losa

Linearizability is a key design methodology for reasoning about implementations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusion that operations execute sequentially and fault-free, despite the a ...

Assoc Computing Machinery2012

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 Press2012

Speculative Linearizability

Rachid Guerraoui, Viktor Kuncak, Giuliano Losa

2011

Decision Procedures for Automating Termination Proofs

Ruzica Piskac

Automated termination provers often use the following schema to prove that a program terminates: construct a relational abstraction of the program's transition relation and then show that the relational abstraction is well-founded. The focus of current too ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

On the Liveness of Transactional Memory

Rachid Guerraoui, Michal Kapalka, Victor Bushkov

2011

Theory of Transactional Memory

Michal Kapalka

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 ...

EPFL2010

In defense of large qualitative calculi

Jingshi Li

The next challenge in qualitative spatial and temporal reasoning is to develop calculi that deal with different aspects of space and time. One approach to achieve this is to combine existing calculi that cover the different aspects. This, however, can lead ...

2010

Data-driven tuning of linear parameter varying precompensators

Alireza Karimi, Mark Edward John Butcher

Methods for direct data-driven tuning of the parameters of precompensators for LPV systems are developed. Since the commutativity property is not always satisfied for LPV systems, previously proposed methods for LTI systems that use this property cannot be ...

Wiley-Blackwell2010

The 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 ...

ACM2009