VOOZH about

URL: https://willitrunai.com/can-run/gpt-oss-20b-on-gaudi-3-128gb


Can GPT-OSS 20B run on Gaudi 3 128GB?

YES — Runs Great

S85Excellent
Estimated from fit model

GPT-OSS 20B needs ~29.0 GB VRAM. Gaudi 3 128GB has 128.0 GB. With Q4_K_M quantization, expect ~463 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: HighStack: StandardBottleneck: Balanced
Share:

Operating mode

Choose the run profile you care about

Interactive favors responsiveness, while light API and scale-out lean harder on serving readiness. The fit stays the same, but the recommendation lens changes.

Current mode

Balanced

Balanced for general local use. Keeps the ranking neutral across personal and serving workflows.

Capabilities:

Select quantization to explore

Q4_K_M (Medium quality) — 29.0 GB, 497.2 tok/s, Runs well
29.0 GB required128.0 GB available
23% VRAM used

Fit status

Runs well

Decode

497.2 tok/s

TTFT

389 ms

Safe context

128K

Memory

29.0 GB / 128.0 GB

Memory breakdown

Weights12.8 GB
KV Cache2.4 GB
Runtime0.9 GB
Headroom12.8 GB

See how fast it feels

See how fast it feelsGPT-OSS 20B on Gaudi 3 128GB
1st promptCold start — includes initialization
>Write a Python function to sort a list
Here's a Python function that sorts a list using quicksort: def quicksort(arr): if len(arr) <= 1: return arr pivot = arr[len(arr) // 2] left = [x for x in arr if x < pivot] middle = [x for x in arr if x == pivot] right = [x for x in arr if x > pivot] return quicksort(left) + middle + quicksort(right) # Example usage numbers = [3, 6, 8, 10, 1, 2, 1] print(quicksort(numbers)) # [1, 1, 2, 3, 6, 8, 10] The algorithm picks a pivot, partitions the list into smaller, equal, and larger elements, then recursively sorts each partition and concatenates the results.
2nd promptWarm — model ready, no init overhead
>Now add type hints and a docstring
def quicksort(arr: list[int]) -> list[int]: """Sort a list using the quicksort algorithm. Args: arr: List of integers to sort. Returns: A new sorted list. """ if len(arr) <= 1: return arr pivot = arr[len(arr) // 2] left = [x for x in arr if x < pivot] middle = [x for x in arr if x == pivot] right = [x for x in arr if x > pivot] return quicksort(left) + middle + quicksort(right) Added type hints for the input and return type, plus a Google-style docstring.
Estimated: 497.2 tok/s decode · 389ms TTFT (warm) · 1243 tok/s prefill

What limits this setup

The raw memory story may look fine, but the software ecosystem is still a constraint here.

Runtime ecosystem is narrower than CUDA

Intel GPUs can look attractive on memory per dollar, but local AI tooling, kernels, and model coverage are still broader and easier on CUDA today.

Best improvement path

Prefer CUDA if you want the path of least resistance

If your goal is maximum runtime coverage, easier troubleshooting, and better support for new local AI releases, CUDA is usually still the safer upgrade path.

Performance by workload

WorkloadGradeFitDecodeTTFTContext
ChatSRuns well462.5 tok/s350 ms128K
CodingSRuns well462.5 tok/s419 ms128K
Agentic CodingSRuns well462.5 tok/s609 ms128K
ReasoningSRuns well462.5 tok/s495 ms128K
RAGSRuns well462.5 tok/s761 ms128K

Quantization options

How GPT-OSS 20B (21B params) fits at each quantization level on Gaudi 3 128GB (128.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
8.2 GB
LowA77
Q3_K_S
3
10.3 GB
LowA77
NVFP4
4

Get started

Copy-paste commands to run GPT-OSS 20B on your machine.

Run

ollama run gpt-oss

Your hardware

More models your Gaudi 3 128GB can run

ModelParamsGradeDecodeCapabilities
👁 Mistral
Devstral 2 123B Instruct
123BS37.5 tok/s
👁 Alibaba
Qwen3-Coder 30B A3B Instruct
30.5BS

Frequently asked questions

See all results for Gaudi 3 128GBSee all hardware for GPT-OSS 20B
11.8 GB
Medium
A77
Q4_K_M
4
12.8 GB
MediumA77
Q5_K_M
5
15.1 GB
HighA77
Q6_K
6
17.2 GB
HighA77
Q8_0
8
22.5 GB
Very HighA78
F16Best for your GPU
16
43.1 GB
MaximumA81
391.6 tok/s
👁 Alibaba
Qwen 3.5 27B
27BS169.8 tok/s
👁 Alibaba
Qwen 3.6 27B
27BS105.9 tok/s
👁 Alibaba
Qwen 3.5 122B A10B
122BS104.1 tok/s