Merge pull request #40 from susana/master

Update "Paxos Made Live" link and fix Appendix anchor target in index
mixu · Nov 18, 2016 · 6024162 · 6024162
2 parents 369d0ed + bd1df95
commit 6024162
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/input/0_index.md b/input/0_index.md
@@ -37,7 +37,7 @@ The [fourth chapter](replication.html) introduces the replication problem, and t
 
 The [fifth chapter](eventual.html) discussed replication with weak consistency guarantees. It introduces a basic reconciliation scenario, where partitioned replicas attempt to reach agreement. It then discusses Amazon's Dynamo as an example of a system design with weak consistency guarantees. Finally, two perspectives on disorderly programming are discussed: CRDTs and the CALM theorem.
 
-# Appendix
+# 6. Appendix
 
 [The appendix](appendix.html) covers recommendations for further reading.
 

diff --git a/input/4_replication.md b/input/4_replication.md
@@ -283,7 +283,7 @@ Of course, implementing this algorithm is much harder than it sounds. There are
 - procedures for bringing a new replica up to date in a safe and efficient manner after a crash, disk loss or when a new node is provisioned
 - procedures for snapshotting and garbage collecting the data required to guarantee safety after some reasonable period (e.g. balancing storage requirements and fault tolerance requirements)
 
-Google's [Paxos Made Live](http://labs.google.com/papers/paxos_made_live.html) paper details some of these challenges.
+Google's [Paxos Made Live](http://research.google.com/archive/paxos_made_live.html) paper details some of these challenges.
 
 ## Partition-tolerant consensus algorithms: Paxos, Raft, ZAB