实时系统内存管理方案的设计与实现
发布时间：2018-09-11 06:46
【摘要】：紧凑内存管理系统是一个紧密压缩的实时内存管理系统，可以完成分配、释放、以及对内存对象的引用。 实现方案：其一为可移动内存版本；其二为不可移动内存版本。在可移动内存的实现方案中，页面分配操作时间复杂度为常数级，如果没有内存紧缩操作，页面回收的时间复杂度会由线性级降为常数级。在不可移动内存实现方案中，分配操作和释放操作的时间复杂度均为线性级。间接引用的时间复杂度为常数级。可移动版本为一次间接跳转，，不可移动版本为二次间接跳转。 指针概念：在紧凑内存模型中指针是指一个地址与一个偏移量的集合。因此，紧凑算法模型支持基于偏移量的寻址算法而不是基于地址指针。值得注意的是如果内存对象被分配在单一的，物理地址连续的一块内存中，可移动版本的实现方案也是可以支持基于地址的寻址算法的。在紧凑算法中紧凑操作是受限制的，它只会释放一块内存然后引起一块相同大小的内存对象的移动。 研究内容：1.实时内存管理系统；2.显式动态内存管理系统；3.隐式动态内存管理系统；4.地址空间的意义，页块和页面碎块研究；5.各种版本的内存开销和算法实现。 预期达到的目标： 1、减少内存额外开销，我们可以通过将物理空间中的页面同样使用于抽象地址空间的方法来实现动态的抽象地址空间。 2、在当前版本中大于16KB的内存对象是不被支持的。我们希望在进一步的工作中通过使用arraylets的概念来实现大于16KB内存对象的支持。
[Abstract]:Compact memory management system is a tightly compressed real-time memory management system that can allocate, free, and reference memory objects. Implementation: one is removable memory version; the other is immovable memory version. In the scheme of removable memory, the time complexity of page allocation is constant. If there is no memory compression, the time complexity of page recovery will be reduced from linear to constant. In the immovable memory implementation scheme, the time complexity of both allocation and release operations is linear. The time complexity of indirect references is constant. The removable version is an indirect jump and the immovable version is a secondary indirect jump. Pointer concept: in a compact memory model, a pointer is a collection of addresses and an offset. Therefore, the compact algorithm model supports offset-based addressing algorithms rather than address pointers. It is worth noting that if memory objects are allocated in a single block of memory with continuous physical addresses the removable version can also support addressable algorithms. In the compact algorithm, the compact operation is restricted, it only releases a block of memory and causes the movement of a memory object of the same size. Research content: 1. Real time memory management system. Explicit dynamic memory management system Implicit dynamic memory management system The meaning of address space, page blocks and page fragments are studied in this paper. Various versions of memory overhead and algorithm implementation. Expected goals: 1. Reduce memory overhead, We can implement dynamic abstract address space by using pages in physical space also in abstract address space. 2. In the current version, memory objects larger than 16KB are not supported. We hope to use the concept of arraylets to support memory objects larger than 16KB in further work.
【学位授予单位】：吉林大学
【学位级别】：硕士
【学位授予年份】：2013
【分类号】：TP333;TP316.2
本文编号：2235925
[Abstract]:Compact memory management system is a tightly compressed real-time memory management system that can allocate, free, and reference memory objects. Implementation: one is removable memory version; the other is immovable memory version. In the scheme of removable memory, the time complexity of page allocation is constant. If there is no memory compression, the time complexity of page recovery will be reduced from linear to constant. In the immovable memory implementation scheme, the time complexity of both allocation and release operations is linear. The time complexity of indirect references is constant. The removable version is an indirect jump and the immovable version is a secondary indirect jump. Pointer concept: in a compact memory model, a pointer is a collection of addresses and an offset. Therefore, the compact algorithm model supports offset-based addressing algorithms rather than address pointers. It is worth noting that if memory objects are allocated in a single block of memory with continuous physical addresses the removable version can also support addressable algorithms. In the compact algorithm, the compact operation is restricted, it only releases a block of memory and causes the movement of a memory object of the same size. Research content: 1. Real time memory management system. Explicit dynamic memory management system Implicit dynamic memory management system The meaning of address space, page blocks and page fragments are studied in this paper. Various versions of memory overhead and algorithm implementation. Expected goals: 1. Reduce memory overhead, We can implement dynamic abstract address space by using pages in physical space also in abstract address space. 2. In the current version, memory objects larger than 16KB are not supported. We hope to use the concept of arraylets to support memory objects larger than 16KB in further work.
【学位授予单位】：吉林大学
【学位级别】：硕士
【学位授予年份】：2013
【分类号】：TP333;TP316.2
【参考文献】
相关期刊论文 前2条
1 何杭军,朱利,李青山,谢海江;基于Linux的动态内存检测工具的设计与实现[J];计算机工程;2005年21期
2 胡滨;孙健力;张永平;侯婧熠;;一种内存管理技术的研究与实现[J];计算机工程与设计;2007年05期
相关硕士学位论文 前1条
1 徐蓉;实时系统的内存管理技术研究与实现[D];电子科技大学;2004年
本文编号：2235925
本文链接：https://www.wllwen.com/kejilunwen/jisuanjikexuelunwen/2235925.html
