Can CodeGeeX 4 9B run on GTX 1080 Ti 11GB?

YES — Runs Great

A83Great

○Estimated from fit model

CodeGeeX 4 9B needs ~8.4 GB VRAM. GTX 1080 Ti 11GB has 11.0 GB. With Q4_K_M quantization, expect ~57 tok/s.

Runtime: OllamaCapacity: RoomyBandwidth: MediumStack: BasicBottleneck: 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) — 8.4 GB, 56.9 tok/s, Runs well

8.4 GB required11.0 GB available

76% VRAM used

Fit status

Runs well

Decode

56.9 tok/s

TTFT

3403 ms

Safe context

84K

Memory

8.4 GB / 11.0 GB

Memory breakdown

Weights5.5 GB

KV Cache0.6 GB

Runtime1.2 GB

Headroom1.1 GB

See how fast it feels

See how fast it feelsCodeGeeX 4 9B on GTX 1080 Ti 11GB
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: 56.9 tok/s decode · 3.4s TTFT (warm) · 142 tok/s prefill

What limits this setup

This setup is broadly balanced for this model.

Older PCIe generation

PCIe 3.0 is workable, but it compounds the penalty when you offload heavily or try to scale across multiple cards.

Best improvement path

Performance by workload

Workload	Grade	Fit	Decode	TTFT	Context
Chat	A	Runs well	56.9 tok/s	1856 ms	84K
Coding	A	Runs well	56.9 tok/s	3403 ms	84K
Agentic Coding	A	Runs well	56.9 tok/s	4950 ms	84K
Reasoning	A	Runs well	56.9 tok/s	4022 ms	84K
RAG	A	Runs well	56.9 tok/s	6187 ms	84K

Quantization options

How CodeGeeX 4 9B (9B params) fits at each quantization level on GTX 1080 Ti 11GB (11.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	3.5 GB	Low	A79
Q3_K_S	3	4.4 GB	Low	A80
NVFP4	4

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 GTX 1080 Ti 11GB See all hardware for CodeGeeX 4 9B

URL: https://willitrunai.com/can-run/codegeex-4-9b-on-gtx-1080-ti-11gb

⇱