期刊文献+

实时系统中的动态内存分配算法 被引量:7

Dynamic Memory Allocation Algorithm in Real-time System
在线阅读 下载PDF
导出
摘要 针对实时系统中的内存分配问题,分析实时系统应用程序的行为特点,提出一种使用双级离散表和双级索引位图相结合的动态内存分配方法。对于较小的内存分配请求,使用位图索引来加快速度并且降低内存分割的次数。对于较大内存块,使用双级离散表的方法降低内存碎片。实验表明,该方法具有很低的内存碎片率和确定的响应时间,适合实时性要求较高的系统。 Memory allocation is an important issue in developing real-time and embedded applications.This paper introduces a novel memory allocation algorithm which uses hybrid of bitmap fit and segregated fit.It uses a double bitmap fit when the memory block is small,which uses a double segregate list to manage larger memory blocks in order to lower fragmentation.Experimental results show the method has low fragmentation and a bounded response time,which is suit for real-time systems.
出处 《计算机工程》 CAS CSCD 北大核心 2008年第8期80-81,84,共3页 Computer Engineering
关键词 动态内存分配 实时系统 响应时间 dynamic memory allocation real-time system response time
  • 相关文献

参考文献5

  • 1Wilson P R, Johnstone M S. Dynamic Storage Allocation: A Survey and Critical Review[C]//Proc. of the Int'l Workshop on Memory Management. Berlin, Germany: Springer-Verlag, 1995: 1-116.
  • 2Comfort W T. Multiword list Items[J]. Communications of the ACM, 1964, 7(6): 357-362.
  • 3Stephenson C J. Fast Fits: New Methods for Dynamic Storage Allocation[C]//Proc. of the 9th ACM Symposium on Operating Systems Principles. [S. l.]: ACM Press. 1983.
  • 4Zorn B G. The Measured Cost of Conservative Garbage Collection[J]. Software Practice and Experience, 1993, 23(7): 733-756.
  • 5Johnstone M S, Wilson P R. The Memory Fragmentation Problem: Solved?[C]//Proceedings of the International Symposium on Memory Management. Coumbia, Canada: ACM Press, 1998.

同被引文献31

引证文献7

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部