A renewed focus on the *structure* of concurrent data structures

Abstract #

It is common for concurrent data structure designers to treat the limitations of their chosen synchronization mechanism as the most important design characteristic. This can overly constrain programmers, especially if too much emphasis is placed on employing a single linearizing compare-and-swap.

In this talk, I will discuss recent innovations in synchronization, and then argue that they enable programmers to place their focus back where it belongs: on the structure of concurrent data structures. I will describe exoTM, one (of many!) recent synchronization frameworks that blurs the line between transactional memory and multi-word compare-and-swap (MCAS). ExoTM lets programmers think of synchronization in terms of coarse-grained transactions, while retaining the ability for low-level optimization. I will then describe the Skip Hash, a shockingly simple and easy-to-verify concurrent ordered map that uses exoTM's composability and novel atomicity features to reduce many operations' complexity to O(1).

Bio #

Michael Spear is an associate professor in the Computer Science and Engineering Department at Lehigh University. He received a BS from the United States Military Academy and a PhD from the University of Rochester. His research focuses on issues related to scalability and programmability for shared and distributed memory systems.