Parallelizing the ZSWEEP Algorithm for Distributed-Shared Memory Architectures (original) (raw)

Parallel rendering of volumetric data set on distributed‐memory architectures

1993

Abstract A solution is proposed to the problem of interactive visualization and rendering of volume data. Designed for parallel distributed memory MIMD architectures, the volume rendering system is based on the ray tracing (RT) visualization technique, the Sticks representation scheme (a data structure exploiting data coherence for the compression of classified data sets), the use of a slice-partitioning technique for the distribution of the data between the processing nodes and the consequent ray-data-flow parallelizing strategy.

Image-Space Decomposition Algorithms for Sort-First Parallel Volume Rendering of Unstructured Grids

The Journal of Supercomputing, 2000

Twelve adaptive image-space decomposition algorithms are presented for sort-rst parallel direct volume rendering (DVR) of unstructured grids on distributed-memory architectures. The algo- rithms are presented under a novel taxonomy based on the dimension of the screen decomposition, the dimension of the workload arrays used in the decomposition, and the scheme used for workload-array creation and querying the workload of a