R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
Paper
Noisy sort, a memory-intensive sorting algorithm
Abstract
A table-lookup technique for sorting is developed. It is a highly parallel method which develops an approximation to the sort through a single access to an associative memory. A postprocessing step is intended to complete the sort. The scheme is most effective for special data classes. © 1989.
Related
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998