Pixel-planes 5: a heterogeneous multiprocessor graphics system using processor-enhanced memories
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Distributing display lists on a multicomputer
I3D '90 Proceedings of the 1990 symposium on Interactive 3D graphics
Multiprocessor methods for computer graphics rendering
Multiprocessor methods for computer graphics rendering
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
A MIMD rendering algorithm for distributed memory architectures
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
Fast data parallel polygon rendering
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
A Sorting Classification of Parallel Rendering
IEEE Computer Graphics and Applications
Dynamic Load Balancing for Parallel Polygon Rendering
IEEE Computer Graphics and Applications
Parallel processing techniques for hidden surface removal
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
Simulation and expected performance analysis of multiple processor Z-buffer systems
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Animac: a multiprocessor architecture for real-time computer animation (graphics, shadows, vlsi)
Animac: a multiprocessor architecture for real-time computer animation (graphics, shadows, vlsi)
A Sorting Classification of Parallel Rendering
IEEE Computer Graphics and Applications
The sort-first rendering architecture for high-performance graphics
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
Image composition methods for sort-last polygon rendering on 2-D mesh architectures
PRS '95 Proceedings of the IEEE symposium on Parallel rendering
Synchronization for a multi-port frame buffer on a mesh-connected multicomputer
PRS '95 Proceedings of the IEEE symposium on Parallel rendering
Interactive parallel rendering on a multiprocessor system with intelligent communication controllers
PRS '95 Proceedings of the IEEE symposium on Parallel rendering
Scheduling policies to support distributed 3D multimedia applications
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
I3D '99 Proceedings of the 1999 symposium on Interactive 3D graphics
Load balancing for multi-projector rendering systems
HWWS '99 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Hybrid sort-first and sort-last parallel rendering with a cluster of PCs
HWWS '00 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Adaptive Parallel Rendering on Multiprocessors and Workstation Clusters
IEEE Transactions on Parallel and Distributed Systems
Image Composition Schemes for Sort-Last Polygon Rendering on 2D Mesh Multicomputers
IEEE Transactions on Visualization and Computer Graphics
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Optimal static 2-dimensional screen subdivision for parallel rasterization architectures
EGGH'96 Proceedings of the Eleventh Eurographics conference on Graphics Hardware
| Hi-index | 0.00 |
As nonshared-memory multiple instruction, multiple data (MIMD) systems become more common, it becomes important to develop parallel rendering algorithms for them. These systems, known as multicomputers, can produce data sets so large that it is difficult to visualize the data on conventional graphics systems, especially if the visualization proceeds in tandem with the calculation. Parallel systems must run interactive graphics to allow convenient visualizations of their computations. While few parallel systems currently have a frame buffer that will support interactive rendering, such systems should be more common in the future. This article describes an algorithm suited for interactive polygon rendering, where the model's image on screen generally has frame-to-frame coherence. The algorithm uses this coherence to perform load-balancing calculations in parallel with the other calculations. The algorithm also uses an optimized version of personalized all-to-all communication, where all processors communicate with all other processors.