Can Qwen 3.5 35B A3B run on AMD Instinct MI60 32GB?

YES — Tight Fit

S95Excellent

○Estimated from fit model

Qwen 3.5 35B A3B needs ~26.9 GB VRAM. AMD Instinct MI60 32GB has 32.0 GB. With Q4_K_M quantization, expect ~69 tok/s.

Runtime: llama.cppCapacity: TightBandwidth: 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) — 26.9 GB, 69.3 tok/s, Tight fit

26.9 GB required32.0 GB available

84% VRAM used

Fit status

Tight fit

Decode

69.3 tok/s

TTFT

2792 ms

Safe context

72K

Memory

26.9 GB / 32.0 GB

Memory breakdown

Weights21.3 GB

KV Cache1.5 GB

Runtime0.9 GB

Headroom3.2 GB

See how fast it feels

See how fast it feelsQwen 3.5 35B A3B on AMD Instinct MI60 32GB
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: 69.3 tok/s decode · 2.8s TTFT (warm) · 173 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	69.3 tok/s	1523 ms	72K
Coding	S	Tight fit	69.3 tok/s	2792 ms	72K
Agentic Coding	S	Tight fit	69.3 tok/s	4061 ms	72K
Reasoning	S	Tight fit	69.3 tok/s	3300 ms	72K
RAG	S	Tight fit	69.3 tok/s	5076 ms	72K

Quantization options

How Qwen 3.5 35B A3B (35B params) fits at each quantization level on AMD Instinct MI60 32GB (32.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	13.7 GB	Low	S90
Q3_K_S	3	17.2 GB	Low	S91
NVFP4	4	19.6 GB	Medium	S91
Q4_K_M	4	21.3 GB	Medium	S90
Q5_K_MBest for your GPU	5	25.2 GB	High	S90
Q6_K	6	28.7 GB	High	F0
Q8_0	8	37.5 GB	Very High	F0
F16	16	71.8 GB	Maximum	F0

Get started

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

Run

ollama run qwen3.5:35b-a3b

Frequently asked questions

See all results for AMD Instinct MI60 32GB See all hardware for Qwen 3.5 35B A3B

URL: https://willitrunai.com/can-run/qwen-3.5-35b-a3b-on-instinct-mi60-32gb

⇱ Qwen 3.5 35B A3B on AMD Instinct MI60 32GB? TIGHT FIT