Examples
Examples
Try the starting example
- Events [time seconds,arriving elements,service capacity elements]
- [[0,10,0],[1,5,8],[2,0,10]]
- Reserve elements
- 2
- Bytes per element
- 16
- Queue occupancy trace
- [[0,10],[1,7],[2,0]]
- Required capacity (elements)
- 17
- Required storage (bytes)
- 272
Try another scenario
- Events [time seconds,arriving elements,service capacity elements]
- [[0,10,0],[1,5,8],[2,0,10]]
- Reserve elements
- 4
- Bytes per element
- 16
- Queue occupancy trace
- [[0,10],[1,7],[2,0]]
- Required capacity (elements)
- 19
- Required storage (bytes)
- 304
Calculation method
Calculation method
Queue occupancy trace
At each unique ordered time, arrivals occur before service; peak measures pre-service occupancy.
Required capacity (elements)
Peak occupancy plus explicit reserve.
Required storage (bytes)
Capacity × bytes per element.
Symbols and units
- a
- Events [time seconds,arriving elements,service capacity elements]
- b
- Reserve elements
- c
- Bytes per element
Use the units shown. A list keeps the order in which you enter its values. The symbol ^ means “raised to the power of”.
Assumptions & limits
Assumptions & limits
- Arrival-service traces, burst limits, element size. Returns Peak occupancy and required bytes. All coefficients and observations are user supplied; results describe only the stated mathematical model. Quantities are deterministic calculations from supplied observations and assumptions; no external data is fetched. Supported limits: Finite inputs only; numeric fields bounded as labelled. Lists and JSON records are limited to 256 entries unless a stricter tool bound is stated. No automatic design approval, legal conclusion, treatment recommendation or safety certification. Reserve elements: minimum 0, maximum 1000000. Bytes per element: minimum 1, maximum 1000000.
Are these inputs private?
These calculations run in your browser. A shared link contains the values you choose to share. Only questions submitted to the separate AI finder are sent to OpenAI.