Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Oneflow-Inc
oneflow
提交
5f99cc97
O
oneflow
项目概览
Oneflow-Inc
/
oneflow
上一次同步 接近 3 年
通知
13
Star
2733
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
O
oneflow
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
5f99cc97
编写于
3月 05, 2018
作者:
X
Xinqi Li
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
more complicated case
Former-commit-id: bfaf66531e38dc397311f553c349fac2bc7db863
上级
2e9f2e3d
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
18 addition
and
13 deletion
+18
-13
oneflow/core/auto_placement/df_demo.cpp
oneflow/core/auto_placement/df_demo.cpp
+18
-13
未找到文件。
oneflow/core/auto_placement/df_demo.cpp
浏览文件 @
5f99cc97
...
...
@@ -157,10 +157,10 @@ Tensor ProbabilityMatrix(Tensor* var, double lr) {
void
AutoPlacementMemoryDemo
()
{
std
::
random_device
rd
{};
std
::
mt19937
gen
{
rd
()};
std
::
normal_distribution
<
double
>
distr
(
1
,
0.1
);
std
::
normal_distribution
<
double
>
distr
(
1
,
0.
0
1
);
DemoChainGraph
chain_graph
([](
DemoChainGraphBuilder
*
builder
)
{
auto
regst
=
builder
->
ModelOp
(
"op0"
);
FOR_RANGE
(
int
,
i
,
1
,
2
3
)
{
FOR_RANGE
(
int
,
i
,
1
,
6
3
)
{
regst
=
builder
->
ModelOp
(
"op"
+
std
::
to_string
(
i
),
{
regst
});
}
builder
->
Backward
(
builder
->
ModelOp
(
"loss"
,
{
regst
}));
...
...
@@ -171,24 +171,21 @@ void AutoPlacementMemoryDemo() {
Tensor
fw_var
(
shape
,
[
&
](
size_t
index
)
{
return
distr
(
gen
);
});
Tensor
fw_prob
;
auto
chain_node_id2name
=
chain_graph
.
CalcChainNodeId2ChainNodeName
();
double
bugo
=
2
;
FOR_RANGE
(
int
,
step
,
0
,
5
000
)
{
double
bugo
=
1
;
FOR_RANGE
(
int
,
step
,
0
,
10
000
)
{
double
lr
=
0.01
;
fw_prob
=
ProbabilityMatrix
(
&
fw_var
,
lr
);
Tensor
chain_node_prob
=
ColIndexReduce
(
fw_prob
,
chain_node2fw_id
);
if
(
step
%
(
static_cast
<
int
>
(
bugo
+=
0.05
)))
{
fw_prob
=
ProbabilityMatrix
(
&
fw_var
,
lr
);
Tensor
chain_node_prob
=
ColIndexReduce
(
fw_prob
,
chain_node2fw_id
);
auto
chain_prob_copies
=
Clone
(
chain_node_prob
,
3
);
Tensor
computation_ii
=
MatrixRowSum
(
chain_prob_copies
.
at
(
0
));
auto
compo_ii_copies
=
Clone
(
computation_ii
,
2
);
Tensor
dev_mem
=
CalcDeviceMemConsumed
(
chain_prob_copies
.
at
(
2
),
chain_graph
,
4
);
Tensor
ii
=
MaxElem
(
compo_ii_copies
.
at
(
1
));
Tensor
indecision
=
Sub
(
Sum
(
Sqrt
(
chain_prob_copies
.
at
(
1
))),
Tensor
(
chain_node_prob
.
shape
().
At
(
1
)));
Tensor
penalty
=
ADD
(
indecision
,
ADD
(
AvgAbsDeviation
(
dev_mem
),
AvgAbsDeviation
(
compo_ii_copies
.
at
(
0
))));
BackwardRun
(
ADD
(
ii
,
penalty
));
Tensor
balance
=
ADD
(
indecision
,
ADD
(
AvgAbsDeviation
(
dev_mem
),
AvgAbsDeviation
(
computation_ii
)));
BackwardRun
(
balance
);
std
::
cout
<<
"fw_prob: "
<<
std
::
endl
;
FOR_RANGE
(
int
,
j
,
0
,
fw_prob
.
shape
().
At
(
1
))
{
FOR_RANGE
(
int
,
i
,
0
,
fw_prob
.
shape
().
At
(
0
))
{
...
...
@@ -233,7 +230,15 @@ void AutoPlacementMemoryDemo() {
}
std
::
cout
<<
std
::
endl
;
}
else
{
BackwardRun
(
Sum
(
CalcDeviceCopiedRegstMem
(
chain_node_prob
,
chain_graph
)));
FOR_RANGE
(
int
,
x
,
0
,
3
)
{
fw_prob
=
ProbabilityMatrix
(
&
fw_var
,
lr
);
Tensor
chain_node_prob
=
ColIndexReduce
(
fw_prob
,
chain_node2fw_id
);
Tensor
copied_mem
=
Sum
(
CalcDeviceCopiedRegstMem
(
chain_node_prob
,
chain_graph
));
std
::
cout
<<
"copied_mem: "
<<
copied_mem
.
At
(
0
)
<<
std
::
endl
<<
std
::
endl
;
BackwardRun
(
copied_mem
);
}
}
}
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录