JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

plus and minus display

Browse Source
This commit is contained in:
Jidong Xiao
2023-11-25 00:18:54 -05:00
parent c30bd97149
commit 14b1ba1f65
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
lectures/25_garbage_collection/README.md
View File

@@ -150,7 +150,7 @@ stack:
- Stop & Copy: - Stop & Copy:
– - requires a long pause in program execution - - requires a long pause in program execution
- \+ can handle cyclical data structures! - \+ can handle cyclical data structures!
- – requires 100% extra memory (you can only use half the memory) - – requires 100% extra memory (you can only use half the memory)
- \+ runs fast if most of the memory is garbage (it only touches the nodes reachable from the root) - \+ runs fast if most of the memory is garbage (it only touches the nodes reachable from the root)
@@ -158,10 +158,10 @@ stack:
- Mark-Sweep: - Mark-Sweep:
– - requires a long pause in program execution - - requires a long pause in program execution
- \+ can handle cyclical data structures! - \+ can handle cyclical data structures!
- \+ requires ∼1% extra memory (just one bit per node) - \+ requires ∼1% extra memory (just one bit per node)
– - runs the same speed regardless of how much of memory is garbage. - - runs the same speed regardless of how much of memory is garbage.
It must touch all nodes in the mark phase, and must link together all garbage nodes into a free list. It must touch all nodes in the mark phase, and must link together all garbage nodes into a free list.
## 25.11 Practical Garbage Collection Methodology in C++: Smart Pointers ## 25.11 Practical Garbage Collection Methodology in C++: Smart Pointers