Metric | Value | |
---|---|---|
Bricks | {{ nActive }} | |
Mode | {{ modeLabel }} | |
Groups used | {{ groupsUsed }} | |
Raw storage (all) ({{ unit }}) | {{ formatCap(rawAll) }} | |
Raw active ({{ unit }}) | {{ formatCap(rawActive) }} | |
Equalized raw ({{ unit }}) | {{ formatCap(equalizedRaw) }} | |
Overhead ({{ unit }}) | {{ formatCap(equalizedRaw - rawEffective) }} | |
Raw post-overhead ({{ unit }}) | {{ formatCap(rawEffective) }} | |
Target fill | {{ (targetFill*100).toFixed(0) }} % | |
Protected efficiency | {{ (efficiency*100).toFixed(2) }} % | |
Usable capacity ({{ unit }}) | {{ formatCap(usable) }} | |
Redundancy overhead ({{ unit }}) | {{ formatCap(redundancyRaw) }} | |
Reserved / free ({{ unit }}) | {{ formatCap(reservedRaw) }} | |
Fault tolerance | {{ faultToleranceText }} | |
{{ note }} |
GlusterFS volumes are distributed storage collections of bricks that provide space and resilience across machines. A compact capacity planning calculator helps compare protection choices and headroom so estimates match real clusters.
You enter the number of bricks and their size or list each brick when capacities differ. Then choose distributed replication or erasure coding and set expected file system overhead and your target fill so the result reflects reserved headroom.
The output shows projected usable capacity and the share consumed by redundancy overhead reserved space and file system overhead. A quick example with twelve bricks of ten terabytes and three way replication shows how the result shifts when you lower the fill target.
Treat the figures as planning numbers not guarantees because file layout small files and mixed workloads can move the needle. Use consistent units and keep assumptions the same when comparing options.
The quantities measured are brick capacities and how they participate in a GlusterFS volume. From those inputs the tool computes raw capacity, applies file system overhead, reserves a target fill, and then applies protection efficiency to estimate usable capacity. Replication and erasure coding change efficiency and fault tolerance at the set level.
Computation proceeds by summing active bricks, subtracting overhead to get effective raw space, multiplying by the chosen fill target, and finally scaling by protection efficiency. Results are partitioned into usable data, redundancy, reserved headroom, and overhead so trade‑offs are visible.
Interpretation focuses on how efficiency varies by mode: distributed has full efficiency; replicated mode yields 1 ⁄ r; replicated with an arbiter yields (r − a) ⁄ r; dispersed erasure coding yields k ⁄ (k + m). Crossing to larger replica widths or higher redundancy m trades space for fault tolerance.
Comparability assumes consistent units and the same brick list. Heterogeneous inputs are handled by using the largest bricks first to fill the active sets; comparisons across different brick mixes may therefore shift slightly with ordering.
Symbol | Meaning | Unit/Datatype | Source |
---|---|---|---|
Total bricks | integer | Input | |
Capacity of brick i | MB | GB | TB | PB | MiB | GiB | TiB | PiB | Input | |
Replica width | integer | Input | |
Arbiters per set | integer | Input | |
EC data and redundancy bricks | integers | Input | |
Active bricks used | integer | Derived | |
File system/metadata overhead | fraction | Input | |
Target fill (occupancy) | fraction | Input | |
Protected efficiency | fraction | Derived | |
Usable capacity | same as input unit | Derived |
Units, precision, and rounding: Inputs use SI (MB, GB, TB, PB) or IEC (MiB, GiB, TiB, PiB). Numbers are computed in double‑precision floating point and displayed with up to two decimal places using locale‑aware separators.
Field | Type | Min | Max | Step/Pattern | Error Text | Notes |
---|---|---|---|---|---|---|
Total bricks | number | 1 | — | step 1 | — | Sets number of inputs when heterogeneous. |
Brick size | number | 0 | — | step 0.01 | — | Capacity per brick before overhead. |
Per‑brick capacities | number | 0 | — | step 0.01 | — | Blank counts as zero. |
Mode | enum | — | — | dist | rep | rep_arb | ec | — | Volume type. |
Replica width | number | 2 (rep) / 3 (rep_arb) | — | step 1 | — | Bricks per replica set. |
Arbiters per set | number | 1 | r − 1 | step 1 | — | Used only in replicated with arbiter. |
EC data k | number | 1 | — | step 1 | — | Dispersed data bricks. |
EC redundancy m | number | 1 | — | step 1 | — | Dispersed redundancy bricks. |
Groups | number | 1 | — | step 1 | — | Number of sets to build. |
Per group | number | min = max(required, input) | — | step 1 | — | Required: r for rep, r for rep_arb, k + m for EC. |
File system overhead f | range | 0 | 0.15 | step 0.005 | — | Clamped to 0 … 0.99 internally. |
Target fill t | range | 0.50 | 1.00 | step 0.01 | — | Reserves headroom below 100 %. |
Units | enum | — | — | MB, GB, TB, PB, MiB, GiB, TiB, PiB | — | SI or IEC. |
I/O: Inputs are numeric fields (integers for counts, decimals for capacities). Outputs include a tabular breakdown, a donut visualization, and optional CSV/JSON exports. Clipboard and file downloads occur locally.
Privacy & compliance: Processing is browser‑based; no data is transmitted or stored server‑side. Clipboard actions and file downloads stay on the device.
GlusterFS capacity planning converts brick counts and sizes into projected usable space, with protection and headroom applied.
Example: 12 × 10 TB, replication 3, overhead 3 %, fill 90 % → ~34.92 TB usable.
You now have a defensible capacity estimate for planning and communication.
No. Calculations run in your browser, and any clipboard copies or downloads remain on your device. No server storage is used.
Clipboard and file saves are local.It models space, headroom, and protection efficiency. Small files, metadata growth, and rebalancing can shift results. Treat outputs as planning figures.
Adjust overhead and fill to reflect practice.SI units MB, GB, TB, PB and IEC units MiB, GiB, TiB, PiB. Display formatting uses your locale separators with up to two decimals.
Choose one unit set and stick with it.Enter per‑brick sizes. The calculation uses the largest bricks first to fill active sets before summing capacity.
Zeros or blanks are ignored in totals.It is the usable fraction after protection: 1 for distributed, 1 ⁄ r for replication, (r − a) ⁄ r with an arbiter, and k ⁄ (k + m) for erasure coding.
Higher protection lowers usable fraction.The calculation itself does not require a network. Once the page is loaded, results compute locally.
Reloading assets may require connectivity.Choose Dispersed, set data k = 8 and redundancy m = 2, then set groups and bricks per group accordingly. Efficiency will be 8 ⁄ 10.
Ensure enough bricks to fill groups.When usable space is close to your need, increase target fill conservatively or add bricks. Avoid operating at 100 % fill.
Leave headroom for growth and repairs.No licensing terms are embedded in this package. The calculator focuses purely on capacity planning logic.
Check your environment’s policies separately.Aim for predictable behavior during failures and repairs, not maximum headline capacity.