VLSI routing on the pipelined hypercube and related networks

[1991] Proceedings. First Great Lakes Symposium on VLSI Pub Date : 1991-03-01 DOI:10.1109/GLSV.1991.143933

J. JáJá

引用次数: 0

Abstract

The author presents parallel algorithms for several important combinatorial problems related to VLSI routing. These algorithms achieve linear speed-ups on the pipelined hypercube, and provably optimal speed-ups on the shuffle-exchange and the cube-connected-cycles, for any number p of processors satisfying 1 >

查看原文本刊更多论文

管道超立方体及相关网络上的VLSI路由

作者提出了几个与VLSI路由相关的重要组合问题的并行算法。对于满足1 >的任意p个处理器，这些算法在流水线超立方体上实现了线性加速，并且在洗牌交换和立方体连接循环上实现了可证明的最优加速。

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

求助全文

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

来源期刊