Files
tasks/client/matching/loadbalancer_test.go
Shahab TajikandDavid Reiss cfb4868841 Refactor tqname package (#5329)
## What changed?
<!-- Describe what has changed in this PR -->
- Replaced package `tqname` with `tqid` containing the following types
- `TaskQueueFamily` struct including namespace ID and user-given TQ name
- `TaskQueue` struct representing a high level task queue for a
particular task type (activity vs workflow)
- `Partition` interface which can be either a `NormalPartition` or a
`StickyPartition`
- Replaced `taskQueueID` with `PhysicalTaskQueueKey` to represent a
DB-level task queue
- Delete `stickyInfo`
- Replaced all usage of `tqname` and `taskQueueID` with new types
depending on the exact entity that we are dealing with (TQ vs Sticky TQ
partition vs normal TQ partition vs physical queue)
- Created `userDataManager` responsible for fetching/loading and
updating user data. Extracted all the related logic from `taskQueueDB`
and `taskQueuePartitionManger` into `userDataManager`.
- Renamed `taskQueueManager` to `physicalTaskQueueManager`

## Why?
<!-- Tell your future self why have you made these changes -->
This is an overdue refactoring, we need proper distinction between all
different entities mentioned above that are called "task queue".

## How did you test it?
<!-- How have you verified this change? Tested locally? Added a unit
test? Checked in staging env? -->
Mainly existing unit tests. Added few new ones where needed.

## Potential risks
<!-- Assuming the worst case, what can be broken when deploying this
change to production? -->
No known behavioral change is introduced, but need to keep an eye on
this to make sure the refactoring has not change anything
unintentionally.

## Is hotfix candidate?
<!-- Is this PR a hotfix candidate or does it require a notification to
be sent to the broader community? (Yes/No) -->
No.
2024-04-12 11:48:50 -07:00

190 lines
6.5 KiB
Go

// The MIT License
//
// Copyright (c) 2020 Temporal Technologies Inc. All rights reserved.
//
// Copyright (c) 2020 Uber Technologies, Inc.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
package matching
import (
"sync"
"testing"
"github.com/stretchr/testify/assert"
enumspb "go.temporal.io/api/enums/v1"
"go.temporal.io/server/common/tqid"
)
func TestTQLoadBalancerMapping(t *testing.T) {
lb := &defaultLoadBalancer{
lock: sync.RWMutex{},
taskQueueLBs: make(map[tqid.TaskQueue]*tqLoadBalancer),
}
f, err := tqid.NewTaskQueueFamily("fake-namespace-id", "fake-taskqueue")
assert.NoError(t, err)
taskQueue := f.TaskQueue(enumspb.TASK_QUEUE_TYPE_WORKFLOW)
tqlb := lb.getTaskQueueLoadBalancer(taskQueue)
tqlb2 := lb.getTaskQueueLoadBalancer(f.TaskQueue(enumspb.TASK_QUEUE_TYPE_WORKFLOW))
assert.Equal(t, tqlb2, tqlb, "mapping should be based on content, not the pointer value")
taskQueueClone := *taskQueue
tqlb2 = lb.getTaskQueueLoadBalancer(&taskQueueClone)
assert.Equal(t, tqlb2, tqlb, "mapping should be based on content, not the pointer value")
tqlb3 := lb.getTaskQueueLoadBalancer(f.TaskQueue(enumspb.TASK_QUEUE_TYPE_ACTIVITY))
assert.NotEqual(t, tqlb3, tqlb, "separate load LB should be created for each task type")
}
func TestTQLoadBalancer(t *testing.T) {
partitionCount := 4
f, err := tqid.NewTaskQueueFamily("fake-namespace-id", "fake-taskqueue")
assert.NoError(t, err)
tqlb := newTaskQueueLoadBalancer(f.TaskQueue(enumspb.TASK_QUEUE_TYPE_ACTIVITY))
// pick 4 times, each partition picked would have one poller
tqlb.pickReadPartition(partitionCount, -1)
assert.Equal(t, 1, maxPollerCount(tqlb))
tqlb.pickReadPartition(partitionCount, -1)
assert.Equal(t, 1, maxPollerCount(tqlb))
tqlb.pickReadPartition(partitionCount, -1)
assert.Equal(t, 1, maxPollerCount(tqlb))
p3 := tqlb.pickReadPartition(partitionCount, -1)
assert.Equal(t, 1, maxPollerCount(tqlb))
// release one, and pick one, the newly picked one should have one poller
p3.Release()
tqlb.pickReadPartition(partitionCount, -1)
assert.Equal(t, 1, maxPollerCount(tqlb))
// pick one again, this time it should have 2 pollers
tqlb.pickReadPartition(partitionCount, -1)
assert.Equal(t, 2, maxPollerCount(tqlb))
}
func TestTQLoadBalancerForce(t *testing.T) {
partitionCount := 4
f, err := tqid.NewTaskQueueFamily("fake-namespace-id", "fake-taskqueue")
assert.NoError(t, err)
tqlb := newTaskQueueLoadBalancer(f.TaskQueue(enumspb.TASK_QUEUE_TYPE_ACTIVITY))
// pick 4 times, each partition picked would have one poller
p1 := tqlb.pickReadPartition(partitionCount, 1)
assert.Equal(t, 1, p1.TQPartition.PartitionId())
assert.Equal(t, 1, maxPollerCount(tqlb))
tqlb.pickReadPartition(partitionCount, 1)
assert.Equal(t, 2, maxPollerCount(tqlb))
// when we don't force it should balance out
tqlb.pickReadPartition(partitionCount, -1)
tqlb.pickReadPartition(partitionCount, -1)
tqlb.pickReadPartition(partitionCount, -1)
tqlb.pickReadPartition(partitionCount, -1)
tqlb.pickReadPartition(partitionCount, -1)
tqlb.pickReadPartition(partitionCount, -1)
assert.Equal(t, 2, maxPollerCount(tqlb))
// releasing the forced one and adding another should still be balanced
p1.Release()
tqlb.pickReadPartition(partitionCount, -1)
assert.Equal(t, 2, maxPollerCount(tqlb))
tqlb.pickReadPartition(partitionCount, -1)
assert.Equal(t, 3, maxPollerCount(tqlb))
}
func TestLoadBalancerConcurrent(t *testing.T) {
wg := &sync.WaitGroup{}
partitionCount := 4
f, err := tqid.NewTaskQueueFamily("fake-namespace-id", "fake-taskqueue")
assert.NoError(t, err)
tqlb := newTaskQueueLoadBalancer(f.TaskQueue(enumspb.TASK_QUEUE_TYPE_ACTIVITY))
concurrentCount := 10 * partitionCount
wg.Add(concurrentCount)
for i := 0; i < concurrentCount; i++ {
go func() {
defer wg.Done()
tqlb.pickReadPartition(partitionCount, -1)
}()
}
wg.Wait()
// verify all partition have same pollers.
assert.Equal(t, 10, tqlb.pollerCounts[0])
assert.Equal(t, 10, tqlb.pollerCounts[1])
assert.Equal(t, 10, tqlb.pollerCounts[2])
assert.Equal(t, 10, tqlb.pollerCounts[3])
}
func TestLoadBalancer_ReducedPartitionCount(t *testing.T) {
partitionCount := 2
f, err := tqid.NewTaskQueueFamily("fake-namespace-id", "fake-taskqueue")
assert.NoError(t, err)
tqlb := newTaskQueueLoadBalancer(f.TaskQueue(enumspb.TASK_QUEUE_TYPE_ACTIVITY))
p1 := tqlb.pickReadPartition(partitionCount, -1)
p2 := tqlb.pickReadPartition(partitionCount, -1)
assert.Equal(t, 1, maxPollerCount(tqlb))
assert.Equal(t, 1, maxPollerCount(tqlb))
partitionCount += 2 // increase partition count
p3 := tqlb.pickReadPartition(partitionCount, -1)
p4 := tqlb.pickReadPartition(partitionCount, -1)
assert.Equal(t, 1, maxPollerCount(tqlb))
assert.Equal(t, 1, maxPollerCount(tqlb))
partitionCount -= 2 // reduce partition count
p5 := tqlb.pickReadPartition(partitionCount, -1)
p6 := tqlb.pickReadPartition(partitionCount, -1)
assert.Equal(t, 2, maxPollerCount(tqlb))
assert.Equal(t, 2, maxPollerCount(tqlb))
p7 := tqlb.pickReadPartition(partitionCount, -1)
assert.Equal(t, 3, maxPollerCount(tqlb))
// release all of them and it should be ok.
p1.Release()
p2.Release()
p3.Release()
p4.Release()
p5.Release()
p6.Release()
p7.Release()
tqlb.pickReadPartition(partitionCount, -1)
tqlb.pickReadPartition(partitionCount, -1)
assert.Equal(t, 1, maxPollerCount(tqlb))
assert.Equal(t, 1, maxPollerCount(tqlb))
tqlb.pickReadPartition(partitionCount, -1)
assert.Equal(t, 2, maxPollerCount(tqlb))
}
func maxPollerCount(tqlb *tqLoadBalancer) int {
res := -1
for _, c := range tqlb.pollerCounts {
if c > res {
res = c
}
}
return res
}