Concurrent Data Representation Synthesis

150 views · Published 12 August 2016 · 58:33 · Indexed 27 October 2026

Channel: Microsoft Research · 2016 · Science & Technology

Watch on YouTube

We describe an approach for synthesizing data representations  for concurrent programs. Our compiler takes as input a program  written using concurrent relations and synthesizes a representation  of the relations as sets of cooperating data structures as well as the  placement and acquisition of locks to synchronize concurrent access  to those data structures. The resulting code is correct by construction:  individual relational operations are implemented correctly and the  aggregate set of operations is serializable and deadlock free. The  relational specification also permits a high-level optimizer to choose  the best performing of many possible legal data representations  and locking strategies, which we demonstrate with an experiment  autotuning a graph benchmark.    This is a joint work with Peter Hawkins (Google),  Alex Aiken  (Stanford), Kathleen Fisher (Tufts University) and Martin Rinard  (MIT).

More from this channel