ThesaHelp: references t-z
Topic: memory management by age
Topic: heap memory management
| |
Reference
Ungar, D.,
"Generation scavenging: A non-disruptive high performance storage reclamation algorithm. ",
SIGPLAN, 19, 5, pp. 157-167, May 1984.
Google
Other Reference
Software Engineering Notes vol 9 num 3
Quotations
157 ;;Quote: generation scavenging has short pause times, works with virtual memory, reclaims circular structure, and is efficient
| 158 ;;Quote: segmentation works poorly for Smalltalk because of object sizes from 25 bytes to 128K bytes and 32-64K objects
| 161 ;;Quote: generation scavenging--a traversal of new space starting at the remembered set finds all live new objects
| 161+;;Quote: generation scavenging--if a new object survives enough scavenges, moved to old object area and no longer reclaimed
|
Related Topics
ThesaHelp: references t-z (309 items)
Topic: memory management by age (18 items)
Topic: heap memory management (28 items)
|