summaryrefslogtreecommitdiffstatshomepage
path: root/src/lib/netlist/plib/putil.cpp
diff options
context:
space:
mode:
author couriersud <couriersud@gmx.org>2019-01-30 02:28:55 +0100
committer couriersud <couriersud@gmx.org>2019-01-31 01:03:35 +0100
commit1513c777b47d19c7df99ba43142d7a334392a0b5 (patch)
tree1698a72b6f570e579d9fe409ecb87c18108d5f1a /src/lib/netlist/plib/putil.cpp
parent3d09dec7b80bfaaed75d04ace63fcdc7a289f68a (diff)
netlist: Refactoring continues ... plus some innovations (nw)
Still some work ahead to separate interface from execution. This is a preparation to switch to another sparse matrix format easily which may be better suited for parallel processing. On the linear algebra side there are some nice additions: - Two additional sort modes: One tries to obtain a upper left identity matrix, the other prefers a diagonal band matrix structure. Both deliver slightly better performance than just sorting. - Parallel execution analysis for Gaussian elimination and LU solve. This determines which operations may be done independently. All of this is not really useful right now. The matrix sizes are below 100 nets. I estimate that we at least need four times more so that CPU parallel processing overhead pays off. For GPU, add another order. But it's nice to have code which may scale.
Diffstat (limited to 'src/lib/netlist/plib/putil.cpp')
0 files changed, 0 insertions, 0 deletions