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
|
#!/usr/bin/env ruby
require 'optparse'
class Scheduler
def initialize(tasks)
@states = []
@tasks = tasks
end
def printHeader()
print "i".ljust(4, ' ')
@tasks.length.times do |i|
print "T#{i.to_s()}".ljust(4, ' ')
end
@tasks.length.times do |i|
print "R#{i.to_s()}".ljust(4, ' ')
end
@tasks.length.times do |i|
print "D#{i.to_s()}".ljust(4, ' ')
end
puts
end
def printState(index, state)
print index.to_s().ljust(4, ' ')
@tasks.length.times do |i|
print state[:task] == i ? "|" : " "
print " "*3
end
state[:remain].each_with_index do |r, i|
print r.to_s().ljust(4, ' ')
end
@tasks.each do |task|
deadline = task[:deadline] - (index % task[:period])
print deadline.to_s().ljust(4, ' ')
end
puts
end
def nextTask(index)
choices = []
if @states.length.zero?
choices = @tasks.length.times.to_a
else
@states.last[:remain].each_with_index do |r, i|
choices << i if r > 0
end
end
if choices.length.zero?
return nil
elsif choices.length == 1
# If there is only one choice return that
return choices[0]
end
loop do
print "Next #{choices.to_s}:"
input = gets
if input == "\n" and @states.last
return @states.last[:task]
end
choice = Integer(input)
if choices.include?(choice)
return choice
end
end
end
def calcNextState(index)
curtask = nextTask(index)
new = {:task => curtask, :remain => []}
@tasks.each_with_index do |task, i|
# Check if start of new period
if index % task[:period] == 0
if @states.last and @states.last[:remain][i] > 0
puts "Deadline missed in task #{i}"
exit
end
new[:remain] << task[:complete]
else
new[:remain] << @states.last[:remain][i]
end
end
# Decrease the selected task
if curtask
new[:remain][curtask] -= 1 unless new[:remain][curtask].zero?
end
return new
end
def run()
printHeader()
# Run LCM times
lcm = @tasks[0][:period]
@tasks.drop(1).each do |task|
lcm = task[:period].lcm(lcm)
end
(0..lcm).each do |i|
new = calcNextState(i)
@states << new
printState(i, new)
end
end
end
def taskFromString(str)
fields = str.split(",")
if fields.length < 2
raise "#{str} does not contain enough fields"
end
# Run for each field
def parseField(f, default = 0)
return f == nil ? Integer(default) : Integer(f)
end
task = {
:period => parseField(fields[0]),
:complete => parseField(fields[1]),
:deadline => parseField(fields[2], fields[0])
}
return task
end
class RmaSched < Scheduler
def nextTask(index)
smallestTask = nil
@tasks.each_with_index do |task, i|
if @states.last and @states.last[:remain][i] == 0
next
end
smallestTask = i if !smallestTask or task[:period] < @tasks[i][:period]
end
return smallestTask
end
end
options = {}
OptionParser.new do |opts|
opts.on("-f", "--taskfile FILE", "Load tasks from FILE") do |f|
options[:taskfile] = f
end
end.parse!
tasks = []
if options[:taskfile]
File.readlines(options[:taskfile]).each do |line|
tasks << taskFromString(line)
end
else
puts "T : period,completion time[,deadline]"
loop do
print "T#{ tasks.length }: "
input = gets
if !input or input.delete_suffix!("\n") == ""
break
end
tasks << taskFromString(input)
end
end
puts tasks.inspect
sch = RmaSched.new(tasks)
sch.run()
|
