Can granite 8b code instruct 4k run on RX 6650 XT 8GB?

YES — Tight Fit

C50Usable

○Estimated from fit model

granite 8b code instruct 4k needs ~7.5 GB VRAM. RX 6650 XT 8GB has 8.0 GB. With Q4_K_M quantization, expect ~29 tok/s.

Runtime: llama.cppCapacity: TightBandwidth: LowStack: 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) — 7.5 GB, 29.3 tok/s, Tight fit

7.5 GB required8.0 GB available

94% VRAM used

Fit status

Tight fit

Decode

29.3 tok/s

TTFT

6616 ms

Safe context

24K

Memory

7.5 GB / 8.0 GB

Memory breakdown

Weights4.9 GB

KV Cache0.9 GB

Runtime0.9 GB

Headroom0.8 GB

See how fast it feels

See how fast it feelsgranite 8b code instruct 4k on RX 6650 XT 8GB
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: 29.3 tok/s decode · 6.6s TTFT (warm) · 73 tok/s prefill

What limits this setup

This setup is broadly balanced for this model.

Very little memory headroom

You can run the model, but there is not much room left for longer context, bigger batches, extra apps, or future model updates.

Best improvement path

Buy headroom, not only minimum fit

A slightly larger memory tier gives you safer context growth and makes the recommendation more future-proof.

Performance by workload

Workload	Grade	Fit	Decode	TTFT	Context
Chat	C	Tight fit	29.3 tok/s	3609 ms	24K
Coding	C	Tight fit	29.3 tok/s	6616 ms	24K
Agentic Coding	D	Runs with offload (needs ~0.3 GB host RAM)	19.5 tok/s	14416 ms	24K
Reasoning	C	Tight fit	29.3 tok/s	7819 ms	24K
RAG	D	Runs with offload (needs ~0.3 GB host RAM)	19.5 tok/s	18020 ms