Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/95237
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wu, Wei | en |
dc.contributor.author | Gong, Fang | en |
dc.contributor.author | Krishnan, Rahul | en |
dc.contributor.author | Yu, Hao | en |
dc.contributor.author | He, Lei | en |
dc.date.accessioned | 2013-06-04T08:46:07Z | en |
dc.date.accessioned | 2019-12-06T19:11:01Z | - |
dc.date.available | 2013-06-04T08:46:07Z | en |
dc.date.available | 2019-12-06T19:11:01Z | - |
dc.date.copyright | 2012 | en |
dc.date.issued | 2012 | en |
dc.identifier.citation | Wu, W., Gong, F., Krishnan, R., Yu, H., & He, L. (2012). Exploiting Parallelism by Data Dependency Elimination: A Case Study of Circuit Simulation Algorithms. IEEE Design & Test of Computers, 1-1. | en |
dc.identifier.issn | 2168-2356 | en |
dc.identifier.uri | https://hdl.handle.net/10356/95237 | - |
dc.description.abstract | Considering the increasing complexity of integrated circuit (IC) designs at Nano-Tera scale, multi-core CPUs and many-core GPUs have provided ideal hardware platforms for emerging parallel algorithm developments in electronic design automation (EDA). However, it has become extremely challenging to leverage parallel hardware platforms at extreme scale beyond 22nm and 60GHz where the EDA algorithms, such as circuit simulation, show strong data dependencies. This paper presents data dependency elimination in circuit simulation algorithms such as parasitic extraction, transient simulation and periodic-steady-state (PSS) simulation, which paves the way towards unleashing the underlying power of parallel hardware platforms. | en |
dc.language.iso | en | en |
dc.relation.ispartofseries | IEEE design & test of computers | en |
dc.rights | © 2013 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: [http://dx.doi.org/10.1109/MDT.2012.2226201]. | en |
dc.subject | DRNTU::Engineering::Mathematics and analysis::Simulations | en |
dc.title | Exploiting parallelism by data dependency elimination : a case study of circuit simulation algorithms | en |
dc.type | Journal Article | en |
dc.contributor.school | School of Electrical and Electronic Engineering | en |
dc.identifier.doi | 10.1109/MDT.2012.2226201 | en |
dc.description.version | Accepted version | en |
item.grantfulltext | open | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | EEE Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Exploiting Parallelism by Data Dependency Elimination A Case Study of Circuit Simulation Algorithms.pdf | 797.83 kB | Adobe PDF | ![]() View/Open |
SCOPUSTM
Citations
20
9
Updated on Mar 28, 2023
Web of ScienceTM
Citations
20
8
Updated on Mar 19, 2023
Page view(s) 5
861
Updated on Mar 28, 2023
Download(s) 10
397
Updated on Mar 28, 2023
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.