Parallelized Critical Path Search in Electrical Circuit Designs

Pascal Bolzhauser,Anthony Sulistio,Gerhard Angst,Christoph Reich

Higashi Hiroshima（2009）

引用 0|浏览0

暂无评分

摘要

For finding the critical path in electrical circuit designs, a shortest-path search must be carried out. This paper introduces a new two-level shortest-path search algorithm specially adapted for parallelization. The proposed algorithm is based on a module-based partitioning algorithm and a shortest-path search parallelized for the usage on multi-core systems. Experimental results show the impact of this approach.

查看译文

关键词

multi-core system,parallelized critical path search,critical path,proposed algorithm,electrical circuit designs,shortest-path search,electrical circuit design,new two-level shortest-path search,module-based partitioning algorithm,graph theory,search algorithm,shortest path,data mining,shortest path problem,electrical circuit,network synthesis,logic gates

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要