Return of an object in two-stack dynamic memory

Authors:
Gordon Bassen;Isaak Garber
Affiliations:
Dept. of Mathematics and Computer Science, Kingsborough Community College, Brooklyn, NY;Dept. of Mathematics and Computer Science, Kingsborough Community College, Brooklyn, NY
Venue:
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Year:
2003

Citing 4
Cited 1

Crafting a compiler with C

Crafting a compiler with C
Garbage collection: algorithms for automatic dynamic memory management

Garbage collection: algorithms for automatic dynamic memory management
Two stack dynamic memory allocation

Journal of Computing Sciences in Colleges
Garbage Collection is Fast, but a Stack is Faster

Garbage Collection is Fast, but a Stack is Faster

Programming multi-stack structures in an assembly language course

Journal of Computing Sciences in Colleges

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a two-stack dynamic memory implementation a function returning an object is required to shift the object from locations in its local variables and parameters area to new locations at the top of the calling function's local variables and parameters area. Special actions are implemented when the object to be shifted is referenced by one or more pointers. These pointers may be located outside the function's local variables and parameters area and their locations may be unknown within the function. Pointers may also be within the object to be returned. During shifting the addresses are changed and the corresponding pointers must be adjusted. The authors have proposed a solution to this problem using a new pointer type, along with a modification of the call procedure for two-stack dynamic memory.