Skip to main navigation Skip to search Skip to main content

Keynote Talk: Highly Asynchronous Concurrency in Data Structures

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This talk will explore whether and by how much operations on data structures can be sped up by using multiple highly unsynchronized threads. Taking advantage of concurrency in this setting is a challenge. The talk will describe work by Siddhartha Jayanti and the speaker on the efficiency of concurrent disjoint set union algorithms, including recent unpublished work that uses new ideas to eliminate the need for randomization. It will also discuss ongoing work with Laxman Dhulipala, Jakub Łȩcki, and Siddhartha Jayanti on finding maximal matchings, as well as the general question of what we should require in a realistic but theoretically tractable model of highly asynchronous concurrency.

Original languageEnglish (US)
Title of host publicationPODC 2026 - Proceedings of the 2026 ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages4
Number of pages1
ISBN (Electronic)9798400725128
DOIs
StatePublished - Jul 1 2026
Event45th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2026 - Egham, United Kingdom
Duration: Jul 6 2026 → Jul 10 2026

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference45th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2026
Country/TerritoryUnited Kingdom
CityEgham
Period7/6/26 → 7/10/26

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Keywords

  • asynchronous algorithms
  • concurrent data structures
  • disjoint set union
  • maximal matching
  • theory of distributed computing

Fingerprint

Dive into the research topics of 'Keynote Talk: Highly Asynchronous Concurrency in Data Structures'. Together they form a unique fingerprint.

Cite this