Cart (Loading....) | Create Account
Close category search window

A scalable data-distributed algorithm for volume rendering on parallel virtual machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Deng, Junhui ; Department of Computer Science, Tsinghua Uni Beijing ty, Beijing 100084, China ; Tang, Zesheng

An algorithm is presented for volume rendering in environments of parallel virtual machines. To reduce the communication cost, as well as to guarantee the locality of all subtasks, the volume data is divided into and organized as a series of slices. The task subdivision algorithm produces acceptable load balancing by maintaining and employing a database of performance indices. An asynchronous binary method merges all partial images in O (logn) time. An efficient development platform based on TCP/IP and Socket standards can help parallelize various rendering algorithms on virtual machines. Our algorithm was implemented on this platform using the classical client/server paradigm. The scalabilities lities of both task size and host number were tested experimentally.

Published in:

Tsinghua Science and Technology  (Volume:6 ,  Issue: 4 )

Date of Publication:

Oct. 2001

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.