Map
Index
Random
Help
th

QuoteRef: wilsPR9_1992

topics > all references > ThesaHelp: references t-z



ThesaHelp:
references t-z
Topic:
memory management by garbage collection
Topic:
heap memory management
Topic:
memory management by reference counting
Topic:
memory management by free list
Topic:
memory management by paging
Topic:
critical regions

Reference

Wilson, P.R., "Uniprocessor garbage collection techniques", in Bekkers, Y., Cohen, J. (ed.), Memory Management. International workshop IWMM 92. Proceedings, Berlin, Springer-Verlag, September 1992. Google

Quotations
2 ;;Quote: manual memory management leads to global bookkeeping, slow memory leaks, dangling pointers, and fixed array sizes
2+;;Quote: large software systems often contain an application-specific garbage collector; should be part of the language
9 ;;Quote: most high-performance, general-purpose systems use tracing garbage collectors instead of reference counting
16 ;;Quote: treadmill is a non-copying garbage collector that uses a doubly-linked list and a color field that assigns each object to a collection set
20 ;;Quote: freed memory should be reused in a LIFO order. Cyclical reuse may cause memory faults under LRU replacement policies
21 ;;Quote: use tricolor marking to understand incremental garbage collection: release white objects, retain black objects, and process descendants of grey objects; no pointers from black to white objects
22 ;;Quote: for incremental garbage collection, coordinate collector and mutator with read or write barriers; write barriers cause fewer faults


Related Topics up

ThesaHelp: references t-z (309 items)
Topic: memory management by garbage collection (113 items)
Topic: heap memory management (28 items)
Topic: memory management by reference counting (22 items)
Topic: memory management by free list (19 items)
Topic: memory management by paging (23 items)
Topic: critical regions (58 items)

Collected barberCB 3/98
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.