Can Qwen 3.6 27B run on Quadro RTX 8000 48GB?

YES — Runs Great

S91Excellent

○Estimated from fit model

Qwen 3.6 27B needs ~26.1 GB VRAM. Quadro RTX 8000 48GB has 48.0 GB. With Q4_K_M quantization, expect ~21 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: MediumStack: 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) — 23.1 GB, 23.1 tok/s, Runs well

23.1 GB required48.0 GB available

48% VRAM used

Fit status

Runs well

Decode

23.1 tok/s

TTFT

8376 ms

Safe context

262K

Memory

23.1 GB / 48.0 GB

Memory breakdown

Weights16.5 GB

KV Cache1.0 GB

Runtime0.9 GB

Headroom4.8 GB

See how fast it feels

See how fast it feelsQwen 3.6 27B on Quadro RTX 8000 48GB
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: 23.1 tok/s decode · 8.4s TTFT (warm) · 58 tok/s prefill

What limits this setup

This setup is broadly balanced for this model.

Older PCIe generation

PCIe 3.0 is workable, but it compounds the penalty when you offload heavily or try to scale across multiple cards.

Best improvement path

Performance by workload

Workload	Grade	Fit	Decode	TTFT	Context
Chat	S	Runs well	23.1 tok/s	4569 ms	262K
Coding	S	Runs well	21.3 tok/s	9074 ms	106K
Agentic Coding	S	Runs well	23.1 tok/s	12183 ms	262K
Reasoning	S	Runs well	23.1 tok/s	9899 ms	262K
RAG	S	Runs well	23.1 tok/s	15229 ms	262K

Quantization options

How Qwen 3.6 27B (27B params) fits at each quantization level on Quadro RTX 8000 48GB (48.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	10.5 GB	Low	S86
Q3_K_S	3	13.2 GB	Low	S86
NVFP4	4

Get started

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

Run

lms load Qwen3.6-27B && lms server start

Your hardware

More models your Quadro RTX 8000 48GB can run

Model	Params	Grade	Decode	Capabilities
👁 Alibaba Qwen3-Coder 30B A3B Instruct	30.5B	S	70.1 tok/s

Frequently asked questions

See all results for Quadro RTX 8000 48GB See all hardware for Qwen 3.6 27B

URL: https://willitrunai.com/can-run/qwen-3.6-27b-on-quadro-rtx-8000-48gb

⇱