RX 7900 XT 20GBBest value
20 GB VRAM (+4)800 GB/s (+600)
B
Raises estimated decode speed by about 208%.95.1 tok/s decode
Raises estimated decode speed by about 208%.
Adds memory headroom for longer context windows and future model growth.
~$899 MSRP
Can Yi Coder 9B run on NVIDIA A2 16GB?
YES — Runs Great
B63Good
○Estimated from fit model
Yi Coder 9B needs ~9.8 GB VRAM. NVIDIA A2 16GB has 16.0 GB. With Q4_K_M quantization, expect ~28 tok/s.
Runtime: OllamaCapacity: RoomyBandwidth: Very lowStack: BasicBottleneck: Memory bandwidth
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.
Select quantization to explore
Q4_K_M (Medium quality) — 9.8 GB, 30.9 tok/s, Runs well
9.8 GB required16.0 GB available
61% VRAM used
Fit status
Runs well
Decode
30.9 tok/s
TTFT
6265 ms
Safe context
84K
Memory
9.8 GB / 16.0 GB
Memory breakdown
Weights5.5 GB
KV Cache1.5 GB
Runtime1.2 GB
Headroom1.6 GB
See how fast it feels
See how fast it feelsYi Coder 9B on NVIDIA A2 16GB
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: 30.9 tok/s decode · 6.3s TTFT (warm) · 77 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 | B | Runs well | 28.4 tok/s | 3716 ms | 84K |
| Coding | B | Runs well | 28.4 tok/s | 6813 ms | 84K |
| Agentic Coding | B | Runs well | 28.4 tok/s | 9910 ms | 84K |
| Reasoning | B | Runs well | 28.4 tok/s | 8052 ms | 84K |
| RAG | B | Runs well | 28.4 tok/s | 12388 ms | 84K |
Quantization options
How Yi Coder 9B (9B params) fits at each quantization level on NVIDIA A2 16GB (16.0 GB usable).
| Quant | Bits | VRAM | Quality | Fit |
|---|---|---|---|---|
Q2_K | 2 | 3.5 GB | Low | B60 |
Q3_K_S | 3 | 4.4 GB | Low | B60 |
NVFP4 | 4 |
Get started
Copy-paste commands to run Yi Coder 9B on your machine.
Run
lms load Yi-Coder-9B-Chat && lms server startUpgrade options
