Parallel polygon rendering for message-passing architectures
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Parallel & Distributed Technology: Systems & Applications
- Vol. 2 (2) , 17-28
- https://doi.org/10.1109/88.311569
Abstract
Applications such as real-time animation and scientific visualization demand high performance for rendering complex 3D abstract data models into 2D images. As large applications migrate to highly parallel supercomputers, how can we exploit the available parallelism to keep the rendering on the supercomputer? To answer this question, we developed a parallel polygon renderer for general-purpose MIMD distributed-memory message-passing systems. It exploits object-level and image-level parallelism, and can run on systems containing from one processor to a number bounded by the number of scan lines in the resulting image. Unlike earlier approaches, ours multiplexes the transformation and rasterization phases on the same machine. This reduces memory usage and network contention, and overlaps computation and communication.Keywords
This publication has 7 references indexed in Scilit:
- A task adaptive parallel graphics rendererPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A multicomputer polygon rendering algorithm for interactive applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast data parallel polygon renderingPublished by Association for Computing Machinery (ACM) ,1993
- Multiprocessor Methods for Computer Graphics RenderingPublished by Taylor & Francis ,1992
- PixelFlow: high-speed rendering using image compositionPublished by Association for Computing Machinery (ACM) ,1992
- Pixel-planes 5: a heterogeneous multiprocessor graphics system using processor-enhanced memoriesPublished by Association for Computing Machinery (ACM) ,1989
- A parallel processor architecture for graphics arithmetic operationsACM SIGGRAPH Computer Graphics, 1987