首页> 外文会议>First International Conference on Innovative Computing, Information and Control vol.II >A New and Efficient Field-Partition Based Code Compression and Its Pipelined Decompression System
【24h】

A New and Efficient Field-Partition Based Code Compression and Its Pipelined Decompression System

机译:一种基于字段的新型高效代码压缩及其流水线解压缩系统

获取原文
获取外文期刊封面目录资料

摘要

A field partition based instruction compression/ decompression system for ARM series architecture is proposed. We could get a statistics of the appearances of each field in all instructions of a program. Depending on the statistics, we partition each instruction into three fields and compress each field using Huffman coding method. Experimental results show that our method is better than others with a 55% of average compression ratio. For decompression, single buffering, double buffering and pipeline techniques have been proposed. However, due to jump penalty, these techniques incur more delays in pipeline or have to stop and fill in the cache buffers. We proposed a Pipeline with Back-up for Flushing technique that incurs no delay and without stopping due to jump. The average performance is increased about 10% to 60%.
机译:提出了一种基于现场分区的ARM系列架构指令压缩/解压缩系统。我们可以得到程序所有指令中每个字段外观的统计信息。根据统计信息,我们将每个指令划分为三个字段,并使用霍夫曼编码方法压缩每个字段。实验结果表明,我们的方法优于平均压缩比为55%的其他方法。对于解压缩,已经提出了单缓冲,双缓冲和流水线技术。但是,由于跳转惩罚,这些技术会导致流水线中更多的延迟,或者必须停止并填充高速缓存缓冲区。我们提出了一种带有备用冲洗管道的技术,该技术不会造成延迟,也不会因跳跃而停止。平均性能提高了大约10%到60%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号