-
Notifications
You must be signed in to change notification settings - Fork 0
/
jobs-scheduler.go
185 lines (161 loc) · 4.34 KB
/
jobs-scheduler.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
package main
import (
"container/list"
"fmt"
)
type Set map[string]struct{}
func (s Set) Add(element string) {
s[element] = struct{}{}
}
func (s Set) Remove(element string) {
delete(s, element)
}
func (s Set) Contains(element string) bool {
_, exists := s[element]
return exists
}
func (s Set) Len() int {
return len(s)
}
// Job represents a job with an ID and a list of dependencies
type Job struct {
ID string
Dependencies Set
}
// JobScheduler handles scheduling and processing of jobs
type JobScheduler struct {
// your data structures
jobs map[string]*Job
jobQueue *list.List
dependents map[string]Set
}
// NewJobScheduler initializes a new JobScheduler
func NewJobScheduler() *JobScheduler {
return &JobScheduler{
jobs: make(map[string]*Job),
jobQueue: list.New(),
dependents: make(map[string]Set),
}
}
// AddJob adds a new job to the scheduler
// Parameters:
// - id: the unique identifier for the job
// - dependencies: a list of job IDs that this job depends on
func (js *JobScheduler) AddJob(id string, dependencies []string) {
depSet := make(Set)
for _, dep := range dependencies {
depSet.Add(dep)
}
job := &Job{ID: id, Dependencies: depSet}
js.jobs[id] = job
js.jobQueue.PushBack(job)
for _, dep := range dependencies {
if js.dependents[dep] == nil {
js.dependents[dep] = make(Set)
}
js.dependents[dep].Add(id)
}
}
// RemoveJob removes a job from the scheduler
// Parameters:
// - id: the unique identifier of the job to remove
func (js *JobScheduler) RemoveJob(id string) {
job, exists := js.jobs[id]
if !exists {
return
}
for e := js.jobQueue.Front(); e != nil; e = e.Next() {
if e.Value.(*Job).ID == id {
js.jobQueue.Remove(e)
break
}
}
delete(js.jobs, id)
for dep := range job.Dependencies {
if dependentSet, ok := js.dependents[dep]; ok {
dependentSet.Remove(id)
// Clean up empty sets
if dependentSet.Len() == 0 {
delete(js.dependents, dep)
}
}
}
delete(js.dependents, id)
}
// AddDependency adds a dependency to a job
// Parameters:
// - jobID: the ID of the job to add a dependency to
// - dependencyID: the ID of the job that is a dependency
func (js *JobScheduler) AddDependency(jobID, dependencyID string) {
job, exists := js.jobs[jobID]
if !exists {
return
}
job.Dependencies.Add(dependencyID)
if js.dependents[dependencyID] == nil {
js.dependents[dependencyID] = make(Set)
}
js.dependents[dependencyID].Add(jobID)
}
// RemoveDependency removes a dependency from a job
// Parameters:
// - jobID: the ID of the job to remove a dependency from
// - dependencyID: the ID of the dependency to remove
func (js *JobScheduler) RemoveDependency(jobID, dependencyID string) {
job, exists := js.jobs[jobID]
if !exists {
return
}
job.Dependencies.Remove(dependencyID)
if js.dependents[dependencyID] != nil {
js.dependents[dependencyID].Remove(jobID)
}
}
// GetNextJob retrieves the next job to be processed based on dependencies
// Returns:
// - *Job: the next job to be processed or nil if no jobs are available
func (js *JobScheduler) GetNextJob() *Job {
for e := js.jobQueue.Front(); e != nil; e = e.Next() {
job := e.Value.(*Job)
if job.Dependencies.Len() == 0 {
js.jobQueue.Remove(e)
return job
}
}
return nil
}
// ProcessJob processes the next job in the queue
func (js *JobScheduler) ProcessJob() {
job := js.GetNextJob()
if job == nil {
fmt.Println("No job to process")
return
}
fmt.Println("Processing job:", job.ID)
delete(js.jobs, job.ID)
// Update dependents and add to readyQueue if needed
for dependentID := range js.dependents[job.ID] {
dependentJob := js.jobs[dependentID]
dependentJob.Dependencies.Remove(job.ID)
}
delete(js.dependents, job.ID)
}
// DisplayJobQueue displays the current job queue
func (js *JobScheduler) DisplayJobQueue() {
fmt.Println("Current job queue:")
for element := js.jobQueue.Front(); element != nil; element = element.Next() {
job := element.Value.(*Job)
fmt.Println("Job ID:", job.ID, "Dependencies:", job.Dependencies.Len())
}
}
// DisplayJobs displays all jobs with their details
func (js *JobScheduler) DisplayJobs() {
fmt.Println("All jobs:")
for id, job := range js.jobs {
dependencies := make([]string, 0, job.Dependencies.Len())
for dep := range job.Dependencies {
dependencies = append(dependencies, dep)
}
fmt.Printf("Job ID: %s, Dependencies: %v\n", id, dependencies)
}
}