| 講演者(Presenter)：
| Ajoy K. Datta (University of Nevada, Las Vegas)
|
| 題目(Title)：
| Self-Stabilizing Leader Election in Arbitrary Networks
|
| 概要(Abstract)： |
A silent self-stabilizing asynchronous distributed algorithm, SSLE, is given for the leader election problem in a connected unoriented (bidirectional) network with unique IDs. SSLE also constructs a BFS tree on the network rooted at that leader. SSLE uses O(log n) space per process and stabilizes in O(n) rounds, against the unfair daemon, where n is the number of processes in the network. |
| 講演言語(Language)： |
English |
| 講演者略歴(Biography)： |
Ajoy K. Datta is a professor of Computer Science at the University of Nevada, Las Vegas. He received his Ph.D. in C.S. from Jadavpur University, Calcutta, India in 1983. His research interest is in fault-tolerant distributed
computing.
| |
|