Can Qwen 2.5 Coder 32B run on Gaudi 3 128GB?

YES — Runs Great

A76Great

Estimated from fit model

Qwen 2.5 Coder 32B needs ~37.1 GB VRAM. Gaudi 3 128GB has 128.0 GB. With Q4_K_M quantization, expect ~133 tok/s.

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

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) — 37.1 GB, 143.3 tok/s, Runs well

37.1 GB required128.0 GB available

29% VRAM used

Fit status

Runs well

Decode

143.3 tok/s

TTFT

1351 ms

Safe context

131K

Memory

37.1 GB / 128.0 GB

Memory breakdown

Weights19.5 GB

KV Cache3.9 GB

Runtime0.9 GB

Headroom12.8 GB

See how fast it feels

See how fast it feelsQwen 2.5 Coder 32B 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: 143.3 tok/s decode · 1.4s TTFT (warm) · 358 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

Workload	Grade	Fit	Decode	TTFT	Context
Chat	A	Runs well	143.3 tok/s	737 ms	131K
Coding	A	Runs well	132.7 tok/s	1459 ms	131K
Agentic Coding	A	Runs well	143.3 tok/s	1965 ms	131K
Reasoning	A	Runs well	143.3 tok/s	1597 ms	131K
RAG	A	Runs well	143.3 tok/s	2456 ms	131K

Quantization options

How Qwen 2.5 Coder 32B (32B params) fits at each quantization level on Gaudi 3 128GB (128.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	12.5 GB	Low	B66
Q3_K_S	3	15.7 GB	Low	B67
NVFP4	4	17.9 GB	Medium	B67
Q4_K_M	4	19.5 GB	Medium	B67
Q5_K_M	5	23.0 GB	High	B67
Q6_K	6	26.2 GB	High	B68
Q8_0	8	34.2 GB	Very High	B69
F16Best for your GPU	16	65.6 GB	Maximum	A74

Get started

Copy-paste commands to run Qwen 2.5 Coder 32B on your machine.

Run

ollama run qwen2.5-coder

Your hardware

More models your Gaudi 3 128GB can run

Model	Params	Grade	Decode
Devstral 2 123B Instruct	123B	S	37.5 tok/s
Qwen 3.5 122B A10B	122B	S	104.1 tok/s
Qwen 3.6 35B A3B	35B	S	329.1 tok/s
Qwen 3.5 35B A3B	35B	S	357.9 tok/s
Mistral Small 4 119B	119B	S	112.9 tok/s

Frequently asked questions

Can Gaudi 3 128GB run Qwen 2.5 Coder 32B?

Yes, Gaudi 3 128GB can run Qwen 2.5 Coder 32B with a A grade (Runs well). Expected decode speed: 132.7 tok/s.

How much VRAM does Qwen 2.5 Coder 32B need?

Qwen 2.5 Coder 32B (32B parameters) requires approximately 37.1 GB of memory with Q4_K_M quantization.

What is the best quantization for Qwen 2.5 Coder 32B?

The recommended quantization for Qwen 2.5 Coder 32B is Q4_K_M, which balances quality and memory efficiency.

What speed will Qwen 2.5 Coder 32B run at on Gaudi 3 128GB?

On Gaudi 3 128GB, Qwen 2.5 Coder 32B achieves approximately 132.7 tokens per second decode speed with a time-to-first-token of 1459ms using Q4_K_M quantization.

Can Gaudi 3 128GB run Qwen 2.5 Coder 32B for coding?

For coding workloads, Qwen 2.5 Coder 32B on Gaudi 3 128GB receives a A grade with 132.7 tok/s and 131K context.

What context window can Qwen 2.5 Coder 32B use on Gaudi 3 128GB?

On Gaudi 3 128GB, Qwen 2.5 Coder 32B can safely use up to 131K tokens of context. The model's official context limit is 131K, but available memory constrains the safe maximum.

What should I upgrade first if Qwen 2.5 Coder 32B feels slow on Gaudi 3 128GB?

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.

Would CUDA be a better path than Gaudi 3 128GB for Qwen 2.5 Coder 32B?

Often yes, if your goal is the easiest setup and the widest runtime support. Intel can offer attractive memory capacity, but CUDA still tends to win on tooling maturity, guides, kernels, and model coverage for local AI.

See all results for Gaudi 3 128GB See all hardware for Qwen 2.5 Coder 32B

Embed this result▼

Paste this snippet into any page to show a live fit card.

<iframe src="https://willitrunai.com/embed/qwen-2.5-coder-32b-on-gaudi-3-128gb" width="400" height="180" frameborder="0" style="border:none;border-radius:12px;overflow:hidden;" title="Will It Run AI — fit result"></iframe>

Preview: