A task adaptive parallel graphics rendering algorithm
Conference
·
OSTI ID:5516104
A parallel approach to computer graphics rendering is needed in order to generate images of highly complex data quickly. This paper presents such an algorithm which can be used on general purpose multiprocessor computers. It was designed for a physically-distributed, logically-shared memory computer with features amenable to both shared memory and message passing implementation. The work decomposition strategy involves assigning rectangular screen space areas to processors initially. Then, as the computation proceeds, processors which have completed their work adaptively partition another processor's task in order to even the computational load. Results on the BBN TC2000 computer at LLNL for this algorithm indicate an efficiency ranging from 59% to 90% on 96 processors for a variety of test images. In fact, a rendering speed of almost 100,000 polygons per second (anti-aliased, specular highlighted) was achieved at this configuration using the software algorithm described here.
- Research Organization:
- Lawrence Livermore National Lab., CA (United States)
- Sponsoring Organization:
- DOE; USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 5516104
- Report Number(s):
- UCRL-JC-109659; CONF-920759--1; ON: DE92008062
- Country of Publication:
- United States
- Language:
- English
Similar Records
A task adaptive parallel graphics rendering algorithm
A Task Adaptive parallel graphics renderer
Object-oriented parallel polygon rendering
Conference
·
Sat Nov 30 23:00:00 EST 1991
·
OSTI ID:10125293
A Task Adaptive parallel graphics renderer
Conference
·
Sun Dec 20 23:00:00 EST 1992
·
OSTI ID:10168876
Object-oriented parallel polygon rendering
Conference
·
Thu Sep 01 00:00:00 EDT 1994
·
OSTI ID:10109198