milvus/internal/datacoord/compaction_queue_test.go
Ted Xu 5fc731795b
enhance: Datacoord to support prioritization of compaction tasks (#36547)
See #36550

This PR made 2 changes:

1. Introducing a prioritization mechanism, if
`dataCoord.compaction.taskPrioritizer` is set to `level`, compaction
tasks are always executed as the priority of L0>Mix>Clustering
2. `dataCoord.compaction.maxParallelTaskNum` now controls the
parallelism of executing tasks, not the task number of queue +
executing.

---------

Signed-off-by: Ted Xu <ted.xu@zilliz.com>
2024-10-09 19:11:20 +08:00

152 lines
3.9 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 (
"sync"
"testing"
"github.com/stretchr/testify/assert"
"github.com/milvus-io/milvus/internal/proto/datapb"
)
func TestCompactionQueue(t *testing.T) {
t1 := &mixCompactionTask{
CompactionTask: &datapb.CompactionTask{
PlanID: 3,
Type: datapb.CompactionType_MixCompaction,
},
}
t2 := &l0CompactionTask{
CompactionTask: &datapb.CompactionTask{
PlanID: 1,
Type: datapb.CompactionType_Level0DeleteCompaction,
},
}
t3 := &clusteringCompactionTask{
CompactionTask: &datapb.CompactionTask{
PlanID: 2,
Type: datapb.CompactionType_MajorCompaction,
},
}
t.Run("default prioritizer", func(t *testing.T) {
cq := NewCompactionQueue(3, DefaultPrioritizer)
err := cq.Enqueue(t1)
assert.NoError(t, err)
err = cq.Enqueue(t2)
assert.NoError(t, err)
err = cq.Enqueue(t3)
assert.NoError(t, err)
err = cq.Enqueue(&mixCompactionTask{})
assert.Error(t, err)
task, err := cq.Dequeue()
assert.NoError(t, err)
assert.Equal(t, int64(1), task.GetPlanID())
task, err = cq.Dequeue()
assert.NoError(t, err)
assert.Equal(t, int64(2), task.GetPlanID())
task, err = cq.Dequeue()
assert.NoError(t, err)
assert.Equal(t, int64(3), task.GetPlanID())
})
t.Run("level prioritizer", func(t *testing.T) {
cq := NewCompactionQueue(3, LevelPrioritizer)
err := cq.Enqueue(t1)
assert.NoError(t, err)
err = cq.Enqueue(t2)
assert.NoError(t, err)
err = cq.Enqueue(t3)
assert.NoError(t, err)
err = cq.Enqueue(&mixCompactionTask{})
assert.Error(t, err)
task, err := cq.Dequeue()
assert.NoError(t, err)
assert.Equal(t, datapb.CompactionType_Level0DeleteCompaction, task.GetType())
task, err = cq.Dequeue()
assert.NoError(t, err)
assert.Equal(t, datapb.CompactionType_MixCompaction, task.GetType())
task, err = cq.Dequeue()
assert.NoError(t, err)
assert.Equal(t, datapb.CompactionType_MajorCompaction, task.GetType())
})
t.Run("update prioritizer", func(t *testing.T) {
cq := NewCompactionQueue(3, LevelPrioritizer)
err := cq.Enqueue(t1)
assert.NoError(t, err)
err = cq.Enqueue(t2)
assert.NoError(t, err)
err = cq.Enqueue(t3)
assert.NoError(t, err)
err = cq.Enqueue(&mixCompactionTask{})
assert.Error(t, err)
task, err := cq.Dequeue()
assert.NoError(t, err)
assert.Equal(t, datapb.CompactionType_Level0DeleteCompaction, task.GetType())
cq.UpdatePrioritizer(DefaultPrioritizer)
task, err = cq.Dequeue()
assert.NoError(t, err)
assert.Equal(t, int64(2), task.GetPlanID())
task, err = cq.Dequeue()
assert.NoError(t, err)
assert.Equal(t, int64(3), task.GetPlanID())
})
}
func TestConcurrency(t *testing.T) {
c := 10
cq := NewCompactionQueue(c, LevelPrioritizer)
wg := sync.WaitGroup{}
wg.Add(c)
for i := 0; i < c; i++ {
t1 := &mixCompactionTask{
CompactionTask: &datapb.CompactionTask{
PlanID: int64(i),
Type: datapb.CompactionType_MixCompaction,
},
}
go func() {
err := cq.Enqueue(t1)
assert.NoError(t, err)
wg.Done()
}()
}
wg.Wait()
wg.Add(c)
for i := 0; i < c; i++ {
go func() {
_, err := cq.Dequeue()
assert.NoError(t, err)
wg.Done()
}()
}
wg.Wait()
}