| Program |
 |
|
|
|
| Find in Program |
|
|
|
|
| Page |
|
|
|
|
| Basket |
|
|
view, help
"MC?: High-Performance Garbage Collection for Memory-Constrained Environments"
|
|
|
|
MC?: High-Performance Garbage Collection for Memory-Constrained Environments
Meeting Rooms 1-3
Tuesday, 11:30, 30 minutes | 7 | · | 8 | · | 9 | · | 10 | · | 11 | · | 12 | · | 13 | · | 14 | · | 15 | · | 16 | · | 17 | · | 18 | · | 19 | · | 20 | · | 21 |
Narendran Sachindran, University of Massachusetts, Amherst
Eliot Moss, University of Massachusetts, Amherst
Emery Berger, University of Massachusetts, Amherst
Java is becoming an important platform for memory-constrained consumer
devices such as PDAs and cellular phones, because it provides safety and
portability. Since Java uses garbage collection, efficient garbage
collectors that run in constrained memory are essential. Typical
collection techniques used on these devices are mark-sweep and
mark-compact. Mark-sweep collectors can provide good throughput and
pause times but suffer from fragmentation. Mark-compact collectors
prevent fragmentation, have low space overheads, and provide good
throughput. However, they cannot be made fully incremental and so can
suffer from long pause times.
Copying collectors can provide higher throughput than either of these
techniques, but because of their high space overhead, they previously
were unsuitable for memory-constrained devices. This paper presents
MC? (Memory-Constrained Copying), a copying, generational garbage
collector that meets the demands of memory-constrained devices with
soft real-time requirements. MC? has low space overhead and tight
space bounds, prevents fragmentation, provides good throughput, and
yields short pause times. These qualities make MC? also attractive for
other environments, including desktop and server systems.
Keywords: Java, copying collector, generational collector, mark-copy,
mark-sweep, mark-compact, memory-constrained copying
|
