Multi-GPU volume rendering using MapReduce
UC Davis
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing, HPDC ’10
@conference{stuart2010multi,
title={Multi-GPU volume rendering using MapReduce},
author={Stuart, J.A. and Chen, C.K. and Ma, K.L. and Owens, J.D.},
booktitle={Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing},
pages={841–848},
year={2010},
organization={ACM}
}
In this paper we present a multi-GPU parallel volume rendering implemention built using the MapReduce programming model. We give implementation details of the library, including specific optimizations made for our rendering and compositing design. We analyze the theoretical peak performance and bottlenecks for all tasks required and show that our system significantly reduces computation as a bottleneck in the ray-casting phase. We demonstrate that our rendering speeds are adequate for interactive visualization (our system is capable of rendering a 1024^3 floating-point sampled volume in under one second using 8 GPUs), and that our system is capable of delivering both in-core and out-of-core visualizations. We argue that a multi-GPU MapReduce library is a good fit for parallel volume renderering because it is easy to program for, scales well, and eliminates the need to focus on I/O algorithms thus allowing the focus to be on visualization algorithms instead. We show that our system scales with respect to the size of the volume, and (given enough work) the number of GPUs.
December 25, 2010 by hgpu
