We present a silent self-stabilizing minimal k-grouping algorithm for an arbitrary network where the processes have unique ID's. We present a new technique to compose self-stabilizing algorithms, called loop composition. We use this technique to design a silent self-stabilizing minimal k-grouping algorithm for an arbitrary network where the processes have unique ID's.
After the talk from 12 to 1 pm, the speaker will discuss about the opportunities for prospective graduate studies at Computer Science Department in University of Nevada Las Vegas. All interested are welcome to attend the talk.
Ajoy K Datta is a professor at the Department of Computer Science at the University of Nevada Las Vegas. He was on the faculty at the Ohio State University and the Arizona State University before joining UNLV. Ajoy held visiting professorship positions in numerous universities in France and Japan. His research interests are in Distributed Computing and Fault-Tolerant Systems.