Research Article
TPD: Temporal and Positional Computation Offloading with Dynamic and Dependent Tasks
Table 4
Time overhead and
of DEFO and CTF algorithms.
| Round | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
| Time overhead of CTF (s) | 0.81 | 1.30 | 1.16 | 1.19 | 1.23 | 1.30 | 1.43 | 1.44 | 1.27 | 1.38 | Time overhead of DEFO (s) | 23.18 | 30.85 | 36.42 | 42.07 | 60.22 | 52.93 | 70.68 | 105.41 | 106.22 | 132.66 | of CTF (s) | 6.22 | 8.07 | 10.71 | 10.79 | 12.01 | 12.50 | 15.18 | 16.76 | 18.47 | 20.60 | of DEFO (s) | 7.32 | 11.05 | 13.56 | 18.45 | 20.86 s | 22.03 | 25.45 | 28.24 | 30.93 | 34.91 |
|
|