Can Qwen 3.5 122B A10B run on B100 192GB?

YES — Runs Great

S95Excellent

○Estimated from fit model

Qwen 3.5 122B A10B needs ~97.0 GB VRAM. B100 192GB has 192.0 GB. With Q4_K_M quantization, expect ~270 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: HighStack: StandardBottleneck: 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) — 97.0 GB, 270.2 tok/s, Runs well

97.0 GB required192.0 GB available

51% VRAM used

Fit status

Runs well

Decode

270.2 tok/s

TTFT

717 ms

Safe context

131K

Memory

97.0 GB / 192.0 GB

Memory breakdown

Weights74.4 GB

KV Cache2.4 GB

Runtime0.9 GB

Headroom19.2 GB

See how fast it feels

See how fast it feelsQwen 3.5 122B A10B on B100 192GB
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: 270.2 tok/s decode · 717ms TTFT (warm) · 675 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	S	Runs well	270.2 tok/s	391 ms	131K
Coding	S	Runs well	270.2 tok/s	717 ms	131K
Agentic Coding	S	Runs well	270.2 tok/s	1042 ms	131K
Reasoning	S	Runs well	270.2 tok/s	847 ms	131K
RAG	S	Runs well	270.2 tok/s	1303 ms	131K

Quantization options

How Qwen 3.5 122B A10B (122B params) fits at each quantization level on B100 192GB (192.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	47.6 GB	Low	A84
Q3_K_S	3	59.8 GB	Low	A85
NVFP4	4	68.3 GB	Medium	S86
Q4_K_M	4	74.4 GB	Medium	S87
Q5_K_M	5	87.8 GB	High	S88
Q6_K	6	100.0 GB	High	S89
Q8_0Best for your GPU	8	130.5 GB	Very High	S90
F16	16	250.1 GB	Maximum	F0

Get started

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

Run

lms load Qwen3.5-122B-A10B-Instruct && lms server start

Your hardware

More models your B100 192GB can run

Model	Params	Grade	Decode	Capabilities
👁 Mistral Devstral 2 123B Instruct	123B	S	97.4 tok/s

Frequently asked questions

See all results for B100 192GB See all hardware for Qwen 3.5 122B A10B

URL: https://willitrunai.com/can-run/qwen-3.5-122b-a10b-on-b100-192gb