A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributed algorithms are used in different application areas of distributed computing, such as telecommunications, scientific computing, distributed information processing, and real-time process control. Standard problems solved by distributed algorithms include leader election, consensus, distributed search, spanning tree generation, mutual exclusion, and resource allocation.[1]
Distributed algorithms are a sub-type of parallel algorithm, typically executed concurrently, with separate parts of the algorithm being run simultaneously on independent processors, and having limited information about what the other parts of the algorithm are doing. One of the major challenges in developing and implementing distributed algorithms is successfully coordinating the behavior of the independent parts of the algorithm in the face of processor failures and unreliable communications links. The choice of an appropriate distributed algorithm to solve a given problem depends on both the characteristics of the problem, and characteristics of the system the algorithm will run on such as the type and probability of processor or link failures, the kind of inter-process communication that can be performed, and the level of timing synchronization between separate processes.[1]
^ abLynch, Nancy (1996). Distributed Algorithms. San Francisco, CA: Morgan Kaufmann Publishers. ISBN 978-1-55860-348-6.
and 20 Related for: Distributed algorithm information
A distributedalgorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributedalgorithms are used...
message passing. The word distributed in terms such as "distributed system", "distributed programming", and "distributedalgorithm" originally referred to...
the distributed edge coloring problem as well. Decentralized algorithms are ones where no message passing is allowed (in contrast to distributed algorithms...
computers. An algorithm designed for such an environment is called a serial algorithm, as opposed to parallel algorithms or distributedalgorithms. Parallel...
In distributed computing, the bully algorithm is a method for dynamically electing a coordinator or leader from a group of distributed computer processes...
Many different algorithms have been designed for multiplying matrices on different types of hardware, including parallel and distributed systems, where...
In computer science, a parallel algorithm, as opposed to a traditional serial algorithm, is an algorithm which can do multiple operations in a given time...
PageRank (PR) is an algorithm used by Google Search to rank web pages in their search engine results. It is named after both the term "web page" and co-founder...
points in the plane (or space). The distributed minimum spanning tree is an extension of MST to the distributed model, where each node is considered...
in a distributed system. Often, distributed systems may have no physically synchronous global clock. In many applications (such as distributed GNU make)...
The Lamport timestamp algorithm is a simple logical clock algorithm used to determine the order of events in a distributed computer system. As different...
In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order...
detector or by a distributedalgorithm like edge chasing. Phantom deadlocks are deadlocks that are falsely detected in a distributed system due to system...
Distributedalgorithmic mechanism design (DAMD) is an extension of algorithmic mechanism design. DAMD differs from Algorithmic mechanism design since the...
A snapshot algorithm is used to create a consistent snapshot of the global state of a distributed system. Due to the lack of globally shared memory and...
The Berkeley algorithm is a method of clock synchronisation in distributed computing which assumes no machine has an accurate time source. It was developed...
A distributed ledger (also called a shared ledger or distributed ledger technology or DLT) is a system whereby replicated, shared, and synchronized digital...
The distributed minimum spanning tree (MST) problem involves the construction of a minimum spanning tree by a distributedalgorithm, in a network where...
The Chang and Roberts algorithm is a ring-based coordinator election algorithm, employed in distributed computing. The algorithm assumes that each process...
Global Information