Given by Scott Klasky, Tom Haupt, Geoffrey C. Fox at CRPC Annual Meeting Houston on 21 May 97. Foils prepared 19 May 97
Abstract * Foil Index for this file
We describe basic physics and computational features of Binary Black Collision Grand Challenge |
We show a simple finite difference is complicated by
|
High level systems DAGH and especially HPF1 cannot express full complexity of problem and MPI must fill in the missing parts |
HPF2 might be able to express full problem but HPF1 misses many key capabilities |
DAGH is more succesful than HPF1 but needs MPI for parts of problem |
Postscript or FramemakerVersion |
HPF Code for Linear Waves |
Grand Challenge Alliance Home Page |
NPAC Activity in Grand Challenge Alliance |
This table of Contents Abstract