2022-06-01 16:11:48 +02:00
|
|
|
import numpy as np
|
|
|
|
|
import include.TasksHelper as TH
|
|
|
|
|
|
|
|
|
|
# The tasks is an Array with three columns and n Rows
|
|
|
|
|
# Each Row represents one Task
|
|
|
|
|
# The columns hold the Tasks parameters
|
|
|
|
|
# column 0 is period P,
|
|
|
|
|
# column 1 is deadline D
|
|
|
|
|
# column 2 is WCET C
|
|
|
|
|
# P_i is accessed as: tasks[i][0]
|
|
|
|
|
# D_i is accessed as: tasks[i][1]
|
|
|
|
|
# C_i is accessed as: tasks[i][2]
|
|
|
|
|
# The number of tasks can be accessed as: tasks.shape[0]
|
|
|
|
|
|
2022-06-24 19:13:20 +02:00
|
|
|
|
2022-06-01 16:11:48 +02:00
|
|
|
#The sufficient Test for the Hyperbolic bound
|
|
|
|
|
def test(tasks):
|
2022-06-24 19:13:20 +02:00
|
|
|
""" The Hyperbolic bound is given as Π(U + 1) of all tasks: """
|
|
|
|
|
# compute the hyperbolic bound as product of the U_factor of each task + 1
|
|
|
|
|
hb = 1
|
|
|
|
|
for i in range(len(tasks)): # len(tasks) is 10
|
|
|
|
|
# print("Task #{}: P_i={} = D_i ={}, C_i={}".format(i, tasks[i][0], tasks[i][1], tasks[i][2]))
|
|
|
|
|
hb *= (tasks[i][2] / tasks[i][0]) + 1
|
|
|
|
|
# compare this computed bound to 2.0
|
|
|
|
|
# if greater then no guaranty of schedulability
|
|
|
|
|
# otherwise task set is schedulable
|
|
|
|
|
print("Hyperbolic bound: {}".format(hb))
|
|
|
|
|
return hb <= 2.0
|
