VOOZH about

URL: https://willitrunai.com/can-run/qwen-2.5-coder-32b-on-instinct-mi300a-128gb

⇱ Qwen 2.5 Coder 32B on AMD Instinct MI300A 128GB? YES


Can Qwen 2.5 Coder 32B run on AMD Instinct MI300A 128GB?

YES — Runs Great

A76Great
Estimated from fit model

Qwen 2.5 Coder 32B needs ~37.1 GB VRAM. AMD Instinct MI300A 128GB has 128.0 GB. With Q4_K_M quantization, expect ~205 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) — 37.1 GB, 205.3 tok/s, Runs well
37.1 GB required128.0 GB available
29% VRAM used

Fit status

Runs well

Decode

205.3 tok/s

TTFT

943 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 AMD Instinct MI300A 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: 205.3 tok/s decode · 943ms TTFT (warm) · 513 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
ChatARuns well205.3 tok/s514 ms131K
CodingARuns well205.3 tok/s943 ms131K
Agentic CodingARuns well205.3 tok/s1372 ms131K
ReasoningARuns well205.3 tok/s1115 ms131K
RAGARuns well205.3 tok/s1715 ms131K

Quantization options

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

QuantBitsVRAMQualityFit
Q2_K
2
12.5 GB
LowB66
Q3_K_S
3
15.7 GB
LowB67
NVFP4
4
17.9 GB
MediumB67
Q4_K_M
4
19.5 GB
MediumB67
Q5_K_M
5
23.0 GB
HighB67
Q6_K
6
26.2 GB
HighB68
Q8_0
8
34.2 GB
Very HighB69
F16Best for your GPU
16
65.6 GB
MaximumA74

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 AMD Instinct MI300A 128GB can run

ModelParamsGradeDecodeCapabilities
👁 Mistral
Devstral 2 123B Instruct
123BS53.8 tok/s
👁 Alibaba
Qwen 3.5 122B A10B
122BS149.2 tok/s
👁 Alibaba
Qwen 3.6 35B A3B
35BS471.5 tok/s
👁 Alibaba
Qwen 3.5 35B A3B
35BS512.7 tok/s
👁 Mistral
Mistral Small 4 119B
119BS161.7 tok/s

Frequently asked questions

See all results for AMD Instinct MI300A 128GBSee all hardware for Qwen 2.5 Coder 32B