forked from NVIDIA/aistore
/
manager_group.go
219 lines (191 loc) · 5.64 KB
/
manager_group.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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
// Package dsort provides distributed massively parallel resharding for very large datasets.
/*
* Copyright (c) 2018-2021, NVIDIA CORPORATION. All rights reserved.
*/
package dsort
import (
"os"
"path"
"regexp"
"sort"
"sync"
"time"
"github.com/artashesbalabekyan/aistore/3rdparty/glog"
"github.com/artashesbalabekyan/aistore/cmn/kvdb"
"github.com/artashesbalabekyan/aistore/hk"
jsoniter "github.com/json-iterator/go"
"github.com/pkg/errors"
)
const (
dsortCollection = "dsort"
managersKey = "managers"
)
var Managers *ManagerGroup
// ManagerGroup abstracts multiple dsort managers into single struct.
type ManagerGroup struct {
mtx sync.Mutex // Synchronizes reading managers field and db access
managers map[string]*Manager
db kvdb.Driver
}
func InitManagers(db kvdb.Driver) {
Managers = NewManagerGroup(db, false)
}
// NewManagerGroup returns new, initialized manager group.
func NewManagerGroup(db kvdb.Driver, skipHk bool) *ManagerGroup {
mg := &ManagerGroup{
managers: make(map[string]*Manager, 1),
db: db,
}
if !skipHk {
hk.Reg(DSortName+hk.NameSuffix, mg.housekeep, hk.DayInterval)
}
return mg
}
// Add new, non-initialized manager with given managerUUID to manager group.
// Returned manager is locked, it's caller responsibility to unlock it.
// Returns error when manager with specified managerUUID already exists.
func (mg *ManagerGroup) Add(managerUUID string) (*Manager, error) {
mg.mtx.Lock()
defer mg.mtx.Unlock()
if _, exists := mg.managers[managerUUID]; exists {
return nil, errors.Errorf("job %q already exists", managerUUID)
}
manager := &Manager{
ManagerUUID: managerUUID,
mg: mg,
}
mg.managers[managerUUID] = manager
manager.lock()
return manager, nil
}
func (mg *ManagerGroup) List(descRegex *regexp.Regexp, onlyActive bool) []JobInfo {
mg.mtx.Lock()
defer mg.mtx.Unlock()
jobsInfos := make([]JobInfo, 0, len(mg.managers))
for _, v := range mg.managers {
if descRegex == nil || descRegex.MatchString(v.Metrics.Description) {
job := v.Metrics.ToJobInfo(v.ManagerUUID)
if onlyActive && job.IsFinished() {
continue
}
jobsInfos = append(jobsInfos, job)
}
}
// Always check persistent db for now
records, err := mg.db.GetAll(dsortCollection, managersKey)
if err != nil {
glog.Error(err)
return jobsInfos
}
for _, r := range records {
var m Manager
if err := jsoniter.Unmarshal([]byte(r), &m); err != nil {
glog.Error(err)
continue
}
if descRegex == nil || descRegex.MatchString(m.Metrics.Description) {
job := m.Metrics.ToJobInfo(m.ManagerUUID)
if onlyActive && job.IsFinished() {
continue
}
jobsInfos = append(jobsInfos, job)
}
}
sort.Slice(jobsInfos, func(i, j int) bool {
return jobsInfos[i].ID < jobsInfos[j].ID
})
return jobsInfos
}
// Get gets manager with given mangerUUID. When manager with given uuid does not
// exist and user requested persisted lookup, it looks for it in persistent
// storage and returns it if found. Returns false if does not exist, true
// otherwise.
func (mg *ManagerGroup) Get(managerUUID string, ap ...bool) (*Manager, bool) {
var allowPersisted bool
mg.mtx.Lock()
defer mg.mtx.Unlock()
if len(ap) > 0 {
allowPersisted = ap[0]
}
manager, exists := mg.managers[managerUUID]
if !exists && allowPersisted {
key := path.Join(managersKey, managerUUID)
if err := mg.db.Get(dsortCollection, key, &manager); err != nil {
if !os.IsNotExist(err) {
glog.Error(err)
}
return nil, false
}
exists = true
}
return manager, exists
}
// Remove the managerUUID from history. Used for reducing clutter. Fails if process hasn't been cleaned up.
func (mg *ManagerGroup) Remove(managerUUID string) error {
mg.mtx.Lock()
defer mg.mtx.Unlock()
if manager, ok := mg.managers[managerUUID]; ok && !manager.Metrics.Archived.Load() {
return errors.Errorf("%s process %s still in progress and cannot be removed", DSortName, managerUUID)
} else if ok {
delete(mg.managers, managerUUID)
}
key := path.Join(managersKey, managerUUID)
_ = mg.db.Delete(dsortCollection, key) // Delete only returns err when record does not exist, which should be ignored
return nil
}
// persist removes manager from manager group (memory) and moves all information
// about it to persistent storage (file). This operation allows for later access
// of old managers (including managers' metrics).
//
// When error occurs during moving manager to persistent storage, manager is not
// removed from memory.
func (mg *ManagerGroup) persist(managerUUID string) {
mg.mtx.Lock()
defer mg.mtx.Unlock()
manager, exists := mg.managers[managerUUID]
if !exists {
return
}
manager.Metrics.Archived.Store(true)
key := path.Join(managersKey, managerUUID)
if err := mg.db.Set(dsortCollection, key, manager); err != nil {
glog.Error(err)
return
}
delete(mg.managers, managerUUID)
}
func (mg *ManagerGroup) AbortAll(err error) {
mg.mtx.Lock()
defer mg.mtx.Unlock()
for _, manager := range mg.managers {
manager.abort(err)
}
}
func (mg *ManagerGroup) housekeep() time.Duration {
const (
retryInterval = time.Hour // retry interval in case error occurred
regularInterval = hk.DayInterval
)
mg.mtx.Lock()
defer mg.mtx.Unlock()
records, err := mg.db.GetAll(dsortCollection, managersKey)
if err != nil {
if kvdb.IsErrNotFound(err) {
return regularInterval
}
glog.Error(err)
return retryInterval
}
for _, r := range records {
var m Manager
if err := jsoniter.Unmarshal([]byte(r), &m); err != nil {
glog.Error(err)
return retryInterval
}
if time.Since(m.Metrics.Extraction.End) > regularInterval {
key := path.Join(managersKey, m.ManagerUUID)
_ = mg.db.Delete(dsortCollection, key)
}
}
return regularInterval
}