Transactional Memory (TM) is a new programming paradigm which is considered by most researchers as the future of parallel programming. Not surprisingly, a lot of work is being devoted to the implementation of TM systems, in hardware or solely in software. What might be surprising is the little effort devoted so far to devising a sound theoretical framework to reason about the TM abstraction.
In conjunction with DISC 2011, the TransForm project (Marie Curie Initial Training Network) and EuroTM (COST Action IC1001) are hosting the 3rd edition of the Workshop on the Theory of Transactional Memory (WTTM 2011). WTTM intends to foster exchanges, discussions, and disseminations among researchers who work on speculative solutions for concurrent programming. The objective is to discuss new theoretical challenges and recent achievements in the area of transactional computing.
The scope of the workshop includes, but is not limited to:
The workshop will consist of invited talks, reviewed contributions, and discussion panels. The presentations may contain results that appeared or are going to appear elsewhere, work-in-progress reports, surveys and tutorials. Student work is especially encouraged to be submitted.
A submission is expected to be a short (one-two pages) abstract of the presentation, and will be lightly reviewed for appropriateness for the workshop. Please send them by August 10 to:
petr.kuznetsov@tu-berlin.de and ravi@net.t-labs.tu-berlin.de
|
| Time | Authors | Title | Slides |
|---|---|---|---|
| 17h20-17h30 | Introduction | ||
| Semantics and synchronization techniques | |||
| 17h30-17h55 | Michael Scott | Semantics for transactional languages | |
| 17h55-18h20 | Maurice Herlihy | On the Nature of Progress | slides |
| 18h20-18h45 | Panagiota Fatourou | Highly Efficient Blocking Synchronization Techniques | |
| 18h45-19h10 | Idit Keidar | On Locality and NUMA effects in STM and other Libraries | |
| Time | Authors | Title | Slides |
|---|---|---|---|
| Models and transaction-friendly abstractions | |||
| 09h-09h25 | Nir Shavit, Alex Matveev | Towards a fully Pessimistic STM Model | |
| 09h25-09h50 | Faith Ellen | A Wait-free Transaction friendly Universal construction | |
| 09h50-10h05 | Sandeep Hans | Exploring the relations between STM and DB consistency conditions | PPT |
| 10h05-10h20 | Tyler Crain, Vincent Gramoli, Michel Raynal | A Transaction-friendly Binary Search Tree | |
| 10h20-11h | Discussion | ||
| 11h-11h30 | Coffee break | ||
| Lower bounds and nesting | |||
| 11h30-11h55 | Alessia Milani | On disjoint-access parallelism | PPT |
| 11h55-12h10 | Masoud Saeida Ardekani, Pierre Sutra, Marc Shapiro | The Impossibility of Ensuring Snapshot Isolation in Genuine Replicated STMs | |
| 12h10-12h35 | Sathya Peri | Efficient Non-blocking Conflict Notion for Nested Transactions | PPT |
| 12h35-13h | Discussion | ||
| 13h-14h | Lunch break | ||
| Scheduling, monitors and speculation | |||
| 14h-14h25 | Danny Hendler | Scheduling based Transactional Memory Contention Management | PPT |
| 14h25-14h50 | Annete Bienussa, Thomas Fuhrmann | Lifting the Barriers-Integration of Monitors into a Distributed Transactional Memory System | |
| 14h50-15h15 | Paolo Romano, Roberto Palmieri, Francesco Quaglia, Luis Rodrigues | Boosting STM Replication via Speculation | |
| 15h15-16h | Discussion | ||
| 16h-16h30 | Coffee break | ||
| Practical TM specifications and verification | |||
| 16h30-16h55 | Torvald Riegel | Draft Specification of Transactional Language Constructs for C++ | |
| 16h55-17h20 | Magel Michael | How to Support Non-blocking Transactions in Practical TM Specifications | |
| 17h20-17h45 | Victor Luchangco | Formal machine-checked verification of a real Transactional Memory algorithm | |
| 17h45-18h45 | Discussion and conclusion | ||
