Ph.D. Computer Science & Engineering, Ohio State University, 2004
M.S. Computer & Information Science, Ohio State University, 2000
B.A. Philosophy, Yale University, 1996
My research investigates theoretical and practical techniques for isolating partial failures within small, local neighborhoods of impact in distributed systems. A representative sample of the kind of work I do can be found here. My previous work addresses a variety of intersecting topics in software engineering, distributed systems, and programming languages.
New: Eventually k-Bounded Wait-Free Distributed Daemons. This paper demonstrates the sufficiency of the eventually-perfect failure detector for wait-free and eventually fair scheduling in environments subject to process crashes. A companion paper demonstrates the necessity of this failure detector, in the sense that wait-free, eventually fair scheduling is impossible using any weaker oracle for crash-fault detection. As such, our results present an optimal oracle for wait-free, eventually fair scheduling.