VOOZH about

URL: https://willitrunai.com/can-run/devstral-small-2507-on-rtx-5000-ada-32gb

⇱ Devstral Small 1.1 on RTX 5000 Ada 32GB? YES


Can Devstral Small 1.1 run on RTX 5000 Ada 32GB?

YES — Runs Great

S93Excellent
Estimated from fit model

Devstral Small 1.1 needs ~21.5 GB VRAM. RTX 5000 Ada 32GB has 32.0 GB. With Q4_K_M quantization, expect ~34 tok/s.

Runtime: OllamaCapacity: RoomyBandwidth: MediumStack: BasicBottleneck: 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) — 21.5 GB, 33.8 tok/s, Runs well
21.5 GB required32.0 GB available
67% VRAM used

Fit status

Runs well

Decode

33.8 tok/s

TTFT

5722 ms

Safe context

85K

Memory

21.5 GB / 32.0 GB

Memory breakdown

Weights14.6 GB
KV Cache2.4 GB
Runtime1.2 GB
Headroom3.2 GB

See how fast it feels

See how fast it feelsDevstral Small 1.1 on RTX 5000 Ada 32GB
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: 33.8 tok/s decode · 5.7s TTFT (warm) · 85 tok/s prefill

What limits this setup

This setup is broadly balanced for this model.

No major red flags

This recommendation has enough memory headroom and acceptable estimated speed for the selected workload.

Best improvement path

Performance by workload

WorkloadGradeFitDecodeTTFTContext
ChatSRuns well33.8 tok/s3121 ms85K
CodingSRuns well33.8 tok/s5722 ms85K
Agentic CodingSRuns well33.8 tok/s8322 ms85K
ReasoningSRuns well33.8 tok/s6762 ms85K
RAGSRuns well33.8 tok/s10403 ms85K

Quantization options

How Devstral Small 1.1 (24B params) fits at each quantization level on RTX 5000 Ada 32GB (32.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
9.4 GB
LowS85
Q3_K_S
3
11.8 GB
LowS86
NVFP4
4
13.4 GB
MediumS87
Q4_K_M
4
14.6 GB
MediumS88
Q5_K_M
5
17.3 GB
HighS89
Q6_K
6
19.7 GB
HighS89
Q8_0Best for your GPU
8
25.7 GB
Very HighS88
F16
16
49.2 GB
MaximumF0

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 RTX 5000 Ada 32GB can run

ModelParamsGradeDecodeCapabilities
👁 Alibaba
Qwen3-Coder 30B A3B Instruct
30.5BS69.7 tok/s
👁 Alibaba
Qwen 3.5 27B
27BS30.2 tok/s
👁 Alibaba
Qwen 3.6 27B
27BS30.3 tok/s
👁 Alibaba
Qwen 3.6 35B A3B
35BS58.6 tok/s
👁 Alibaba
Qwen3-VL 30B A3B Instruct
30BS72.1 tok/s

Frequently asked questions

See all results for RTX 5000 Ada 32GBSee all hardware for Devstral Small 1.1