Can Devstral Small 1.1 run on Gaudi 3 128GB?

YES — Runs Great

S87Excellent

Estimated from fit model

Devstral Small 1.1 needs ~30.8 GB VRAM. Gaudi 3 128GB has 128.0 GB. With Q4_K_M quantization, expect ~190 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) — 30.8 GB, 190.2 tok/s, Runs well

30.8 GB required128.0 GB available

24% VRAM used

Fit status

Runs well

Decode

190.2 tok/s

TTFT

1018 ms

Safe context

131K

Memory

30.8 GB / 128.0 GB

Memory breakdown

Weights14.6 GB

KV Cache2.4 GB

Runtime0.9 GB

Headroom12.8 GB

See how fast it feels

See how fast it feelsDevstral Small 1.1 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: 190.2 tok/s decode · 1.0s TTFT (warm) · 476 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	S	Runs well	190.2 tok/s	555 ms	131K
Coding	S	Runs well	190.2 tok/s	1018 ms	131K
Agentic Coding	S	Runs well	190.2 tok/s	1481 ms	131K
Reasoning	S	Runs well	190.2 tok/s	1203 ms	131K
RAG	S	Runs well	190.2 tok/s	1851 ms	131K

Quantization options

How Devstral Small 1.1 (24B params) fits at each quantization level on Gaudi 3 128GB (128.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	9.4 GB	Low	A78
Q3_K_S	3	11.8 GB	Low	A78
NVFP4	4	13.4 GB	Medium	A78
Q4_K_M	4	14.6 GB	Medium	A78
Q5_K_M	5	17.3 GB	High	A78
Q6_K	6	19.7 GB	High	A79
Q8_0	8	25.7 GB	Very High	A79
F16Best for your GPU	16	49.2 GB	Maximum	A83

Get started

Copy-paste commands to run Devstral Small 1.1 on your machine.

Run

lms load Devstral-Small-2507 && lms server start

Your hardware

More models your Gaudi 3 128GB can run

Model	Params	Grade	Decode
Devstral 2 123B Instruct	123B	S	37.5 tok/s
Qwen3-Coder 30B A3B Instruct	30.5B	S	391.6 tok/s
Qwen 3.5 27B	27B	S	169.8 tok/s
Qwen 3.6 27B	27B	S	105.9 tok/s
Qwen 3.5 122B A10B	122B	S	104.1 tok/s

Frequently asked questions

Can Gaudi 3 128GB run Devstral Small 1.1?

Yes, Gaudi 3 128GB can run Devstral Small 1.1 with a S grade (Runs well). Expected decode speed: 190.2 tok/s.

How much VRAM does Devstral Small 1.1 need?

Devstral Small 1.1 (24B parameters) requires approximately 30.8 GB of memory with Q4_K_M quantization.

What is the best quantization for Devstral Small 1.1?

The recommended quantization for Devstral Small 1.1 is Q4_K_M, which balances quality and memory efficiency.

What speed will Devstral Small 1.1 run at on Gaudi 3 128GB?

On Gaudi 3 128GB, Devstral Small 1.1 achieves approximately 190.2 tokens per second decode speed with a time-to-first-token of 1018ms using Q4_K_M quantization.

Can Gaudi 3 128GB run Devstral Small 1.1 for coding?

For coding workloads, Devstral Small 1.1 on Gaudi 3 128GB receives a S grade with 190.2 tok/s and 131K context.

What context window can Devstral Small 1.1 use on Gaudi 3 128GB?

On Gaudi 3 128GB, Devstral Small 1.1 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 Devstral Small 1.1 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 Devstral Small 1.1?

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 Devstral Small 1.1

Embed this result▼

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

<iframe src="https://willitrunai.com/embed/devstral-small-2507-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: