Back-to-Basics Weekend Reading - Survey of Local Algorithms
All Things Distributed
MAY 29, 2015
As we know the run time of most algorithms increases when the input set increases in size. There is one noticeable exception: there is a class of distributed algorithms, dubbed local algorithms, that run in constant time, independently of the size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the operation of large-scale distributed systems.
Let's personalize your content