mirror of
https://gitee.com/milvus-io/milvus.git
synced 2024-12-02 20:09:57 +08:00
42 lines
1.7 KiB
Go
42 lines
1.7 KiB
Go
// Licensed to the LF AI & Data foundation under one
|
|
// or more contributor license agreements. See the NOTICE file
|
|
// distributed with this work for additional information
|
|
// regarding copyright ownership. The ASF licenses this file
|
|
// to you under the Apache License, Version 2.0 (the
|
|
// "License"); you may not use this file except in compliance
|
|
// with the License. You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package indexcoord
|
|
|
|
import "github.com/milvus-io/milvus/internal/proto/commonpb"
|
|
|
|
// PeekClientPolicy defines how to choose IndexNode.
|
|
type PeekClientPolicy func(memorySize uint64, indexParams []*commonpb.KeyValuePair,
|
|
typeParams []*commonpb.KeyValuePair, pq *PriorityQueue) UniqueID
|
|
|
|
// PeekClientV0 choose the IndexNode with the smallest amount of tasks.
|
|
func PeekClientV0(memorySize uint64, indexParams []*commonpb.KeyValuePair,
|
|
typeParams []*commonpb.KeyValuePair, pq *PriorityQueue) UniqueID {
|
|
return pq.items[0].key
|
|
}
|
|
|
|
// PeekClientV1 choose the one with the smallest amount of tasks among all IndexNodes
|
|
// whose memory size meets the requirements for building the index.
|
|
func PeekClientV1(memorySize uint64, indexParams []*commonpb.KeyValuePair,
|
|
typeParams []*commonpb.KeyValuePair, pq *PriorityQueue) UniqueID {
|
|
for i := range pq.items {
|
|
if pq.items[i].totalMem > memorySize {
|
|
return pq.items[i].key
|
|
}
|
|
}
|
|
return UniqueID(-1)
|
|
}
|