loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Algorithm for Interactive Graphics on Multicomputers
July/August 1994 (vol. 14 no. 4)
pp. 33-40

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.

1. F. Parke, "Simulation and Expected Performance Analysis of Multiple Processor Z-buffer Systems,"Computer Graphics(Proc. Siggraph), Vol. 14, No. 3, July 1980, pp. 48-56.
2. M. Kaplan and D.P. Greenberg, "Parallel Processing Techniques for Hidden Surface Removal,"Computer Graphics(Proc. Siggraph), Vol. 13, No. 2, Aug. 1979, pp. 300-307.
3. D.S. Whelan,Animac: A Multiprocessor Architecture for Real-Time Computer Animation, doctoral dissertation, California Institute of Technology, Pasadena, Calif., 1985.
4. S. Whitman,Multiprocessor Methods for Computer Graphics Rendering, AK Peters, Wellesley, Mass., 1992.
5. S. Whitman, "A Task-Adaptive Parallel Graphics Renderer,"IEEE CG&A, Vol. 14, No. 4, July 1994, pp. 41-48.
6. H. Fuchs et al., "Pixel-Planes 5: A Heterogeneous Multiprocessor Graphics System Using Processor-Enhanced Memory,"Computer Graphics(Proc. Siggraph), Vol. 23, No. 3, July 1989, pp. 79-88.
7. D.R. Roble, "A Load Balanced Parallel Scanline Z-buffer Algorithm for the iPSC Hypercube,"Proc. First Int'l Conf. Pixim 88, Editions Hermes, Paris, 1988, pp. 177-192.
8. F.A. Ortega, C.D. Hansen, and J.P. Ahrens, "Fast Data Parallel Polygon Rendering,"Proc. Supercomputing 93, IEEE Computer Society Press, Los Alamitos, Calif., 1993, pp. 709-718.
9. T. W. Crockett and T. Orloff, "A Parallel Rendering Algorithm for MIMD Architectures,"Proc. Parallel Rendering Symposium, ACM Press, New York, 1993, pp. 35-42.
10. D. Ellsworth, H. Good, and B. Tebbs, "Distributing Display Lists on a Multicomputer,"Computer Graphics(Proc. Symp. Interactive 3D Graphics), Vol. 24, No. 2, Mar. 1990, pp. 147-155.
11. S.E. Molnar et al., "A Sorting Classification of Parallel Rendering,"IEEE CG&A, Vol. 14, No. 4, July 1994, pp. 23-32.
12. V. Kumar et al.,Introduction to Parallel Computing: Design and Analysis of Parallel Algorithms, Benjamin Cummings, Redwood City, Calif., 1994.

Citation:
David A. Ellsworth, "A New Algorithm for Interactive Graphics on Multicomputers," IEEE Computer Graphics and Applications, vol. 14, no. 4, pp. 33-40, July/Aug. 1994, doi:10.1109/38.291529
Usage of this product signifies your acceptance of the Terms of Use.