Skip to main content

Return of an Object in Two-Stack Dynamic Memory

  • Conference paper
  • First Online:
Computational Science and Its Applications — ICCSA 2003 (ICCSA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2667))

Included in the following conference series:

  • 736 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bassen, G. and Garber, I.: Two Stack Dynamic Memory Allocation, The Journal of Computing Sciences in Colleges, Volume 18, No. 1 (2002)

    Google Scholar 

  2. Fischer, C.N. and LeBlanc, Jr. R.J.: Crafting a Compiler with C, Redwood City, CA: Benjamin/Cummings Publishing Company, Inc. (1991) 287–313

    Google Scholar 

  3. Jones, R. and Lins, R.: Garbage Collection: Algorithms for Automatic Dynamic Memory Management, John Wiley Publishers, (1996)

    Google Scholar 

  4. Miller, J., and Rozas, G.: Garbage Collection is Fast, But a Stack is Faster, MIT Artificial Intelligence Laboratory, A.I. Tech. Report 1462, Cambridge MA, (1994)

    Google Scholar 

  5. Tremblay, M. and O’Connor, J.M.: Multi-Stack Memory Architecture, U.S. patent # 6,138,210 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bassen, G., Garber, I. (2003). Return of an Object in Two-Stack Dynamic Memory. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44839-X_69

Download citation

  • DOI: https://doi.org/10.1007/3-540-44839-X_69

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40155-1

  • Online ISBN: 978-3-540-44839-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics