一种支持标量替换的细粒度可配置结构寄存器分配算法
A Register Allocation Algorithm in the Presence of Scalar Replacement for Fine-Grain Configurable Architectures
摘要：
对数组引用的标量替换的积极应用以可能非常大数量的寄存器为代价显著地减少了存储器操作的数量。在本文中，我们描述了一个寄存器分配算法，分配寄存器的标量替换阵列引用沿关键路线的计算，在许多情况下，利用并发内存访问的机会。实验结果，一组图像/信号处理代码内核，揭示了所提出的算法导致相应的硬件实现的执行周期的数量大幅减少当代现场可编程门阵列（FPGA）相比，其他贪婪的分配算法，在某些情况下，使用更少的寄存器。
英文摘要：
The aggressive application of scalar replacement to array references substantially reduces the number of memory operations at the expense of a possibly very large number of registers. In this paper we describe a register allocation algorithm that assigns registers to scalar replaced array references along the critical paths of a computation, in many cases exploiting the opportunity for concurrent memory accesses. Experimental results, for a set of image/signal processing code kernels, reveal that the proposed algorithm leads to a substantial reduction of the number of execution cycles for the corresponding hardware implementation on a contemporary Field-Programmable-Gate-Array (FPGA) when compared to other greedy allocation algorithms, in some cases, using even fewer number of registers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
