kvmmiss.blogg.se - Distributed algorithms by nancy lynch

Distributed Algorithms, by Nancy Lynch.Distributed Computing: a Locality-Sensitive Approach, by David Peleg.Application Specific Problems: Storage and retrieval of data in peer-to-peer computing, coverage and routing in sensor networks, and rumour spreading in social networking.Fundamental Problems on Distributed Networks: Maximal independent set, minimum spanning tree, vertex colouring, dominating set, routing algorithms, leader election, Byzantine agreement, synchronizers, graph spanners, dynamic networks.

Complexity measures like time, space, and message complexity.

Models for Distributed Computer Networks: Message passing and shared memory models, synchronous and asynchronous timing models, failure models.

Review of Prerequisite Topics: Graph theory, probability theory covering Markov's inequality, Chebyshev's inequality, Chernoff bounds, Markov chains and random walks.Center for Computational Brain Research (CCBR).Robert Bosch Centre for Data Science and Artificial Intelligence.