| 
|
QuoteRef: bacoDF1_2003
topics >
all references >
ThesaHelp:
ACM references a-e
ThesaHelp:
references a-b
Topic:
memory management by garbage collection
Topic:
real time systems
Topic:
critical regions
Topic:
memory management by free list
Topic:
heap memory management
Topic:
arrays
Topic:
collection class
Topic:
task scheduling
Reference
Bacon, D.F., Cheng, P., Rajan, V.T., "A real-time garbage collector with low overhead and consistent utilization", Conference Record of POPL 2003: The 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, New Orleans, Louisiana, USA, January 2003, ACM, pp. 285-298. Google
285 ;;Quote: mostly non-copying, real-time incremental garbage collector with 4% read barrier overhead and 45% utilization in 1.6-2.5x actual space
287 ;;Quote: memory allocation using free-lists with geometric sizes (1/8) in 16KB blocks; 2% fragmentation on average; lazy page formatting and collection
288 ;;Quote: use 2 KB arraylets instead of large memory objects; efficient access and garbage collection; 8 MB max size using an allocation page as the index
285 ;;Quote: time-based scheduling is better than work-based scheduling for real-time garbage collector; yields consistent utilization without frequent pauses
ThesaHelp: ACM references a-e (259 items)
ThesaHelp: references a-b (396 items)
Topic: memory management by garbage collection (116 items)
Topic: real time systems (14 items)
Topic: critical regions (58 items)
Topic: memory management by free list (25 items)
Topic: heap memory management (33 items)
Topic: arrays (58 items)
Topic: collection class (11 items)
Topic: task scheduling (49 items)