University of Cambridge > > Wednesday Seminars - Department of Computer Science and Technology  > Serializability Enforcement for Concurrent ML

Serializability Enforcement for Concurrent ML

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mateja Jamnik.

There has been much recent interest in exploring higher-level concurrency control abstractions such as software transactional memory (STM) to alleviate the complexity of reasoning about interactions among concurrent threads of control. Isolation and atomicity are the two critical properties provided by an STM that guarantee serializability of concurrent actions. Isolation ensures that transactions execute without interference from effects performed by other transactions, and atomicity guarantees that intermediate effects performed by a transaction are not seen by other concurrently executing transactions.

While STM has been mostly studied in the context of shared-memory concurrency, the atomicity and isolation properties it provides can benefit message-passing systems as well. In this talk, we explore the integration of these features into Concurrent ML, a dialect of ML that supports first-class synchronous message-based communication events. Central to our design is the introduction of an isolate, a combinator that ensures its argument events, which may be arbitrarily complex, execute concurrently with strong isolation guarantees. In conjunction with an orthogonal combinator that provides atomicity, we achieve a programming model that fully integrates transactional support into a CML -style concurrency model, resulting in improved expressivity and safety. We also present an overview of an implementation in MLton, a whole-program optimizing compiler for ML.

This talk is part of the Wednesday Seminars - Department of Computer Science and Technology series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity