A multicomputer polygon rendering algorithm for interactive applications
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper presents a new multicomputer polygon rendering algorithm that is specialized for interactive applications. The algorithm differs from previous algorithms in two ways. First, it load balances the rasterization once per frame, instead of as the frame progresses, using the previous frame's distribution of polygons on the screen as input to the load-balancing algorithm. Second, it uses a new message sending scheme that reduces the number of messages required. These characteristics mean that the algorithm only requires global synchronization between frames, which allows for higher frame rates. The algorithm was selected using a simulator which confirmed that using the previous frame's polygon distribution on the screen is nearly as good as using the current frame's distribution. The algorithm is implemented on Caltech's Intel Touchstone Delta, a 512 processor multicomputer system, and preliminary performance figures are given. The highest performance achieved to date is 930,000 triangles per second using 256 processors and a 806,640 triangle data set.Keywords
This publication has 8 references indexed in Scilit:
- A MIMD rendering algorithm for distributed memory architecturesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Distributing display lists on a multicomputerPublished by Association for Computing Machinery (ACM) ,1990
- Pixel-planes 5: a heterogeneous multiprocessor graphics system using processor-enhanced memoriesPublished by Association for Computing Machinery (ACM) ,1989
- The Silicon Graphics 4D/240GTX superworkstationIEEE Computer Graphics and Applications, 1989
- A display system for the Stellar graphics supercomputer model GS1000Published by Association for Computing Machinery (ACM) ,1988
- Simulation and expected performance analysis of multiple processor Z-buffer systemsPublished by Association for Computing Machinery (ACM) ,1980
- Parallel processing techniques for hidden surface removalPublished by Association for Computing Machinery (ACM) ,1979
- Distributing a visible surface algorithm over multiple processorsPublished by Association for Computing Machinery (ACM) ,1977