aljaz/hacker-laws
1
1
Fork 0
mirror of https://github.com/dwmkerr/hacker-laws.git synced 2025-12-17 12:45:20 +01:00
Code Issues Packages Projects Releases Wiki Activity

fix: Fix section's links (#317)

Browse Source 
Corrected wrong self-links for the following sections:
* The Fallacies of Distributed Computing
* The Pareto Principle (The 80/20 Rule)
This commit is contained in:
leocaraballo
2020-10-12 22:17:38 -03:00
committed by GitHub
parent d8df4603ca
commit 7b341fc0d2
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
README.md
View File

@@ -168,7 +168,7 @@ The CAP Theorem (defined by Eric Brewer) states that for a distributed data stor
- Availability: when reading data, every request receives _a non error response_, without the guarantee that it is the _most recent_ data - Availability: when reading data, every request receives _a non error response_, without the guarantee that it is the _most recent_ data
- Partition Tolerance: when an arbitrary number of network requests between nodes fail, the system continues to operate as expected - Partition Tolerance: when an arbitrary number of network requests between nodes fail, the system continues to operate as expected
The core of the reasoning is as follows. It is impossible to guarantee that a network partition will not occur (see [The Fallacies of Distributed Computing](#The_Fallacies_of_Distributed_Computing)). Therefore in the case of a partition we can either cancel the operation (increasing consistency and decreasing availability) or proceed (increasing availability but decreasing consistency). The core of the reasoning is as follows. It is impossible to guarantee that a network partition will not occur (see [The Fallacies of Distributed Computing](#the-fallacies-of-distributed-computing)). Therefore in the case of a partition we can either cancel the operation (increasing consistency and decreasing availability) or proceed (increasing availability but decreasing consistency).
The name comes from the first letters of the guarantees (Consistency, Availability, Partition Tolerance). Note that it is very important to be aware that this does _not_ relate to [_ACID_](#TODO), which has a different definition of consistency. More recently, [PACELC](#TODO) theorem has been developed which adds constraints for latency and consistency when the network is _not_ partitioned (i.e. when the system is operating as expected). The name comes from the first letters of the guarantees (Consistency, Availability, Partition Tolerance). Note that it is very important to be aware that this does _not_ relate to [_ACID_](#TODO), which has a different definition of consistency. More recently, [PACELC](#TODO) theorem has been developed which adds constraints for latency and consistency when the network is _not_ partitioned (i.e. when the system is operating as expected).
@@ -181,7 +181,7 @@ Real world examples:
See also: See also:
- [ACID](#TODO) - [ACID](#TODO)
- [The Fallacies of Distributed Computing](#The_Fallacies_of_Distributed_Computing) - [The Fallacies of Distributed Computing](#the-fallacies-of-distributed-computing)
- [PACELC](#TODO) - [PACELC](#TODO)
### Conway's Law ### Conway's Law
@@ -735,7 +735,7 @@ Related to:
See also: See also:
- [Pareto Principle](#the-pareto-principle) - [Pareto Principle](#the-pareto-principle-the-8020-rule)
### The Peter Principle ### The Peter Principle