Can Granite 4.1 3B run on NVIDIA A40 48GB?

YES — Runs Great

B60Good

○Estimated from fit model

Granite 4.1 3B needs ~9.1 GB VRAM. NVIDIA A40 48GB has 48.0 GB. With Q4_K_M quantization, expect ~42 tok/s.

Runtime: OllamaCapacity: RoomyBandwidth: MediumStack: 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) — 9.1 GB, 42.0 tok/s, Runs well

9.1 GB required48.0 GB available

19% VRAM used

Fit status

Runs well

Decode

42.0 tok/s

TTFT

4610 ms

Safe context

131K

Memory

9.1 GB / 48.0 GB

Memory breakdown

Weights1.8 GB

KV Cache1.2 GB

Runtime1.2 GB

Headroom4.8 GB

See how fast it feels

See how fast it feelsGranite 4.1 3B on NVIDIA A40 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: 42.0 tok/s decode · 4.6s TTFT (warm) · 105 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	B	Runs well	42.0 tok/s	2514 ms	131K
Coding	B	Runs well	42.0 tok/s	4610 ms	131K
Agentic Coding	B	Runs well	42.0 tok/s	6705 ms	131K
Reasoning	B	Runs well	42.0 tok/s	5448 ms	131K
RAG	B	Runs well	42.0 tok/s	8381 ms	131K