Codync
무료 오픈소스 1:1 대안, Grok Bot과 Muse 대신
저장소 정보는 아직 수집하지 않았습니다.
아직 감지된 업데이트가 없습니다. 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.