title: Fast space-filling molecular graphics using dynamic partitioning among parallel processors.
abstract: We present a novel algorithm for the efficient generation of high-quality space-filling molecular graphics that is particularly appropriate for the creation of the large number of images needed in the animation of molecular dynamics. Each atom of the molecule is represented by a sphere of an appropriate radius, and the image of the sphere is constructed pixel-by-pixel using a generalization of the lighting model proposed by Porter (Comp. Graphics 1978, 12, 282). The edges of the spheres are antialiased, and intersections between spheres are handled through a simple blending algorithm that provides very smooth edges. We have implemented this algorithm on a multiprocessor computer using a procedure that dynamically repartitions the effort among the processors based on the CPU time used by each processor to create the previous image. This dynamic reallocation among processors automatically maximizes efficiency in the face of both the changing nature of the image from frame to frame and the shifting demands of the other programs running simultaneously on the same processors. We present data showing the efficiency of this multiprocessing algorithm as the number of processors is increased. The combination of the graphics and multiprocessor algorithms allows the fast generation of many high-quality images.
authors.affiliation: Department of Chemistry, University of California, San Diego, La Jolla 92093-0339.
authors.forename: B J
authors.initials: BJ
authors.lastname: Gertner
authors.forename: R M
authors.initials: RM
authors.lastname: Whitnell
authors.forename: K R
authors.initials: KR
authors.lastname: Wilson
mesh_terms: D000465:Algorithms; D003196:Computer Graphics; D003198:Computer Simulation; D008958:Models, Molecular