Can Qwen 3.5 27B run on RTX A6000 48GB?

YES — Runs Great

S93Excellent

○Estimated from fit model

Qwen 3.5 27B needs ~25.6 GB VRAM. RTX A6000 48GB has 48.0 GB. With Q4_K_M quantization, expect ~38 tok/s.

Runtime: OllamaCapacity: RoomyBandwidth: MediumStack: 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) — 25.6 GB, 38.3 tok/s, Runs well

25.6 GB required48.0 GB available

53% VRAM used

Fit status

Runs well

Decode

38.3 tok/s

TTFT

5058 ms

Safe context

129K

Memory

25.6 GB / 48.0 GB

Memory breakdown

Weights16.5 GB

KV Cache3.2 GB

Runtime1.2 GB

Headroom4.8 GB

See how fast it feels

See how fast it feelsQwen 3.5 27B on RTX A6000 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: 38.3 tok/s decode · 5.1s TTFT (warm) · 96 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	38.3 tok/s	2759 ms	129K
Coding	S	Runs well	38.3 tok/s	5058 ms	129K
Agentic Coding	S	Runs well	38.3 tok/s	7357 ms	129K
Reasoning	S	Runs well	38.3 tok/s	5978 ms	129K
RAG	S	Runs well	38.3 tok/s	9197 ms	129K

Quantization options

How Qwen 3.5 27B (27B params) fits at each quantization level on RTX A6000 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	S87
NVFP4	4	15.1 GB	Medium	S87
Q4_K_M	4	16.5 GB	Medium	S88
Q5_K_M	5	19.4 GB	High	S89
Q6_K	6	22.1 GB	High	S89
Q8_0Best for your GPU	8	28.9 GB	Very High	S91
F16	16	55.4 GB	Maximum	F0

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 RTX A6000 48GB can run

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

Frequently asked questions

See all results for RTX A6000 48GB See all hardware for Qwen 3.5 27B

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