公开(公告)号：KR100829167B1

公开(公告)日：2008-05-13

申请号：KR1020060111260

申请日：2006-11-10

Applicant: 재단법인서울대학교산학협력재단

Inventor： 백윤흥 ,  조두산 ,  어강령

IPC: G06F17/00 ,  G06F9/38

CPC classification number: G06F9/3838

Abstract: A method for reducing data dependence in software pipelining is provided to improve the performance of a pipelining loop of a DSP(Digital Signal Processor) and utilize resources of the DSP fully by reducing the data dependence in iterated pipelining. All routes is searched from a data dependence graph made for machine language of a target loop code and a priority route forming the longest route, which determines an execution time of the loop, is found from the searched routes(S200). An instruction having the shortest priority route is found as an instruction to reduce dependence by forming a replaceable instruction table for the priority routes and searching the priority route in reference to the replaceable instruction table(S204). Dependence relation is changed by replacing the found instruction to reduce the dependence with a replaceable instruction(S206). The dependence graph is reformed for the changed loop code and a routine is returned to a first stage(S208). The routine is terminated when the instruction to reduce the dependence is not found in the priority route.

Abstract translation: 提供了一种降低软件流水线数据依赖性的方法，以提高DSP（数字信号处理器）流水线回路的性能，并通过减少迭代流水线中的数据依赖来充分利用DSP的资源。 从搜索到的路线中找到从针对目标循环码的机器语言的数据依赖图形中搜索所有路线，并且从搜索到的路线中找到确定循环的执行时间的最长路线的优先路线（S200）。 发现具有最短优先级路由的指令作为通过为优先级路由形成可替换指令表并参考可替换指令表搜索优先级路由来减少依赖性的指令（S204）。 通过替换发现的指令来改变依赖关系，以通过替换指令减少依赖（S206）。 改变循环码的依赖图，并将例程返回到第一阶段（S208）。 当在优先级路由中找不到减少依赖性的指令时，程序终止。