Cart (Loading....) | Create Account
Close category search window
 

Innovative approaches to parallelizing finite-difference time-domain computations

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

2 Author(s)
Gorodetsky, D.A. ; University of Cincinnati, P.0. Box 210030 Cincinnati, Ohio 45221-0030 USA. Email: goroded@email.uc.edu ; Wilsey, P.A.

We investigate the Linux implementation of the finite-difference time- domain (FDTD) algorithm on a Beowulf cluster of parallel workstations. We discuss synchronization and domain decomposition alternatives. To obtain performance characteristics the algorithm is applied to a test scattering problem. The computation has been done using varying numbers of identical dual-processor AMD Athlon MP- 1800 workstations with the Message Passing Interface (MPI) used to handle the inter- processor communications and the parallel runtime.

Published in:

Direct and Inverse Problems of Electromagnetic and Acoustic Wave Theory, Proceedings of Xth International Seminar/Workshop on

Date of Conference:

12-15 Sept. 2005

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.