Hash Functions for GPU Rendering

Thumbnail Image

Files

paper.pdf (1.28 MB)

Links to Files

http://jcgt.org/published/0009/03/02/

Permanent Link

http://hdl.handle.net/11603/20126

Collections

UMBC Imaging Research Center (IRC)
UMBC Computer Science and Electrical Engineering Department
UMBC Staff Collection

Author/Creator

Author/Creator ORCID

Date

Type of Work

journal articles
Text

Department

Program

Citation of Original Publication

Mark Jarzynski and Marc Olano, Hash Functions for GPU Rendering, Journal of Computer Graphics Techniques (JCGT), vol. 9, no. 3, 21-38, 2020 Available online http://jcgt.org/published/0009/03/02/

Rights

This item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.
Attribution-NoDerivs 3.0 United States

Subjects

UMBC High Performance Computing Facility (HPCF)

Abstract

In many graphics applications, a deterministic random hash provides the best source of random numbers. We evaluate a range of existing hash functions for random number quality using the TestU01 test suite, and GPU execution speed through benchmarking. We analyze the hash functions on the Pareto frontier to make recommendations on which hash functions offer the best quality/speed trade-off for the range of needs, from high-performance/low-quality to high-quality/low-performance. We also present a new class of hash tuned for multidimensional input and output that performs well at the high-quality end of this spectrum. We provide a supplemental document with test results and code for all hashes.