Parallel visualization algorithms: performance and architectural implications
- 1 July 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 27 (7), 45-55
- https://doi.org/10.1109/2.299410
Abstract
Recently, a new class of scalable, shared-address-space multiprocessors has emerged. Like message-passing machines, these multiprocessors have a distributed interconnection network and physically distributed main memory. However, they provide hardware support for efficient implicit communication through a shared address space, and they automatically exploit temporal locality by caching both local and remote data in a processor's hardware cache. In this article, we show that these architectural characteristics make it much easier to obtain very good speedups on the best known visualization algorithms. Simple and natural parallelizations work very well, the sequential implementations do not have to be fundamentally restructured, and the high degree of temporal locality obviates the need for explicit data distribution and communication management. We demonstrate our claims through parallel versions of three state-of-the-art algorithms: a recent hierarchical radiosity algorithm by Hanrahan et al. (1991), a parallelized ray-casting volume renderer by Levoy (1992), and an optimized ray-tracer by Spach and Pulleyblank (1992). We also discuss a new shear-warp volume rendering algorithm that provides the first demonstration of interactive frame rates for a 256/spl times/256/spl times/256 voxel data set on a general-purpose multiprocessor.<>Keywords
This publication has 9 references indexed in Scilit:
- Working Sets, Cache Sizes, And Node Granularity Issues For Large-scale MultiprocessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The directory-based cache coherence protocol for the DASH multiprocessorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Parallel Processing of Progressive Refinement Radiosity MethodsPublished by Springer Nature ,1994
- Fast volume rendering using a shear-warp factorization of the viewing transformationPublished by Association for Computing Machinery (ACM) ,1994
- Volume rendering on scalable shared-memory MIMD architecturesPublished by Association for Computing Machinery (ACM) ,1992
- A rapid hierarchical radiosity algorithmACM SIGGRAPH Computer Graphics, 1991
- A highly flexible multiprocessor solution for ray tracingThe Visual Computer, 1990
- Load balancing strategies for a parallel ray-tracing system based on constant subdivisionThe Visual Computer, 1988
- A progressive refinement approach to fast radiosity image generationACM SIGGRAPH Computer Graphics, 1988