Premium
Parallel computing efficiency analysis of BOR‐FDTD code on a Beowulf cluster
Author(s) -
Lu Yongquan,
Lu Rui,
Che Qing,
Su Zhiwu,
Yu Wenhua,
Mittra Raj
Publication year - 2007
Publication title -
microwave and optical technology letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.304
H-Index - 76
eISSN - 1098-2760
pISSN - 0895-2477
DOI - 10.1002/mop.22423
Subject(s) - finite difference time domain method , myrinet , computer science , ethernet , code (set theory) , parallel computing , microwave , cluster (spacecraft) , reflector (photography) , computational science , computer cluster , antenna (radio) , software , computer hardware , optics , telecommunications , physics , message passing , distributed computing , operating system , light source , set (abstract data type) , programming language
Abstract In this communication, we investigate the efficiency of a parallel BOR‐FDTD code on a commonly used Beowulf cluster which is connected via an Ethernet or Myrinet networking system. The efficiency of a parallel BOR‐FDTD code is relatively high since it only requires data exchanging between the processors on the subdomain boundary. A satellite reflector antenna is simulated by using the parallel BOR‐FDTD code in order to verify the parallel code we developed. Numerical experiments have demonstrated both software design and networking system play an important role in the efficiency of parallel processing. © 2007 Wiley Periodicals, Inc. Microwave Opt Technol Lett 49: 1398–1401, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI.10.1002/mop.22423