Memory management model
A memory-management model describes how information or storage is allocated, organized, retained, accessed, tracked, and released during computation.
.NET in Action, Second Edition
Memory management is the process of allocating, tracking, and reclaiming computer memory during program execution.
- How it is used
- Frames .NET garbage collection as an alternative to manual allocation and cleanup when writing dynamic-array code.
- How deep it goes
- Explains references, stack frames, heap allocation, and allocation failure through code, without detailing the collector’s algorithms.
- Examples
- Compares C++ and C# dynamic arrays and supplies a PerfView GCStats table with counts, pauses, and allocations.
- What you can do after
- Evaluate/understand when .NET reclaims unused memory and why C# array code omits explicit deallocation.
Read how .NET in Action, Second Edition explains memory management model →
Code Like a Pro in Rust
Memory management is the allocation, use, tracking, and release of computer memory during program execution.
- How it is used
- Guides allocation choices for Rust data structures, particularly when performance or memory overhead matters.
- How deep it goes
- Reviews heap and stack behavior with Rust examples, while previewing rather than detailing ownership, reference counting, and custom allocators.
- Examples
- Contrasts Box, Vec, and String heap allocations with local values and C string pointers.
- What you can do after
- Evaluate/understand how Rust types affect allocation and when heap use warrants attention in memory-constrained systems.
Read how Code Like a Pro in Rust explains memory management model →
Go in Practice, Second Edition
Memory management is the allocation, use, lifetime control, and reclamation of memory occupied by program data.
- How it is used
- Positions Go’s garbage-collected runtime as a practical choice for systems, server, and cloud applications.
- How deep it goes
- Contrasts manual management, garbage collection, borrow checking, and smart pointers without explaining their implementation internals.
- Examples
- Compares memory-management choices across Go, C, Rust, Zig, and embedded-system workloads.
- What you can do after
- Evaluate/understand how garbage collection, manual management, borrow checking, and smart pointers trade convenience against lifetime control.
Read how Go in Practice, Second Edition explains memory management model →
Related concepts
- context managementpart of · Context management is the deliberate control of resources and information within an execution or interaction context, including their acquisition, organization, retention, use, and cleanup.
- sliding windowincludes · A sliding window is a bounded region over an ordered sequence or time range that advances, updating which elements fall within it.
- garbage collectionimplemented by · Garbage collection is an automated memory- or storage-management process that identifies objects or data no longer reachable or needed and reclaims or deletes them.
- reference countingimplemented by · Reference counting is a memory-management technique that tracks references to an object or value and can reclaim it when its reference count reaches zero.
- data structureused by · A data structure is an organized representation of data and its relationships that supports defined operations for storing, accessing, or modifying it.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.