The Case for Higher Computational Density in the Memory-Bound FDTD Method within Multicore Environments
It is argued here that more accurate though more compute-intensive alternate algorithms to certain computational methods which are deemed too inefficient and wasteful when implemented within serial codes can be more efficient and cost-effective when implemented in parallel codes designed to run on t...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | International Journal of Antennas and Propagation |
| Online Access: | http://dx.doi.org/10.1155/2012/280359 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|