VOOZH about

URL: https://willitrunai.com/can-run/qwen-2.5-32b-on-radeon-pro-w6800-32gb

⇱ Qwen 2.5 32B on Radeon Pro W6800 32GB? TIGHT FIT


Can Qwen 2.5 32B run on Radeon Pro W6800 32GB?

YES — Tight Fit

A82Great
Estimated from fit model

Qwen 2.5 32B needs ~27.5 GB VRAM. Radeon Pro W6800 32GB has 32.0 GB. With Q4_K_M quantization, expect ~16 tok/s.

Runtime: llama.cppCapacity: TightBandwidth: MediumStack: 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) — 27.5 GB, 15.9 tok/s, Tight fit
27.5 GB required32.0 GB available
86% VRAM used

Fit status

Tight fit

Decode

15.9 tok/s

TTFT

12204 ms

Safe context

34K

Memory

27.5 GB / 32.0 GB

Memory breakdown

Weights19.5 GB
KV Cache3.9 GB
Runtime0.9 GB
Headroom3.2 GB

See how fast it feels

See how fast it feelsQwen 2.5 32B on Radeon Pro W6800 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: 15.9 tok/s decode · 12.2s TTFT (warm) · 40 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 well15.9 tok/s6657 ms34K
CodingATight fit15.9 tok/s12204 ms34K
Agentic CodingARuns with offload15.9 tok/s17751 ms34K
ReasoningATight fit15.9 tok/s14423 ms34K
RAGARuns with offload15.9 tok/s22189 ms34K

Quantization options

How Qwen 2.5 32B (32B params) fits at each quantization level on Radeon Pro W6800 32GB (32.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
12.5 GB
LowA81
Q3_K_S
3
15.7 GB
LowA83
NVFP4
4
17.9 GB
MediumA83
Q4_K_M
4
19.5 GB
MediumA83
Q5_K_MBest for your GPU
5
23.0 GB
HighA82
Q6_K
6
26.2 GB
HighF0
Q8_0
8
34.2 GB
Very HighF0
F16
16
65.6 GB
MaximumF0

Get started

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

Run

ollama run qwen2.5

Your hardware

More models your Radeon Pro W6800 32GB can run

ModelParamsGradeDecodeCapabilities
👁 Alibaba
Qwen 3.6 35B A3B
35BS36.4 tok/s
👁 Alibaba
Qwen 3.5 35B A3B
35BS39.6 tok/s

Frequently asked questions

See all results for Radeon Pro W6800 32GBSee all hardware for Qwen 2.5 32B