MIT
Lecture 11: Storage Allocation
Systems ThinkingData Science, Analytics & Computer TechnologySoftware Design and EngineeringAlgorithms and Data StructuresComputer ScienceBusiness & Management
Om kurset
Description: This lecture discusses different means of storage allocation, including stacks, fixed-sized heaps, and variable-sized heaps. The lecture also discusses garbage collection, including by counting reference pointers, mark-and-sweep, and stop-and-copy. Instructor: Julian Shun