Codync
免费开源的 1:1 Grok Bot 与 Muse 替代方案。可在 iPhone、Mac 或 Linux 桌面上将 Claude 代码、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.