MacBook Pro M4 Max 48GBBudget pick
48 GB Unified (+16)
C
This setup is broadly balanced for this model.76.8 tok/s decode
~$2,499 MSRP
Can granite 8b code instruct 4k run on AMD Instinct MI60 32GB?
YES — Runs Great
C48Usable
○Estimated from fit model
granite 8b code instruct 4k needs ~9.9 GB VRAM. AMD Instinct MI60 32GB has 32.0 GB. With Q4_K_M quantization, expect ~103 tok/s.
Runtime: llama.cppCapacity: RoomyBandwidth: HighStack: 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) — 9.9 GB, 102.8 tok/s, Runs well
9.9 GB required32.0 GB available
31% VRAM used
Fit status
Runs well
Decode
102.8 tok/s
TTFT
1883 ms
Safe context
393K
Memory
9.9 GB / 32.0 GB
Memory breakdown
Weights4.9 GB
KV Cache0.9 GB
Runtime0.9 GB
Headroom3.2 GB
See how fast it feels
See how fast it feelsgranite 8b code instruct 4k on AMD Instinct MI60 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: 102.8 tok/s decode · 1.9s TTFT (warm) · 257 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 | 102.8 tok/s | 1027 ms | 393K |
| Coding | C | Runs well | 102.8 tok/s | 1883 ms | 393K |
| Agentic Coding | C | Runs well | 102.8 tok/s | 2739 ms | 393K |
| Reasoning | C | Runs well | 102.8 tok/s | 2225 ms | 393K |
| RAG | C | Runs well | 102.8 tok/s | 3423 ms | 393K |
Quantization options
How granite 8b code instruct 4k (8B params) fits at each quantization level on AMD Instinct MI60 32GB (32.0 GB usable).
| Quant | Bits | VRAM | Quality | Fit |
|---|---|---|---|---|
Q2_K | 2 | 3.1 GB | Low | C43 |
Q3_K_S | 3 | 3.9 GB | Low | C43 |
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