VOOZH about

URL: https://willitrunai.com/can-run/qwen-3.5-9b-on-b200-180gb


Can Qwen 3.5 9B run on NVIDIA B200 180GB?

YES — Runs Great

S87Excellent
Estimated from fit model

Qwen 3.5 9B needs ~26.9 GB VRAM. NVIDIA B200 180GB has 180.0 GB. With Q4_K_M quantization, expect ~126 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) — 26.9 GB, 126.0 tok/s, Runs well
26.9 GB required180.0 GB available
15% VRAM used

Fit status

Runs well

Decode

126.0 tok/s

TTFT

1537 ms

Safe context

131K

Memory

26.9 GB / 180.0 GB

Memory breakdown

Weights5.5 GB
KV Cache2.2 GB
Runtime1.2 GB
Headroom18.0 GB

See how fast it feels

See how fast it feelsQwen 3.5 9B on NVIDIA B200 180GB
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: 126.0 tok/s decode · 1.5s TTFT (warm) · 315 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 well126.0 tok/s838 ms131K
CodingSRuns well126.0 tok/s1537 ms131K
Agentic CodingSRuns well126.0 tok/s2235 ms131K
ReasoningSRuns well126.0 tok/s1816 ms131K
RAGSRuns well126.0 tok/s2794 ms131K

Quantization options

How Qwen 3.5 9B (9B params) fits at each quantization level on NVIDIA B200 180GB (180.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
3.5 GB
LowA79
Q3_K_S
3
4.4 GB
LowA79
NVFP4
4

Get started

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

Run

ollama run qwen3.5:9b

Your hardware

More models your NVIDIA B200 180GB can run

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

Frequently asked questions

See all results for NVIDIA B200 180GBSee all hardware for Qwen 3.5 9B
5.0 GB
Medium
A79
Q4_K_M
4
5.5 GB
MediumA79
Q5_K_M
5
6.5 GB
HighA79
Q6_K
6
7.4 GB
HighA79
Q8_0
8
9.6 GB
Very HighA79
F16Best for your GPU
16
18.5 GB
MaximumA79
1016.1 tok/s
👁 Alibaba
Qwen 3.5 27B
27BS378 tok/s
👁 Alibaba
Qwen 3.6 27B
27BS378 tok/s
👁 Alibaba
Qwen 3.5 122B A10B
122BS270.2 tok/s