首页> 外文期刊>Integration >A hardware implementation of realloc function
【24h】

A hardware implementation of realloc function

机译:重新分配功能的硬件实现

获取原文
获取原文并翻译 | 示例
       

摘要

The memory intensitve nature of object-oriented languages such as C++ and Java has created the need of a high-performance dynamic memory management. Objec-oriented applications often generate higher memory intensity in the heap region. Thus, high-performance memory manager is needed to cope with such applications. As today's VLSI technology advances, it becomes more and mroe attractive to map basic software algorithms such as maloc(), free(), and realloc() into hardware. This paper presents a hardware desgin of realloc function that fully utilizes the advantage of combinaional logic. There are two steps needed to complete a reallocation process: (a) try to reallocate on the original memory blocvk and (b) if (a) failed, allocate another memory blck and copy the contents of the original block to this new location. In our scheme, (a) can be done in constant time. For (b), the allocation of new memory block and he deallocaion of original block are done in constant time. The hardware complexity of proposed scheme (i.e. X-unit, RS-unit, and ESG-unit) is O(n), where n represents the size of bit-map.
机译:诸如C ++和Java之类的面向对象语言的内存密集型特性引起了对高性能动态内存管理的需求。面向对象的应用程序通常在堆区域中生成更高的内存强度。因此,需要高性能的存储器管理器来应对这种应用。随着当今VLSI技术的发展,将诸如maloc(),free()和realloc()之类的基本软件算法映射到硬件中变得越来越有吸引力。本文介绍了充分利用组合逻辑优势的重新分配功能的硬件设计。完成重新分配过程需要两个步骤:(a)尝试在原始内存blocvk上重新分配,并且(b)如果(a)失败,则分配另一个内存blck并将原始块的内容复制到此新位置。在我们的方案中,(a)可以在恒定时间内完成。对于(b),新存储块的分配和原始块的释放是在恒定时间内完成的。所提出方案的硬件复杂度(即X单元,RS单元和ESG单元)为O(n),其中n表示位图的大小。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号