首页> 外文期刊>Parallel Computing >Efficient compilation for queue size constrained queue processors
【24h】

Efficient compilation for queue size constrained queue processors

机译:队列大小受限的队列处理器的高效编译

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

摘要

Queue computers use a FIFO data structure for data processing. The essential characteristics of a queue-based architecture excel at satisfying the demands of embedded systems, including compact instruction set, simple hardware logic, high parallelism, and low power consumption. The size of the queue is an important concern in the design of a realizable embedded queue processor. We introduce the relationship between parallelism, length of data dependency edges in data flow graphs and the queue utilization requirements. This paper presents a technique developed to make the compiler aware of the size of the queue register file and, thus, optimize the programs to effectively utilize the available hardware. The compiler examines the data flow graph of the programs and partitions it into clusters whenever it exceeds the queue limits of the target architecture. The presented algorithm deals with the two factors that affect the utilization of the queue, namely parallelism and the length of variables' reaching definitions. We analyze how the quality of the generated code is affected for SPEC CINT95 benchmark programs and different queue size configurations. Our results show that for reasonable queue sizes the compiler generates a code that is comparable to the code generated for infinite resources in terms of instruction count, static execution time, and instruction level parallelism.
机译:队列计算机使用FIFO数据结构进行数据处理。基于队列的体系结构的基本特征擅长满足嵌入式系统的需求,包括紧凑的指令集,简单的硬件逻辑,高并行度和低功耗。在可实现的嵌入式队列处理器的设计中,队列的大小是一个重要的考虑因素。我们介绍了并行性,数据流图中数据相关性边的长度和队列利用率要求之间的关系。本文提出了一种使编译器了解队列寄存器文件的大小,从而优化程序以有效利用可用硬件的技术。编译器检查程序的数据流图,并在超过目标体系结构的队列限制时将其划分为群集。提出的算法处理了影响队列利用率的两个因素,即并行性和变量到达定义的长度。我们分析了SPEC CINT95基准程序和不同队列大小配置对生成代码质量的影响。我们的结果表明,对于合理的队列大小,编译器生成的代码在指令计数,静态执行时间和指令级别并行性方面与为无限资源生成的代码相当。

著录项

  • 来源
    《Parallel Computing》 |2009年第4期|213-225|共13页
  • 作者单位

    IBM, Tokyo Research Laboratory, 1623-14 Shimotsuruma, Yamato-Shi, Kanagawa-Ken 242-8502, Japan;

    University of Aizu, Aizu-Wakamatsu, Fukushima-Ken 965-8580, Japan;

    University of Electro-Communications, Graduate School of Information Systems, Chofugaoka 1-5-1, Chofu-Shi 182-8585, Japan;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    queue register file; queue processor; constrained; optimization; compiler;

    机译:队列寄存器文件;队列处理器;约束优化;编译器;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号