Editing List of algorithms (section)

==Distributed systems algorithms==
{{further|Distributed algorithm|Distributed systems}}
* [[Clock synchronization]]
** [[Berkeley algorithm]]
** [[Cristian's algorithm]]
** [[Intersection algorithm]]
** [[Marzullo's algorithm]]
* [[Consensus (computer science)]]: agreeing on a single value or history among unreliable processors
** [[Chandra–Toueg consensus algorithm]]
** [[Paxos algorithm]]
** [[Raft (computer science)]]
* Detection of Process Termination
** [[Dijkstra-Scholten algorithm]]
** [[Huang's algorithm]]
* [[Lamport ordering]]: a [[partial order]]ing of events based on the ''happened-before'' relation
* [[Leader election]]: a method for dynamically selecting a coordinator
** [[Bully algorithm]]
* [[Mutual exclusion]]
** [[Lamport's Distributed Mutual Exclusion Algorithm]]
** [[Naimi-Trehel's log(n) Algorithm]]
** [[Maekawa's algorithm|Maekawa's Algorithm]]
** [[Raymond's algorithm|Raymond's Algorithm]]
** [[Ricart–Agrawala algorithm|Ricart–Agrawala Algorithm]]
* [[Snapshot algorithm]]: record a consistent global state for an asynchronous system
** [[Chandy–Lamport algorithm]]
* [[Vector clocks]]: generate a [[partial ordering]] of events in a distributed system and detect [[causality]] violations

===Memory allocation and deallocation algorithms===
* [[Buddy memory allocation]]: an algorithm to allocate memory such with less fragmentation
* [[Garbage collection (computer science)|Garbage collectors]]
** [[Cheney's algorithm]]: an improvement on the [[Semi-space collector]]
** [[garbage collection (computer science)|Generational garbage collector]]: Fast garbage collectors that segregate memory by age
** [[Mark-compact algorithm]]: a combination of the [[Mark and sweep|mark-sweep algorithm]] and [[Cheney's algorithm|Cheney's copying algorithm]]
** [[Mark and sweep]]
** [[Semi-space collector]]: an early copying collector
* [[Reference counting]]