Come
hear James Frank Family Professor of Computer Science
Prasad
Jayanti talk
about his research in distributed computing today.
WHEN: Wednesday,
January 28, 6:30 PM - 7:30 PM
WHERE: Kemeny 108
THERE WILL BE PIZZA.
Analyzing Mutual Exclusion With a Game
ABSTRACT: Mutual Exclusion is an important and well known problem in distributed computing. As with most problems, the more space we use the faster we can solve this problem. Thus, we can
wonder what the tradeoff between space and time is for this problem. Our research led us to a deep connection between this question and a simple one-player game. In this talk, I will explain the mutual exclusion problem, the one player game, and the connection
between the two.