Algorithms for Practical Distributed Agreement

Speaker: Naama Ben-David , VMware Research

Date: Wednesday, November 17, 2021

Time: 4:00 PM to 5:00 PM Note: all times are in the Eastern Time Zone

Public: Yes


Event Type: Seminar

Room Description:

Host: Julian Shun, MIT CSAIL

Contact: Linda Lynch, 715-2459,

Relevant URL:

Speaker URL:

Speaker Photo:

Reminders to:,,,,

Reminder Subject: TALK: Algorithms for Practical Distributed Agreement

******************IMPORTANT NOTE ABOUT REGISTRATION******************
- The registration link for Fall 2021 is different than from the link from previous terms, so you will need to register again.
- Please save the Zoom link that you receive after you register. This link will stay the same for all subsequent Fast Code seminars.
- Zoom does not recognize a second registration, and will not send out the link a second time. The organizers will not be notified of any second registration.
- If you have any problems with registration, please contact by 3:30pm on the day of the seminar, so that we can try to resolve it before the seminar begins.

Agreement algorithms form the underpinning of many reliable services; they provide consistent state among several machines despite asynchrony, crash failures, and malicious attacks. In this talk, I will argue that it is important to design agreement algorithms to optimize for both best-case and worst-case performance. I’ll discuss a theoretical model that captures the behavior and costs of data-center networks on which agreement algorithms are often run, and will show recent results that provably improve the running time of agreement algorithms in both best- and worst-case executions. Additionally, I will discuss a system that was built based on these theoretical insights and achieves improved performance in both the best and the worst case.

Naama Ben-David is a postdoctoral researcher at VMware. She completed her PhD at Carnegie Mellon University, where her dissertation received an honorable mention for the CMU SCS Dissertation Award. Her primary research interests are in the intersection of theory and practice in distributed computing. More specifically, Naama strives to theoretically explain phenomena seen in modern machines, and to use obtained insights to design and analyze practical algorithms for concurrent settings. Naama is the recipient of an NSERC postgraduate scholarship and a Microsoft Research PhD Fellowship.

Research Areas:
Algorithms & Theory, Programming Languages & Software, Systems & Networking

Impact Areas:

This event is not part of a series.

Created by Julian J. Shun Email at Tuesday, November 09, 2021 at 8:37 PM.