Category:Distributed computing problems
 | Computing portal |
Here is a list of articles in the category Distributed computing problems of the Computing portal that unifies foundations of mathematics and computations using computers. Problems and challenges related to distributed computing, distributed systems and distributed algorithms, including:
- Computational problems that have been studied in a distributed setting.
- Challenges related to dividing a computational problem into multiple tasks that can be solved in parallel.
- Challenges related to fault-tolerance and synchronisation.
The focus is on formal, mathematical problems. See Category:Distributed computing architecture for software engineering challenges and Category:Applications of distributed computing for real-world applications.
See also
- Category:Distributed algorithms for algorithms that solve these problems.
Subcategories
This category has the following 2 subcategories, out of 2 total.
Pages in category "Distributed computing problems"
The following 35 pages are in this category, out of 35 total.
A
- Atomic broadcast (physics)
- Atomic commit (physics)
B
- Big data (computing)
- Big memory (computing)
- Brooks–Iyengar algorithm (computing)
- Byzantine fault (computing)
- Byzantine fault tolerance (computing)
C
- Clock synchronization (computing)
- Consensus (computer science) (computing)
D
- Data lineage (computing)
- Deadlock (computing)
- Distributed concurrency control (computing)
- Distributed graph coloring (computing)
E
- Embarrassingly parallel (computing)
F
- Failure semantics (computing)
- Fallacies of distributed computing (computing)
G
- Global concurrency control (computing)
H
- Happened-before (computing)
L
- Leader election (computing)
Q
- Quantum Byzantine agreement (physics)
R
- Race condition (computing)
S
- Self-stabilization (computing)
- Serializability (computing)
- Shared register (computing)
- Shared snapshot objects (computing)
- State machine replication (computing)
- Superstabilization (computing)
T
- Terminating Reliable Broadcast (computing)
- Timing failure (computing)
- Transitive data skew (computing)
- Two Generals' Problem (computing)
U
- Uniform consensus (computing)
V
- Automatic vectorization (computing)
- Version vector (computing)
W
- Weak coloring (computing)
Mathematics
Organizations
Books
About