12 GB VRAM (+1)672 GB/s (+188)
B
Raises estimated decode speed by about 48%.107.2 tok/s decode
Raises estimated decode speed by about 48%.
~$549 MSRP
Can Granite 3.1 8B run on GTX 1080 Ti 11GB?
YES — Runs Great
B60Good
○Estimated from fit model
Granite 3.1 8B needs ~8.8 GB VRAM. GTX 1080 Ti 11GB has 11.0 GB. With Q4_K_M quantization, expect ~67 tok/s.
Runtime: llama.cppCapacity: RoomyBandwidth: MediumStack: StandardBottleneck: 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.
Select quantization to explore
Q4_K_M (Medium quality) — 8.8 GB, 72.3 tok/s, Runs well
8.8 GB required11.0 GB available
80% VRAM used
Fit status
Runs well
Decode
72.3 tok/s
TTFT
2676 ms
Safe context
34K
Memory
8.8 GB / 11.0 GB
Memory breakdown
Weights4.9 GB
KV Cache2.0 GB
Runtime0.9 GB
Headroom1.1 GB
See how fast it feels
See how fast it feelsGranite 3.1 8B on GTX 1080 Ti 11GB
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: 72.3 tok/s decode · 2.7s TTFT (warm) · 181 tok/s prefill
What limits this setup
This setup is broadly balanced for this model.
Older PCIe generation
PCIe 3.0 is workable, but it compounds the penalty when you offload heavily or try to scale across multiple cards.
Best improvement path
Performance by workload
| Workload | Grade | Fit | Decode | TTFT | Context |
|---|---|---|---|---|---|
| Chat | B | Runs well | 72.3 tok/s | 1460 ms | 34K |
| Coding | B | Runs well | 67.3 tok/s | 2877 ms | 34K |
| Agentic Coding | B | Runs with offload | 72.3 tok/s | 3893 ms | 34K |
| Reasoning | B | Runs well | 72.3 tok/s | 3163 ms | 34K |
| RAG | B | Runs with offload | 72.3 tok/s | 4866 ms | 34K |
Quantization options
How Granite 3.1 8B (8B params) fits at each quantization level on GTX 1080 Ti 11GB (11.0 GB usable).
| Quant | Bits | VRAM | Quality | Fit |
|---|---|---|---|---|
Q2_K | 2 | 3.1 GB | Low | C55 |
Q3_K_S | 3 | 3.9 GB | Low | B56 |
NVFP4 | 4 |
Get started
Copy-paste commands to run Granite 3.1 8B on your machine.
Run
ollama run granite3.1-denseUpgrade options