VOOZH about

URL: https://willitrunai.com/can-run/qwen-3.5-27b-on-gh200-96gb


Can Qwen 3.5 27B run on NVIDIA GH200 96GB?

YES — Runs Great

S91Excellent
Estimated from fit model

Qwen 3.5 27B needs ~30.4 GB VRAM. NVIDIA GH200 96GB has 96.0 GB. With Q4_K_M quantization, expect ~197 tok/s.

Runtime: OllamaCapacity: RoomyBandwidth: HighStack: BasicBottleneck: 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) — 30.4 GB, 212.5 tok/s, Runs well
30.4 GB required96.0 GB available
32% VRAM used

Fit status

Runs well

Decode

212.5 tok/s

TTFT

911 ms

Safe context

131K

Memory

30.4 GB / 96.0 GB

Memory breakdown

Weights16.5 GB
KV Cache3.2 GB
Runtime1.2 GB
Headroom9.6 GB

See how fast it feels

See how fast it feelsQwen 3.5 27B on NVIDIA GH200 96GB
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: 212.5 tok/s decode · 911ms TTFT (warm) · 531 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
ChatSRuns well212.5 tok/s497 ms131K
CodingSRuns well196.7 tok/s984 ms131K
Agentic CodingSRuns well212.5 tok/s1325 ms131K
ReasoningSRuns well212.5 tok/s1077 ms131K
RAGSRuns well212.5 tok/s1657 ms131K

Quantization options

How Qwen 3.5 27B (27B params) fits at each quantization level on NVIDIA GH200 96GB (96.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
10.5 GB
LowA82
Q3_K_S
3
13.2 GB
LowA82
NVFP4
4

Get started

Copy-paste commands to run Qwen 3.5 27B on your machine.

Run

ollama run qwen3.5:27b

Your hardware

More models your NVIDIA GH200 96GB can run

ModelParamsGradeDecodeCapabilities
👁 Mistral
Devstral 2 123B Instruct
123BS47 tok/s
👁 Alibaba
Qwen3-Coder 30B A3B Instruct
30.5BS

Frequently asked questions

See all results for NVIDIA GH200 96GBSee all hardware for Qwen 3.5 27B
15.1 GB
Medium
A83
Q4_K_M
4
16.5 GB
MediumA83
Q5_K_M
5
19.4 GB
HighA83
Q6_K
6
22.1 GB
HighA83
Q8_0
8
28.9 GB
Very HighA85
F16Best for your GPU
16
55.4 GB
MaximumS90
489.9 tok/s