A heuristic approach to datapath scheduling of complex conditional structure

1995 IEEE TENCON. IEEE Region 10 International Conference on Microelectronics and VLSI. 'Asia-Pacific Microelectronics 2000'. Proceedings Pub Date : 1995-11-06 DOI:10.1109/TENCON.1995.496361

S. Nakamura, A. Yamada, I. Shirakawa

引用次数: 0

Abstract

This paper proposes a new heuristic approach to the time-constrained datapath scheduling with complex conditional structures. This algorithm intends to select the best of all solutions attained by the iterative refinement process. Experimental results demonstrate that this algorithm attains optimal results in most cases and can be applied to a practical scale of datapath scheduling.

查看原文本刊更多论文

复杂条件结构数据路径调度的一种启发式方法

本文提出了一种新的启发式方法来解决具有复杂条件结构的时间约束数据路径调度问题。该算法旨在从迭代优化过程得到的所有解中选择最优解。实验结果表明，该算法在大多数情况下都获得了最优结果，可以应用于实际规模的数据路径调度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

1995 IEEE TENCON. IEEE Region 10 International Conference on Microelectronics and VLSI. 'Asia-Pacific Microelectronics 2000'. Proceedings

自引率

0.00%

发文量