### Abstract

Electromagnetic fields interacting with a dielectric or conducting structure produce scattered electromagnetic fields. To model the fields produced by complicated, volumetric structures, the finite difference time domain (FDTD) method employs an iterative solution to Maxwell's time dependent curl equations. Implementations of the FDTD method intensively use memory and perform numerous calculations per time step iteration. We implemented an FDTD code on the California Institute of Technology/ Jet Propulsion Laboratory Mark III Hypercube. This code allows us to solve problems requiring as many as 2,048,OOO unit cells on a 32 node Hypercube. For smaller problems, the code produces solutions in a fraction of the time to solve the same problems on sequential computers.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988 |

Editors | Geoffrey Fox |

Publisher | Association for Computing Machinery, Inc |

Pages | 1088-1100 |

Number of pages | 13 |

Volume | 2 |

ISBN (Electronic) | 0897912780, 9780897912785 |

DOIs | |

State | Published - Jan 3 1989 |

Externally published | Yes |

Event | 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988 - Pasadena, United States Duration: Jan 19 1988 → Jan 20 1988 |

### Other

Other | 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988 |
---|---|

Country | United States |

City | Pasadena |

Period | 1/19/88 → 1/20/88 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture
- Computer Graphics and Computer-Aided Design
- Software
- Computer Science Applications

### Cite this

*Proceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988*(Vol. 2, pp. 1088-1100). Association for Computing Machinery, Inc. https://doi.org/10.1145/63047.63062

**Finite difference time domain solution of electromagnetic scattering on the hypercube.** / Calaio, Rue H.; Lyons, James; Imbriale, William A.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988.*vol. 2, Association for Computing Machinery, Inc, pp. 1088-1100, 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988, Pasadena, United States, 1/19/88. https://doi.org/10.1145/63047.63062

}

TY - GEN

T1 - Finite difference time domain solution of electromagnetic scattering on the hypercube

AU - Calaio, Rue H.

AU - Lyons, James

AU - Imbriale, William A.

PY - 1989/1/3

Y1 - 1989/1/3

N2 - Electromagnetic fields interacting with a dielectric or conducting structure produce scattered electromagnetic fields. To model the fields produced by complicated, volumetric structures, the finite difference time domain (FDTD) method employs an iterative solution to Maxwell's time dependent curl equations. Implementations of the FDTD method intensively use memory and perform numerous calculations per time step iteration. We implemented an FDTD code on the California Institute of Technology/ Jet Propulsion Laboratory Mark III Hypercube. This code allows us to solve problems requiring as many as 2,048,OOO unit cells on a 32 node Hypercube. For smaller problems, the code produces solutions in a fraction of the time to solve the same problems on sequential computers.

AB - Electromagnetic fields interacting with a dielectric or conducting structure produce scattered electromagnetic fields. To model the fields produced by complicated, volumetric structures, the finite difference time domain (FDTD) method employs an iterative solution to Maxwell's time dependent curl equations. Implementations of the FDTD method intensively use memory and perform numerous calculations per time step iteration. We implemented an FDTD code on the California Institute of Technology/ Jet Propulsion Laboratory Mark III Hypercube. This code allows us to solve problems requiring as many as 2,048,OOO unit cells on a 32 node Hypercube. For smaller problems, the code produces solutions in a fraction of the time to solve the same problems on sequential computers.

UR - http://www.scopus.com/inward/record.url?scp=84939726237&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84939726237&partnerID=8YFLogxK

U2 - 10.1145/63047.63062

DO - 10.1145/63047.63062

M3 - Conference contribution

VL - 2

SP - 1088

EP - 1100

BT - Proceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988

A2 - Fox, Geoffrey

PB - Association for Computing Machinery, Inc

ER -