Dynamic Data Management for Parallel Volume Visualisation
The parallel implementation of volume visualisation offers the potential of solving this computationally complex problem in reasonable times. This paper discusses the preferred bias strategy for allocating tasks to processing elements. This strategy is able to exploit both spatial and temporal coherence within the problem domain between successive frames to improve the effectiveness of the distributed memory management system and thus increase overall system performance. Tree and torus configurations are also investigated to determine the effect configurations have on the parallel implementation of volume visualisation on large multiprocessor systems.
KeywordsCoherence Turkey Dispatch Allo Alan
Unable to display preview. Download preview PDF.
- A. G. Chalmers and J. P. Tidmus.Practical Parallel Processing: An introduction to problem solving in parallel. International Thomson Publishing, London,1996.Google Scholar
- A. Kaufman, K. Hohne, and P. Schroder. Research issues in volume visualisation. IEEE Computer Graphics and Applications, 63–67, March 1994.Google Scholar
- C. Kose and A. G. Chalmers. Memory management strategies for parallel volume rendering. In B. O’Neil, editor, 19 th World Occam and Transputer User Group meeting, IOS Press, Nottingham, March 1996. To appear.Google Scholar
- M. S. Levey. Volume rendering: display of surfaces from volume data. Computer Graphics and Applications, 8(3), May 1988.Google Scholar
- M. S. Levoy. Efficient ray tracing of volume data. ACM Transactions of Graphics, 9(3), July 1990.Google Scholar
- U. Neumann. Communication cost for parallel volume rendering algorithms. IEEE Computer Graphics and Applications, 49–58, July 1994.Google Scholar
- L. A. Westover. Splatting: A parallel, feed-forward volume rendering algorithm. Technical Report, The University of North Carolina at Chapel Hill, Department of Computer Science, July 1991.Google Scholar