专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US5367687A Method and apparatus for optimizing cost-based heuristic instruction scheduling 失效
标题翻译：用于优化基于成本的启发式指令调度的方法和装置
公开(公告)号：US5367687A
公开(公告)日：1994-11-22
申请号：US88418
申请日：1993-07-07
申请人： Gregory Tarsy , Michael J. Woodard
发明人： Gregory Tarsy , Michael J. Woodard
IPC分类号： G06F9/38 , G06F9/45 , G06F11/34
CPC分类号： G06F8/445 , G06F11/3428
摘要： A method and apparatus for optimizing cost-based heuristic instruction scheduling for a pipelined processor is disclosed which has particular application to compile time instruction scheduling after code generation. Instruction scheduling is optimized by determining the optimal weights to be used by an apparatus for cost based heuristic instruction scheduling for a particular pipelined processor. The optimal weights are determined based on the lowest of the lowest costs incurred by different collections of interrelated weight sets. Each collection of interrelated weight sets comprises a randomly generated initial weight set and subsequent interrelated weight sets generated in a predetermined manner. The predetermined manner for generating subsequent weight sets facilitates rapid identification of the optimal weight set for a collection, and thereby rapid identification of the overall optimal weight set for the collections.
摘要翻译：公开了一种用于优化用于流水线处理器的基于成本的启发式指令调度的方法和装置，其具有在代码生成之后编译时间指令调度的特定应用。通过确定用于特定流水线处理器的基于成本的启发式指令调度的装置使用的最优权重来优化指令调度。最优权重是根据相互关联的不同权重集合所产生的最低成本中的最低权重来确定的。相互关联的权重集合的每个集合包括以预定方式生成的随机生成的初始权重集和随后的相关权重集合。用于产生后续权重集的预定方式有助于快速识别用于集合的最优权重集，并且因此快速识别为集合设置的整体最优权重。

2. 发明授权

US5202993A Method and apparatus for cost-based heuristic instruction scheduling 失效
标题翻译：基于成本的卫星指导调度方法与装置
公开(公告)号：US5202993A
公开(公告)日：1993-04-13
申请号：US661674
申请日：1991-02-27
申请人： Gregory Tarsy , Michael J. Woodard
发明人： Gregory Tarsy , Michael J. Woodard
IPC分类号： G06F9/38 , G06F9/45
CPC分类号： G06F8/445
摘要： A method and apparatus for cost based heuristic instruction scheduling for a pipelined processor is disclosed which has particular application to compile time instruction scheduling after code generation. The method and apparatus schedules instructions of an instruction block one at a time, based on the lowest total cost among all the current eligible free instructions. The total cost of each of the current eligible free instructions is computed based on the weighted sum of a plurality of cost heuristics. The cost heuristics used in the preferred embodiment comprise a resource dependency cost, a data dependency cost, a dependency wait cost, a dependent cycle cost, a floating point ratio cost, a store ratio cost and a floating point queue cost. Additionally, in the preferred embodiment, a number of the cost heuristics are modeled by a processor model. As a result, improved overall effectiveness in speeding up the execution time of an instruction block is achieved.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式