revert-PACELC
parent
648b12aba2
commit
f78e88fc36
|
@ -0,0 +1,2 @@
|
||||||
|
# Default ignored files
|
||||||
|
/workspace.xml
|
|
@ -0,0 +1,5 @@
|
||||||
|
<component name="ProjectCodeStyleConfiguration">
|
||||||
|
<state>
|
||||||
|
<option name="PREFERRED_PROJECT_CODE_STYLE" value="Default" />
|
||||||
|
</state>
|
||||||
|
</component>
|
|
@ -0,0 +1,6 @@
|
||||||
|
<?xml version="1.0" encoding="UTF-8"?>
|
||||||
|
<project version="4">
|
||||||
|
<component name="VcsDirectoryMappings">
|
||||||
|
<mapping directory="" vcs="Git" />
|
||||||
|
</component>
|
||||||
|
</project>
|
16
README.md
16
README.md
|
@ -104,7 +104,6 @@ Review the [Contributing Guidelines](CONTRIBUTING.md).
|
||||||
* [Performance vs scalability](#performance-vs-scalability)
|
* [Performance vs scalability](#performance-vs-scalability)
|
||||||
* [Latency vs throughput](#latency-vs-throughput)
|
* [Latency vs throughput](#latency-vs-throughput)
|
||||||
* [Availability vs consistency](#availability-vs-consistency)
|
* [Availability vs consistency](#availability-vs-consistency)
|
||||||
* [PACELC theorem](#PACELC-theorem)
|
|
||||||
* [CAP theorem](#cap-theorem)
|
* [CAP theorem](#cap-theorem)
|
||||||
* [CP - consistency and partition tolerance](#cp---consistency-and-partition-tolerance)
|
* [CP - consistency and partition tolerance](#cp---consistency-and-partition-tolerance)
|
||||||
* [AP - availability and partition tolerance](#ap---availability-and-partition-tolerance)
|
* [AP - availability and partition tolerance](#ap---availability-and-partition-tolerance)
|
||||||
|
@ -438,21 +437,6 @@ Generally, you should aim for **maximal throughput** with **acceptable latency**
|
||||||
|
|
||||||
## Availability vs consistency
|
## Availability vs consistency
|
||||||
|
|
||||||
### PACELC theorem
|
|
||||||
<p align="center">
|
|
||||||
<img src="images/PACELC.png" width="600" height="300">
|
|
||||||
<br/>
|
|
||||||
<i><a href=https://github.com/Ahmad-alsanie/system-design-examples/blob/main/images/PACELC.png>Source: PACELC theorem </a></i>
|
|
||||||
</p>
|
|
||||||
|
|
||||||
If there's a partition; a system can trade of between A(availability) and C(Consistency).
|
|
||||||
Else the trade of is in between C(consistency) and L(latency)
|
|
||||||
|
|
||||||
<p align="center">
|
|
||||||
<img src="images/pacelcDBs.png">
|
|
||||||
<br/>
|
|
||||||
<i><a href=https://en.wikipedia.org/wiki/PACELC_theorem>Source: PACELC theorem </a></i>
|
|
||||||
</p>
|
|
||||||
|
|
||||||
### CAP theorem
|
### CAP theorem
|
||||||
|
|
||||||
|
|
Binary file not shown.
Before Width: | Height: | Size: 59 KiB |
Binary file not shown.
Before Width: | Height: | Size: 91 KiB |
Loading…
Reference in New Issue