A fast and memory-sparing probabilistic selection algorithm for the GPU

A fast and memory-sparing probabilistic selection algorithm for the GPU [electronic resource]

A fast and memory-sparing probabilistic top-N selection algorithm is implemented on the GPU. This probabilistic algorithm gives a deterministic result and always terminates. The use of randomization reduces the amount of data that needs heavy processing, and so reduces both the memory requirements a...

Full description

Saved in:
Bibliographic Details
Online Access: Online Access
Corporate Author: Los Alamos National Laboratory (Researcher)
Format: Government Document Electronic eBook
Language:English
Published: Washington, D.C. : Oak Ridge, Tenn. : United States. Dept. of Energy ; distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy, 2010.
Subjects:
Distributed Data Processing.
Algorithms.
Processing.
Optimization.
Parallel Processing.
Statistics.
General And Miscellaneous//mathematics, Computing, And Information Science.

Internet

Online Access

Online

Holdings details from Online
Call Number: E 1.99: la-ur-10-6606
E 1.99: la-ur-10-6606 Available

Similar Items