Codync
免費、開源的 1:1 替代方案,取代 Grok Bot 與 Muse。從 iPhone、Mac 或 Linux 桌面將 Claude Code、Codex、Cursor 與 40+ 程式碼代理人作為持續機器人傳訊。群組聊天、主題串…
AI 翻譯
尚未收集儲存庫資訊。
尚未偵測到更新。GitHub 發布版本後會顯示在這裡。
製作者的介紹僅有上面的一句話。 更多詳情請閱讀儲存庫 README。 儲存庫 README ↗
正在載入完整 README。
檢視完整 README ↗A single-page storage sizing calculator. Open index.html in any browser; there is nothing to install or build.
| Module | What it calculates |
|---|---|
| Workload | Presets (OLTP, VDI, virtual servers, email, file server, analytics, backup, video) that fill in a typical block size and read/write mix |
| IOPS ↔ Throughput | Solves any one of IOPS, block size or throughput from the other two |
| Block size table | Throughput and IOPS at block sizes from 512 B to 1 MiB |
| Array IOPS | Usable IOPS for a RAID 0/1/10/5/6/50/60 array from drive count, IOPS per drive and read/write mix; drives needed for a target IOPS |
| Capacity | Raw and usable capacity (TB and TiB), efficiency, parity/mirror overhead, hot spares and span groups |
| Queue depth & latency | Little's law: queue depth = IOPS × latency |
| System bottleneck | IOPS ceilings for disks, CPU, controllers and network; the lowest one is the system limit |
Drive, CPU-cost and controller figures are typical values, not measurements. The model ignores controller write cache, SSD write amplification and full-stripe writes, and assumes reads are spread evenly over the working set. Use it for planning, then confirm with a benchmark (for example fio) on your own hardware.