Advertisement

Storage Allocation for Real-Time, Embedded Systems

  • Steven M. Donahue
  • Matthew P. Hampton
  • Morgan Deters
  • Jonathan M. Nye
  • Ron K. Cytron
  • Krishna M. Kavi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2211)

Abstract

Dynamic storage allocation and automatic garbage collection are among the most popular features that high-level languages can offer. However, time-critical applications cannot be written in such languages unless the time taken to allocate and deallocate storage can be reasonably bounded. In this paper, we present algorithms for automatic storage allocation that are appropriate for real-time and embedded systems. We have implemented these algorithms, and results are presented that validate the predictability and efficiency of our approach.

Keywords

Embed System Garbage Collection Spec Benchmark Internal Fragmentation Free Block 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dante J. Cannarozzi, Michael P. Plezbert, and Ron K. Cytron. Contaminated garbage collection. Programming Language Design and Implementation, 2000.Google Scholar
  2. 2.
    Trishul Chilimbi and James Larus. Using generational garbage collection to implement cache-conscious data placement. Proceedings of the International Symposium on Memory Management, 1998.Google Scholar
  3. 3.
    SPEC Corporation. Java spec benchmarks. Technical report, SPEC, 1999. Available by purchase from SPEC.Google Scholar
  4. 4.
    Scott Haug. Automatic storage optimization via garbage collection. Master’s thesis, Washington University, 1999.Google Scholar
  5. 5.
    Arie Kaufman. Tailored-list and recombination-delaying buddy systems. ACM Transactions on Programming Languages and Systems, 6(1):118–125, January 1984.CrossRefGoogle Scholar
  6. 6.
    Donald E. Knuth. Fundamental Algorithms, Volume 1, The Art of Computer Programming, Second Edition. Addison-Wesley, 1973.Google Scholar
  7. 7.
    Tim Lindholm and Frank Yellin. The Java Virtual Machine Specification. Addison-Wesley, 1997.Google Scholar
  8. 8.
    Paul R. Wilson. Uniprocessor garbage collection techniques (Long Version). Submitted to ACM Computing Surveys, 1994.Google Scholar
  9. 9.
    Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles. Dynamic storage allocation: A survey and critical review. In Henry Baker, editor, Proceedings of International Workshop on Memory Management, volume 986 of Lecture Notes in Computer Science, Kinross, Scotland, September 1995. Springer-Verlag.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Steven M. Donahue
    • 1
  • Matthew P. Hampton
    • 1
  • Morgan Deters
    • 1
  • Jonathan M. Nye
    • 1
  • Ron K. Cytron
    • 1
  • Krishna M. Kavi
    • 2
  1. 1.Department of Computer ScienceWashington UniversitySaint LouisUSA
  2. 2.University of North TexasDenton

Personalised recommendations