mirror of
https://github.com/reanimate/reanimate.git
synced 2026-09-12 08:32:20 +00:00
Move script.
Former-commit-id: 1db9ffa85910e560efc69368cfaa7423fea64570
This commit is contained in:
parent
11a9179da1
commit
9ded319938
1 changed files with 0 additions and 0 deletions
8
videos/bakers-algorithm/BAKER_SCRIPT.md
Normal file
8
videos/bakers-algorithm/BAKER_SCRIPT.md
Normal file
|
|
@ -0,0 +1,8 @@
|
|||
# Baker's Algorithm
|
||||
|
||||
A computer's memory is finite and will quickly run out if it is not reused. Manually marking objects for reuse is error prone
|
||||
and automatic memory management techniques have become the default in high level languages.
|
||||
|
||||
Copying garbage collector divide available memory into two segments and marks one of them for new allocations.
|
||||
No memory is reused until the segment is full. When this happens, reachable objects are copied to the opposite segment. Anything
|
||||
left must be unreachable and the memory in the segment can be reused.
|
||||
Loading…
Reference in a new issue