.png){kind=icon}
返回
An EScheduler-Based Data Dependence Analysis and Task Scheduling for Parallel Circuit Simulation
.png){kind=icon}
OA
AI
DOI：10.1109/TCSII.2011.2164148.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The sparse matrix solver has become the bottleneck in a Simulation Program with Integrated Circuit Emphasis circuit simulator. It is difficult to parallelize the sparse matrix solver because of the high data dependence during the numerical LU factorization. In this brief, a parallel LU factorization algorithm is developed on shared-memory computers with multicore central processing units, based on KLU algorithms. An Elimination Scheduler (EScheduler) is proposed to represent the data dependence during the LU factorization. Based on the EScheduler, the parallel tasks are scheduled in two modes to achieve a high level of concurrence, i.e., cluster mode and pipeline mode. The experimental results on 26 circuit matrices reveal that the developed algorithm can achieve speedup of 1.18-4.55x (on geometric average), as compared with KLU, with 1-8 threads. The result analysis indicates that for different data dependence, different parallel strategies should be dynamically selected to obtain optimal performance.
Keyword:
Circuit simulation
Elimination Scheduler (EScheduler)
parallel LU factorization
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
引用论文
Generation of Human iPSC-derived Neural Progenitor Cells (NPCs) as Drug Discovery Model for Neurological and Mitochondrial Disorders.png)
BIO-PROTOCOLOAAI
BIO-PROTOCOLIF0
OAAI分享收藏
分享收藏
查看更多内容