test/milvus
1
0
Fork 0
mirror of https://gitee.com/milvus-io/milvus.git synced 2024-12-01 11:29:48 +08:00
Code Issues Actions 11 Packages Projects Releases Wiki Activity

[skip ci]Change lowercase for etcd (#9886)

Browse Source 
Signed-off-by: Weida Zhu <weida.zhu@zilliz.com>
This commit is contained in:
zwd1208 2021-10-14 18:08:36 +08:00 committed by GitHub
parent 9196b599c2
commit 47a6f538f1
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
docs/design_docs/index_design.md
View File

@ -65,7 +65,7 @@ node that executes index building tasks.
NodeManager is responsible for managing the node information of IndexNode, and contains a priority queue to save the NodeManager is responsible for managing the node information of IndexNode, and contains a priority queue to save the
load information of each IndexNode. The load information of IndexNode is based on the number of tasks executed. load information of each IndexNode. The load information of IndexNode is based on the number of tasks executed.
When the IndexCoord service starts, it first obtains the node information of all When the IndexCoord service starts, it first obtains the node information of all
current IndexNodes from ETCD, and then adds the node information to the NodeManager. After that, the online and offline current IndexNodes from etcd, and then adds the node information to the NodeManager. After that, the online and offline
information of IndexNode node is obtained from watchNodeLoop. Then it will traverse the entire MetaTable, get the load information of IndexNode node is obtained from watchNodeLoop. Then it will traverse the entire MetaTable, get the load
information corresponding to each IndexNode node, and update the priority queue in the NodeManager. Whenever the task information corresponding to each IndexNode node, and update the priority queue in the NodeManager. Whenever the task
of building an index needs to be allocated, the IndexNode with the lowest load will be selected according to the of building an index needs to be allocated, the IndexNode with the lowest load will be selected according to the