Can Granite Code 8B run on Radeon Pro W6800 32GB?

YES — Runs Great

A73Great

○Estimated from fit model

Granite Code 8B needs ~10.9 GB VRAM. Radeon Pro W6800 32GB has 32.0 GB. With Q4_K_M quantization, expect ~63 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: MediumStack: 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) — 10.9 GB, 63.2 tok/s, Runs well

10.9 GB required32.0 GB available

34% VRAM used

Fit status

Runs well

Decode

63.2 tok/s

TTFT

3065 ms

Safe context

Memory

10.9 GB / 32.0 GB

Memory breakdown

Weights4.9 GB

KV Cache2.0 GB

Runtime0.9 GB

Headroom3.2 GB

See how fast it feels

See how fast it feelsGranite Code 8B 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: 63.2 tok/s decode · 3.1s TTFT (warm) · 158 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

Workload	Grade	Fit	Decode	TTFT	Context
Chat	A	Runs well	63.2 tok/s	1672 ms	8K
Coding	A	Runs well	63.2 tok/s	3065 ms	8K
Agentic Coding	A	Runs well	63.2 tok/s	4458 ms	8K
Reasoning	A	Runs well	63.2 tok/s	3623 ms	8K
RAG	A	Runs well	63.2 tok/s	5573 ms	8K

Quantization options

How Granite Code 8B (8B params) fits at each quantization level on Radeon Pro W6800 32GB (32.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	3.1 GB	Low	B68
Q3_K_S	3	3.9 GB	Low	B68
NVFP4	4

Get started

Copy-paste commands to run Granite Code 8B on your machine.

Run

ollama run granite-code:8b

Your hardware

More models your Radeon Pro W6800 32GB can run

Model	Params	Grade	Decode	Capabilities
👁 Alibaba Qwen3-Coder 30B A3B Instruct	30.5B	S	43.4 tok/s
👁 Alibaba Qwen 3.5 27B	27B	S	18.8 tok/s

Frequently asked questions

See all results for Radeon Pro W6800 32GB See all hardware for Granite Code 8B

URL: https://willitrunai.com/can-run/granite-code-8b-on-radeon-pro-w6800-32gb

⇱