Can internlm JanusCoder 14B run on NVIDIA A800 80GB?

YES — Runs Great

C47Usable

○Estimated from fit model

internlm JanusCoder 14B needs ~19.4 GB VRAM. NVIDIA A800 80GB has 80.0 GB. With Q4_K_M quantization, expect ~177 tok/s.

Runtime: OllamaCapacity: RoomyBandwidth: HighStack: 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) — 19.4 GB, 176.7 tok/s, Runs well

19.4 GB required80.0 GB available

24% VRAM used

Fit status

Runs well

Decode

176.7 tok/s

TTFT

1095 ms

Safe context

607K

Memory

19.4 GB / 80.0 GB

Memory breakdown

Weights8.5 GB

KV Cache1.6 GB

Runtime1.2 GB

Headroom8.0 GB

See how fast it feels

See how fast it feelsinternlm JanusCoder 14B on NVIDIA A800 80GB
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: 176.7 tok/s decode · 1.1s TTFT (warm) · 442 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

Workload	Grade	Fit	Decode	TTFT	Context
Chat	C	Runs well	176.7 tok/s	598 ms	607K
Coding	C	Runs well	176.7 tok/s	1095 ms	607K
Agentic Coding	C	Runs well	176.7 tok/s	1593 ms	607K
Reasoning	C	Runs well	176.7 tok/s	1295 ms	607K
RAG	C	Runs well	176.7 tok/s	1992 ms	607K

Quantization options

How internlm JanusCoder 14B (14B params) fits at each quantization level on NVIDIA A800 80GB (80.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	5.5 GB	Low	D39
Q3_K_S	3	6.9 GB	Low	D39
NVFP4	4

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 NVIDIA A800 80GB See all hardware for internlm JanusCoder 14B

URL: https://willitrunai.com/can-run/hf-bartowski--internlm-januscoder-14b-gguf-on-a800-80gb

⇱