Mark/handouts
Mark/handouts
1
0
Fork 0
Code Pull Requests 1 Actions Packages Releases Activity

Cleaned up RAID handout

Browse Source
This commit is contained in:
Mark 2023-01-12 18:56:54 -08:00
parent 7e2ebc4fc7
commit 513bac6f54
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
Misc/Warm-Ups/raid.tex
View File

@ -66,7 +66,7 @@
\problem{}
Suppose we have two hard drives. How can we arrange our data so that...
\begin{enumerate}
\item We can store 1 TiB of data
\item We get 1 TiB of usable storage
\item We lose no data if any one drive fails
\end{enumerate}
@ -75,7 +75,7 @@
\problem{}
Suppose we have three hard drives. How can we arrange our data so that...
\begin{enumerate}
\item We can store 2 TiB of data
\item We get 2 TiB of usable storage
\item We lose no data if any one drive fails
\end{enumerate}
@ -84,14 +84,15 @@
\problem{}
Suppose we have five hard drives. How can we arrange our data so that...
\begin{enumerate}
\item We can store 3 TiB of data
\item We get 3 TiB of usable storage
\item We lose no data if any two drives fail
\end{enumerate}
\vfill
\problem{}
Can you write a general solution to this problem?
Write a general solution to this problem, using $n$ drives and providing $s$ TiB of storage. \\
How many failures will such an array be able to tolerate?
\vfill
\end{document}