Parallel total weight crossing number algorithm for channel routing on a linear array with a reconfigurable pipelined bus system

被引：1

作者：

Kimm, H

机构：

来源：

PROCEEDINGS OF THE TWENTY-NINTH SOUTHEASTERN SYMPOSIUM ON SYSTEM THEORY | 1997年

关键词：

D O I：

10.1109/SSST.1997.581604

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In the channel routing problem, terminals between cells ave interconnected completely while reducing channel routing area. The crossing number, the number of crossings between two wires in the channel, is related to the channel routing area. In this paper; we present a parallel algorithm finding a weighted total crossing number in the channel by using LARPBS model (Linear Array with a Reconfigurable Pipelined Bus System), which is based on the advanced fiber optic technology. The parallel total weight crossing number algorithm on the LARPBS model runs in O(n*log(root n)) time using O(n) number of processors, where n is the number of nets in a channel.

引用

页码：183 / 187

页数：5

共 44 条

[21] Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system
Li, KQ
Pan, Y
Zheng, SQ
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (08) : 705 - 720
[22] Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system
State Univ of New York, New Paltz, United States
IEEE Trans Parallel Distrib Syst, 8 (705-720):
[23] The systems edge of the Parameterized Linear Array with a Reconfigurable Pipelined Bus System (LARPBS(p)) optical bus parallel computing model
d'Auriol, Brian J.
JOURNAL OF SUPERCOMPUTING, 2009, 48 (02): : 183 - 209
[24] The systems edge of the Parameterized Linear Array with a Reconfigurable Pipelined Bus System (LARPBS(p)) optical bus parallel computing model
Brian J. d’Auriol
The Journal of Supercomputing, 2009, 48
[25] Multiple addition and prefix sum on a linear array with a reconfigurable pipelined bus system
Datta, A
JOURNAL OF SUPERCOMPUTING, 2004, 29 (03): : 303 - 317
[26] Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system
Pan, Y
Li, KQ
Zheng, SQ
THIRD INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS, PROCEEDINGS (I-SPAN '97), 1997, : 444 - 450
[27] Multiple Addition and Prefix Sum on a Linear Array with a Reconfigurable Pipelined Bus System
Amitava Datta
The Journal of Supercomputing, 2004, 29 : 303 - 317
[28] Efficient Graph-Theoretic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
Amitava Datta
The Journal of Supercomputing, 2002, 23 : 193 - 211
[29] Efficient graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system
Datta, A
JOURNAL OF SUPERCOMPUTING, 2002, 23 (02): : 193 - 211
[30] Constant time fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system
Bourgeois, AG
Pan, Y
Prasad, SK
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2005, 65 (03) : 374 - 381

← 1 2 3 4 5 →