Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
ca78868f
提交
ca78868f
authored
8月 06, 2014
作者:
Roy Xue
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Updates:)
上级
a97ad2b6
隐藏空白字符变更
内嵌
并排
正在显示
2 个修改的文件
包含
28 行增加
和
36 行删除
+28
-36
profiling.py
theano/compile/profiling.py
+26
-33
test_profiling.py
theano/compile/tests/test_profiling.py
+2
-3
没有找到文件。
theano/compile/profiling.py
浏览文件 @
ca78868f
...
@@ -702,12 +702,18 @@ class ProfileStats(object):
...
@@ -702,12 +702,18 @@ class ProfileStats(object):
mem_count
=
0
mem_count
=
0
max_mem_count
=
0
max_mem_count
=
0
mem_bound
=
numpy
.
inf
mem_bound
=
numpy
.
inf
dependencies
=
fgraph
.
profile
.
dependencies
# Initial compute_map which is used to check if a node is valid
compute_map
=
defaultdict
(
lambda
:
[
0
])
for
var
in
fgraph
.
inputs
:
compute_map
[
var
][
0
]
=
1
def
check_node_state
(
node
):
def
check_node_state
(
node
):
"""
"""
check if an Apply node is valid(has inputs
but no outputs
).
check if an Apply node is valid(has inputs).
:param node:
apply n
ode
:param node:
Apply N
ode
"""
"""
inputs
=
node
.
inputs
inputs
=
node
.
inputs
outputs
=
node
.
outputs
outputs
=
node
.
outputs
...
@@ -722,39 +728,29 @@ class ProfileStats(object):
...
@@ -722,39 +728,29 @@ class ProfileStats(object):
else
:
else
:
return
False
return
False
compute_map
=
defaultdict
(
lambda
:
[
0
])
# Initial executable_nodes
# compute_map use to check if a node is valid
executable_nodes
=
set
()
executables_nodes
=
set
()
for
var
in
fgraph
.
inputs
:
compute_map
[
var
][
0
]
=
1
for
var
in
fgraph
.
inputs
:
for
var
in
fgraph
.
inputs
:
for
c
,
_
in
var
.
clients
:
for
c
,
_
in
var
.
clients
:
if
c
!=
"output"
and
check_node_state
(
c
):
if
c
!=
"output"
and
check_node_state
(
c
):
executable
s
_nodes
.
add
(
c
)
executable_nodes
.
add
(
c
)
dependencies
=
fgraph
.
profile
.
dependencies
def
min_memory_generator
(
executable_nodes
):
# for node in node_list[0].inputs[0]:
"""
# dependencies[node] = []
Generate all valid node order from node_list
# if val.owner and val.clients:
and compute its memory peaf
# ls = []
"""
# for c in val.clients:
# if c[0] is not 'output':
# ls += c[0].outputs
# dependencies[val] += ls
def
min_memory_generator
(
executables_nodes
):
global
mem_count
,
mem_bound
,
max_mem_count
,
max_mem_count
global
mem_count
,
mem_bound
,
max_mem_count
,
max_mem_count
for
node
in
executables_nodes
:
new_exec_nodes
=
executables_nodes
.
copy
()
for
node
in
executable_nodes
:
new_exec_nodes
=
executable_nodes
.
copy
()
new_exec_nodes
.
remove
(
node
)
new_exec_nodes
.
remove
(
node
)
mem_created
=
0
mem_created
=
0
mem_freed
=
0
mem_freed
=
0
if
mem_count
>
mem_bound
:
# check if we cut path now
mem_count
-=
mem_created
if
max_mem_count
>
mem_bound
:
mem_count
+=
mem_freed
continue
continue
for
var
in
node
.
outputs
:
for
var
in
node
.
outputs
:
...
@@ -764,7 +760,7 @@ class ProfileStats(object):
...
@@ -764,7 +760,7 @@ class ProfileStats(object):
dmap
=
getattr
(
node
.
op
,
'destroy_map'
,
None
)
dmap
=
getattr
(
node
.
op
,
'destroy_map'
,
None
)
vmap
=
getattr
(
node
.
op
,
'view_map'
,
None
)
vmap
=
getattr
(
node
.
op
,
'view_map'
,
None
)
#
add
mem_create
#
Compute
mem_create
for
i
in
nodes_mem
[
node
]:
for
i
in
nodes_mem
[
node
]:
if
(
dmap
and
idx
in
dmap
)
or
(
vmap
and
idx
in
vmap
):
if
(
dmap
and
idx
in
dmap
)
or
(
vmap
and
idx
in
vmap
):
continue
continue
...
@@ -776,7 +772,7 @@ class ProfileStats(object):
...
@@ -776,7 +772,7 @@ class ProfileStats(object):
if
mem_count
>
max_mem_count
:
if
mem_count
>
max_mem_count
:
max_mem_count
=
mem_count
max_mem_count
=
mem_count
#
add mem_freed, this part is not working well
#
Compute mem_freed
for
val
in
node
.
inputs
:
for
val
in
node
.
inputs
:
if
(
dependencies
[
val
]
and
val
.
owner
and
val
not
in
fgraph
.
outputs
):
if
(
dependencies
[
val
]
and
val
.
owner
and
val
not
in
fgraph
.
outputs
):
if
all
(
compute_map
[
v
]
for
v
in
dependencies
[
val
]):
if
all
(
compute_map
[
v
]
for
v
in
dependencies
[
val
]):
...
@@ -785,8 +781,6 @@ class ProfileStats(object):
...
@@ -785,8 +781,6 @@ class ProfileStats(object):
mem_count
-=
mem_freed
mem_count
-=
mem_freed
# check if cut path now
for
var
in
node
.
outputs
:
for
var
in
node
.
outputs
:
for
c
,
_
in
var
.
clients
:
for
c
,
_
in
var
.
clients
:
if
c
!=
"output"
and
check_node_state
(
c
):
if
c
!=
"output"
and
check_node_state
(
c
):
...
@@ -794,22 +788,21 @@ class ProfileStats(object):
...
@@ -794,22 +788,21 @@ class ProfileStats(object):
if
not
new_exec_nodes
:
if
not
new_exec_nodes
:
yield
[
node
]
yield
[
node
]
#
u
pdate mem_bound
#
Check and U
pdate mem_bound
if
max_mem_count
<
mem_bound
:
if
max_mem_count
<
mem_bound
:
mem_bound
=
max_mem_count
mem_bound
=
max_mem_count
else
:
else
:
for
p
in
min_memory_generator
(
new_exec_nodes
):
for
p
in
min_memory_generator
(
new_exec_nodes
):
yield
[
node
]
+
p
yield
[
node
]
+
p
#
resetting part
#
Reset track variables
mem_count
-=
mem_created
mem_count
-=
mem_created
max_mem_count
-=
mem_created
max_mem_count
-=
mem_created
mem_count
+=
mem_freed
mem_count
+=
mem_freed
for
var
in
node
.
outputs
:
for
var
in
node
.
outputs
:
compute_map
[
var
][
0
]
=
0
compute_map
[
var
][
0
]
=
0
for
order
in
min_memory_generator
(
executable_nodes
):
for
order
in
min_memory_generator
(
executables_nodes
):
continue
continue
return
mem_bound
return
mem_bound
...
...
theano/compile/tests/test_profiling.py
浏览文件 @
ca78868f
...
@@ -42,9 +42,8 @@ def test_profiling():
...
@@ -42,9 +42,8 @@ def test_profiling():
# regression testing for future algo speed up
# regression testing for future algo speed up
the_string
=
buf
.
getvalue
()
the_string
=
buf
.
getvalue
()
# assert "Max if linker=cvm(default): 8208KB (16400KB)" in the_string
assert
"Max if linker=cvm(default): 8208KB (16400KB)"
in
the_string
# assert "Minimum peak from all valid apply node order is 8192KB" in the_string
assert
"Minimum peak from all valid apply node order is 8192KB"
in
the_string
print
the_string
finally
:
finally
:
theano
.
config
.
profile
=
old1
theano
.
config
.
profile
=
old1
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论