Browse Source

sort writables to be able to skew write probability to lesser ids (older volumes)

pull/2/head
Tamás Gulácsi 12 years ago
parent
commit
ce7394f3bf
  1. 38
      weed-fs/src/pkg/topology/volume_layout.go

38
weed-fs/src/pkg/topology/volume_layout.go

@ -5,12 +5,15 @@ import (
"fmt" "fmt"
"math/rand" "math/rand"
"pkg/storage" "pkg/storage"
"sort"
) )
type volumeIdList []storage.VolumeId
type VolumeLayout struct { type VolumeLayout struct {
repType storage.ReplicationType repType storage.ReplicationType
vid2location map[storage.VolumeId]*VolumeLocationList vid2location map[storage.VolumeId]*VolumeLocationList
writables []storage.VolumeId // transient array of writable volume id
writables volumeIdList // transient (sorted!) array of writable volume Ids
pulse int64 pulse int64
volumeSizeLimit uint64 volumeSizeLimit uint64
} }
@ -19,7 +22,7 @@ func NewVolumeLayout(repType storage.ReplicationType, volumeSizeLimit uint64, pu
return &VolumeLayout{ return &VolumeLayout{
repType: repType, repType: repType,
vid2location: make(map[storage.VolumeId]*VolumeLocationList), vid2location: make(map[storage.VolumeId]*VolumeLocationList),
writables: *new([]storage.VolumeId),
writables: make(volumeIdList, 0, 4),
pulse: pulse, pulse: pulse,
volumeSizeLimit: volumeSizeLimit, volumeSizeLimit: volumeSizeLimit,
} }
@ -33,12 +36,15 @@ func (vl *VolumeLayout) RegisterVolume(v *storage.VolumeInfo, dn *DataNode) {
if len(vl.vid2location[v.Id].list) == v.RepType.GetCopyCount() { if len(vl.vid2location[v.Id].list) == v.RepType.GetCopyCount() {
if vl.isWritable(v) { if vl.isWritable(v) {
vl.writables = append(vl.writables, v.Id) vl.writables = append(vl.writables, v.Id)
if len(vl.writables) > 1 {
vl.writables.Sort()
}
} }
} }
} }
} }
func (vl *VolumeLayout) isWritable(v *storage.VolumeInfo) bool{
func (vl *VolumeLayout) isWritable(v *storage.VolumeInfo) bool {
return uint64(v.Size) < vl.volumeSizeLimit && v.Version == storage.CurrentVersion return uint64(v.Size) < vl.volumeSizeLimit && v.Version == storage.CurrentVersion
} }
@ -52,7 +58,13 @@ func (vl *VolumeLayout) PickForWrite(count int) (*storage.VolumeId, int, *Volume
fmt.Println("No more writable volumes!") fmt.Println("No more writable volumes!")
return nil, 0, nil, errors.New("No more writable volumes!") return nil, 0, nil, errors.New("No more writable volumes!")
} }
vid := vl.writables[rand.Intn(len_writers)]
var vid storage.VolumeId
if len_writers == 1 {
vid = vl.writables[0]
} else {
// skew for lesser indices
vid = vl.writables[rand.Intn(len_writers+1)%len_writers]
}
locationList := vl.vid2location[vid] locationList := vl.vid2location[vid]
if locationList != nil { if locationList != nil {
return &vid, count, locationList, nil return &vid, count, locationList, nil
@ -82,6 +94,9 @@ func (vl *VolumeLayout) setVolumeWritable(vid storage.VolumeId) bool {
} }
fmt.Println("Volume", vid, "becomes writable") fmt.Println("Volume", vid, "becomes writable")
vl.writables = append(vl.writables, vid) vl.writables = append(vl.writables, vid)
if len(vl.writables) > 1 {
vl.writables.Sort()
}
return true return true
} }
@ -114,3 +129,18 @@ func (vl *VolumeLayout) ToMap() interface{} {
//m["locations"] = vl.vid2location //m["locations"] = vl.vid2location
return m return m
} }
func (vls volumeIdList) Len() int { return len(vls) }
func (vls volumeIdList) Less(i, j int) bool {
return vls[i] < vls[j]
}
func (vls volumeIdList) Swap(i, j int) {
vls[i], vls[j] = vls[j], vls[i]
}
// convienence sorting
func (vls volumeIdList) Sort() {
sort.Sort(vls)
}
Loading…
Cancel
Save