VOOZH about

URL: https://willitrunai.com/can-run/granite-code-8b-on-instinct-mi350x-288gb

⇱ Granite Code 8B on AMD Instinct MI350X 288GB? YES


Can Granite Code 8B run on AMD Instinct MI350X 288GB?

YES — Runs Great

B70Good
Estimated from fit model

Granite Code 8B needs ~36.5 GB VRAM. AMD Instinct MI350X 288GB has 288.0 GB. With Q4_K_M quantization, expect ~112 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) — 36.5 GB, 112.0 tok/s, Runs well
36.5 GB required288.0 GB available
13% VRAM used

Fit status

Runs well

Decode

112.0 tok/s

TTFT

1729 ms

Safe context

8K

Memory

36.5 GB / 288.0 GB

Memory breakdown

Weights4.9 GB
KV Cache2.0 GB
Runtime0.9 GB
Headroom28.8 GB

See how fast it feels

See how fast it feelsGranite Code 8B on AMD Instinct MI350X 288GB
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: 112.0 tok/s decode · 1.7s TTFT (warm) · 280 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
ChatBRuns well112.0 tok/s943 ms8K
CodingBRuns well112.0 tok/s1729 ms8K
Agentic CodingBRuns well112.0 tok/s2514 ms8K
ReasoningBRuns well112.0 tok/s2043 ms8K
RAGBRuns well112.0 tok/s3143 ms8K

Quantization options

How Granite Code 8B (8B params) fits at each quantization level on AMD Instinct MI350X 288GB (288.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
3.1 GB
LowB61
Q3_K_S
3
3.9 GB
LowB61
NVFP4
4
4.5 GB
MediumB61
Q4_K_M
4
4.9 GB
MediumB61
Q5_K_M
5
5.8 GB
HighB61
Q6_K
6
6.6 GB
HighB61
Q8_0
8
8.6 GB
Very HighB61
F16Best for your GPU
16
16.4 GB
MaximumB61

Get started

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

Run

ollama run granite-code:8b

Frequently asked questions

See all results for AMD Instinct MI350X 288GBSee all hardware for Granite Code 8B