Publication

On the Correctness of Transactional Memory

Related publications (67)

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On the Correctness of Transactional Memory

Graph Chatbot

Chat with Graph Search

Safety, Liveness and Parallelism in Concurrent Computing

Consistency Models in Distributed Systems with Physical Clocks

The PCL Theorem. Transactions cannot be Parallel, Consistent and Live.

Clock-SI: Snapshot Isolation for Partitioned Data Stores Using Loosely Synchronized Clocks

OF.CPP: Consistent Packet Processing for OpenFlow

OF.CPP: Consistent Packet Processing for OpenFlow

Collaborative Monocular SLAM with Multiple Micro Aerial Vehicles

Scalability of write-ahead logging on multicore and multisocket hardware

Concurrent Tries with Efficient Non-Blocking Snapshots

Democratizing Transactional Programming

Safety, Liveness and Parallelism in Concurrent Computing

OF.CPP: Consistent Packet Processing for OpenFlow

The PCL Theorem. Transactions cannot be Parallel, Consistent and Live.

Consistency Models in Distributed Systems with Physical Clocks

Scalability of write-ahead logging on multicore and multisocket hardware

Concurrent Tries with Efficient Non-Blocking Snapshots

OF.CPP: Consistent Packet Processing for OpenFlow

Collaborative Monocular SLAM with Multiple Micro Aerial Vehicles

Democratizing Transactional Programming

Clock-SI: Snapshot Isolation for Partitioned Data Stores Using Loosely Synchronized Clocks