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...
CDNetworks
CDNetworks, founded in 2000, is a full-service content delivery network (CDN), with increasing business in the United States.
Founded in 2000, CDNetworks is a full-service content delivery network...
CDNetworks - Wikipedia
Eisenberg & McGuire algorithm
Eisenberg may refer to:
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
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 data storage
A distributed data store is a computer network where information is stored on more than one node, often in a replicated fashion. It is usually specifically used to refer to either a distributed databa...
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...
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 ...
Limelight Networks
Limelight Networks is a Content Delivery Network (CDN). The company is based in Tempe, Arizona, U.S.A., with offices in San Francisco, Seattle, New York, Paris, Washington DC, Munich, Mumbai, Delhi, D...
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...
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...
Erdős–Faber–Lovász conjecture
In graph theory, the Erdős–Faber–Lovász conjecture is an unsolved problem about graph coloring, named after Paul Erdős, Vance Faber, and László Lovász, who formulated it in 1972. It says:If k complet...
Raymond's algorithm
Raymond's Algorithm is a lock based algorithm for mutual exclusion on a distributed system. It imposes a logical structure (a K-ary tree) on distributed resources. As defined, each node has only a s...
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
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...
Bully algorithm
The bully algorithm is a method in distributed computing for dynamically electing a coordinator by process ID number. The process with the highest process ID number is selected as the coordinator.
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...
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...
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
Graph coloring
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In its simplest ...
Graph coloring - Wikipedia
Lamport's bakery algorithm
Lamport's bakery algorithm is a computer algorithm devised by computer scientist Leslie Lamport, which is intended to improve the safety in the usage of shared resources among multiple threads by mean...
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...
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