WTTM 2017 - Workshop on the Theory of Transactional Memory WTTM 2017
Date2017-07-23 - 2017-07-26
Deadline2017-02-12
VenueWashington, DC, USA - United States
Keywords
Websitehttps://www.podc.org
Topics/Call fo Papers
Transactional Memory (TM) aims at making parallel programming more programmer friendly by providing an alternative synchronization mechanism to traditional lock-based concurrency. TM research has led to hardware TM implementations on both commodity and high performance computing microprocessors, as well as to TM integration in mainstream programming languages (e.g., C, C++) and leading open source compilers (e.g., GCC).
From a theoretical perspective, the TM abstraction raises several challenges in the way we view synchronization as well as in the way we implement it. A major goal of the workshop is to explore new directions and approaches for reasoning about Transactional Memory.
Topics of interest include, but are not limited to:
Models and semantics for concurrent computing
Safety and liveness properties
Tradeoffs in TM and concurrent computing
TM algorithms and architecture
Impossibility results and lower bounds
TM performance and parallelism
Speculation-friendly and transaction-friendly data structures and their algorithms
Formal methods, semantics and verification of TM and concurrent systems
TM for cluster, cloud, grid and high-performance computing
Concurrent computing, synchronization, and shared memory
Concurrent data structures and their algorithms
Multiprocessor and multi-core architectures and algorithms
From a theoretical perspective, the TM abstraction raises several challenges in the way we view synchronization as well as in the way we implement it. A major goal of the workshop is to explore new directions and approaches for reasoning about Transactional Memory.
Topics of interest include, but are not limited to:
Models and semantics for concurrent computing
Safety and liveness properties
Tradeoffs in TM and concurrent computing
TM algorithms and architecture
Impossibility results and lower bounds
TM performance and parallelism
Speculation-friendly and transaction-friendly data structures and their algorithms
Formal methods, semantics and verification of TM and concurrent systems
TM for cluster, cloud, grid and high-performance computing
Concurrent computing, synchronization, and shared memory
Concurrent data structures and their algorithms
Multiprocessor and multi-core architectures and algorithms
Other CFPs
Last modified: 2016-06-05 14:09:36