diff --git a/content/SD/comms.md b/content/SD/comms.md
deleted file mode 100644
index e69de29..0000000
diff --git a/content/SD/conditions.md b/content/SD/conditions.md
deleted file mode 100644
index e69de29..0000000
diff --git a/content/SD/deals.md b/content/SD/deals.md
deleted file mode 100644
index e69de29..0000000
diff --git a/content/SD/exercises.md b/content/SD/exercises.md
deleted file mode 100644
index e69de29..0000000
diff --git a/content/SD/imgs/race-example.png b/content/SD/imgs/race-example.png
deleted file mode 100644
index 7d11db2..0000000
Binary files a/content/SD/imgs/race-example.png and /dev/null differ
diff --git a/content/SD/intro.md b/content/SD/intro.md
deleted file mode 100644
index 048186f..0000000
--- a/content/SD/intro.md
+++ /dev/null
@@ -1,20 +0,0 @@
----
-title: Introduction 
----
-
-# Introduction
-
-These are my notes for Sistemas Distribuídos (SD).
-This is the proper order to study it.
-
-1. [Races and Mutual Exclusion](mutex.md)
-2. [Programming with locks](locks.md)
-3. [Mutex Algorithms](mutex-algs.md)
-4. [Conditions](conditions.md)
-5. [Communications](comms.md)
-6. [Serialization](serialization.md)
-7. [Threads](threads.md)
-8. [Physic and Logic Time](time.md)
-9. [Deals](deals.md)
-10. [P2P](p2p.md)
-11. [Exercises](exercises.md)
diff --git a/content/SD/locks.md b/content/SD/locks.md
deleted file mode 100644
index e69de29..0000000
diff --git a/content/SD/mutex-algs.md b/content/SD/mutex-algs.md
deleted file mode 100644
index e69de29..0000000
diff --git a/content/SD/mutex.md b/content/SD/mutex.md
deleted file mode 100644
index 2e1fa38..0000000
--- a/content/SD/mutex.md
+++ /dev/null
@@ -1,93 +0,0 @@
----
-title: Races and Mutual Exclusion
----
-
-# Races
-
-What is a race? Let's take for example a simple counter using two threads.
-This object counter is shared between the two threads
-
-```java
-public class Counter {
-    private long value;
-
-public long getAndIncrement() {
-    return value++;
-}
-}
-```
-
-The objective of this counter is to print every single prime number until 100. To do that we can write the following code snippet:
-
-```java
-int counter = new Counter(1);
-
-void primePrint {
-    long j = 0;
-    while (j < 100) {
-        j = counter.getAndIncrement();
-    if (isPrime(j))
-    print(j);
-}
-}
-```
-
-Has we know, the variable counter will be shared. To understand why this code may cause some problems we must know a bit about the way a computer works.
-
-When both threads are acessing the same spot in memory, the order in which they write and read is not precise. So there are times where both can read the same thing from the variable `value` but when writing it, it's possible that some time has passed and the `value` may not be the same.
-
-![Imagem](imgs/race-example)
-
-Being said all this, this code is pretty much okay when it comes to single-threaded programs, but for a multi-threaded program this will cause a lot of races. 
-
-# Mutual Exclusion
-
-## Locks
-
-A way to solve this problem is through using **locks**. In Java a lock is define by the following interface:
-
-```java
-public interface Lock {
-    public void lock(); //acquire lock
-    public void unlock(); //release lock
-}
-```
-
-A way to solve the previous problem using locks can be something like this
-```java
-public class Counter {
-    private long value;
-    private Lock lock;
-
-
-    public long getAndIncrement() {
-        lock.lock(); 
-
-        try {
-            int temp = value;
-            value = value + 1;
-        } finally {
-            lock.unlock();
-        }
-
-        return temp;
-    }
-}
-```
-
-As you can see, the code that needs to be protected from the race (the read and write of value) is inside the `try`. To this code we will call it the *critical section*. What is happening here is that we are locking the shared object (Counter) when doing the method `getAndIncrement()`, this means, the variables in it are only being acessed and altered by one single thread, the other threads can't do anything to it. This way we guarantee that the threads won't read different values or write the wrong value to the object.
-
-## Problems with Mutual Exclusion
-
-Let's take into this two versions of the parallel primality testing code
-- Increment +1 and get n, test n
-- Increment +2 and get n, test n and n+1
-
-Using the first version we will, eventually, have at least one thread that is waiting for mutex. This happens cause the critical section is being acessed far
-<!---
-Must review slide 3 
---->
-
-<hr></hr>
-
-### Next Chapter: [Programming with locks](locks.md)
diff --git a/content/SD/p2p.md b/content/SD/p2p.md
deleted file mode 100644
index e69de29..0000000
diff --git a/content/SD/serialization.md b/content/SD/serialization.md
deleted file mode 100644
index e69de29..0000000
diff --git a/content/SD/threads.md b/content/SD/threads.md
deleted file mode 100644
index e69de29..0000000
diff --git a/content/SD/time.md b/content/SD/time.md
deleted file mode 100644
index e69de29..0000000
diff --git a/content/index.md b/content/index.md
index df43964..2c157a9 100644
--- a/content/index.md
+++ b/content/index.md
@@ -19,5 +19,5 @@ I decided to create this so I have a place to dump my college stuff.
 
 - [Projects](projects.md)
 - [PL](PL/intro.md)
-- [SD](SD/intro.md)
+