Efficient Mobile Computation Offloading with Hard Task Deadlines and Concurrent Local Execution

2020 
This paper considers the problem of algorithmic efficiency in mobile computation offloading with Concurrent Local Execution (CLE). Online energy optimal algorithms can be developed when CLE is used to guarantee hard task deadlines while offloading over Markovian wireless channels. Unfortunately, these algorithms often have a high computational complexity, which prohibits their use in online mobile implementations. Three algorithms are introduced to reduce this complexity: Markovian Compression (MC), Time Compression (TC) and Preemption Using Continuous Offloading (Preemption-CO). MC and TC reduce the state space of the offloading Markovian process, by using a novel notion of geometric similarity, or by running an optimal online offloading algorithm in periodic time steps. In Preemption-CO, while a task is offloaded preemptively, the offloading decision at every time-slot is based on non-preemptive calculations. Our simulations show that, by applying these methods, the running times of the algorithms can be significantly reduced without suffering unreasonable performance degradation compared with the optimal energy performance.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    12
    References
    0
    Citations
    NaN
    KQI
    []