You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

422 lines
14 KiB

2 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
2 years ago
4 years ago
2 years ago
4 years ago
2 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
  1. package shell
  2. import (
  3. "cmp"
  4. "flag"
  5. "fmt"
  6. "io"
  7. "os"
  8. "time"
  9. "github.com/seaweedfs/seaweedfs/weed/pb"
  10. "github.com/seaweedfs/seaweedfs/weed/storage/erasure_coding"
  11. "github.com/seaweedfs/seaweedfs/weed/storage/super_block"
  12. "github.com/seaweedfs/seaweedfs/weed/storage/types"
  13. "golang.org/x/exp/slices"
  14. "github.com/seaweedfs/seaweedfs/weed/pb/master_pb"
  15. "github.com/seaweedfs/seaweedfs/weed/storage/needle"
  16. )
  17. func init() {
  18. Commands = append(Commands, &commandVolumeBalance{})
  19. }
  20. type commandVolumeBalance struct {
  21. }
  22. func (c *commandVolumeBalance) Name() string {
  23. return "volume.balance"
  24. }
  25. func (c *commandVolumeBalance) Help() string {
  26. return `balance all volumes among volume servers
  27. volume.balance [-collection ALL_COLLECTIONS|EACH_COLLECTION|<collection_name>] [-force] [-dataCenter=<data_center_name>]
  28. Algorithm:
  29. For each type of volume server (different max volume count limit){
  30. for each collection {
  31. balanceWritableVolumes()
  32. balanceReadOnlyVolumes()
  33. }
  34. }
  35. func balanceWritableVolumes(){
  36. idealWritableVolumeRatio = totalWritableVolumes / totalNumberOfMaxVolumes
  37. for hasMovedOneVolume {
  38. sort all volume servers ordered by the localWritableVolumeRatio = localWritableVolumes to localVolumeMax
  39. pick the volume server B with the highest localWritableVolumeRatio y
  40. for any the volume server A with the number of writable volumes x + 1 <= idealWritableVolumeRatio * localVolumeMax {
  41. if y > localWritableVolumeRatio {
  42. if B has a writable volume id v that A does not have, and satisfy v replication requirements {
  43. move writable volume v from A to B
  44. }
  45. }
  46. }
  47. }
  48. }
  49. func balanceReadOnlyVolumes(){
  50. //similar to balanceWritableVolumes
  51. }
  52. `
  53. }
  54. func (c *commandVolumeBalance) Do(args []string, commandEnv *CommandEnv, writer io.Writer) (err error) {
  55. balanceCommand := flag.NewFlagSet(c.Name(), flag.ContinueOnError)
  56. collection := balanceCommand.String("collection", "ALL_COLLECTIONS", "collection name, or use \"ALL_COLLECTIONS\" across collections, \"EACH_COLLECTION\" for each collection")
  57. dc := balanceCommand.String("dataCenter", "", "only apply the balancing for this dataCenter")
  58. applyBalancing := balanceCommand.Bool("force", false, "apply the balancing plan.")
  59. if err = balanceCommand.Parse(args); err != nil {
  60. return nil
  61. }
  62. infoAboutSimulationMode(writer, *applyBalancing, "-force")
  63. if err = commandEnv.confirmIsLocked(args); err != nil {
  64. return
  65. }
  66. // collect topology information
  67. topologyInfo, volumeSizeLimitMb, err := collectTopologyInfo(commandEnv, 15*time.Second)
  68. if err != nil {
  69. return err
  70. }
  71. volumeServers := collectVolumeServersByDc(topologyInfo, *dc)
  72. volumeReplicas, _ := collectVolumeReplicaLocations(topologyInfo)
  73. diskTypes := collectVolumeDiskTypes(topologyInfo)
  74. if *collection == "EACH_COLLECTION" {
  75. collections, err := ListCollectionNames(commandEnv, true, false)
  76. if err != nil {
  77. return err
  78. }
  79. for _, c := range collections {
  80. if err = balanceVolumeServers(commandEnv, diskTypes, volumeReplicas, volumeServers, volumeSizeLimitMb*1024*1024, c, *applyBalancing); err != nil {
  81. return err
  82. }
  83. }
  84. } else if *collection == "ALL_COLLECTIONS" {
  85. if err = balanceVolumeServers(commandEnv, diskTypes, volumeReplicas, volumeServers, volumeSizeLimitMb*1024*1024, "ALL_COLLECTIONS", *applyBalancing); err != nil {
  86. return err
  87. }
  88. } else {
  89. if err = balanceVolumeServers(commandEnv, diskTypes, volumeReplicas, volumeServers, volumeSizeLimitMb*1024*1024, *collection, *applyBalancing); err != nil {
  90. return err
  91. }
  92. }
  93. return nil
  94. }
  95. func balanceVolumeServers(commandEnv *CommandEnv, diskTypes []types.DiskType, volumeReplicas map[uint32][]*VolumeReplica, nodes []*Node, volumeSizeLimit uint64, collection string, applyBalancing bool) error {
  96. for _, diskType := range diskTypes {
  97. if err := balanceVolumeServersByDiskType(commandEnv, diskType, volumeReplicas, nodes, volumeSizeLimit, collection, applyBalancing); err != nil {
  98. return err
  99. }
  100. }
  101. return nil
  102. }
  103. func balanceVolumeServersByDiskType(commandEnv *CommandEnv, diskType types.DiskType, volumeReplicas map[uint32][]*VolumeReplica, nodes []*Node, volumeSizeLimit uint64, collection string, applyBalancing bool) error {
  104. for _, n := range nodes {
  105. n.selectVolumes(func(v *master_pb.VolumeInformationMessage) bool {
  106. if collection != "ALL_COLLECTIONS" {
  107. if v.Collection != collection {
  108. return false
  109. }
  110. }
  111. return v.DiskType == string(diskType)
  112. })
  113. }
  114. if err := balanceSelectedVolume(commandEnv, diskType, volumeReplicas, nodes, sortWritableVolumes, applyBalancing); err != nil {
  115. return err
  116. }
  117. return nil
  118. }
  119. func collectVolumeServersByDc(t *master_pb.TopologyInfo, selectedDataCenter string) (nodes []*Node) {
  120. for _, dc := range t.DataCenterInfos {
  121. if selectedDataCenter != "" && dc.Id != selectedDataCenter {
  122. continue
  123. }
  124. for _, r := range dc.RackInfos {
  125. for _, dn := range r.DataNodeInfos {
  126. nodes = append(nodes, &Node{
  127. info: dn,
  128. dc: dc.Id,
  129. rack: r.Id,
  130. })
  131. }
  132. }
  133. }
  134. return
  135. }
  136. func collectVolumeDiskTypes(t *master_pb.TopologyInfo) (diskTypes []types.DiskType) {
  137. knownTypes := make(map[string]bool)
  138. for _, dc := range t.DataCenterInfos {
  139. for _, r := range dc.RackInfos {
  140. for _, dn := range r.DataNodeInfos {
  141. for diskType, _ := range dn.DiskInfos {
  142. if _, found := knownTypes[diskType]; !found {
  143. knownTypes[diskType] = true
  144. }
  145. }
  146. }
  147. }
  148. }
  149. for diskType, _ := range knownTypes {
  150. diskTypes = append(diskTypes, types.ToDiskType(diskType))
  151. }
  152. return
  153. }
  154. type Node struct {
  155. info *master_pb.DataNodeInfo
  156. selectedVolumes map[uint32]*master_pb.VolumeInformationMessage
  157. dc string
  158. rack string
  159. }
  160. type CapacityFunc func(*master_pb.DataNodeInfo) float64
  161. func capacityByMaxVolumeCount(diskType types.DiskType) CapacityFunc {
  162. return func(info *master_pb.DataNodeInfo) float64 {
  163. diskInfo, found := info.DiskInfos[string(diskType)]
  164. if !found {
  165. return 0
  166. }
  167. return float64(diskInfo.MaxVolumeCount)
  168. }
  169. }
  170. func capacityByFreeVolumeCount(diskType types.DiskType) CapacityFunc {
  171. return func(info *master_pb.DataNodeInfo) float64 {
  172. diskInfo, found := info.DiskInfos[string(diskType)]
  173. if !found {
  174. return 0
  175. }
  176. var ecShardCount int
  177. for _, ecShardInfo := range diskInfo.EcShardInfos {
  178. ecShardCount += erasure_coding.ShardBits(ecShardInfo.EcIndexBits).ShardIdCount()
  179. }
  180. return float64(diskInfo.MaxVolumeCount-diskInfo.VolumeCount) - float64(ecShardCount)/erasure_coding.DataShardsCount
  181. }
  182. }
  183. func (n *Node) localVolumeRatio(capacityFunc CapacityFunc) float64 {
  184. return float64(len(n.selectedVolumes)) / capacityFunc(n.info)
  185. }
  186. func (n *Node) localVolumeNextRatio(capacityFunc CapacityFunc) float64 {
  187. return float64(len(n.selectedVolumes)+1) / capacityFunc(n.info)
  188. }
  189. func (n *Node) isOneVolumeOnly() bool {
  190. if len(n.selectedVolumes) != 1 {
  191. return false
  192. }
  193. for _, disk := range n.info.DiskInfos {
  194. if disk.VolumeCount == 1 && disk.MaxVolumeCount == 1 {
  195. return true
  196. }
  197. }
  198. return false
  199. }
  200. func (n *Node) selectVolumes(fn func(v *master_pb.VolumeInformationMessage) bool) {
  201. n.selectedVolumes = make(map[uint32]*master_pb.VolumeInformationMessage)
  202. for _, diskInfo := range n.info.DiskInfos {
  203. for _, v := range diskInfo.VolumeInfos {
  204. if fn(v) {
  205. n.selectedVolumes[v.Id] = v
  206. }
  207. }
  208. }
  209. }
  210. func sortWritableVolumes(volumes []*master_pb.VolumeInformationMessage) {
  211. slices.SortFunc(volumes, func(a, b *master_pb.VolumeInformationMessage) int {
  212. return cmp.Compare(a.Size, b.Size)
  213. })
  214. }
  215. func balanceSelectedVolume(commandEnv *CommandEnv, diskType types.DiskType, volumeReplicas map[uint32][]*VolumeReplica, nodes []*Node, sortCandidatesFn func(volumes []*master_pb.VolumeInformationMessage), applyBalancing bool) (err error) {
  216. selectedVolumeCount, volumeMaxCount := 0, float64(0)
  217. var nodesWithCapacity []*Node
  218. capacityFunc := capacityByMaxVolumeCount(diskType)
  219. for _, dn := range nodes {
  220. selectedVolumeCount += len(dn.selectedVolumes)
  221. capacity := capacityFunc(dn.info)
  222. if capacity > 0 {
  223. nodesWithCapacity = append(nodesWithCapacity, dn)
  224. }
  225. volumeMaxCount += capacity
  226. }
  227. idealVolumeRatio := float64(selectedVolumeCount) / volumeMaxCount
  228. hasMoved := true
  229. // fmt.Fprintf(os.Stdout, " total %d volumes, max %d volumes, idealVolumeRatio %f\n", selectedVolumeCount, volumeMaxCount, idealVolumeRatio)
  230. for hasMoved {
  231. hasMoved = false
  232. slices.SortFunc(nodesWithCapacity, func(a, b *Node) int {
  233. return cmp.Compare(a.localVolumeRatio(capacityFunc), b.localVolumeRatio(capacityFunc))
  234. })
  235. if len(nodesWithCapacity) == 0 {
  236. fmt.Printf("no volume server found with capacity for %s", diskType.ReadableString())
  237. return nil
  238. }
  239. var fullNode *Node
  240. var fullNodeIndex int
  241. for fullNodeIndex = len(nodesWithCapacity) - 1; fullNodeIndex >= 0; fullNodeIndex-- {
  242. fullNode = nodesWithCapacity[fullNodeIndex]
  243. if !fullNode.isOneVolumeOnly() {
  244. break
  245. }
  246. }
  247. var candidateVolumes []*master_pb.VolumeInformationMessage
  248. for _, v := range fullNode.selectedVolumes {
  249. candidateVolumes = append(candidateVolumes, v)
  250. }
  251. sortCandidatesFn(candidateVolumes)
  252. for _, emptyNode := range nodesWithCapacity[:fullNodeIndex] {
  253. if !(fullNode.localVolumeRatio(capacityFunc) > idealVolumeRatio && emptyNode.localVolumeNextRatio(capacityFunc) <= idealVolumeRatio) {
  254. // no more volume servers with empty slots
  255. break
  256. }
  257. fmt.Fprintf(os.Stdout, "%s %.2f %.2f:%.2f\t", diskType.ReadableString(), idealVolumeRatio, fullNode.localVolumeRatio(capacityFunc), emptyNode.localVolumeNextRatio(capacityFunc))
  258. hasMoved, err = attemptToMoveOneVolume(commandEnv, volumeReplicas, fullNode, candidateVolumes, emptyNode, applyBalancing)
  259. if err != nil {
  260. return
  261. }
  262. if hasMoved {
  263. // moved one volume
  264. break
  265. }
  266. }
  267. }
  268. return nil
  269. }
  270. func attemptToMoveOneVolume(commandEnv *CommandEnv, volumeReplicas map[uint32][]*VolumeReplica, fullNode *Node, candidateVolumes []*master_pb.VolumeInformationMessage, emptyNode *Node, applyBalancing bool) (hasMoved bool, err error) {
  271. for _, v := range candidateVolumes {
  272. hasMoved, err = maybeMoveOneVolume(commandEnv, volumeReplicas, fullNode, v, emptyNode, applyBalancing)
  273. if err != nil {
  274. return
  275. }
  276. if hasMoved {
  277. break
  278. }
  279. }
  280. return
  281. }
  282. func maybeMoveOneVolume(commandEnv *CommandEnv, volumeReplicas map[uint32][]*VolumeReplica, fullNode *Node, candidateVolume *master_pb.VolumeInformationMessage, emptyNode *Node, applyChange bool) (hasMoved bool, err error) {
  283. if !commandEnv.isLocked() {
  284. return false, fmt.Errorf("lock is lost")
  285. }
  286. if candidateVolume.RemoteStorageName != "" {
  287. return false, fmt.Errorf("does not move volume in remove storage")
  288. }
  289. if candidateVolume.ReplicaPlacement > 0 {
  290. replicaPlacement, _ := super_block.NewReplicaPlacementFromByte(byte(candidateVolume.ReplicaPlacement))
  291. if !isGoodMove(replicaPlacement, volumeReplicas[candidateVolume.Id], fullNode, emptyNode) {
  292. return false, nil
  293. }
  294. }
  295. if _, found := emptyNode.selectedVolumes[candidateVolume.Id]; !found {
  296. if err = moveVolume(commandEnv, candidateVolume, fullNode, emptyNode, applyChange); err == nil {
  297. adjustAfterMove(candidateVolume, volumeReplicas, fullNode, emptyNode)
  298. return true, nil
  299. } else {
  300. return
  301. }
  302. }
  303. return
  304. }
  305. func moveVolume(commandEnv *CommandEnv, v *master_pb.VolumeInformationMessage, fullNode *Node, emptyNode *Node, applyChange bool) error {
  306. collectionPrefix := v.Collection + "_"
  307. if v.Collection == "" {
  308. collectionPrefix = ""
  309. }
  310. fmt.Fprintf(os.Stdout, " moving %s volume %s%d %s => %s\n", v.DiskType, collectionPrefix, v.Id, fullNode.info.Id, emptyNode.info.Id)
  311. if applyChange {
  312. return LiveMoveVolume(commandEnv.option.GrpcDialOption, os.Stderr, needle.VolumeId(v.Id), pb.NewServerAddressFromDataNode(fullNode.info), pb.NewServerAddressFromDataNode(emptyNode.info), 5*time.Second, v.DiskType, 0, false)
  313. }
  314. return nil
  315. }
  316. func isGoodMove(placement *super_block.ReplicaPlacement, existingReplicas []*VolumeReplica, sourceNode, targetNode *Node) bool {
  317. for _, replica := range existingReplicas {
  318. if replica.location.dataNode.Id == targetNode.info.Id &&
  319. replica.location.rack == targetNode.rack &&
  320. replica.location.dc == targetNode.dc {
  321. // never move to existing nodes
  322. return false
  323. }
  324. }
  325. // existing replicas except the one on sourceNode
  326. existingReplicasExceptSourceNode := make([]*VolumeReplica, 0)
  327. for _, replica := range existingReplicas {
  328. if replica.location.dataNode.Id != sourceNode.info.Id {
  329. existingReplicasExceptSourceNode = append(existingReplicasExceptSourceNode, replica)
  330. }
  331. }
  332. // target location
  333. targetLocation := location{
  334. dc: targetNode.dc,
  335. rack: targetNode.rack,
  336. dataNode: targetNode.info,
  337. }
  338. // check if this satisfies replication requirements
  339. return satisfyReplicaPlacement(placement, existingReplicasExceptSourceNode, targetLocation)
  340. }
  341. func adjustAfterMove(v *master_pb.VolumeInformationMessage, volumeReplicas map[uint32][]*VolumeReplica, fullNode *Node, emptyNode *Node) {
  342. delete(fullNode.selectedVolumes, v.Id)
  343. if emptyNode.selectedVolumes != nil {
  344. emptyNode.selectedVolumes[v.Id] = v
  345. }
  346. existingReplicas := volumeReplicas[v.Id]
  347. for _, replica := range existingReplicas {
  348. if replica.location.dataNode.Id == fullNode.info.Id &&
  349. replica.location.rack == fullNode.rack &&
  350. replica.location.dc == fullNode.dc {
  351. loc := newLocation(emptyNode.dc, emptyNode.rack, emptyNode.info)
  352. replica.location = &loc
  353. for diskType, diskInfo := range fullNode.info.DiskInfos {
  354. if diskType == v.DiskType {
  355. diskInfo.VolumeCount--
  356. diskInfo.FreeVolumeCount++
  357. }
  358. }
  359. for diskType, diskInfo := range emptyNode.info.DiskInfos {
  360. if diskType == v.DiskType {
  361. diskInfo.VolumeCount++
  362. diskInfo.FreeVolumeCount--
  363. }
  364. }
  365. return
  366. }
  367. }
  368. }