/
hot_write.go
108 lines (97 loc) · 3.06 KB
/
hot_write.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
// Copyright 2018 TiKV Project Authors.
//
// Licensed 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 cases
import (
"math/rand"
"github.com/docker/go-units"
"github.com/pingcap/kvproto/pkg/metapb"
"github.com/tikv/pd/pkg/core"
"github.com/tikv/pd/tools/pd-simulator/simulator/info"
"github.com/tikv/pd/tools/pd-simulator/simulator/simutil"
"go.uber.org/zap"
)
func newHotWrite() *Case {
var simCase Case
storeNum, regionNum := getStoreNum(), getRegionNum()
// Initialize the cluster
for i := 1; i <= storeNum; i++ {
simCase.Stores = append(simCase.Stores, &Store{
ID: IDAllocator.nextID(),
Status: metapb.StoreState_Up,
})
}
for i := 0; i < storeNum*regionNum/3; i++ {
storeIDs := rand.Perm(storeNum)
peers := []*metapb.Peer{
{Id: IDAllocator.nextID(), StoreId: uint64(storeIDs[0] + 1)},
{Id: IDAllocator.nextID(), StoreId: uint64(storeIDs[1] + 1)},
{Id: IDAllocator.nextID(), StoreId: uint64(storeIDs[2] + 1)},
}
simCase.Regions = append(simCase.Regions, Region{
ID: IDAllocator.nextID(),
Peers: peers,
Leader: peers[0],
Size: 96 * units.MiB,
Keys: 960000,
})
}
// Events description
// select regions on store 1 as hot write regions.
selectStoreNum := storeNum
writeFlow := make(map[uint64]int64, selectStoreNum)
for _, r := range simCase.Regions {
if r.Leader.GetStoreId() == 1 {
writeFlow[r.ID] = 2 * units.MiB
if len(writeFlow) == selectStoreNum {
break
}
}
}
e := &WriteFlowOnRegionDescriptor{}
e.Step = func(int64) map[uint64]int64 {
return writeFlow
}
simCase.Events = []EventDescriptor{e}
// Checker description
simCase.Checker = func(regions *core.RegionsInfo, _ []info.StoreStats) bool {
leaderCount := make([]int, storeNum)
peerCount := make([]int, storeNum)
for id := range writeFlow {
region := regions.GetRegion(id)
leaderCount[int(region.GetLeader().GetStoreId()-1)]++
for _, p := range region.GetPeers() {
peerCount[int(p.GetStoreId()-1)]++
}
}
simutil.Logger.Info("current hot region counts", zap.Reflect("leader", leaderCount), zap.Reflect("peer", peerCount))
// check count diff <= 2.
var minLeader, maxLeader, minPeer, maxPeer int
for i := range leaderCount {
if leaderCount[i] > leaderCount[maxLeader] {
maxLeader = i
}
if leaderCount[i] < leaderCount[minLeader] {
minLeader = i
}
if peerCount[i] > peerCount[maxPeer] {
maxPeer = i
}
if peerCount[i] < peerCount[minPeer] {
minPeer = i
}
}
return leaderCount[maxLeader]-leaderCount[minLeader] <= 2 && peerCount[maxPeer]-peerCount[minPeer] <= 2
}
return &simCase
}