Can starcoder2 15b i1 run on NVIDIA V100 32GB?

YES — Runs Great

C51Usable

○Estimated from fit model

starcoder2 15b i1 needs ~15.3 GB VRAM. NVIDIA V100 32GB has 32.0 GB. With Q4_K_M quantization, expect ~66 tok/s.

Runtime: OllamaCapacity: RoomyBandwidth: HighStack: 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) — 15.3 GB, 65.9 tok/s, Runs well

15.3 GB required32.0 GB available

48% VRAM used

Fit status

Runs well

Decode

65.9 tok/s

TTFT

2938 ms

Safe context

168K

Memory

15.3 GB / 32.0 GB

Memory breakdown

Weights9.2 GB

KV Cache1.8 GB

Runtime1.2 GB

Headroom3.2 GB

See how fast it feels

See how fast it feelsstarcoder2 15b i1 on NVIDIA V100 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: 65.9 tok/s decode · 2.9s TTFT (warm) · 165 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	C	Runs well	65.9 tok/s	1602 ms	168K
Coding	C	Runs well	65.9 tok/s	2938 ms	168K
Agentic Coding	C	Runs well	65.9 tok/s	4273 ms	168K
Reasoning	C	Runs well	65.9 tok/s	3472 ms	168K
RAG	C	Runs well	65.9 tok/s	5341 ms	168K

Quantization options

How starcoder2 15b i1 (15B params) fits at each quantization level on NVIDIA V100 32GB (32.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	5.9 GB	Low	C44
Q3_K_S	3	7.4 GB	Low	C44
NVFP4	4

Get started

Copy-paste commands to run starcoder2 15b i1 on your machine.

Run

lms load hf-mradermacher--starcoder2-15b-i1-gguf && lms server start

Frequently asked questions

See all results for NVIDIA V100 32GB See all hardware for starcoder2 15b i1

URL: https://willitrunai.com/can-run/hf-mradermacher--starcoder2-15b-i1-gguf-on-v100-32gb

⇱