University of Cambridge > > Microsoft Research Cambridge, public talks > Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures

Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

In this talk, I will first present “asynchronized concurrency (ASCY),” a paradigm consisting of four complementary programming patterns. ASCY calls for the design of concurrent search data structures to resemble that of their sequential counterparts. I will show how ASCY leads to implementations which are portably scalable: they scale across different types of hardware platforms, including single and multi-socket ones, for various classes of workloads, and according to different performance metrics, including throughput, latency, and energy.

I will then introduce our ongoing work on OPTIK , a concurrency framework that facilitates the design and implementation of ASCY -compliant data structures. OPTIK relies on the well-explored ideas of versioning and validation: a thread acquires a version number, optimistically accesses the data structure, and then locks and validates the version to detect concurrency. I will show how OPTIK can be used to easily make lock-based data structures more optimistic and more scalable.

(Asynchronized concurrency appeared in ASPLOS ‘15)

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity