By Topic

Implementation of matrix-type FDTD algorithm on a graphics accelerator

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Dziekonski, A. ; Dept. of Microwave & Antenna Eng., Gdansk Univ. of Technol., Gdansk ; Sypek, P. ; Kulas, L. ; Mrozowski, M.

This paper presents initial conclusions concerning the implementation of matrix-type FDTD algorithm on a low cost graphics accelerator (Nvidia GeForce GT 512 MB, 1.188 GHz) in CUDA (compute unified device architecture). Authors of this article pose a question as to whether using the graphics accelerator based on SIMD architecture (single instruction, multiple data) is reasonable in programming a matrix-type FDTD algorithm, then results of tests meant to compare the efficiency of sequential and parallel implementation are presented.

Published in:

Microwaves, Radar and Wireless Communications, 2008. MIKON 2008. 17th International Conference on

Date of Conference:

19-21 May 2008