/
taskGenerator.py
76 lines (68 loc) · 2.17 KB
/
taskGenerator.py
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
#!/usr/bin/python
import random
import sys
import argparse
import math
from taskModel import task
from scheduleAnalysis import QPA
# Using uuniFast to generate the task utilization
def uuniFast(totalUtil, taskNumber):
sumU = totalUtil
vectU = [];
for i in range(1, taskNumber):
nextSumU = float(sumU) * (random.random() ** (1 / float(taskNumber - i)))
vectU.append(sumU - nextSumU)
sumU = nextSumU
vectU.append(sumU)
if all(i <= 1 for i in vectU):
return vectU
else:
return uuniFast(taskNumber, totalUtil)
"""
To generate the task period, use the approach given by
Paul Emberson, Roger Stafford, Robert I Davis
"Techniques For The Synthesis Of Multiprocessor Task Sets"
in proceedings 1st International Workshop on Analysis Tools and Methodologies for
Embedded and Real-time Systems (WATERS 2010)
"""
def periodGenerator(Tmin,Tmax,Tg):
"""
Generate period for one task from a range (Tmin, Tmax).
In this generation procedure, log-uniform distribution is used instead
of uniform distribution.
args:
Tmin the minimum period
Tmax the maximum period
Tg the period granularity
Note: Tmin and Tmax must be multiples of Tg
"""
r = random.uniform(math.log(Tmin),math.log(Tmax + Tg))
return math.floor(math.exp(r) / Tg) * Tg
def generateTasks(utilization, taskNum):
"""
Generate synthetic taskset based on utilization and task Num
"""
v = uuniFast(taskNum, utilization)
taskset = []
for i in range(len(v)):
T = periodGenerator(20,200,1)
C = math.floor(T * v[i])
if C == 0:
C = 1
taskset.append(task(i, C, T))
return taskset
def main():
taskset = []
taskset.append(task(1,6000,31000,18000))
taskset.append(task(2,2000,9800,9000))
taskset.append(task(3,1000,17000,12000))
taskset.append(task(4,90,4200,3000))
taskset.append(task(5,8,96,78))
taskset.append(task(6,2,12,16))
taskset.append(task(7,10,280,120))
taskset.append(task(8,26,660,160))
for i in taskset:
print i.print_task()
print QPA(taskset)
if __name__ == "__main__":
main()