Section outline

  • This week we shall address the topic (#18) of how can distributed agents synchronize their work without resorting to shared memory and global clock. This subject matter is so important to this lecture series that its discussion will span two consecutive lectures.

    Once again, the lecture material includes a demo program, written in Ada, to illustrate a concrete application of a state-of-the-art algorithm for distributed synchronization. The students are invited to study that program for logic and execution, and to reproduce its functional behaviour in a programming language of their choice.