Non-explicit Information Exchange in Distributed Computing

Distributed systems become more and more ubiquitous. These systems entail different instances of distributed computing problems, each with unique characteristics. In this talk, I will discuss my Ph.D. research on theoretical and algorithmic aspects of distributed computing. Specifically, I will focus on two works that represent different aspects of my research on non-explicit information exchange in distributed systems. I will start with a fundamental work on concepts of information transfer in a distributed fault-prone environment and present tight bounds for the Atomic Commit problem by using the concept of a silent choir. Then, I will discuss my work on load balancing in the parallel server model with multiple dispatchers and present new solutions. These solutions are designed from a distributed computing perspective without explicit communication and instead, they utilize stochastic coordination.

*PhD student under the supervision of Prof. Yoram Moses.