Please use this identifier to cite or link to this item:
Title: An EScheduler-based data dependence analysis and task scheduling for parallel circuit simulation
Authors: Chen, Xiaoming
Yu, Hao
Yang, Huazhong
Wu, Wei
Wang, Yu
Keywords: DRNTU::Engineering::Electrical and electronic engineering
Issue Date: 2011
Source: Chen, X., Wu, W., Wang, Y., Yu, H., & Yang, H. (2011). An EScheduler-based data dependence analysis and task scheduling for parallel circuit simulation. IEEE Transactions on Circuits and Systems II: Express Briefs, 58(10), 702-706.
Series/Report no.: IEEE transactions on circuits and systems II: express briefs
Abstract: 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.55× (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.
DOI: 10.1109/TCSII.2011.2164148
Schools: School of Electrical and Electronic Engineering 
Rights: © 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [DOI:].
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:EEE Journal Articles

Citations 10

Updated on May 21, 2024

Web of ScienceTM
Citations 10

Updated on Oct 25, 2023

Page view(s) 5

Updated on May 24, 2024

Download(s) 10

Updated on May 24, 2024

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.