Advanced Search
DSpace@MIT

Garbage Collection is Fast, But a Stack is Faster

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author Miller, James S. en_US
dc.contributor.author Rozas, Guillermo J. en_US
dc.date.accessioned 2004-10-08T20:34:37Z
dc.date.available 2004-10-08T20:34:37Z
dc.date.issued 1994-03-01 en_US
dc.identifier.other AIM-1462 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/6622
dc.description.abstract Prompted by claims that garbage collection can outperform stack allocation when sufficient physical memory is available, we present a careful analysis and set of cross-architecture measurements comparing these two approaches for the implementation of continuation (procedure call) frames. When the frames are allocated on a heap they require additional space, increase the amount of data transferred between memory and registers, and, on current architectures, require more instructions. We find that stack allocation of continuation frames outperforms heap allocation in some cases by almost a factor of three. Thus, stacks remain an important implementation technique for procedure calls, even in the presence of an efficient, compacting garbage collector and large amounts of memory. en_US
dc.format.extent 94049 bytes
dc.format.extent 389294 bytes
dc.format.mimetype application/octet-stream
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.relation.ispartofseries AIM-1462 en_US
dc.title Garbage Collection is Fast, But a Stack is Faster en_US


Files in this item

Name Size Format Description
AIM-1462.ps.Z 91.84Kb Unknown
AIM-1462.pdf 380.1Kb PDF

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage