Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
c3cad4a7
提交
c3cad4a7
authored
5月 21, 2010
作者:
James Bergstra
浏览文件
操作
浏览文件
下载
差异文件
merge
上级
35010387
bb8b38a4
隐藏空白字符变更
内嵌
并排
正在显示
2 个修改的文件
包含
128 行增加
和
21 行删除
+128
-21
basic_ops.py
theano/sandbox/cuda/basic_ops.py
+126
-20
test_basic_ops.py
theano/sandbox/cuda/tests/test_basic_ops.py
+2
-1
没有找到文件。
theano/sandbox/cuda/basic_ops.py
浏览文件 @
c3cad4a7
...
@@ -514,7 +514,7 @@ class GpuSum(Op):
...
@@ -514,7 +514,7 @@ class GpuSum(Op):
return
sio
.
getvalue
()
return
sio
.
getvalue
()
def
_makecall
(
self
,
node
,
name
,
x
,
z
,
fail
):
def
_makecall
(
self
,
node
,
name
,
x
,
z
,
fail
,
pattern
=
None
):
"""Return a string for making a kernel call.
"""Return a string for making a kernel call.
The return value looks something like:
The return value looks something like:
...
@@ -540,14 +540,18 @@ class GpuSum(Op):
...
@@ -540,14 +540,18 @@ class GpuSum(Op):
}
}
"""
"""
sio
=
StringIO
.
StringIO
()
sio
=
StringIO
.
StringIO
()
pattern
=
''
.
join
(
str
(
c
)
for
c
in
self
.
reduce_mask
)
if
pattern
is
None
:
ndim
=
len
(
pattern
)
pattern
=
''
.
join
(
str
(
c
)
for
c
in
self
.
reduce_mask
)
ndim
=
len
(
self
.
reduce_mask
)
nd_out
=
ndim
-
sum
(
self
.
reduce_mask
)
nd_out
=
ndim
-
sum
(
self
.
reduce_mask
)
print
>>
sio
,
"""
print
>>
sio
,
"""
if (verbose) printf("running kernel_reduce_sum_
%(pattern)
s_
%(name)
s
\\
n");
if (verbose) printf("running kernel_reduce_sum_
%(pattern)
s_
%(name)
s
\\
n");
int n_shared = sizeof(float) * n_threads.x * n_threads.y * n_threads.z;
int n_shared = sizeof(float) * n_threads.x * n_threads.y * n_threads.z;
if (verbose>1) printf("n_threads.x=
%%
d, n_threads.y=
%%
d, n_threads.z=
%%
d, n_blocks.x=
%%
d, n_blocks.y=
%%
d n_shared=
%%
d
\\
n",
if (verbose>1) printf("n_threads.x=
%%
d, n_threads.y=
%%
d, n_threads.z=
%%
d, nb_threads=
%%
d, n_blocks.x=
%%
d, n_blocks.y=
%%
d, nb_block=
%%
d, n_shared=
%%
d
\\
n",
n_threads.x,n_threads.y,n_threads.z,n_blocks.x,n_blocks.y,n_shared);
n_threads.x,n_threads.y,n_threads.z,
n_threads.x*n_threads.y*n_threads.z,
n_blocks.x,n_blocks.y,
n_blocks.x*n_blocks.y, n_shared);
kernel_reduce_sum_
%(pattern)
s_
%(name)
s<<<n_blocks, n_threads, n_shared>>>(
kernel_reduce_sum_
%(pattern)
s_
%(name)
s<<<n_blocks, n_threads, n_shared>>>(
"""
%
locals
()
"""
%
locals
()
for
i
in
xrange
(
ndim
):
for
i
in
xrange
(
ndim
):
...
@@ -587,7 +591,7 @@ class GpuSum(Op):
...
@@ -587,7 +591,7 @@ class GpuSum(Op):
"""
%
locals
()
"""
%
locals
()
return
sio
.
getvalue
()
return
sio
.
getvalue
()
def
_k_decl
(
self
,
node
,
nodename
):
def
_k_decl
(
self
,
node
,
nodename
,
pattern
=
None
,
ndim
=
None
,
reduce_mask
=
None
):
"""Return a string to declare a kernel function
"""Return a string to declare a kernel function
.. code-block:: c
.. code-block:: c
...
@@ -604,27 +608,32 @@ class GpuSum(Op):
...
@@ -604,27 +608,32 @@ class GpuSum(Op):
const int sZ0)
const int sZ0)
"""
%
locals
()
"""
%
locals
()
pattern
=
''
.
join
(
str
(
i
)
for
i
in
self
.
reduce_mask
)
if
reduce_mask
is
None
:
reduce_mask
=
self
.
reduce_mask
if
ndim
is
None
:
ndim
=
len
(
reduce_mask
)
if
pattern
is
None
:
pattern
=
''
.
join
(
str
(
i
)
for
i
in
reduce_mask
)
sio
=
StringIO
.
StringIO
()
sio
=
StringIO
.
StringIO
()
print
>>
sio
,
"""
print
>>
sio
,
"""
static __global__ void kernel_reduce_sum_
%(pattern)
s_
%(nodename)
s(
static __global__ void kernel_reduce_sum_
%(pattern)
s_
%(nodename)
s(
"""
%
locals
()
"""
%
locals
()
for
i
in
xrange
(
len
(
self
.
reduce_mask
)
):
for
i
in
xrange
(
ndim
):
print
>>
sio
,
"""
print
>>
sio
,
"""
const int d
%(i)
s,
const int d
%(i)
s,
"""
%
locals
()
"""
%
locals
()
print
>>
sio
,
"""
print
>>
sio
,
"""
const float *A,
const float *A,
"""
%
locals
()
"""
%
locals
()
for
i
in
xrange
(
len
(
self
.
reduce_mask
)
):
for
i
in
xrange
(
ndim
):
print
>>
sio
,
"""
print
>>
sio
,
"""
const int sA
%(i)
s,
const int sA
%(i)
s,
"""
%
locals
()
"""
%
locals
()
print
>>
sio
,
"""
print
>>
sio
,
"""
float * Z
float * Z
"""
%
locals
()
"""
%
locals
()
for
i
in
xrange
(
len
(
self
.
reduce_mask
)
-
sum
(
self
.
reduce_mask
)):
for
i
in
xrange
(
ndim
-
sum
(
reduce_mask
)):
print
>>
sio
,
"""
print
>>
sio
,
"""
, const int sZ
%(i)
s
, const int sZ
%(i)
s
"""
%
locals
()
"""
%
locals
()
...
@@ -694,6 +703,25 @@ class GpuSum(Op):
...
@@ -694,6 +703,25 @@ class GpuSum(Op):
}
}
"""
%
locals
()
"""
%
locals
()
#Threads must be organized as: threadNum%nb_reduce correspond to the same sum
#nb_reduce<=warpSize
def
_k_reduce_buf_multiple
(
self
,
z_pos
,
nb_reduce
):
return
"""
buf[threadNum] = mysum;
__syncthreads();
// rest of function is handled by one warp
if (threadNum <
%(nb_reduce)
s)
{
//round up all the partial sums into the first `nb_reduce` elements
for (int i = threadNum +
%(nb_reduce)
s; i < threadCount; i +=
%(nb_reduce)
s)
{
mysum += buf[i];
}
%(z_pos)
s = mysum;
}
"""
%
locals
()
def
c_code_reduce_ccontig
(
self
,
sio
,
node
,
name
,
x
,
z
,
fail
):
def
c_code_reduce_ccontig
(
self
,
sio
,
node
,
name
,
x
,
z
,
fail
):
print
>>
sio
,
"""
print
>>
sio
,
"""
{
{
...
@@ -856,18 +884,60 @@ class GpuSum(Op):
...
@@ -856,18 +884,60 @@ class GpuSum(Op):
"""
%
locals
()
"""
%
locals
()
def
c_code_reduce_010
(
self
,
sio
,
node
,
name
,
x
,
z
,
fail
):
def
c_code_reduce_010
(
self
,
sio
,
node
,
name
,
x
,
z
,
fail
):
makecall
=
self
.
_makecall
(
node
,
name
,
x
,
z
,
fail
)
makecall
=
self
.
_makecall
(
node
,
name
,
x
,
z
,
fail
)
makecall_inner
=
self
.
_makecall
(
node
,
name
,
x
,
z
,
fail
,
pattern
=
"010_inner"
)
pattern
=
''
.
join
(
str
(
i
)
for
i
in
self
.
reduce_mask
)
print
>>
sio
,
"""
print
>>
sio
,
"""
{
{
int verbose = 0;
int verbose = 0;
dim3 n_threads(
std::min(CudaNdarray_HOST_DIMS(
%(x)
s)[1],
dim3 n_threads(std::min(32,CudaNdarray_HOST_DIMS(
%(x)
s)[2]));
(int)NUM_VECTOR_OP_THREADS_PER_BLOCK));
while(n_threads.x*(n_threads.y+1)<=512
dim3 n_blocks(std::min(CudaNdarray_HOST_DIMS(
%(x)
s)[0], (int)NUM_VECTOR_OP_BLOCKS));
&& n_threads.y<CudaNdarray_HOST_DIMS(
%(x)
s)[1]){
n_blocks.y = std::min(
n_threads.y++;
CudaNdarray_HOST_DIMS(
%(x)
s)[2],
}
(int)(NUM_VECTOR_OP_BLOCKS / n_blocks.x)
);
dim3 n_blocks(std::min(CudaNdarray_HOST_DIMS(
%(x)
s)[0],
%(makecall)
s
(int)NUM_VECTOR_OP_BLOCKS));
n_blocks.y = std::min(
ceil_intdiv(CudaNdarray_HOST_DIMS(
%(x)
s)[2],(int)n_threads.x),
(int)(NUM_VECTOR_OP_BLOCKS / n_blocks.x)
);
if(std::min(std::min(CudaNdarray_HOST_STRIDES(
%(x)
s)[0],
CudaNdarray_HOST_STRIDES(
%(x)
s)[1]),
CudaNdarray_HOST_STRIDES(
%(x)
s)[2])
==CudaNdarray_HOST_STRIDES(
%(x)
s)[2]
&& n_blocks.y==ceil_intdiv(CudaNdarray_HOST_DIMS(
%(x)
s)[2],(int)n_threads.x)){
if(verbose>1)
printf("n_block.x.1=
%%
d, n_block.x.2=
%%
d, n_block.y.1=
%%
d, n_block.y.2=
%%
d,
\\
n",
CudaNdarray_HOST_DIMS(
%(x)
s)[0],NUM_VECTOR_OP_BLOCKS,
ceil_intdiv(CudaNdarray_HOST_DIMS(
%(x)
s)[2],(int)n_threads.x),
(int)(NUM_VECTOR_OP_BLOCKS / n_blocks.x));
assert(n_threads.x<=32);
%(makecall_inner)
s
}else{
n_threads.x = std::min(CudaNdarray_HOST_DIMS(
%(x)
s)[1],
(int)NUM_VECTOR_OP_THREADS_PER_BLOCK);
n_blocks.x = std::min(CudaNdarray_HOST_DIMS(
%(x)
s)[0], (int)NUM_VECTOR_OP_BLOCKS);
n_blocks.y = std::min(
CudaNdarray_HOST_DIMS(
%(x)
s)[2],
(int)(NUM_VECTOR_OP_BLOCKS / n_blocks.x)
);
%(makecall)
s
}
CNDA_THREAD_SYNC;
cudaError_t sts = cudaGetLastError();
if (cudaSuccess != sts)
{
PyErr_Format(PyExc_RuntimeError, "Cuda error:
%%
s:
%%
s. (grid:
%%
i x
%%
i; block:
%%
i x
%%
i x
%%
i)
\\
n",
"kernel_reduce_sum_
%(pattern)
s_
%(name)
s",
cudaGetErrorString(sts),
n_blocks.x,
n_blocks.y,
n_threads.x,
n_threads.y,
n_threads.z);
%(fail)
s;
}
}
}
"""
%
locals
()
"""
%
locals
()
...
@@ -1075,7 +1145,7 @@ class GpuSum(Op):
...
@@ -1075,7 +1145,7 @@ class GpuSum(Op):
"""
%
locals
()
"""
%
locals
()
def
c_code_cache_version
(
self
):
def
c_code_cache_version
(
self
):
return
(
1
6
,)
return
(
1
7
,)
def
c_support_code_apply
(
self
,
node
,
nodename
):
def
c_support_code_apply
(
self
,
node
,
nodename
):
...
@@ -1247,6 +1317,42 @@ class GpuSum(Op):
...
@@ -1247,6 +1317,42 @@ class GpuSum(Op):
}
}
"""
%
locals
()
"""
%
locals
()
if
self
.
reduce_mask
==
(
0
,
1
,
0
):
# This kernel is optimized when the inner most dimensions have the smallest stride.
# this kernel uses one block for multiple column(up to 32TODO),
# threads per block for each element per column.
#thread.x = dim 2 contiguous
#thread.y = dim 1
#block.x = dim 0
#block.y = dim 1 rest
init
=
self
.
_k_init
(
node
,
nodename
)
decl
=
self
.
_k_decl
(
node
,
nodename
,
pattern
=
"010_inner"
)
reducebuf
=
self
.
_k_reduce_buf_multiple
(
'Z[i0 * sZ0 + i2*sZ1]'
,
'blockDim.x'
)
reducebuf
=
self
.
_k_reduce_buf_multiple
(
'Z[i0 * sZ0 + i2*sZ1]'
,
'blockDim.x'
)
print
>>
sio
,
"""
%(decl)
s
{
if(warpSize<blockDim.x){
//TODO: set error code
Z[0] = -666;
return;
}
%(init)
s
for (int i0 = blockIdx.x; i0 < d0; i0 += gridDim.x)
{
for (int i2 = blockIdx.y*blockDim.x+threadIdx.x; i2 < d2; i2 += gridDim.y*blockDim.x)
{
for (int i1 = threadIdx.y; i1 < d1; i1 += blockDim.y)
{
mysum += A[i0 * sA0 + i1 * sA1 + i2 * sA2];
}
%(reducebuf)
s
}
}
}
"""
%
locals
()
if
self
.
reduce_mask
==
(
1
,
1
,
0
):
if
self
.
reduce_mask
==
(
1
,
1
,
0
):
# this kernel uses one block for each column,
# this kernel uses one block for each column,
# threads per block for each element per column.
# threads per block for each element per column.
...
...
theano/sandbox/cuda/tests/test_basic_ops.py
浏览文件 @
c3cad4a7
...
@@ -34,7 +34,8 @@ def test_sum():
...
@@ -34,7 +34,8 @@ def test_sum():
test sum pattern 1, 11, 10, 01, 100, 110, 011, 001, 111, 0011, 0111, 1011, 1111
test sum pattern 1, 11, 10, 01, 100, 110, 011, 001, 111, 0011, 0111, 1011, 1111
TODO: test with broadcast
TODO: test with broadcast
"""
"""
for
shape
,
pattern
in
[((
0
,),[
0
]),((
5
,),[
0
]),
for
shape
,
pattern
in
[((
100
,
3
,
1300
),[
1
]),
((
0
,),[
0
]),((
5
,),[
0
]),
((
0
,
0
),[
0
,
1
]),((
1
,
0
),[
0
,
1
]),((
5
,
4
),[
0
,
1
]),((
33
,
31
),[
0
,
1
]),((
5
,
4
),[
1
]),((
5
,
4
),[
0
]),
#need something bigger then 32 for some opt test.
((
0
,
0
),[
0
,
1
]),((
1
,
0
),[
0
,
1
]),((
5
,
4
),[
0
,
1
]),((
33
,
31
),[
0
,
1
]),((
5
,
4
),[
1
]),((
5
,
4
),[
0
]),
#need something bigger then 32 for some opt test.
((
5
,
4
,
3
),[
0
]),((
5
,
4
,
3
),[
1
]),((
5
,
4
,
3
),[
0
,
1
]),((
5
,
4
,
3
),[
2
]),((
5
,
4
,
3
),[
1
,
2
]),((
5
,
4
,
3
),[
0
,
1
,
2
]),
((
5
,
4
,
3
),[
0
]),((
5
,
4
,
3
),[
1
]),((
5
,
4
,
3
),[
0
,
1
]),((
5
,
4
,
3
),[
2
]),((
5
,
4
,
3
),[
1
,
2
]),((
5
,
4
,
3
),[
0
,
1
,
2
]),
((
0
,
0
,
0
,
0
),[
0
,
1
,
2
,
3
]),
((
0
,
0
,
0
,
0
),[
0
,
1
,
2
,
3
]),
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论