Fast Transform-based preconditioners for large-scale power grid analysis on massively parallel architectures
dc.creator | Daloukas, K. | en |
dc.creator | Evmorfopoulos, N. | en |
dc.creator | Drasidis, G. | en |
dc.creator | Tsiampas, M. | en |
dc.creator | Tsompanopoulou, P. | en |
dc.creator | Stamoulis, G. I. | en |
dc.date.accessioned | 2015-11-23T10:25:05Z | |
dc.date.available | 2015-11-23T10:25:05Z | |
dc.date.issued | 2012 | |
dc.identifier.issn | 10923152 | |
dc.identifier.uri | http://hdl.handle.net/11615/26868 | |
dc.description.abstract | Efficient analysis of massive on-chip power delivery networks is among the most challenging problems facing the EDA industry today. In this paper, we present a new preconditioned iterative method for fast DC and transient simulation of large-scale power grids found in contemporary nanometer-scale ICs. The emphasis is placed on the preconditioner which reduces the number of iterations by a factor of 5X for a 2.6M-node industrial design and by 72.6X for a 6.2M-node synthetic benchmark, compared with incomplete factorization preconditioners. Moreover, owing to the preconditioner's special structure that allows utilizing a Fast Transform solver, the preconditioning system can be solved in a near-optimal number of operations, while it is extremely amenable to parallel computation on massively parallel architectures like graphics processing units (GPUs). Experimental results demonstrate that our method achieves a speed-up of 214.3X and 138.7X for a 2.6M-node industrial design, and a speed-up of 1610.5X and 438X for a 3.1M-node synthetic design, over state-of-the-art direct and iterative solvers respectively when GPUs are utilized. At the same time, its matrix-less formulation allows for reducing the memory footprint by up to 33% compared to the memory requirements of the best available iterative solver. © 2012 ACM. | en |
dc.source.uri | http://www.scopus.com/inward/record.url?eid=2-s2.0-84872308110&partnerID=40&md5=33fdc176f9c39d0462e3fdcb10fc12a8 | |
dc.subject | EDA industry | en |
dc.subject | Efficient analysis | en |
dc.subject | Fast Transform | en |
dc.subject | Graphics processing units | en |
dc.subject | Incomplete factorization | en |
dc.subject | Iterative solvers | en |
dc.subject | Memory footprint | en |
dc.subject | Memory requirements | en |
dc.subject | Nano-meter-scale | en |
dc.subject | Number of iterations | en |
dc.subject | On chips | en |
dc.subject | Parallel Computation | en |
dc.subject | Power delivery network | en |
dc.subject | Power grid analysis | en |
dc.subject | Power grids | en |
dc.subject | Preconditioned iterative methods | en |
dc.subject | Preconditioners | en |
dc.subject | Special structure | en |
dc.subject | Synthetic benchmark | en |
dc.subject | Synthetic design | en |
dc.subject | Transient simulation | en |
dc.subject | Computer aided design | en |
dc.subject | Computer graphics | en |
dc.subject | Electric power transmission | en |
dc.subject | Iterative methods | en |
dc.subject | Product design | en |
dc.subject | Program processors | en |
dc.subject | Parallel architectures | en |
dc.title | Fast Transform-based preconditioners for large-scale power grid analysis on massively parallel architectures | en |
dc.type | conferenceItem | en |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |