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

C. R. Ramakrishnan; Claudio T. Silva

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

C. R. Ramakrishnan
, Claudio T. Silva

Computer Science

Stony Brook University

Stony Brook University

Research output: Contribution to journal › Conference article › peer-review

3 Scopus citations

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 language	English
Pages (from-to)	182-192
Number of pages	11
Journal	Proceedings of SPIE - The International Society for Optical Engineering
Volume	3643
State	Published - 1999
Event	Proceedings of the 1999 Visual Data Exploration and Analysis VI - San Jose, CA, USA Duration: Jan 27 1999 → Jan 28 1999

Cite this

@article{a63b6da101844ba18bf3869d5b8a19ba,

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",

volume = "3643",

pages = "182--192",

journal = "Proceedings of SPIE - The International Society for Optical Engineering",

issn = "0277-786X",

note = "Proceedings of the 1999 Visual Data Exploration and Analysis VI ; Conference date: 27-01-1999 Through 28-01-1999",

}

TY - JOUR

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 - https://www.scopus.com/pages/publications/0032686980

M3 - Conference article

SN - 0277-786X

VL - 3643

SP - 182

EP - 192

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

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

T2 - Proceedings of the 1999 Visual Data Exploration and Analysis VI

Y2 - 27 January 1999 through 28 January 1999

ER -

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

Abstract

Other files and links

Fingerprint

Cite this