VOOZH about

URL: https://willitrunai.com/can-run/hf-bartowski--internlm-januscoder-14b-gguf-on-rx-7900-xtx-24gb

⇱ internlm JanusCoder 14B on RX 7900 XTX 24GB? YES


Can internlm JanusCoder 14B run on RX 7900 XTX 24GB?

YES — Runs Great

C53Usable
Estimated from fit model

internlm JanusCoder 14B needs ~13.5 GB VRAM. RX 7900 XTX 24GB has 24.0 GB. With Q4_K_M quantization, expect ~81 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) — 13.5 GB, 80.9 tok/s, Runs well
13.5 GB required24.0 GB available
56% VRAM used

Fit status

Runs well

Decode

80.9 tok/s

TTFT

2392 ms

Safe context

119K

Memory

13.5 GB / 24.0 GB

Memory breakdown

Weights8.5 GB
KV Cache1.6 GB
Runtime0.9 GB
Headroom2.4 GB

See how fast it feels

See how fast it feelsinternlm JanusCoder 14B on RX 7900 XTX 24GB
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: 80.9 tok/s decode · 2.4s TTFT (warm) · 202 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
ChatCRuns well80.9 tok/s1305 ms119K
CodingCRuns well80.9 tok/s2392 ms119K
Agentic CodingCRuns well80.9 tok/s3479 ms119K
ReasoningCRuns well80.9 tok/s2827 ms119K
RAGCRuns well80.9 tok/s4349 ms119K

Quantization options

How internlm JanusCoder 14B (14B params) fits at each quantization level on RX 7900 XTX 24GB (24.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
5.5 GB
LowC45
Q3_K_S
3
6.9 GB
LowC46
NVFP4
4
7.8 GB
MediumC47
Q4_K_M
4
8.5 GB
MediumC47
Q5_K_M
5
10.1 GB
HighC48
Q6_K
6
11.5 GB
HighC49
Q8_0Best for your GPU
8
15.0 GB
Very HighC50
F16
16
28.7 GB
MaximumF0

Get started

Copy-paste commands to run internlm JanusCoder 14B on your machine.

Run

lms load hf-bartowski--internlm-januscoder-14b-gguf && lms server start

Frequently asked questions

See all results for RX 7900 XTX 24GBSee all hardware for internlm JanusCoder 14B