### Inhalt

### zur Navigation

## Es gibt keine deutsche Übersetzung dieser Webseite.

# Publications by Type: Miscellaneous (Talks, Posters, Demos, Drafts, etc.)

see also talks without publication, posters, demos, IETF drafts & RFCs. *(under construction)*

Zitatschlüssel | BFGGMOSST-APSUPDEP-96 |
---|---|

Autor | Blelloch, Guy E. and Feldmann, Anja and Ghattas, Omar and Gilbert, John R. and Miller, Gary L. and O'Hallaron, David R. and Shewchuk, Jonathan R. and Schwabe, Eric J. and Teng, Shang-Hua |

Jahr | 1996 |

Notiz | For more information on solving unstructured PDE and FEM problems see CMU's Quake project page, http://www.cs.cmu.edu/%7equake/. |

Zusammenfassung | This article describes Archimedes, an automated system for solving partial differential equations over complex domains using distributed memory supercomputers. Archimedes is intended to allow researchers in engineering and science to solve physical problems on irregularly shaped objects or regions. The tasks of such a system are manifold. First, Archimedes discretizes the domain being modelled by generating an unstructured mesh which fills the region. Then, the domain is partitioned into separate subdomains, which are placed onto individual processors. Communication is routed between these processors. Code is generated to solve a PDE in parallel. The geometric properties of the mesh can be exploited to find provably good partitions with good load balance and a relatively small amount of communication between subdomains. Machine-dependent heuristics for placement and routing are developed for iWarp and the Connection Machine CM-5. A parallel finite element algorithm can be written using simple primitives which hide each machine's underlying communication mechanisms. We consider how to optimize finite element algorithms using standard program transformations. We give sample performance figures on iWarp. |