VOOZH about

URL: https://willitrunai.com/can-run/granite-code-20b-on-instinct-mi300x-192gb

⇱ Granite Code 20B on AMD Instinct MI300X 192GB? YES


Can Granite Code 20B run on AMD Instinct MI300X 192GB?

YES — Runs Great

A75Great
Estimated from fit model

Granite Code 20B needs ~35.5 GB VRAM. AMD Instinct MI300X 192GB has 192.0 GB. With Q4_K_M quantization, expect ~280 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) — 35.5 GB, 280.0 tok/s, Runs well
35.5 GB required192.0 GB available
18% VRAM used

Fit status

Runs well

Decode

280.0 tok/s

TTFT

691 ms

Safe context

8K

Memory

35.5 GB / 192.0 GB

Memory breakdown

Weights12.2 GB
KV Cache3.2 GB
Runtime0.9 GB
Headroom19.2 GB

See how fast it feels

See how fast it feelsGranite Code 20B on AMD Instinct MI300X 192GB
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: 280.0 tok/s decode · 691ms TTFT (warm) · 700 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 well280.0 tok/s377 ms8K
CodingARuns well280.0 tok/s691 ms8K
Agentic CodingARuns well280.0 tok/s1006 ms8K
ReasoningARuns well280.0 tok/s817 ms8K
RAGARuns well280.0 tok/s1257 ms8K

Quantization options

How Granite Code 20B (20B params) fits at each quantization level on AMD Instinct MI300X 192GB (192.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
7.8 GB
LowB67
Q3_K_S
3
9.8 GB
LowB67
NVFP4
4
11.2 GB
MediumB67
Q4_K_M
4
12.2 GB
MediumB67
Q5_K_M
5
14.4 GB
HighB67
Q6_K
6
16.4 GB
HighB67
Q8_0
8
21.4 GB
Very HighB67
F16Best for your GPU
16
41.0 GB
MaximumB69

Get started

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

Run

ollama run granite-code:20b

Your hardware

More models your AMD Instinct MI300X 192GB can run

ModelParamsGradeDecodeCapabilities
👁 Mistral
Devstral 2 123B Instruct
123BS59.9 tok/s
👁 Alibaba
Qwen3-Coder 30B A3B Instruct
30.5BS625.1 tok/s
👁 Alibaba
Qwen 3.5 27B
27BS271.1 tok/s
👁 Alibaba
Qwen 3.6 27B
27BS169 tok/s
👁 Alibaba
Qwen 3.5 122B A10B
122BS166.2 tok/s

Frequently asked questions

See all results for AMD Instinct MI300X 192GBSee all hardware for Granite Code 20B