Oct. 19, 1997 to Oct. 19, 1997
C. Mueller , Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA
Sort-first architectures for parallel rendering use the natural frame-to-frame coherence of primitives on the screen to increase performance by grouping primitives that are close together on the screen onto the same processor. This technique reduces processor-to-processor communications overhead. As primitives move on the screen, they may also be moved to other processors. This migration poses many problems for the editing and traversal of hierarchical graphics databases (HGDs) such as PHIGS. The author describes the major problems associated with implementing an HGD on a sort-first system. He discusses the basics of HGDs and how they extend to parallel graphics systems. He shows why bookkeeping for HGDs is a more complex issue for sort-first than for other parallel architectures. He then examines two possible solution branches for this issue and delve into the design choices and implementation issues that arise with either method. The methods differ in the amount of bookkeeping that they do versus the amount of primitive cull-testing that must be performed.
visual databases; sort-first architectures; hierarchical graphics databases; parallel rendering; natural frame-to-frame primitive coherence; grouping primitives; reduced processor-to-processor communications overhead; editing; traversal; bookkeeping; parallel architectures; primitive cull-testing
C. Mueller, "Hierarchical graphics databases in sort-first", PRS, 1997, Parallel Rendering Symposium, Parallel Rendering Symposium 1997, pp. 49, doi:10.1109/PRS.1997.628295