DeepSeek/3FS
1
0
Fork 0
mirror of https://github.com/deepseek-ai/3FS synced 2025-06-26 18:16:45 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Update design_notes.md

Browse Source
This commit is contained in:
Chongzhuo Yang
2025-03-09 01:51:37 +08:00
committed by GitHub
parent 3b273a6de2
commit ef97d2793e
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
docs/design_notes.md
View File

@@ -140,8 +140,8 @@ To reduce the performance impact, we can have more SSDs share the redirected tra
| 5 | 1 | `A3` | `C2` | `F3` | | 5 | 1 | `A3` | `C2` | `F3` |
| 6 | 1 | `A4` | `B3` | `E3` | | 6 | 1 | `A4` | `B3` | `E3` |
| 7 | 1 | `B4` | `C3` | `F4` | | 7 | 1 | `B4` | `C3` | `F4` |
| 8 | 1 | `B5` | `C4` | `E4` | | 8 | 1 | `B5` | `C4` | `D4` |
| 9 | 1 | `A5` | `C5` | `D4` | | 9 | 1 | `A5` | `C5` | `E4` |
| 10 | 1 | `D5` | `E5` | `F5` | | 10 | 1 | `D5` | `E5` | `F5` |
To achieve maximum read throughput during recovery, the load balance problem can be formulated as a balanced incomplete block design. The optimal solution is obtained by using integer programming solver. To achieve maximum read throughput during recovery, the load balance problem can be formulated as a balanced incomplete block design. The optimal solution is obtained by using integer programming solver.