Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
32d650ca
提交
32d650ca
authored
10月 08, 2013
作者:
Frederic
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Better optimizer profiling
上级
36c3a88d
隐藏空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
49 行增加
和
18 行删除
+49
-18
opt.py
theano/gof/opt.py
+49
-18
没有找到文件。
theano/gof/opt.py
浏览文件 @
32d650ca
...
...
@@ -1422,20 +1422,20 @@ class EquilibriumOptimizer(NavigatorOptimizer):
changed
=
True
max_use_abort
=
False
opt_name
=
None
process_count
=
{}
max_nb_nodes
=
len
(
fgraph
.
apply_nodes
)
max_use
=
max_nb_nodes
*
self
.
max_use_ratio
loop_timing
=
[]
loop_process_count
=
[]
global_opt_timing
=
[]
time_opts
=
{}
io_toposort_timing
=
[]
nb_nodes
=
[]
for
opt
in
self
.
global_optimizers
+
self
.
local_optimizers
:
process_count
.
setdefault
(
opt
,
0
)
time_opts
.
setdefault
(
opt
,
0
)
while
changed
and
not
max_use_abort
:
process_count
=
{}
t0
=
time
.
time
()
changed
=
False
...
...
@@ -1446,6 +1446,7 @@ class EquilibriumOptimizer(NavigatorOptimizer):
gopt
.
apply
(
fgraph
)
time_opts
[
gopt
]
+=
time
.
time
()
-
t_opt
if
fgraph
.
change_tracker
.
changed
:
process_count
.
setdefault
(
gopt
,
0
)
process_count
[
gopt
]
+=
1
changed
=
True
if
process_count
[
gopt
]
>
max_use
:
...
...
@@ -1486,6 +1487,7 @@ class EquilibriumOptimizer(NavigatorOptimizer):
lopt_change
=
self
.
process_node
(
fgraph
,
node
,
lopt
)
time_opts
[
lopt
]
+=
time
.
time
()
-
t_opt
if
lopt_change
:
process_count
.
setdefault
(
lopt
,
0
)
process_count
[
lopt
]
+=
1
changed
=
True
if
process_count
[
lopt
]
>
max_use
:
...
...
@@ -1498,6 +1500,7 @@ class EquilibriumOptimizer(NavigatorOptimizer):
finally
:
self
.
detach_updater
(
fgraph
,
u
)
loop_process_count
.
append
(
process_count
)
loop_timing
.
append
(
float
(
time
.
time
()
-
t0
))
if
max_use_abort
:
...
...
@@ -1506,7 +1509,7 @@ class EquilibriumOptimizer(NavigatorOptimizer):
+
"
%
f with the theano flag 'optdb.max_use_ratio'."
%
config
.
optdb
.
max_use_ratio
)
return
(
self
,
loop_timing
,
process_count
,
max_nb_nodes
,
return
(
self
,
loop_timing
,
loop_
process_count
,
max_nb_nodes
,
global_opt_timing
,
nb_nodes
,
time_opts
,
io_toposort_timing
)
def
print_summary
(
self
,
stream
=
sys
.
stdout
,
level
=
0
,
depth
=-
1
):
...
...
@@ -1520,40 +1523,64 @@ class EquilibriumOptimizer(NavigatorOptimizer):
@staticmethod
def
print_profile
(
stream
,
prof
,
level
=
0
):
(
opt
,
loop_timing
,
process_count
,
max_nb_nodes
,
(
opt
,
loop_timing
,
loop_
process_count
,
max_nb_nodes
,
global_opt_timing
,
nb_nodes
,
time_opts
,
io_toposort_timing
)
=
prof
blanc
=
(
' '
*
level
)
print
>>
stream
,
blanc
,
"EquilibriumOptimizer"
,
print
>>
stream
,
blanc
,
getattr
(
opt
,
"name"
,
getattr
(
opt
,
"__name__"
,
""
))
print
>>
stream
,
blanc
,
" time
%.3
fs for
%
d passes,
%
d nodes max"
%
(
print
>>
stream
,
blanc
,
"
time
%.3
fs for
%
d passes,
%
d nodes max"
%
(
sum
(
loop_timing
),
len
(
loop_timing
),
max_nb_nodes
)
print
>>
stream
,
blanc
,
" time io_toposort
%.3
fs"
%
sum
(
print
>>
stream
,
blanc
,
"
time io_toposort
%.3
fs"
%
sum
(
io_toposort_timing
)
s
=
sum
([
time_opts
[
o
]
for
o
in
opt
.
local_optimizers
])
print
>>
stream
,
blanc
,
" time in local optimizers
%.3
fs"
%
s
s
=
sum
([
time_opts
[
o
]
for
o
in
opt
.
global_optimizers
])
print
>>
stream
,
blanc
,
" time in global optimizers
%.3
fs"
%
s
for
i
in
range
(
len
(
loop_timing
)):
print
>>
stream
,
blanc
,
(
'
%
d -
%.3
fs (
%.3
fs in global opts, '
'
%.3
fs io_toposort) -
%
d nodes'
%
(
lopt
=
""
if
len
(
loop_process_count
[
i
])
<
5
:
lopt
=
" "
.
join
([
str
((
str
(
k
),
v
))
for
k
,
v
in
loop_process_count
[
i
]
.
iteritems
()])
print
>>
stream
,
blanc
,
(
'
%2
d -
%.3
fs
%
d (
%.3
fs in global opts, '
'
%.3
fs io_toposort) -
%
d nodes -
%
s'
%
(
i
,
loop_timing
[
i
],
sum
(
loop_process_count
[
i
]
.
values
()),
global_opt_timing
[
i
],
io_toposort_timing
[
i
],
nb_nodes
[
i
]))
io_toposort_timing
[
i
],
nb_nodes
[
i
],
lopt
))
count_opt
=
[]
not_used
=
0
not_used_time
=
0
process_count
=
{}
for
o
in
opt
.
global_optimizers
+
opt
.
local_optimizers
:
process_count
.
setdefault
(
o
,
0
)
for
count
in
loop_process_count
:
for
o
,
v
in
count
.
iteritems
():
process_count
[
o
]
+=
v
for
opt
,
count
in
process_count
.
iteritems
():
if
count
>
0
:
count_opt
.
append
((
time_opts
[
opt
],
count
,
opt
))
else
:
not_used
+=
1
not_used_time
+=
time_opts
[
opt
]
if
count_opt
:
print
>>
stream
,
blanc
,
\
'
times applied - optimizer (only those applied)
:'
'
times - times applied - name
:'
count_opt
.
sort
()
for
(
t
,
count
,
opt
)
in
count_opt
[::
-
1
]:
print
>>
stream
,
blanc
,
'
%.3
fs -
%
d -
%
s'
%
(
t
,
count
,
opt
)
print
>>
stream
,
blanc
,
'
%.3
fs - in
%
d optimization that where not used'
%
(
not_used_time
,
not_used
)
print
>>
stream
@staticmethod
def
merge_profile
(
prof1
,
prof2
):
#(opt, loop_timing, process_count, max_nb_nodes,
#(opt, loop_timing,
loop_
process_count, max_nb_nodes,
# global_opt_timing, nb_nodes, time_opts, io_toposort_timing) = prof1
local_optimizers
=
set
(
prof1
[
0
]
.
local_optimizers
)
.
union
(
...
...
@@ -1575,12 +1602,16 @@ class EquilibriumOptimizer(NavigatorOptimizer):
loop_timing
=
merge_list
(
prof1
[
1
],
prof2
[
1
])
process_count
=
prof1
[
2
]
.
copy
()
for
process
,
count
in
prof2
[
2
]
.
iteritems
():
if
process
in
process_count
:
process_count
[
process
]
+=
count
else
:
process_count
[
process
]
=
count
loop_process_count
=
prof1
[
2
]
.
copy
()
for
i
in
range
(
len
(
loop_process_count
)):
process_count
=
loop_process_count
[
i
]
for
process
,
count
in
prof2
[
2
][
i
]
.
iteritems
():
if
process
in
process_count
:
process_count
[
process
]
+=
count
else
:
process_count
[
process
]
=
count
for
i
in
range
(
len
(
loop_process_count
),
len
(
prof2
[
2
])):
loop_process_count
.
append
(
prof2
[
2
]
.
copy
())
max_nb_nodes
=
max
(
prof1
[
3
],
prof2
[
3
])
...
...
@@ -1602,7 +1633,7 @@ class EquilibriumOptimizer(NavigatorOptimizer):
assert
len
(
loop_timing
)
==
max
(
len
(
prof1
[
1
]),
len
(
prof2
[
1
]))
return
(
new_opt
,
loop_timing
,
process_count
,
loop_
process_count
,
max_nb_nodes
,
global_opt_timing
,
nb_nodes
,
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论