Fast parallel algorithm for volume rendering and its experiment on computational grid

Hyung Jun Kim, Sung Up Jo, Yong Won Kwon, So Hyun Ryu, Yong Je Woo, Chang-Sung Jeong, Hyoungwoo Park

Research output: Contribution to journalArticle

Abstract

In this paper we present a fast and well balanced parallel algorithm for volume rendering, and shows our experimental result on Grid computing environment. Our algorithm is based on a new dynamic space leaping method of forward projection, and we shall show that the exploitation of load balancing through the dynamic distribution of data obtained during the execution of the forward projection and the reduction in time taken for the traversal of data and image space sharply speed up the whole algorithm. We implement the parallel ray casting algorithm on computational grid which consists of various heterogenous machines, and have shown that it has relatively good speedup due to the well organized dynamic load balancing.

Original languageEnglish
Pages (from-to)610-618
Number of pages9
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2657
Publication statusPublished - 2003 Dec 1

Fingerprint

Volume Rendering
Volume rendering
Computational Grid
Parallel algorithms
Parallel Algorithms
Fast Algorithm
Resource allocation
Speedup
Projection
Experiment
Dynamic Load Balancing
Image Space
Grid computing
Experiments
Grid Computing
Casting
Dynamic loads
Load Balancing
Exploitation
Half line

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Fast parallel algorithm for volume rendering and its experiment on computational grid. / Kim, Hyung Jun; Jo, Sung Up; Kwon, Yong Won; Ryu, So Hyun; Woo, Yong Je; Jeong, Chang-Sung; Park, Hyoungwoo.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2657, 01.12.2003, p. 610-618.

Research output: Contribution to journalArticle

@article{f3f3b6dd48114cd5a72ae568246f4d15,
title = "Fast parallel algorithm for volume rendering and its experiment on computational grid",
abstract = "In this paper we present a fast and well balanced parallel algorithm for volume rendering, and shows our experimental result on Grid computing environment. Our algorithm is based on a new dynamic space leaping method of forward projection, and we shall show that the exploitation of load balancing through the dynamic distribution of data obtained during the execution of the forward projection and the reduction in time taken for the traversal of data and image space sharply speed up the whole algorithm. We implement the parallel ray casting algorithm on computational grid which consists of various heterogenous machines, and have shown that it has relatively good speedup due to the well organized dynamic load balancing.",
author = "Kim, {Hyung Jun} and Jo, {Sung Up} and Kwon, {Yong Won} and Ryu, {So Hyun} and Woo, {Yong Je} and Chang-Sung Jeong and Hyoungwoo Park",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2657",
pages = "610--618",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Fast parallel algorithm for volume rendering and its experiment on computational grid

AU - Kim, Hyung Jun

AU - Jo, Sung Up

AU - Kwon, Yong Won

AU - Ryu, So Hyun

AU - Woo, Yong Je

AU - Jeong, Chang-Sung

AU - Park, Hyoungwoo

PY - 2003/12/1

Y1 - 2003/12/1

N2 - In this paper we present a fast and well balanced parallel algorithm for volume rendering, and shows our experimental result on Grid computing environment. Our algorithm is based on a new dynamic space leaping method of forward projection, and we shall show that the exploitation of load balancing through the dynamic distribution of data obtained during the execution of the forward projection and the reduction in time taken for the traversal of data and image space sharply speed up the whole algorithm. We implement the parallel ray casting algorithm on computational grid which consists of various heterogenous machines, and have shown that it has relatively good speedup due to the well organized dynamic load balancing.

AB - In this paper we present a fast and well balanced parallel algorithm for volume rendering, and shows our experimental result on Grid computing environment. Our algorithm is based on a new dynamic space leaping method of forward projection, and we shall show that the exploitation of load balancing through the dynamic distribution of data obtained during the execution of the forward projection and the reduction in time taken for the traversal of data and image space sharply speed up the whole algorithm. We implement the parallel ray casting algorithm on computational grid which consists of various heterogenous machines, and have shown that it has relatively good speedup due to the well organized dynamic load balancing.

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

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

M3 - Article

AN - SCOPUS:35248888462

VL - 2657

SP - 610

EP - 618

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -