Control-Scheduling Codesign Exploiting Trade-Off between Task Periods and Deadlines

Table 1

The required computing times for the three approaches with varying number of tasks.

Number of tasks	Exhaustive	Implicit	Ours
1	0.6835 ms	0.7885 ms	0.69 ms
2	13.684 ms	0.926 ms	0.88 ms
3	1305 ms	6 ms	0.75 ms
4	2 min	72 ms	0.74 ms
5	(3 hours)	986 ms	1.65 ms
6	(12 days)	1100 ms	2.44 ms
7	(1228 days)	(2 min)	16.19 ms
8	(3 years)	(26 min)	121 ms
9	(30577 years)	(5 hours)	609 ms
10	(290635 years)	(2 days)	1121 ms