A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributed algorithms are used...

message passing. The word distributed in terms such as "distributed system", "distributed programming", and "distributed algorithm" originally referred to...

iterations Gale–Shapley algorithm: solves the stable matching problem Pseudorandom number generators (uniformly distributed—see also List of pseudorandom...

In distributed computing, the bully algorithm is a method for dynamically electing a coordinator or leader from a group of distributed computer processes...

the distributed edge coloring problem as well. Decentralized algorithms are ones where no message passing is allowed (in contrast to distributed algorithms...

machine replication is a technique for converting an algorithm into a fault-tolerant, distributed implementation. Ad-hoc techniques may leave important...

In mathematics and computer science, an algorithm (/ˈælɡərɪðəm/ ) is a finite sequence of mathematically rigorous instructions, typically used to solve...

must distributedly choose values for a set of variables such that the cost of a set of constraints over the variables is minimized. Distributed Constraint...

Raft is a consensus algorithm designed as an alternative to the Paxos family of algorithms. It was meant to be more understandable than Paxos by means...

computing Machinery) Dijkstra Prize in Distributed Computing given at the annual ACM-PODC symposium. A distributed algorithm is self-stabilizing if, starting...

The Chandy–Lamport algorithm is a snapshot algorithm that is used in distributed systems for recording a consistent global state of an asynchronous system...

Lamport's Distributed Mutual Exclusion Algorithm is a contention-based algorithm for mutual exclusion on a distributed system. Every process maintains...

in a distributed system. Often, distributed systems may have no physically synchronous global clock. In many applications (such as distributed GNU make)...

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...

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...

Distributed algorithmic mechanism design (DAMD) is an extension of algorithmic mechanism design. DAMD differs from Algorithmic mechanism design since the...

In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a...

Many different algorithms have been designed for multiplying matrices on different types of hardware, including parallel and distributed systems, where...

The Lamport timestamp algorithm is a simple logical clock algorithm used to determine the order of events in a distributed computer system. As different...

or editing device Synchronizer (algorithm), an algorithm that can be applied to a synchronous distributed algorithm to produce a version that operates...

In computer networking and distributed databases, the three-phase commit protocol (3PC) is a distributed algorithm that ensures all nodes in a system...

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...

The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph...

The distributed minimum spanning tree (MST) problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network where...

commitment protocol (ACP). It is a distributed algorithm that coordinates all the processes that participate in a distributed atomic transaction on whether...

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...

The Chang and Roberts algorithm is a ring-based coordinator election algorithm, employed in distributed computing. The algorithm assumes that each process...

Rocha–Thatte algorithm is a distributed algorithm in graph theory for detecting cycles on large-scale directed graphs based on the bulk synchronous message...

detector or by a distributed algorithm like edge chasing. Phantom deadlocks are deadlocks that are falsely detected in a distributed system due to system...

Cristian's algorithm (introduced by Flaviu Cristian in 1989) is a method for clock synchronization which can be used in many fields of distributive computer...