NCA-AIIO domain - 22% of the exam

AI Operations

AI Operations is 22% of the NCA-AIIO exam. These are the objectives it covers, each with practice questions, with every answer explained.

The domain in numbers

45
Practice questions
4
Objectives
45
Medium

Where people go wrong

  • Treating time-slicing or MPS as hardware isolation

    Time-sliced vGPU, CUDA MPS and full passthrough are offered where hardware-isolated sharing is required. Time-slicing rotates access to the whole GPU, so one tenant's memory pressure can affect others and no share is guaranteed. MPS gives no memory isolation between clients. Passthrough isolates but serves one tenant. Multi-Instance GPU partitions compute, memory and cache into dedicated instances with guaranteed throughput. The reverse trap also appears: MIG instances are statically allocated, so where strict isolation is not required and loads are bursty, time-sliced vGPU lets active tenants reclaim idle slices.

    See it in a sample question
  • Inferring throttling or efficiency from a secondary signal

    The wrong answers read throttling, or poor compute efficiency, from a neighbouring metric. Utilisation only reports that the SMs were busy for a fraction of the time, so it shows neither a clock reduction nor how densely the arithmetic units were fed; occupancy or pipe-utilisation profiling answers that. Power at the limit, memory occupancy and high temperature do not confirm lowered clocks. The clock throttle-reason flags in DCGM and NVML name the active cause, such as thermal slowdown or a software power cap, even when temperature is within range.

    See it in a sample question
  • Using passive telemetry where an active DCGM test is needed

    Prometheus-style polling, XID history, health watches, field groups and profiling metrics only report what a GPU is doing or has already done, and persistence mode only keeps the driver loaded. None of them exercises the hardware. DCGM diagnostics run active test suites that load memory, compute and interconnect links, and return a pass or fail verdict before a new or suspect node accepts jobs. Passive telemetry cannot provoke a latent defect, so it cannot qualify a node.

    See it in a sample question
  • Swapping gang scheduling, backfill, preemption and fair-share

    Each scheduling policy gets credited with another's job. Gang scheduling starts all of a job's processes together, so a partial allocation cannot stall a distributed job. Backfill runs shorter low-priority jobs in idle slots before a reserved start and never evicts anything. Preemption with requeue reclaims nodes from running lower-priority jobs, and checkpointing lets them resume. Fair-share only adjusts priority from past usage over time and never interrupts a job that is already running.

    See it in a sample question
  • Relying on spreading or anti-affinity to protect GPU nodes

    Spreading, anti-affinity and priority are chosen to keep GPU capacity usable, and each misses. Spreading leaves one free GPU per node, which blocks a pod that needs eight free GPUs on one node; bin-packing small pods onto as few nodes as possible keeps whole nodes free. Anti-affinity only separates pods from one another. Priority with preemption acts only after other pods have landed, by evicting them. A taint on the GPU nodes, with a matching toleration on GPU workloads, repels every pod without that toleration.

    See it in a sample question

Objectives in this domain

What to study

The official documents this domain's practice questions cite most.

Sample questions from this domain

Free sampleAI Operationsmedium

A cloud provider needs to share a single A100 GPU among seven independent tenants running small inference workloads, with each tenant requiring guaranteed memory and compute bandwidth that cannot be affected by a noisy neighbour. Which virtualisation approach best meets this requirement?

  • AMulti-Instance GPU partitioning, creating up to seven hardware-isolated compute and memory slices on the GPU Correct
  • BNVIDIA vGPU in time-sliced mode, assigning each tenant a virtual GPU profile
  • CFull GPU passthrough, dedicating the entire physical GPU to a single virtual machine
  • DCUDA Multi-Process Service, allowing multiple CUDA processes to share GPU context simultaneously
Distinguish MIG hardware partitioning from vGPU time-slicing and other sharing mechanisms for multi-tenant isolation guarantees. Multi-Instance GPU is a hardware feature available on Ampere and later NVIDIA data-centre GPUs that partitions a physical GPU into up to seven fully isolated instances, each with its own memory slice, L2 cache partition, and compute engines. Because the partition boundaries are enforced in silicon, one instance cannot read, write, or saturate the resources of another. This deterministic isolation is the defining property that makes MIG the correct choice when tenants require guaranteed, interference-free performance. vGPU time-slicing and CUDA MPS share resources in software and therefore cannot provide the same hard isolation guarantees.

Why A is correct: MIG uses hardware mechanisms in Ampere and later GPUs to divide a single physical GPU into isolated instances, each with its own dedicated compute engines, memory slice, and cache. This prevents cross-tenant interference and provides the guaranteed performance isolation required for multi-tenant inference.

Why B is wrong: vGPU time-slicing is tempting because it divides a GPU across many tenants, but time-sliced vGPU does not provide hardware-level memory partitioning, so one tenant's memory pressure can affect others and there is no guaranteed bandwidth isolation.

Why C is wrong: Full passthrough gives maximum performance and true isolation for one tenant, but it cannot serve multiple tenants simultaneously on the same physical GPU, making it unsuitable when seven tenants must share one device.

Why D is wrong: CUDA MPS enables concurrent GPU sharing among processes on the same machine but provides no memory isolation between clients. A misbehaving tenant can corrupt another tenant's memory, making it unsuitable where strict isolation is required.

Free sampleAI Operationsmedium

An operations team monitors a fleet of training GPUs and wants a single early-warning signal that a GPU is being forced to reduce its clock speed because it has reached a hardware-protective limit. They already collect temperature, power draw, and utilisation. Which additional telemetry signal most directly tells them that a GPU is actively throttling rather than simply running warm or busy?

  • AThe instantaneous SM (streaming multiprocessor) utilisation percentage, because a GPU that is throttling will show utilisation pinned at 100 per cent while its effective work falls.
  • BThe board power draw in watts, because any value at or near the configured power limit confirms the GPU is throttling to protect itself.
  • CThe clock throttle-reason flags, because they explicitly report why the current clock is being held down, including thermal, power-cap, or hardware-slowdown causes. Correct
  • DThe GPU memory utilisation percentage, because memory pressure is the usual trigger that forces the scheduler to lower the core clock.
Clock throttle-reason flags are the telemetry that explicitly confirms a GPU is reducing its clock and identifies the protective cause. Throttling is a state where the GPU lowers its clock to stay within thermal, power, or reliability limits. DCGM and NVML expose a throttle-reason bitmask that names the active cause, so it directly confirms and diagnoses throttling, whereas temperature, power, and utilisation only hint at it indirectly.

Why A is wrong: Tempting because utilisation feels like the headline activity metric, but utilisation only reports how much of the time the SMs were issuing work; it does not reveal whether the clock was lowered for protection, so a throttling GPU and a healthy busy GPU can both read high.

Why B is wrong: Tempting because hitting the power cap can trigger throttling, but power at the limit only shows the GPU is power-bound, not that the clock was actually reduced; the explicit throttle reason is what distinguishes a capped-but-fine GPU from a throttled one.

Why C is correct: Correct: the throttle-reason bitmask exposed through DCGM and NVML names the active cause of any clock reduction (thermal slowdown, software or hardware power cap, reliability slowdown), so it directly confirms throttling and its origin rather than being inferred from secondary signals.

Why D is wrong: Tempting because high memory use does correlate with heavy workloads, but memory utilisation measures occupied frame-buffer capacity and has no direct mechanism for lowering the core clock, so it cannot confirm a protective throttle event.

Free sampleAI Operationsmedium

A cluster operator wants to qualify GPU nodes before they enter a scheduling pool by actively exercising memory, compute, and the interconnect to surface latent faults, rather than only passively reading temperature and utilisation counters during production jobs. Which DCGM capability is designed for this proactive node-qualification role?

  • AContinuous polling of NVML utilisation fields exported as Prometheus metrics for dashboard alerting.
  • BReading the GPU's persisted XID journal to list any fault codes recorded since the last driver reload.
  • CDCGM diagnostics, which run active health checks that load the GPU's memory, compute, and links to detect faults before the node accepts jobs. Correct
  • DSetting a persistence-mode flag so the driver stays resident and reduces job start-up latency on the node.
DCGM diagnostics actively stress GPU memory, compute, and interconnect to qualify nodes and surface latent faults before they accept scheduled jobs. Passive telemetry only reports current state, so it cannot reveal a fault that a workload has not yet triggered; DCGM diagnostics run dedicated test routines that load each subsystem to provoke and detect latent defects, making them the right tool for pre-scheduling node qualification.

Why A is wrong: Prometheus-style polling reports passive runtime telemetry; it is tempting because it is the most familiar DCGM use, but it observes whatever the GPU is currently doing rather than actively stress-testing the GPU to expose latent faults.

Why B is wrong: Reviewing XID history surfaces faults that have already occurred, which is useful but reactive; this answer appeals because it relates to fault detection, yet it does not actively drive the hardware to provoke a latent defect before the node is used.

Why C is correct: DCGM diagnostics deliberately exercise GPU memory, compute pipelines, and interconnect with targeted test workloads, so latent defects are provoked and caught during qualification rather than during a production training run.

Why D is wrong: Persistence mode keeps the driver initialised to cut start-up overhead and performs no health testing at all; it is plausible as a node-readiness setting, but it neither tests hardware nor reports faults.

Free sampleAI Operationsmedium

A research team submits a distributed training job that requires 16 GPUs spread across 4 nodes. The job fails to start because the scheduler allocates only 3 of the 4 nodes before a competing job claims the fourth. Which scheduling strategy is specifically designed to prevent this outcome?

  • AGang scheduling, which holds all required nodes in reserve and starts all processes simultaneously Correct
  • BFair-share scheduling, which divides available GPU resources proportionally among all active users
  • CPreemptive scheduling, which evicts lower-priority jobs to free resources for higher-priority requests
  • DBackfill scheduling, which slots smaller jobs into idle windows left by reserved future allocations
Explain how gang scheduling prevents partial-allocation failures in multi-node distributed GPU training jobs. Gang scheduling (also called co-scheduling) treats all processes of a distributed job as a single indivisible unit. The scheduler withholds the job from running until every required slot on every required node is available at the same instant, then launches all ranks together. This is essential for tight-coupling frameworks such as MPI or PyTorch distributed training where all ranks must communicate from the first iteration. Without gang scheduling, partial allocations stall indefinitely, wasting the already-allocated GPUs and blocking other work.

Why A is correct: Gang scheduling ensures every process in a distributed job is launched at the same time across all required nodes. This atomic allocation eliminates the partial-allocation deadlock where some nodes are claimed by competing jobs before the full gang is assembled.

Why B is wrong: Fair-share scheduling governs resource equity across users over time, but it does not guarantee that all nodes for a single job are reserved simultaneously, so the same partial-allocation race can still occur.

Why C is wrong: Preemptive scheduling can reclaim resources from lower-priority jobs, but it does not inherently co-allocate all nodes at once. A preempted node may become available only after the remaining nodes are already taken by other jobs.

Why D is wrong: Backfill scheduling improves cluster utilisation by filling gaps around reserved slots, but it is not the mechanism that guarantees simultaneous allocation of all nodes for a single multi-node job.

Free sampleAI Operationsmedium

A platform team runs a shared Kubernetes GPU cluster. They notice that small inference pods get scheduled onto whichever nodes have free GPUs, leaving GPUs scattered one-per-node. This fragmentation blocks an incoming eight-GPU training pod that needs eight free GPUs on a single node, even though the cluster has more than eight GPUs free in total. Which scheduling approach most directly reduces this fragmentation so large single-node jobs can be placed?

  • ABin-packing the small pods onto as few nodes as possible so that whole nodes are left fully free Correct
  • BSpreading the small pods evenly across all nodes to balance GPU temperature and power draw
  • CEnabling cluster autoscaling so new nodes are added whenever a large job cannot be placed
  • DRaising the large training pod's priority so it preempts and evicts the small inference pods
Bin-packing small workloads onto fewer nodes preserves whole free nodes so large single-node jobs can be scheduled without fragmentation. GPU fragmentation arises when a spread placement policy leaves one free GPU per node, so no node has enough free devices for a large job. A bin-packing scheduling policy consolidates small pods onto fewer hosts, keeping complete nodes with all GPUs free available for jobs that need many GPUs on one host.

Why A is correct: Bin-packing consolidates small workloads onto fewer nodes, which preserves intact nodes with all GPUs free for large jobs and directly addresses the fragmentation described.

Why B is wrong: Spreading is tempting because it balances thermals and load, but it is the exact behaviour that causes fragmentation here, leaving one GPU free per node rather than whole free nodes.

Why C is wrong: Autoscaling can add capacity and seems to solve placement, but it adds cost and start-up delay and does not reclaim the GPUs already stranded by fragmentation across existing nodes.

Why D is wrong: Higher priority with preemption could evict small pods to make room, but it disrupts running inference and is a blunt fix rather than preventing the fragmentation that bin-packing avoids.

Other domains in this exam

See also the NCA-AIIO cert hub, the study guide, and the cheat sheet.

Examworthy is not affiliated with or endorsed by NVIDIA. Original, blueprint-aligned practice material only.