From 5879699da9de22023eecf087750ff03f074a2d0a Mon Sep 17 00:00:00 2001
From: Andreas Kloeckner <inform@tiker.net>
Date: Sat, 10 Nov 2012 02:41:17 -0600
Subject: [PATCH] Experimentation showed that radix-sorting two bits at a time
is better.
---
pyopencl/algorithm.py | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/pyopencl/algorithm.py b/pyopencl/algorithm.py
index d8925eb9..4e72a6a5 100644
--- a/pyopencl/algorithm.py
+++ b/pyopencl/algorithm.py
@@ -339,7 +339,7 @@ class RadixSort(object):
on the compute device.
"""
def __init__(self, context, arguments, key_expr, sort_arg_names,
- bits_at_a_time=3, index_dtype=np.int32, key_dtype=np.uint32,
+ bits_at_a_time=2, index_dtype=np.int32, key_dtype=np.uint32,
options=[]):
"""
:arg arguments: A string of comma-separated C argument declarations.
--
GitLab