Mac Studio M3 Ultra 96GBBudget pick
96 GB Unified (+48)819 GB/s (+147)
C
Adds memory headroom for longer context windows and future model growth.112 tok/s decode
Adds memory headroom for longer context windows and future model growth.
~$3,999 MSRP
Can granite 8b code instruct 4k run on Quadro RTX 8000 48GB?
YES — Runs Great
C47Usable
○Estimated from fit model
granite 8b code instruct 4k needs ~11.8 GB VRAM. Quadro RTX 8000 48GB has 48.0 GB. With Q4_K_M quantization, expect ~95 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.
Select quantization to explore
Q4_K_M (Medium quality) — 11.8 GB, 95.0 tok/s, Runs well
11.8 GB required48.0 GB available
25% VRAM used
Fit status
Runs well
Decode
95.0 tok/s
TTFT
2038 ms
Safe context
634K
Memory
11.8 GB / 48.0 GB
Memory breakdown
Weights4.9 GB
KV Cache0.9 GB
Runtime1.2 GB
Headroom4.8 GB
See how fast it feels
See how fast it feelsgranite 8b code instruct 4k on Quadro RTX 8000 48GB
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: 95.0 tok/s decode · 2.0s TTFT (warm) · 238 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 | C | Runs well | 95.0 tok/s | 1111 ms | 634K |
| Coding | C | Runs well | 95.0 tok/s | 2038 ms | 634K |
| Agentic Coding | C | Runs well | 95.0 tok/s | 2964 ms | 634K |
| Reasoning | C | Runs well | 95.0 tok/s | 2408 ms | 634K |
| RAG | C | Runs well | 95.0 tok/s | 3705 ms | 634K |
Quantization options
How granite 8b code instruct 4k (8B params) fits at each quantization level on Quadro RTX 8000 48GB (48.0 GB usable).
| Quant | Bits | VRAM | Quality | Fit |
|---|---|---|---|---|
Q2_K | 2 | 3.1 GB | Low | C41 |
Q3_K_S | 3 | 3.9 GB | Low | C41 |
NVFP4 | 4 |
Get started
Copy-paste commands to run granite 8b code instruct 4k on your machine.
Run
lms load hf-ibm-granite--granite-8b-code-instruct-4k-gguf && lms server startUpgrade options