VOOZH about

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


Can LFM2 24B run on Radeon Pro W6800 32GB?

YES — Runs Great

A85Great
Estimated from fit model

LFM2 24B needs ~21.2 GB VRAM. Radeon Pro W6800 32GB has 32.0 GB. With Q4_K_M quantization, expect ~21 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: 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) — 21.2 GB, 21.1 tok/s, Runs well
21.2 GB required32.0 GB available
66% VRAM used

Fit status

Runs well

Decode

21.1 tok/s

TTFT

9196 ms

Safe context

87K

Memory

21.2 GB / 32.0 GB

Memory breakdown

Weights14.6 GB
KV Cache2.4 GB
Runtime0.9 GB
Headroom3.2 GB

See how fast it feels

See how fast it feelsLFM2 24B 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: 21.1 tok/s decode · 9.2s TTFT (warm) · 53 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 well21.1 tok/s5016 ms87K
CodingARuns well21.1 tok/s9196 ms87K
Agentic CodingSRuns well21.1 tok/s13375 ms87K
ReasoningARuns well21.1 tok/s10868 ms87K
RAGSRuns well21.1 tok/s16719 ms87K

Quantization options

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

QuantBitsVRAMQualityFit
Q2_K
2
9.4 GB
LowA79
Q3_K_S
3
11.8 GB
LowA80
NVFP4
4

Get started

Copy-paste commands to run LFM2 24B on your machine.

Run

ollama run lfm2

Your hardware

More models your Radeon Pro W6800 32GB can run

ModelParamsGradeDecodeCapabilities
👁 Alibaba
Qwen3-Coder 30B A3B Instruct
30.5BS43.4 tok/s
👁 Alibaba
Qwen 3.5 27B
27BS18.8 tok/s

Frequently asked questions

See all results for Radeon Pro W6800 32GBSee all hardware for LFM2 24B
13.4 GB
Medium
A81
Q4_K_M
4
14.6 GB
MediumA82
Q5_K_M
5
17.3 GB
HighA83
Q6_K
6
19.7 GB
HighA82
Q8_0Best for your GPU
8
25.7 GB
Very HighA82
F16
16
49.2 GB
MaximumF0
👁 Alibaba
Qwen 3.6 27B
27BS14.3 tok/s
👁 Alibaba
Qwen 3.6 35B A3B
35BS36.4 tok/s
👁 Alibaba
Qwen3-VL 30B A3B Instruct
30BS44.8 tok/s