Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
BaiXuePrincess
milvus
提交
0fbf4315
milvus
项目概览
BaiXuePrincess
/
milvus
与 Fork 源项目一致
从无法访问的项目Fork
通知
7
Star
4
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
milvus
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
0fbf4315
编写于
8月 21, 2019
作者:
W
wxyu
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
MS-391 Add PushTaskToNeighbourHasExecutor action
Former-commit-id: bddcefc244cc06cfa908e9da9f6c5150ed53f87f
上级
109eb6ea
变更
4
隐藏空白更改
内联
并排
Showing
4 changed file
with
56 addition
and
13 deletion
+56
-13
cpp/CHANGELOG.md
cpp/CHANGELOG.md
+1
-0
cpp/src/scheduler/Scheduler.cpp
cpp/src/scheduler/Scheduler.cpp
+2
-1
cpp/src/scheduler/action/Action.h
cpp/src/scheduler/action/Action.h
+5
-0
cpp/src/scheduler/action/PushTaskToNeighbour.cpp
cpp/src/scheduler/action/PushTaskToNeighbour.cpp
+48
-12
未找到文件。
cpp/CHANGELOG.md
浏览文件 @
0fbf4315
...
...
@@ -36,6 +36,7 @@ Please mark all change in change log and use the ticket from JIRA.
-
MS-384 - Add global instance of ResourceMgr and Scheduler
-
MS-389 - Add clone interface in Task
-
MS-390 - Update resource construct function
-
MS-391 - Add PushTaskToNeighbourHasExecutor action
## New Feature
-
MS-343 - Implement ResourceMgr
...
...
cpp/src/scheduler/Scheduler.cpp
浏览文件 @
0fbf4315
...
...
@@ -114,13 +114,14 @@ Scheduler::OnCopyCompleted(const EventPtr &event) {
resource
->
WakeupExecutor
();
if
(
resource
->
Type
()
==
ResourceType
::
DISK
)
{
Action
::
PushTaskToNeighbour
(
event
->
resource_
);
}
else
{
Action
::
PushTaskToNeighbourHasExecutor
(
event
->
resource_
);
}
}
}
void
Scheduler
::
OnTaskTableUpdated
(
const
EventPtr
&
event
)
{
// Action::PushTaskToNeighbour(event->resource_);
if
(
auto
resource
=
event
->
resource_
.
lock
())
{
resource
->
WakeupLoader
();
}
...
...
cpp/src/scheduler/action/Action.h
浏览文件 @
0fbf4315
...
...
@@ -20,6 +20,11 @@ public:
static
void
PushTaskToNeighbour
(
const
ResourceWPtr
&
self
);
/*
* Push task to neighbour that has executor;
*/
static
void
PushTaskToNeighbourHasExecutor
(
const
ResourceWPtr
&
self
);
/*
* Pull task From neighbour;
...
...
cpp/src/scheduler/action/PushTaskToNeighbour.cpp
浏览文件 @
0fbf4315
...
...
@@ -4,7 +4,7 @@
* Proprietary and confidential.
******************************************************************************/
#include <
iostream
>
#include <
list
>
#include "Action.h"
...
...
@@ -13,29 +13,65 @@ namespace milvus {
namespace
engine
{
void
push_task
(
const
ResourcePtr
&
self
,
const
ResourcePtr
&
other
)
{
auto
&
self_task_table
=
self
->
task_table
();
auto
&
other_task_table
=
other
->
task_table
();
next
(
std
::
list
<
ResourcePtr
>
neighbours
,
std
::
list
<
ResourcePtr
>::
iterator
&
it
)
{
it
++
;
if
(
neighbours
.
end
()
==
it
)
{
it
=
neighbours
.
begin
();
}
}
void
push_task_round_robin
(
TaskTable
&
self_task_table
,
std
::
list
<
ResourcePtr
>
&
neighbours
)
{
CacheMgr
cache
;
auto
indexes
=
PickToMove
(
self_task_table
,
cache
,
10
);
auto
it
=
neighbours
.
begin
();
if
(
it
==
neighbours
.
end
())
return
;
auto
indexes
=
PickToMove
(
self_task_table
,
cache
,
self_task_table
.
Size
());
for
(
auto
index
:
indexes
)
{
if
(
self_task_table
.
Move
(
index
))
{
auto
task
=
self_task_table
.
Get
(
index
)
->
task
;
other_task_table
.
Put
(
task
);
// TODO: mark moved future
task
=
task
->
Clone
();
(
*
it
)
->
task_table
().
Put
(
task
);
next
(
neighbours
,
it
);
}
}
}
void
Action
::
PushTaskToNeighbour
(
const
ResourceWPtr
&
res
)
{
if
(
auto
self
=
res
.
lock
())
{
for
(
auto
&
neighbour
:
self
->
GetNeighbours
())
{
if
(
auto
n
=
neighbour
.
neighbour_node
.
lock
())
{
push_task
(
self
,
std
::
static_pointer_cast
<
Resource
>
(
n
));
}
auto
self
=
res
.
lock
();
if
(
not
self
)
return
;
std
::
list
<
ResourcePtr
>
neighbours
;
for
(
auto
&
neighbour_node
:
self
->
GetNeighbours
())
{
auto
node
=
neighbour_node
.
neighbour_node
.
lock
();
if
(
not
node
)
continue
;
auto
resource
=
std
::
static_pointer_cast
<
Resource
>
(
node
);
neighbours
.
emplace_back
(
resource
);
}
push_task_round_robin
(
self
->
task_table
(),
neighbours
);
}
void
Action
::
PushTaskToNeighbourHasExecutor
(
const
ResourceWPtr
&
res
)
{
auto
self
=
res
.
lock
();
if
(
not
self
)
return
;
std
::
list
<
ResourcePtr
>
neighbours
;
for
(
auto
&
neighbour_node
:
self
->
GetNeighbours
())
{
auto
node
=
neighbour_node
.
neighbour_node
.
lock
();
if
(
not
node
)
continue
;
auto
resource
=
std
::
static_pointer_cast
<
Resource
>
(
node
);
if
(
resource
->
HasExecutor
())
{
neighbours
.
emplace_back
(
resource
);
}
}
push_task_round_robin
(
self
->
task_table
(),
neighbours
);
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录