可重构硬件加速系统的查询序列优化
Query-Sequence Optimization on a Reconfigurable Hardware-Accelerated System
摘要：
数据库查询处理的硬件加速可以在FPGA的帮助下完成。特别是，它们在运行时是部分可重新配置的，这允许硬件在运行时适应各种查询。然而，重新配置本身需要一些时间。由于FPGA的受影响区域在重新配置期间不可用于计算，因此避免某些重新配置可以提高整体性能。本文提出了基于查询序列的优化方法，降低了重配置的影响。即将到来的查询的知识用于（I）当查询仍在运行时推测性地开始重新配置，以及（II）避免将在后续查询中再次使用的可重新配置区域的重复。我们使用校准模型和各种参数值的测量来评估我们的优化。即使使用只有两个查询的序列，也可以获得高达21%的执行时间改进
英文摘要：
Hardware acceleration of database query processing can be done with the help of FPGAs. In particular, they are partially reconfigurable during runtime, which allows for the runtime adaption of the hardware to a variety of queries. Reconfiguration itself, however, takes some time. As the affected area of the FPGA is not available for computations during the reconfiguration, avoiding some of the reconfigurations can improve overall performance. This paper presents optimizations based on query sequences, which reduces the impact of the reconfigurations. Knowledge of coming queries is used to (I) speculatively start reconfiguration already when a query is still running and (II) avoid overwriting of reconfigurable regions that will be used again in subsequent queries. We evaluate our optimizations with a calibrated model and measurements for various parameter values. Improvements in execution time of up to 21% can be obtained even with sequences of only two queries
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
