PACM Colloquium: Concurrent Disjoint Set Union

Speaker: 
Robert Tarjan, Princeton University
Date: 
Nov 28 2016 - 4:00pm
Event type: 
PACM Colloquium
Room: 
214 Fine Hall
Abstract: 

The disjoint set union problem is a classical problem in data structures with a simple and efficient sequential solution that has a notoriously complicated analysis.  One application is to find strongly connected components in huge, implicitly defined graphs arising in model checking.  In this application, the use of multiprocessors has the potential to produce significant speedups.  We explore this possibility.  We devise and analyze concurrent versions of standard sequential algorithms that use single and double compare-and-swap primitives for synchronization, making them wait-free.  We obtain work bounds that grow logarithmically with the number of processors, suggesting the possibility of significant speedup in practice. 

This is ongoing joint work with Siddhartha Jayanti, an undergraduate at Princeton.

Since 1985, Robert E. Tarjan has been the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University.  He previously held academic positions at Cornell, Berkeley, Stanford, and NYU, and industrial research positions at Bell Labs, NEC, Intertrust Technologies, HP, and Microsoft.  Among other honors, he received the Nevanlina Prize in Informatics, given by the International Mathematical Union, in 1982, and the A.C.M. Turing Award in 1986.  He is a member of the National Academy of Sciences and the National Academy of Engineering, and a Fellow of the American Philosophical Society and the American Academy of Arts and Sciences.  He has published over 250 papers, mostly in the areas of the design and analysis of data structures and graph and network algorithms.