Optimal processor allocation for sort-last compositing under BSP-tree ordering

C. R. Ramakrishnan, Claudio T. Silva

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

An optimal processor allocation technique for parallelizing compositing back-end for sort-last rendering systems based on a BSP-tree execution model is proposed. This allocation technique can be readily adapted to optimize other system parameters, such as frame rate and latency. Other techniques are also introduced to optimize sequential operations of individual compositing processes, as well as to reduce communication overheads and effectively pipeline compositing operations. For purposes of illustration, all these techniques are implemented on a MPP machine.

Original languageEnglish (US)
Title of host publicationProceedings of SPIE - The International Society for Optical Engineering
PublisherSociety of Photo-Optical Instrumentation Engineers
Pages182-192
Number of pages11
Volume3643
StatePublished - 1999
EventProceedings of the 1999 Visual Data Exploration and Analysis VI - San Jose, CA, USA
Duration: Jan 27 1999Jan 28 1999

Other

OtherProceedings of the 1999 Visual Data Exploration and Analysis VI
CitySan Jose, CA, USA
Period1/27/991/28/99

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Condensed Matter Physics

Fingerprint Dive into the research topics of 'Optimal processor allocation for sort-last compositing under BSP-tree ordering'. Together they form a unique fingerprint.

  • Cite this

    Ramakrishnan, C. R., & Silva, C. T. (1999). Optimal processor allocation for sort-last compositing under BSP-tree ordering. In Proceedings of SPIE - The International Society for Optical Engineering (Vol. 3643, pp. 182-192). Society of Photo-Optical Instrumentation Engineers.