Technology
•
Computers
•
Algorithm
•
Distributed computing
•
Concurrent algorithms
•
Distributed Systems
Distributed algorithms
A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributed algorithms are used in many varied application areas of distributed...
Concurrency control algorithms
•
File sharing networks
Concurrency control algorithms
File sharing networks
File sharing is the practice of distributing or providing access to digital media, such as computer programs, multimedia (audio, images and video), documents or electronic books. File sharing may be a...
T-coloring
In graph theory, a T-Coloring of a graph , given the set T of nonnegative integers containing 0, is a function of colors (positive integers) to the vertices of G such that if . In simple words, the d...
T-coloring - Wikipedia
NoCDN
Parallel algorithm
In computer science, a parallel algorithm, as opposed to a traditional serial algorithm, is an algorithm which can be executed a piece at a time on many different processing devices, and then combined...
Banker's algorithm
The Banker's algorithm is a resource allocation and deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of predetermined maximum possible amoun...
Distributed minimum spanning tree
The distributed minimum spanning tree (MST) problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network where nodes communicate by message passing. It is rad...
Distributed minimum spanning tree - Wikipedia
Comparison of streaming media systems
This is a comparison of streaming media systems. A more complete list of streaming media systems is also available.
The following tables compare general and technical information for a number of s...
Gnutella2
Gnutella2, often referred to as G2, is a peer-to-peer protocol developed mainly by Michael Stokes and released in 2002. While inspired by the gnutella protocol, G2 shares little of its design with the...
Dijkstra–Scholten algorithm
The Dijkstra–Scholten algorithm (named after Edsger W. Dijkstra and Carel S. Scholten) is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Sch...
Chandra–Toueg consensus algorithm
The Chandra–Toueg consensus algorithm, published by Tushar Deepak Chandra and Sam Toueg in 1996, is an algorithm for solving consensus in a network of unreliable processes equipped with an eventually ...
Level 3 Communications
Level 3 Communications is an American multinational telecommunications and Internet service provider company headquartered in Broomfield, Colorado.It operates a Tier 1 network. The company provides co...
Level 3 Communications - Wikipedia
Operational transformation
Operational transformation (OT) is a technology for supporting a range of collaboration functionalities in advanced collaborative software systems. OT was originally invented for consistency mainten...
Operational transformation - Wikipedia
Cannon's algorithm
In computer science, Cannon's algorithm is a distributed algorithm for matrix multiplication for two-dimensional meshes first described in 1969 by Lynn Elliot Cannon.It is especially suitable for comp...
Intersection algorithm
The intersection algorithm is an agreement algorithm used to select sources for estimating accurate time from a number of noisy time sources, it forms part of the modern Network Time Protocol. It is a...
Berkeley algorithm
The Berkeley algorithm is a method of clock synchronisation in distributed computing which assumes no machine has an accurate time source. It was developed by Gusella and Zatti at the University of Ca...
Lamport's Distributed Mutual Exclusion Algorithm
Lamport's Distributed Mutual Exclusion Algorithm is a contention-based algorithm for mutual exclusion on a distributed system.
Requesting processOther processes
Peterson's algorithm
Peterson's algorithm (AKA Peterson's solution) is a concurrent programming algorithm for mutual exclusion that allows two processes to share a single-use resource without conflict, using only shared m...
Cristian's algorithm
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 science but is primarily used in low-latenc...
Raft (computer science)
Raft is a consensus algorithm designed as an alternative to Paxos. It was meant to be more understandable than Paxos by means of separation of logic, but it is also formally proven safe and offers som...
PULSE (P2PTV)
PULSE is a P2PTV application developed by the European FP7 NAPA-WINE (Network-Aware P2P-TV Application over Wise Networks) research consortium.PULSE stands for Peer-to-Peer Unstructured Live Streaming...
HS algorithm
The HS Algorithm is named after Dan Hirschberg and J. B. Sinclair. It is a distributed algorithm designed for the Leader Election problem in a Synchronous Ring.The algorithm requires the use of unique...
Marzullo's algorithm
Marzullo's algorithm, invented by Keith Marzullo for his Ph.D. dissertation in 1984, is an agreement algorithm used to select sources for estimating accurate time from a number of noisy time sources. ...
Marzullo's algorithm - Wikipedia
Paxos (computer science)
Paxos is a family of protocols for solving consensus in a network of unreliable processors.Consensus is the process of agreeing on one result among a group of participants. This problem becomes diffi...
Dekker's algorithm
Dekker's algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming. The solution is attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra ...
Snapshot algorithm
The snapshot algorithm is an algorithm used in distributed systems for recording a consistent global state of an asynchronous system. The algorithm discussed here is also known as the Chandy–Lamport a...
Graph factorization
In graph theory, a factor of a graph G is a spanning subgraph, i.e., a subgraph that has the same vertex set as G. A k-factor of a graph is a spanning k-regular subgraph, and a k-factorization partiti...
Graph factorization - Wikipedia
Chang and Roberts algorithm
The Chang and Roberts algorithm is a ring-based coordinator election algorithm, employed in distributed computing.
The algorithm assumes that each process has a Unique Identification (UID) and th...
Agreement algorithms
BitTorrent
BitTorrent is a protocol for the practice of peer-to-peer file sharing that is used to distribute large amounts of data over the Internet. BitTorrent is one of the most common protocols for transferri...
BitTorrent - Wikipedia