Can starcoder2 15b instruct v0.1 run on NVIDIA H100 PCIe 80GB?

YES — Runs Great

C47Usable

○Estimated from fit model

starcoder2 15b instruct v0.1 needs ~20.1 GB VRAM. NVIDIA H100 PCIe 80GB has 80.0 GB. With Q4_K_M quantization, expect ~184 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) — 20.1 GB, 183.6 tok/s, Runs well

20.1 GB required80.0 GB available

25% VRAM used

Fit status

Runs well

Decode

183.6 tok/s

TTFT

1054 ms

Safe context

561K

Memory

20.1 GB / 80.0 GB

Memory breakdown

Weights9.2 GB

KV Cache1.8 GB

Runtime1.2 GB

Headroom8.0 GB

See how fast it feels

See how fast it feelsstarcoder2 15b instruct v0.1 on NVIDIA H100 PCIe 80GB
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: 183.6 tok/s decode · 1.1s TTFT (warm) · 459 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	183.6 tok/s	575 ms	561K
Coding	C	Runs well	183.6 tok/s	1054 ms	561K
Agentic Coding	C	Runs well	183.6 tok/s	1534 ms	561K
Reasoning	C	Runs well	183.6 tok/s	1246 ms	561K
RAG	C	Runs well	183.6 tok/s	1917 ms	561K

Quantization options

How starcoder2 15b instruct v0.1 (15B params) fits at each quantization level on NVIDIA H100 PCIe 80GB (80.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	5.9 GB	Low	D39
Q3_K_S	3	7.4 GB	Low	D40
NVFP4	4	8.4 GB	Medium	D40
Q4_K_M	4	9.2 GB	Medium	D40
Q5_K_M	5	10.8 GB	High	D40
Q6_K	6	12.3 GB	High	C40
Q8_0	8	16.1 GB	Very High	C41
F16Best for your GPU	16	30.7 GB	Maximum	C43

Get started

Copy-paste commands to run starcoder2 15b instruct v0.1 on your machine.

Run

lms load hf-bartowski--starcoder2-15b-instruct-v0-1-gguf && lms server start

Frequently asked questions

See all results for NVIDIA H100 PCIe 80GB See all hardware for starcoder2 15b instruct v0.1

URL: https://willitrunai.com/can-run/hf-bartowski--starcoder2-15b-instruct-v0-1-gguf-on-h100-pcie-80gb

⇱ starcoder2 15b instruct v0.1 on NVIDIA H100 PCIe 80GB? YES