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.
This work has been supported by KIPA-Information Technology Research Center, University research program by Ministry of Information & Communication, and Brain Korea 21 projects in 2003
Chapter PDF
Similar content being viewed by others
References
I. Foster, C. Kesselman, S. Tuecke, “The Anatomy of the Grid: Enabling Scalable Virtual Organizations,” International J. Supercomputer Applications, 15(3), 2001.
I. Foster, and C. Kesselman, “The Globus Project: A Status Report,” Heterogeneous Computing Workshop,” pp. 4–18, 1998.
P. Steven, P. Michael, L. Yarden, S. Peter-Pike, H. Charles, “Interactive Ray Tracing for Volume Visualization,” IEEE Trans. on Visualization and Computer Graphics, Vol. 5, No. 3, pp. 238–250. 1999.
J. Danskin, and Hanrahan, P., “Fast algorithms for volume ray tracing,” 1992 workshop on Volume Visualization, Boston, MA, 1992, pp. 91–98.
J. Danskin, R. Bender, and G. T. Herman, “Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and X-ray photography,” J. Theoretical Biology, vol. 29, pp. 471–482, 1970.
Yagel, R., Cohen, D., Kaufman, A. and Zhang, Q., “Volumetric Ray Tracing,” TR 91. 01. 09, Computer Science, SUNY at Stony Brook, January 1991.
R. Yagel, and Z. Shi, “Accelerating Volume Animation by Space-Leaping,” Visualization’ 93, 1993, pp. 63–69.
V. Goel and A. Mukherjee, “An Optimal Parallel Algorithm for Volume Ray Casting,” Visual Comput, Vol. 12, 1996, pp. 26–39.
C. Kose and A. Chalmers, “Profiling for efficient parallel volume visualization,” Parallel Computing Vol. 23, 1997, pp. 943–952.
S. U. Jo and C. S. Jeong, “A Parallel Volume Visualization Using Extended Space Leaping Method,” PARA2000, 2001, pp. 296–305.
M. Levoy, “A hybrid ray tracer for rendering polygon and volume data,” IEEE Computer Graphics & Application Vol. 10, No. 2, 1990, pp. 33–40.
K. Czajkowski, et al, “Grid Information Services for Distributed Resource Sharing,” HPDC-10, August 2001.
K. Czajkowski, et al., “Resource Co-Allocation in Computational Grids,” HPDC-8, 1999, pp. 219–228.
B. Allcock, et al., “Data Management and Transfer in High Performance Computational Grid Environments,” Parallel Computing Journal,” Vol. 28(5), May 2002, pp. 749–771.
I. Foster, et al. “A Security Architecture for Computational Grids,” Proc. 5th ACM CCSC, pp. 83–92, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, HJ. et al. (2003). Fast Parallel Algorithm for Volume Rendering and Its Experiment on Computational Grid. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Dongarra, J.J., Zomaya, A.Y., Gorbachev, Y.E. (eds) Computational Science — ICCS 2003. ICCS 2003. Lecture Notes in Computer Science, vol 2657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44860-8_63
Download citation
DOI: https://doi.org/10.1007/3-540-44860-8_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40194-0
Online ISBN: 978-3-540-44860-0
eBook Packages: Springer Book Archive
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.