Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
doujutun3207
flink
提交
07a9a56c
F
flink
项目概览
doujutun3207
/
flink
与 Fork 源项目一致
从无法访问的项目Fork
通知
24
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
F
flink
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
07a9a56c
编写于
3月 10, 2015
作者:
F
Fabian Hueske
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[FLINK-1683] [jobmanager] Fix scheduling preference choice for non-unary execution tasks.
This closes #476
上级
81ebe980
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
23 addition
and
5 deletion
+23
-5
flink-runtime/src/main/java/org/apache/flink/runtime/executiongraph/ExecutionVertex.java
.../apache/flink/runtime/executiongraph/ExecutionVertex.java
+23
-5
未找到文件。
flink-runtime/src/main/java/org/apache/flink/runtime/executiongraph/ExecutionVertex.java
浏览文件 @
07a9a56c
...
...
@@ -47,6 +47,7 @@ import java.util.ArrayList;
import
java.util.Collections
;
import
java.util.HashSet
;
import
java.util.List
;
import
java.util.Set
;
import
java.util.concurrent.CopyOnWriteArrayList
;
import
static
com
.
google
.
common
.
base
.
Preconditions
.
checkElementIndex
;
...
...
@@ -348,22 +349,39 @@ public class ExecutionVertex implements Serializable {
return
Collections
.
emptySet
();
}
else
{
HashSet
<
Instance
>
locations
=
new
HashSet
<
Instance
>();
Set
<
Instance
>
locations
=
new
HashSet
<
Instance
>();
Set
<
Instance
>
inputLocations
=
new
HashSet
<
Instance
>();
// go over all inputs
for
(
int
i
=
0
;
i
<
inputEdges
.
length
;
i
++)
{
inputLocations
.
clear
();
ExecutionEdge
[]
sources
=
inputEdges
[
i
];
if
(
sources
!=
null
)
{
// go over all input sources
for
(
int
k
=
0
;
k
<
sources
.
length
;
k
++)
{
// look-up assigned slot of input source
SimpleSlot
sourceSlot
=
sources
[
k
].
getSource
().
getProducer
().
getCurrentAssignedResource
();
if
(
sourceSlot
!=
null
)
{
locations
.
add
(
sourceSlot
.
getInstance
());
if
(
locations
.
size
()
>
MAX_DISTINCT_LOCATIONS_TO_CONSIDER
)
{
return
null
;
// add input location
inputLocations
.
add
(
sourceSlot
.
getInstance
());
// inputs which have too many distinct sources are not considered
if
(
inputLocations
.
size
()
>
MAX_DISTINCT_LOCATIONS_TO_CONSIDER
)
{
inputLocations
.
clear
();
break
;
}
}
}
}
// keep the locations of the input with the least preferred locations
if
(
locations
.
isEmpty
()
||
// nothing assigned yet
(!
inputLocations
.
isEmpty
()
&&
inputLocations
.
size
()
<
locations
.
size
()))
{
// current input has fewer preferred locations
locations
.
clear
();
locations
.
addAll
(
inputLocations
);
}
}
return
locations
;
}
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录