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

Fingerprint

central processing units
Pipelines
massively parallel processors
Communication
communication

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Condensed Matter Physics

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.

Optimal processor allocation for sort-last compositing under BSP-tree ordering. / Ramakrishnan, C. R.; Silva, Claudio T.

Proceedings of SPIE - The International Society for Optical Engineering. Vol. 3643 Society of Photo-Optical Instrumentation Engineers, 1999. p. 182-192.

Research output: Chapter in Book/Report/Conference proceedingChapter

Ramakrishnan, CR & Silva, CT 1999, Optimal processor allocation for sort-last compositing under BSP-tree ordering. in Proceedings of SPIE - The International Society for Optical Engineering. vol. 3643, Society of Photo-Optical Instrumentation Engineers, pp. 182-192, Proceedings of the 1999 Visual Data Exploration and Analysis VI, San Jose, CA, USA, 1/27/99.
Ramakrishnan CR, Silva CT. Optimal processor allocation for sort-last compositing under BSP-tree ordering. In Proceedings of SPIE - The International Society for Optical Engineering. Vol. 3643. Society of Photo-Optical Instrumentation Engineers. 1999. p. 182-192
Ramakrishnan, C. R. ; Silva, Claudio T. / Optimal processor allocation for sort-last compositing under BSP-tree ordering. Proceedings of SPIE - The International Society for Optical Engineering. Vol. 3643 Society of Photo-Optical Instrumentation Engineers, 1999. pp. 182-192
@inbook{23d9505c5f8541f1bab44feda1b42632,
title = "Optimal processor allocation for sort-last compositing under BSP-tree ordering",
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.",
author = "Ramakrishnan, {C. R.} and Silva, {Claudio T.}",
year = "1999",
language = "English (US)",
volume = "3643",
pages = "182--192",
booktitle = "Proceedings of SPIE - The International Society for Optical Engineering",
publisher = "Society of Photo-Optical Instrumentation Engineers",

}

TY - CHAP

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

AU - Ramakrishnan, C. R.

AU - Silva, Claudio T.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032686980&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032686980&partnerID=8YFLogxK

M3 - Chapter

VL - 3643

SP - 182

EP - 192

BT - Proceedings of SPIE - The International Society for Optical Engineering

PB - Society of Photo-Optical Instrumentation Engineers

ER -