Garbage Collection Can Be Faster Than Stack Allocation Export

@misc{citeulike:5853106, abstract = {A very old and simple algorithm for garbage collection gives very good results when the physical memory is much larger than the number of reachable cells. In fact, the overhead associated with allocating and collecting cells from the heap can be reduced to less than one instruction per cell by increasing the size of physical memory. Special hardware, intricate garbage-collection algorithms, and fancy compiler analysis become unnecessary.}, author = {Appel, Andrew W.}, citeulike-article-id = {5853106}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8219}, keywords = {garbage-collection}, posted-at = {2009-09-29 19:11:00}, priority = {2}, title = {Garbage Collection Can Be Faster Than Stack Allocation}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8219}, year = {1987} }

TY - ELEC ID - citeulike:5853106 L3 - citeulike-article-id:5853106 N2 - A very old and simple algorithm for garbage collection gives very good results when the physical memory is much larger than the number of reachable cells. In fact, the overhead associated with allocating and collecting cells from the heap can be reduced to less than one instruction per cell by increasing the size of physical memory. Special hardware, intricate garbage-collection algorithms, and fancy compiler analysis become unnecessary. TI - Garbage Collection Can Be Faster Than Stack Allocation KW - garbage-collection AU - Appel, Andrew PY - 1987/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8219 ER -