VOOZH about

URL: https://willitrunai.com/can-run/hf-second-state--starcoder2-15b-gguf-on-a10-24gb


Can StarCoder2 15B run on NVIDIA A10 24GB?

YES — Runs Great

C53Usable
Estimated from fit model

StarCoder2 15B needs ~14.5 GB VRAM. NVIDIA A10 24GB has 24.0 GB. With Q4_K_M quantization, expect ~51 tok/s.

Runtime: OllamaCapacity: RoomyBandwidth: MediumStack: BasicBottleneck: Balanced
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.

Capabilities:

Select quantization to explore

Q4_K_M (Medium quality) — 14.5 GB, 51.1 tok/s, Runs well
14.5 GB required24.0 GB available
60% VRAM used

Fit status

Runs well

Decode

51.1 tok/s

TTFT

3785 ms

Safe context

102K

Memory

14.5 GB / 24.0 GB

Memory breakdown

Weights9.2 GB
KV Cache1.8 GB
Runtime1.2 GB
Headroom2.4 GB

See how fast it feels

See how fast it feelsStarCoder2 15B on NVIDIA A10 24GB
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: 51.1 tok/s decode · 3.8s TTFT (warm) · 128 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

WorkloadGradeFitDecodeTTFTContext
ChatCRuns well51.1 tok/s2065 ms102K
CodingCRuns well51.1 tok/s3785 ms102K
Agentic CodingCRuns well51.1 tok/s5506 ms102K
ReasoningCRuns well51.1 tok/s4473 ms102K
RAGCRuns well51.1 tok/s6882 ms102K

Quantization options

How StarCoder2 15B (15B params) fits at each quantization level on NVIDIA A10 24GB (24.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
5.9 GB
LowC46
Q3_K_S
3
7.4 GB
LowC47
NVFP4
4

Get started

Copy-paste commands to run StarCoder2 15B on your machine.

Run

lms load hf-second-state--starcoder2-15b-gguf && lms server start

Frequently asked questions

See all results for NVIDIA A10 24GBSee all hardware for StarCoder2 15B
8.4 GB
Medium
C47
Q4_K_M
4
9.2 GB
MediumC48
Q5_K_M
5
10.8 GB
HighC49
Q6_K
6
12.3 GB
HighC50
Q8_0Best for your GPU
8
16.1 GB
Very HighC50
F16
16
30.7 GB
MaximumF0