Mac Studio M3 Ultra 256GBBudget pick
256 GB Unified (+76)
C
This setup is broadly balanced for this model.112 tok/s decode
~$6,999 MSRP
Can Granite 3.1 8B run on NVIDIA B200 180GB?
YES — Runs Great
C50Usable
○Estimated from fit model
Granite 3.1 8B needs ~26.0 GB VRAM. NVIDIA B200 180GB has 180.0 GB. With Q4_K_M quantization, expect ~112 tok/s.
Runtime: OllamaCapacity: RoomyBandwidth: HighStack: 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.
Select quantization to explore
Q4_K_M (Medium quality) — 26.0 GB, 112.0 tok/s, Runs well
26.0 GB required180.0 GB available
14% VRAM used
Fit status
Runs well
Decode
112.0 tok/s
TTFT
1729 ms
Safe context
128K
Memory
26.0 GB / 180.0 GB
Memory breakdown
Weights4.9 GB
KV Cache2.0 GB
Runtime1.2 GB
Headroom18.0 GB
See how fast it feels
See how fast it feelsGranite 3.1 8B on NVIDIA B200 180GB
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: 112.0 tok/s decode · 1.7s TTFT (warm) · 280 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 | 112.0 tok/s | 943 ms | 128K |
| Coding | C | Runs well | 112.0 tok/s | 1729 ms | 128K |
| Agentic Coding | C | Runs well | 112.0 tok/s | 2514 ms | 128K |
| Reasoning | C | Runs well | 112.0 tok/s | 2043 ms | 128K |
| RAG | C | Runs well | 112.0 tok/s | 3143 ms | 128K |
Quantization options
How Granite 3.1 8B (8B params) fits at each quantization level on NVIDIA B200 180GB (180.0 GB usable).
| Quant | Bits | VRAM | Quality | Fit |
|---|---|---|---|---|
Q2_K | 2 | 3.1 GB | Low | C42 |
Q3_K_S | 3 | 3.9 GB | Low | C42 |
NVFP4 | 4 |
Get started
Copy-paste commands to run Granite 3.1 8B on your machine.
Run
ollama run granite3.1-denseUpgrade options