A configurable algorithm for parallel image-compositing applications

Collective communication operations can dominate the cost of large-scale parallel algorithms. Image compositing in parallel scientific visualization is a reduction operation where this is the case. We present a new algorithm called Radix-k that in many cases performs better than existing compositing...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis pp. 1 - 10
Main Authors:	Peterka, Tom, Goodell, David, Ross, Robert, Shen, Han-Wei, Thakur, Rajeev
Format:	Conference Proceeding
Language:	English
Published:	New York, NY, USA ACM 14.11.2009
Series:	ACM Conferences
Subjects:	Bandwidth communication Costs Government image compositing Information systems > Information systems applications Libraries Lower bound Optimization parallel scientific visualization Pipelines Program processors Rendering (computer graphics) Vectors communication parallel scientific visualization image compositing
ISBN:	1605587443, 9781605587448
ISSN:	2167-4329
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!