Module 2 – AI Runtime Engineering · 2
Plan memory lifetimes
15-minute session: read for 3 minutes, trace for 3, experiment for 7, and complete the check for 2. Spend longer whenever you need.
An execution graph has values with creation and last-use points. Reuse a buffer only after its old value is no longer needed and no asynchronous operation is still using it. Weights, activations, temporary workspaces, and caches need separate accounting. Calculate element count times bytes per element, then include alignment and overhead in a real implementation.
Practice and evidence: Predict the example or draw its state transitions. Change one assumption, test the boundary, and record the actual result. Explain what this small model does not establish about a production system.
shape=(4,8)
bytes_per_element=4
print(shape[0]*shape[1]*bytes_per_element)
Expected result: 128
Practice and evidence
Keep three notes: your prediction, the actual result, and why they match or differ. The completion check grades understanding; the practice task builds skill.
Language reference: git.agilaos.com
Complete this lesson
Answer every check correctly to earn your lesson certificate. Feedback helps you review and try again.
Sign in · Save your progress and earn a certificate for this lesson.