mirror of
https://gitee.com/milvus-io/milvus.git
synced 2026-01-07 19:31:51 +08:00
Seals the largest growing segment if the total size of growing segments of each shard exceeds the size threshold(default 4GB). Introducing this policy can help keep the size of growing segments within a suitable level, alleviating the pressure on the delegator. issue: https://github.com/milvus-io/milvus/issues/34554 --------- Signed-off-by: bigsheeper <yihao.dai@zilliz.com>
233 lines
6.7 KiB
Go
233 lines
6.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 datacoord
|
|
|
|
import (
|
|
"math/rand"
|
|
"testing"
|
|
"time"
|
|
|
|
"github.com/stretchr/testify/assert"
|
|
|
|
"github.com/milvus-io/milvus-proto/go-api/v2/commonpb"
|
|
"github.com/milvus-io/milvus-proto/go-api/v2/schemapb"
|
|
"github.com/milvus-io/milvus/internal/proto/datapb"
|
|
"github.com/milvus-io/milvus/pkg/common"
|
|
"github.com/milvus-io/milvus/pkg/util/paramtable"
|
|
"github.com/milvus-io/milvus/pkg/util/tsoutil"
|
|
)
|
|
|
|
func TestUpperLimitCalBySchema(t *testing.T) {
|
|
type testCase struct {
|
|
schema *schemapb.CollectionSchema
|
|
expected int
|
|
expectErr bool
|
|
}
|
|
testCases := []testCase{
|
|
{
|
|
schema: nil,
|
|
expected: -1,
|
|
expectErr: true,
|
|
},
|
|
{
|
|
schema: &schemapb.CollectionSchema{
|
|
Fields: []*schemapb.FieldSchema{},
|
|
},
|
|
expected: -1,
|
|
expectErr: true,
|
|
},
|
|
{
|
|
schema: &schemapb.CollectionSchema{
|
|
Fields: []*schemapb.FieldSchema{
|
|
{
|
|
DataType: schemapb.DataType_FloatVector,
|
|
TypeParams: []*commonpb.KeyValuePair{
|
|
{Key: common.DimKey, Value: "bad_dim"},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
expected: -1,
|
|
expectErr: true,
|
|
},
|
|
{
|
|
schema: &schemapb.CollectionSchema{
|
|
Fields: []*schemapb.FieldSchema{
|
|
{
|
|
DataType: schemapb.DataType_Int64,
|
|
},
|
|
{
|
|
DataType: schemapb.DataType_Int32,
|
|
},
|
|
{
|
|
DataType: schemapb.DataType_FloatVector,
|
|
TypeParams: []*commonpb.KeyValuePair{
|
|
{Key: common.DimKey, Value: "128"},
|
|
},
|
|
},
|
|
},
|
|
},
|
|
expected: int(Params.DataCoordCfg.SegmentMaxSize.GetAsFloat() * 1024 * 1024 / float64(524)),
|
|
expectErr: false,
|
|
},
|
|
}
|
|
for _, c := range testCases {
|
|
result, err := calBySchemaPolicy(c.schema)
|
|
if c.expectErr {
|
|
assert.Error(t, err)
|
|
} else {
|
|
assert.Equal(t, c.expected, result)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestGetChannelOpenSegCapacityPolicy(t *testing.T) {
|
|
p := getChannelOpenSegCapacityPolicy(3)
|
|
type testCase struct {
|
|
channel string
|
|
segments []*SegmentInfo
|
|
ts Timestamp
|
|
validator func([]*SegmentInfo) bool
|
|
}
|
|
testCases := []testCase{
|
|
{
|
|
segments: []*SegmentInfo{},
|
|
ts: tsoutil.ComposeTS(time.Now().Unix()/int64(time.Millisecond), rand.Int63n(1000)),
|
|
validator: func(result []*SegmentInfo) bool {
|
|
return len(result) == 0
|
|
},
|
|
},
|
|
{
|
|
segments: []*SegmentInfo{
|
|
{
|
|
SegmentInfo: &datapb.SegmentInfo{},
|
|
},
|
|
{
|
|
SegmentInfo: &datapb.SegmentInfo{},
|
|
},
|
|
{
|
|
SegmentInfo: &datapb.SegmentInfo{},
|
|
},
|
|
{
|
|
SegmentInfo: &datapb.SegmentInfo{},
|
|
},
|
|
},
|
|
ts: tsoutil.ComposeTS(time.Now().Unix()/int64(time.Millisecond), rand.Int63n(1000)),
|
|
validator: func(result []*SegmentInfo) bool {
|
|
return len(result) == 1
|
|
},
|
|
},
|
|
}
|
|
for _, c := range testCases {
|
|
result, _ := p(c.channel, c.segments, c.ts)
|
|
if c.validator != nil {
|
|
assert.True(t, c.validator(result))
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestSortSegmentsByLastExpires(t *testing.T) {
|
|
segs := make([]*SegmentInfo, 0, 10)
|
|
for i := 0; i < 10; i++ {
|
|
segs = append(segs,
|
|
&SegmentInfo{
|
|
SegmentInfo: &datapb.SegmentInfo{
|
|
LastExpireTime: uint64(rand.Int31n(100000)),
|
|
},
|
|
})
|
|
}
|
|
sortSegmentsByLastExpires(segs)
|
|
for i := 1; i < 10; i++ {
|
|
assert.True(t, segs[i-1].LastExpireTime <= segs[i].LastExpireTime)
|
|
}
|
|
}
|
|
|
|
func TestSealSegmentPolicy(t *testing.T) {
|
|
t.Run("test seal segment by lifetime", func(t *testing.T) {
|
|
lifetime := 2 * time.Second
|
|
now := time.Now()
|
|
curTS := now.UnixNano() / int64(time.Millisecond)
|
|
nosealTs := (now.Add(lifetime / 2)).UnixNano() / int64(time.Millisecond)
|
|
sealTs := (now.Add(lifetime)).UnixNano() / int64(time.Millisecond)
|
|
|
|
p := sealL1SegmentByLifetime(lifetime)
|
|
|
|
segment := &SegmentInfo{
|
|
SegmentInfo: &datapb.SegmentInfo{
|
|
ID: 1,
|
|
LastExpireTime: tsoutil.ComposeTS(curTS, 0),
|
|
},
|
|
}
|
|
|
|
shouldSeal, _ := p.ShouldSeal(segment, tsoutil.ComposeTS(nosealTs, 0))
|
|
assert.False(t, shouldSeal)
|
|
|
|
shouldSeal, _ = p.ShouldSeal(segment, tsoutil.ComposeTS(sealTs, 0))
|
|
assert.True(t, shouldSeal)
|
|
})
|
|
}
|
|
|
|
func Test_sealLongTimeIdlePolicy(t *testing.T) {
|
|
idleTimeTolerance := 2 * time.Second
|
|
minSizeToSealIdleSegment := 16.0
|
|
maxSizeOfSegment := 512.0
|
|
policy := sealL1SegmentByIdleTime(idleTimeTolerance, minSizeToSealIdleSegment, maxSizeOfSegment)
|
|
seg1 := &SegmentInfo{lastWrittenTime: time.Now().Add(idleTimeTolerance * 5)}
|
|
shouldSeal, _ := policy.ShouldSeal(seg1, 100)
|
|
assert.False(t, shouldSeal)
|
|
seg2 := &SegmentInfo{lastWrittenTime: getZeroTime(), currRows: 1, SegmentInfo: &datapb.SegmentInfo{MaxRowNum: 10000}}
|
|
shouldSeal, _ = policy.ShouldSeal(seg2, 100)
|
|
assert.False(t, shouldSeal)
|
|
seg3 := &SegmentInfo{lastWrittenTime: getZeroTime(), currRows: 1000, SegmentInfo: &datapb.SegmentInfo{MaxRowNum: 10000}}
|
|
shouldSeal, _ = policy.ShouldSeal(seg3, 100)
|
|
assert.True(t, shouldSeal)
|
|
}
|
|
|
|
func Test_sealByTotalGrowingSegmentsSize(t *testing.T) {
|
|
paramtable.Get().Save(paramtable.Get().DataCoordCfg.TotalGrowingSizeThresholdInMB.Key, "100")
|
|
defer paramtable.Get().Reset(paramtable.Get().DataCoordCfg.TotalGrowingSizeThresholdInMB.Key)
|
|
|
|
seg0 := &SegmentInfo{SegmentInfo: &datapb.SegmentInfo{
|
|
ID: 0,
|
|
State: commonpb.SegmentState_Growing,
|
|
Binlogs: []*datapb.FieldBinlog{{Binlogs: []*datapb.Binlog{{MemorySize: 30 * MB}}}},
|
|
}}
|
|
seg1 := &SegmentInfo{SegmentInfo: &datapb.SegmentInfo{
|
|
ID: 1,
|
|
State: commonpb.SegmentState_Growing,
|
|
Binlogs: []*datapb.FieldBinlog{{Binlogs: []*datapb.Binlog{{MemorySize: 40 * MB}}}},
|
|
}}
|
|
seg2 := &SegmentInfo{SegmentInfo: &datapb.SegmentInfo{
|
|
ID: 2,
|
|
State: commonpb.SegmentState_Growing,
|
|
Binlogs: []*datapb.FieldBinlog{{Binlogs: []*datapb.Binlog{{MemorySize: 50 * MB}}}},
|
|
}}
|
|
seg3 := &SegmentInfo{SegmentInfo: &datapb.SegmentInfo{
|
|
ID: 3,
|
|
State: commonpb.SegmentState_Sealed,
|
|
}}
|
|
|
|
fn := sealByTotalGrowingSegmentsSize()
|
|
// size not reach threshold
|
|
res, _ := fn("ch-0", []*SegmentInfo{seg0}, 0)
|
|
assert.Equal(t, 0, len(res))
|
|
// size reached the threshold
|
|
res, _ = fn("ch-0", []*SegmentInfo{seg0, seg1, seg2, seg3}, 0)
|
|
assert.Equal(t, 1, len(res))
|
|
assert.Equal(t, seg2.GetID(), res[0].GetID())
|
|
}
|