All Concurrency and Distributed Systems Techniques

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

Peterson's algorithm (or Peterson's solution) is a concurrent programming algorithm for mutual exclusion

Operational transformation (OT) is a technology for supporting a range of collaboration functionalities in advanced collaborative software systems.

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 bakery algorithm is one of many mutual exclusion algorithms designed to prevent concurrent threads entering critical sections of code concurrently

ring-based coordinator election algorithm, employed in distributed computing

Raft is a consensus algorithm designed as an alternative to the Paxos family of algorithms.

Dekker's algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming where processes only communicate via shared memory.

The Dijkstra-Scholten algorithm (named after Edsger W. Dijkstra and Carel S. Scholten) is an algorithm for detecting termination in a distributed system.

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

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

resource allocation and deadlock avoidance algorithm

The Eisenberg & McGuire algorithm is an algorithm for solving the critical sections problem, a general version of the dining philosophers problem.

is an agreement algorithm used to select sources for estimating accurate time from a number of noisy time sources.

The intersection algorithm is an agreement algorithm used to select sources for estimating accurate time from a number of noisy time sources.

The Ricart-Agrawala algorithm is an algorithm for mutual exclusion on a distributed system.

In computer science, a lock or mutex (from mutual exclusion) is a synchronization primitive that prevents state from being modified or accessed by multiple threads of execution at once.

In computer science, a semaphore is a synchronization device used to control access to a common resource by multiple threads or processes in a concurrent system, such as a multitasking operating system.

A vector clock is a data structure used for determining the partial ordering of events in a distributed system and detecting causality violations.

A database shard, or simply a shard, is a horizontal partition of data within a database or search engine.

In computing, load balancing is the process of distributing a set of tasks over a set of resources (computing units) with the aim of making their overall processing more efficient.

In distributed computing, leader election is the process of designating a single process as the organizer of some task distributed among several computers (nodes).

A gossip protocol or epidemic protocol is a procedure or process of computer peer-to-peer communication that is based on the way epidemics spread.