| dc.creator |
Stallman, Richard M. |
|
| dc.date |
2004-10-04T14:51:57Z |
|
| dc.date |
2004-10-04T14:51:57Z |
|
| dc.date |
1980-07-01 |
|
| dc.date.accessioned |
2013-10-09T02:44:52Z |
|
| dc.date.available |
2013-10-09T02:44:52Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
AIM-556 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/6331 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
A Stack is a very efficient way of allocating and deallocating memory, but it works only with a restricted pattern of usage. Garbage collection is completely flexible but comparatively costly. The implementation of powerful control structures naturally uses memory which usually fits in with stack allocation but must have the flexibility to do otherwise from time to time. How can we manage memory which only once in a while violates stack restrictions, without paying a price the rest of the time? This paper provides an extremely simple way of doing so, in which only the part of the system which actually uses the stack needs to know anything about the stack. We call them Phantom Stacks because they are liable to vanish if subjected to close scrutiny. Phantom Stacks will be used in the next version of the Artificial Intelligence Lab's Scheme microprocessor chip. |
|
| dc.format |
3185596 bytes |
|
| dc.format |
2486129 bytes |
|
| dc.format |
application/postscript |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.relation |
AIM-556 |
|
| dc.title |
Phantom Stacks: If You Look Too Hard, They Aren't There |
|