1 / 6

Visualizing Very Large Scale Earthquake Simulations (SC 2003)

Visualizing Very Large Scale Earthquake Simulations (SC 2003). K.L.Ma, UC-Davis. Summary. A parallel rendering algorithm is presented to visualize a 3D seismic propagation (time varying data) of Northridge earthquake (highest resolution vol viz of an earthquake simulation to date)

gray-cooper
Download Presentation

Visualizing Very Large Scale Earthquake Simulations (SC 2003)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Visualizing Very Large Scale Earthquake Simulations (SC 2003) K.L.Ma, UC-Davis

  2. Summary • A parallel rendering algorithm is presented to visualize a 3D seismic propagation (time varying data) of Northridge earthquake (highest resolution vol viz of an earthquake simulation to date) • Issues dealt with: • Large data • Time varying data • Unstructured grid

  3. Main strategies used • Interleaving load distribution • Overlapping communication and computation • Avoiding per time step processing • Buffering intermediate results to amortize communication overheads • Compression • A parallel cell projection algorithm is used which requires no connectivity between adjacent cells unlike ray tracing (for visualizing unstructured data)

  4. Parallel Rendering • An octree based representation of the volume is used at multiple resolutions • The appropriate data resolution is used to match image resolution • Projection data is scattered to the nodes to eliminate nodes that are not viewed • The data block size is made coarse enough for faster traversal • The loading of blocks from disk and rendering are overlapped.

  5. Parallel Image Composition • SLIC (Scheduled Linear Image Compositing) • Pixels are classified as background (ignored), non-overlapping (sent directly to final processor) and 1, 2, 3 overlapping etc (figure 4) • Compositing is scheduled according to overlap • The overlapping calculation has to be redone when view point changes (scheduling for composition is also recalculated)

  6. Results, References • Test results should low compositing cost in most cases but after n=32, the parallel algorithm is inefficient due to load imbalance • Papers to look at: • survey of visualization of time varying data • binary swap • communication costs of parallel volume rendering algorithms • SLIC

More Related