An improvement on binary-swap compositing for sort-last parallel rendering

  • Authors:
  • Akira Takeuchi;Fumihiko Ino;Kenichi Hagihara

  • Affiliations:
  • Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan;Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan;Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan

  • Venue:
  • Proceedings of the 2003 ACM symposium on Applied computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Sort-last parallel rendering is a good rendering scheme on distributed memory multiprocessors. This paper presents an improvement on the binary-swap (BS) method, which is an efficient image compositing algorithm for sort-last parallel rendering. Our compositing method uses three acceleration techniques, compared to the original BS method. Through the use of the three techniques, our method balances the compositing load among processors, exploits more sparsity of the image, and reduces the cost of communication. We also show some experimental results on a PC cluster. The results show that our method completes the image compositing faster than the original BS method, and its speedup to the original increases with the number of processors.