VOOZH about

URL: https://willitrunai.com/can-run/codegeex-4-9b-on-radeon-pro-w7500-8gb


Can CodeGeeX 4 9B run on Radeon Pro W7500 8GB?

YES — With Offload

A78Great
Estimated from fit model

CodeGeeX 4 9B needs ~7.8 GB VRAM. Radeon Pro W7500 8GB has 8.0 GB. With Q4_K_M quantization, expect ~26 tok/s.

Runtime: llama.cppCapacity: OffloadBandwidth: Very lowStack: StandardBottleneck: Memory bandwidth
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) — 7.8 GB, 26.3 tok/s, Runs with offload
7.8 GB required8.0 GB available
98% VRAM used

Fit status

Runs with offload

Decode

26.3 tok/s

TTFT

7353 ms

Safe context

21K

Memory

7.8 GB / 8.0 GB

Memory breakdown

Weights5.5 GB
KV Cache0.6 GB
Runtime0.9 GB
Headroom0.8 GB

See how fast it feels

See how fast it feelsCodeGeeX 4 9B on Radeon Pro W7500 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: 26.3 tok/s decode · 7.4s TTFT (warm) · 66 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

WorkloadGradeFitDecodeTTFTContext
ChatATight fit26.3 tok/s4011 ms21K
CodingARuns with offload26.3 tok/s7353 ms21K
Agentic CodingARuns with offload (needs ~0.3 GB host RAM)17.8 tok/s15845 ms21K
ReasoningARuns with offload26.3 tok/s8690 ms21K
RAGARuns with offload (needs ~0.3 GB host RAM)17.8 tok/s19806 ms

Quantization options

How CodeGeeX 4 9B (9B params) fits at each quantization level on Radeon Pro W7500 8GB (8.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
3.5 GB
LowA81
Q3_K_S
3
4.4 GB
LowA81
NVFP4Best for your GPU

Get started

Copy-paste commands to run CodeGeeX 4 9B on your machine.

Run

docker run --rm -it ghcr.io/ggerganov/llama.cpp:full \ --hf-repo "THUDM/codegeex4-all-9b" \ --hf-file "codegeex4-all-9b-Q4_K_M.gguf" \ -c 4096 -ngl 99

Frequently asked questions

See all results for Radeon Pro W7500 8GBSee all hardware for CodeGeeX 4 9B
21K
4
5.0 GB
Medium
A81
Q4_K_M
4
5.5 GB
MediumF0
Q5_K_M
5
6.5 GB
HighF0
Q6_K
6
7.4 GB
HighF0
Q8_0
8
9.6 GB
Very HighF0
F16
16
18.5 GB
MaximumF0

Buy headroom, not only minimum fit. A slightly larger memory tier gives you safer context growth and makes the recommendation more future-proof.