Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
BaiXuePrincess
milvus
提交
2ea773b9
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,发现更多精彩内容 >>
提交
2ea773b9
编写于
8月 16, 2019
作者:
W
wxyu
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
MS-368 Implement cost.cpp
Former-commit-id: 554f06b109662bb381bb06aa73ddab956fb8c47c
上级
484f255f
变更
4
隐藏空白更改
内联
并排
Showing
4 changed file
with
33 addition
and
6 deletion
+33
-6
cpp/CHANGELOG.md
cpp/CHANGELOG.md
+1
-0
cpp/src/scheduler/Cost.cpp
cpp/src/scheduler/Cost.cpp
+21
-3
cpp/src/scheduler/Cost.h
cpp/src/scheduler/Cost.h
+3
-3
cpp/src/scheduler/TaskTable.h
cpp/src/scheduler/TaskTable.h
+8
-0
未找到文件。
cpp/CHANGELOG.md
浏览文件 @
2ea773b9
...
@@ -22,6 +22,7 @@ Please mark all change in change log and use the ticket from JIRA.
...
@@ -22,6 +22,7 @@ Please mark all change in change log and use the ticket from JIRA.
-
MS-364 - Modify tasktableitem in tasktable
-
MS-364 - Modify tasktableitem in tasktable
-
MS-365 - Use tasktableitemptr instead in event
-
MS-365 - Use tasktableitemptr instead in event
-
MS-366 - Implement TaskTable
-
MS-366 - Implement TaskTable
-
MS-368 - Implement cost.cpp
## New Feature
## New Feature
-
MS-343 - Implement ResourceMgr
-
MS-343 - Implement ResourceMgr
...
...
cpp/src/scheduler/Cost.cpp
浏览文件 @
2ea773b9
...
@@ -12,22 +12,40 @@ namespace milvus {
...
@@ -12,22 +12,40 @@ namespace milvus {
namespace
engine
{
namespace
engine
{
std
::
vector
<
uint64_t
>
std
::
vector
<
uint64_t
>
PickToMove
(
const
TaskTable
&
task_table
,
const
CacheMgr
&
cache_mgr
,
uint64_t
limit
)
{
PickToMove
(
TaskTable
&
task_table
,
const
CacheMgr
&
cache_mgr
,
uint64_t
limit
)
{
std
::
vector
<
uint64_t
>
indexes
;
std
::
vector
<
uint64_t
>
indexes
;
for
(
uint64_t
i
=
0
,
count
=
0
;
i
<
task_table
.
Size
()
&&
count
<
limit
;
++
i
)
{
if
(
task_table
[
i
]
->
state
==
TaskTableItemState
::
LOADED
)
{
indexes
.
push_back
(
i
);
++
count
;
}
}
return
indexes
;
return
indexes
;
}
}
std
::
vector
<
uint64_t
>
std
::
vector
<
uint64_t
>
PickToLoad
(
const
TaskTable
&
task_table
,
uint64_t
limit
)
{
PickToLoad
(
TaskTable
&
task_table
,
uint64_t
limit
)
{
std
::
vector
<
uint64_t
>
indexes
;
std
::
vector
<
uint64_t
>
indexes
;
for
(
uint64_t
i
=
0
,
count
=
0
;
i
<
task_table
.
Size
()
&&
count
<
limit
;
++
i
)
{
if
(
task_table
[
i
]
->
state
==
TaskTableItemState
::
START
)
{
indexes
.
push_back
(
i
);
++
count
;
}
}
return
indexes
;
return
indexes
;
}
}
std
::
vector
<
uint64_t
>
std
::
vector
<
uint64_t
>
PickToExecute
(
const
TaskTable
&
task_table
,
uint64_t
limit
)
{
PickToExecute
(
TaskTable
&
task_table
,
uint64_t
limit
)
{
std
::
vector
<
uint64_t
>
indexes
;
std
::
vector
<
uint64_t
>
indexes
;
for
(
uint64_t
i
=
0
,
count
=
0
;
i
<
task_table
.
Size
()
&&
count
<
limit
;
++
i
)
{
if
(
task_table
[
i
]
->
state
==
TaskTableItemState
::
LOADED
)
{
indexes
.
push_back
(
i
);
++
count
;
}
}
return
indexes
;
return
indexes
;
}
}
...
...
cpp/src/scheduler/Cost.h
浏览文件 @
2ea773b9
...
@@ -23,7 +23,7 @@ namespace engine {
...
@@ -23,7 +23,7 @@ namespace engine {
* call from scheduler;
* call from scheduler;
*/
*/
std
::
vector
<
uint64_t
>
std
::
vector
<
uint64_t
>
PickToMove
(
const
TaskTable
&
task_table
,
const
CacheMgr
&
cache_mgr
,
uint64_t
limit
);
PickToMove
(
TaskTable
&
task_table
,
const
CacheMgr
&
cache_mgr
,
uint64_t
limit
);
/*
/*
...
@@ -32,7 +32,7 @@ PickToMove(const TaskTable &task_table, const CacheMgr &cache_mgr, uint64_t limi
...
@@ -32,7 +32,7 @@ PickToMove(const TaskTable &task_table, const CacheMgr &cache_mgr, uint64_t limi
* I DONT SURE NEED THIS;
* I DONT SURE NEED THIS;
*/
*/
std
::
vector
<
uint64_t
>
std
::
vector
<
uint64_t
>
PickToLoad
(
const
TaskTable
&
task_table
,
uint64_t
limit
);
PickToLoad
(
TaskTable
&
task_table
,
uint64_t
limit
);
/*
/*
* select task to execute;
* select task to execute;
...
@@ -40,7 +40,7 @@ PickToLoad(const TaskTable &task_table, uint64_t limit);
...
@@ -40,7 +40,7 @@ PickToLoad(const TaskTable &task_table, uint64_t limit);
* I DONT SURE NEED THIS;
* I DONT SURE NEED THIS;
*/
*/
std
::
vector
<
uint64_t
>
std
::
vector
<
uint64_t
>
PickToExecute
(
const
TaskTable
&
task_table
,
uint64_t
limit
);
PickToExecute
(
TaskTable
&
task_table
,
uint64_t
limit
);
}
}
...
...
cpp/src/scheduler/TaskTable.h
浏览文件 @
2ea773b9
...
@@ -90,6 +90,14 @@ public:
...
@@ -90,6 +90,14 @@ public:
Size
()
{
Size
()
{
return
table_
.
size
();
return
table_
.
size
();
}
}
public:
TaskTableItemPtr
&
operator
[](
uint64_t
index
)
{
return
table_
[
index
];
}
std
::
deque
<
TaskTableItemPtr
>::
iterator
begin
()
{
return
table_
.
begin
();
}
std
::
deque
<
TaskTableItemPtr
>::
iterator
end
()
{
return
table_
.
end
();
}
public:
public:
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录