Show simple item record

Efficient Multi-GPU Computation of All-Pairs Shortest Paths

date accessioned2020-03-12T20:35:00Z
date available2020-03-12T20:35:00Z
date issued2014
identifier other6877270.pdf
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/1018874?show=full
formatgeneral
languageEnglish
publisherIEEE
titleEfficient Multi-GPU Computation of All-Pairs Shortest Paths
typeConference Paper
contenttypeMetadata Only
identifier padid8143133
subject keywordsS-parameters
subject keywordscircuit simulation
subject keywordscomputational electromagnetics
subject keywordselectromagnetic coupling
subject keywordselectromagnetic wave scattering
subject keywordsfinite difference time-domain analysis
subject keywordsnetwork analysers
subject keywordsprinted circuits
subject keywords2D-FDTD method
subject keywords2D-finite difference time domain method
subject keywordsS-parameters
subject keywordselectric field intensities
subject keywordselectromagnetic coupling calculation
subject keywordselectromagnetic numerical method
subject keywordselectromagnetic problem simulation
subject keywordsequivalent circuits
subject keywordsfull wave EM solver
subject keywordsisolated ground islands
subject keywordsisolated power islands
identifier doi10.1109/EMCEurope.2014.6930903
journal titlearallel and Distributed Processing Symposium, 2014 IEEE 28th International
filesize269800
citations0
contributor rawauthorDjidjev, H. , Thulasidasan, S. , Chapuis, G. , Andonov, R. , Lavenier, D.


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record