Volume rendering using grid computing for large-scale volume data

Proceedings of 11th IEEE International Conference on Computer-Aided Design and Computer Graphics Page 470-477 published_at 2009
アクセス数 : 1056
ダウンロード数 : 234

今月のアクセス数 : 0
今月のダウンロード数 : 5
File
Proc11IEEEIntConfCADGraph_470.pdf 963 KB 種類 : fulltext
Title ( eng )
Volume rendering using grid computing for large-scale volume data
Creator
Nishihashi Kunihiko
Okabe Kenji
Raytchev Bisser
Source Title
Proceedings of 11th IEEE International Conference on Computer-Aided Design and Computer Graphics
Start Page 470
End Page 477
Abstract
In this paper, we propose a volume rendering method using grid computing for large-scale volume data. Grid computing is attractive because medical institutions and research facilities often have a large number of idle computers. A large-scale volume data is divided into sub-volumes and the sub-volumes are rendered using grid computing. When using grid computing, different computers rarely have the same processor speeds. Thus the return order of results rarely matches the sending order. However order is vital when combining results to create a final image. Job-Scheduling is important in grid computing for volume rendering, so we use an obstacle-flag which changes priorities dynamically to manage sub-volume results. Obstacle-Flags manage visibility of each sub-volume when line of sight from the view point is obscured by other sub-volumes. The proposed Dynamic Job-Scheduling based on visibility substantially increases efficiency. Our Dynamic Job-Scheduling method was implemented on our university's campus grid and we conducted comparative experiments, which showed that the proposed method provides significant improvements in efficiency for large-scale volume rendering.
NDC
Electrical engineering [ 540 ]
Language
eng
Resource Type conference paper
Publisher
IEEE
Date of Issued 2009
Rights
Copyright (c) 2009 IEEE
Publish Type Version of Record
Access Rights open access
Source Identifier
[URI] http://ir.lib.hiroshima-u.ac.jp/00027248