The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Une approche de traitement parallèle des données est prometteuse pour le rendu de volumes en temps réel en raison du parallélisme massif du rendu de volumes. Dans le rendu de volumes parallèle aux données, les éléments de traitement des résultats locaux (PE) générés à partir des sous-volumes alloués sont intégrés pour former une image finale. Généralement, l'intégration entraîne une surcharge inévitable dans le rendu de volume parallèle aux données en raison des communications entre les PE. Cet article propose un algorithme de rendu de volume par cisaillement et déformation parallèle aux données, combiné à une méthode de subdivision de volume adaptative pour réduire la surcharge de communication et améliorer l'efficacité du traitement. Nous implémentons l'algorithme parallèle sur un système multiprocesseur de transmission de messages pour l'évaluation des performances. Les résultats expérimentaux montrent que la méthode de subdivision adaptative en volume peut réduire les frais généraux et atteindre une efficacité plus élevée par rapport à une méthode de subdivision en dalle conventionnelle.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Kentaro SANO, Hiroyuki KITAJIMA, Hiroaki KOBAYASHI, Tadao NAKAMURA, "Data-Parallel Volume Rendering with Adaptive Volume Subdivision" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 1, pp. 80-89, January 2000, doi: .
Abstract: A data-parallel processing approach is promising for real-time volume rendering because of the massive parallelism in volume rendering. In data-parallel volume rendering, local results processing elements(PEs) generate from allocated subvolumes are integrated to form a final image. Generally, the integration causes an overhead unavoidable in data-parallel volume rendering due to communications among PEs. This paper proposes a data-parallel shear-warp volume rendering algorithm combined with an adaptive volume subdivision method to reduce the communication overhead and improve processing efficiency. We implement the parallel algorithm on a message-passing multiprocessor system for performance evaluation. The experimental results show that the adaptive volume subdivision method can reduce the overhead and achieve higher efficiency compared with a conventional slab subdivision method.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_1_80/_p
Copier
@ARTICLE{e83-d_1_80,
author={Kentaro SANO, Hiroyuki KITAJIMA, Hiroaki KOBAYASHI, Tadao NAKAMURA, },
journal={IEICE TRANSACTIONS on Information},
title={Data-Parallel Volume Rendering with Adaptive Volume Subdivision},
year={2000},
volume={E83-D},
number={1},
pages={80-89},
abstract={A data-parallel processing approach is promising for real-time volume rendering because of the massive parallelism in volume rendering. In data-parallel volume rendering, local results processing elements(PEs) generate from allocated subvolumes are integrated to form a final image. Generally, the integration causes an overhead unavoidable in data-parallel volume rendering due to communications among PEs. This paper proposes a data-parallel shear-warp volume rendering algorithm combined with an adaptive volume subdivision method to reduce the communication overhead and improve processing efficiency. We implement the parallel algorithm on a message-passing multiprocessor system for performance evaluation. The experimental results show that the adaptive volume subdivision method can reduce the overhead and achieve higher efficiency compared with a conventional slab subdivision method.},
keywords={},
doi={},
ISSN={},
month={January},}
Copier
TY - JOUR
TI - Data-Parallel Volume Rendering with Adaptive Volume Subdivision
T2 - IEICE TRANSACTIONS on Information
SP - 80
EP - 89
AU - Kentaro SANO
AU - Hiroyuki KITAJIMA
AU - Hiroaki KOBAYASHI
AU - Tadao NAKAMURA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2000
AB - A data-parallel processing approach is promising for real-time volume rendering because of the massive parallelism in volume rendering. In data-parallel volume rendering, local results processing elements(PEs) generate from allocated subvolumes are integrated to form a final image. Generally, the integration causes an overhead unavoidable in data-parallel volume rendering due to communications among PEs. This paper proposes a data-parallel shear-warp volume rendering algorithm combined with an adaptive volume subdivision method to reduce the communication overhead and improve processing efficiency. We implement the parallel algorithm on a message-passing multiprocessor system for performance evaluation. The experimental results show that the adaptive volume subdivision method can reduce the overhead and achieve higher efficiency compared with a conventional slab subdivision method.
ER -