Abstract | ||
---|---|---|
In this paper, we consider sequential task offloading to multiple mobile-edge computing servers to providing ultra-reliable low- latency mobile edge computing. The task consists of a set of sub-tasks, with a general dependency model among sub-tasks. Our objective is to minimize both latency and offloading failure probability by scheduling sub-tasks to servers. We formulate an optimization problem with constraints over binary scheduling decision variables. A genetic algorithm is devised to solve the formulated optimization problems. Simulation results show that the proposed algorithm provides performance close to the optimal solution, which is obtained through exhaustive search. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1109/GCWkshps45667.2019.9024374 | 2019 IEEE Globecom Workshops (GC Wkshps) |
Keywords | DocType | ISSN |
failure probability,binary scheduling decision variables,genetic algorithm,formulated optimization problems,sequential task scheduling,sequential task offloading,mobile-edge computing servers,providing ultra-reliable,latency mobile edge computing,general dependency model | Conference | 2166-0069 |
ISBN | Citations | PageRank |
978-1-7281-0961-9 | 0 | 0.34 |
References | Authors | |
10 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ahmed A. Al-Habob | 1 | 9 | 2.21 |
Octavia A. Dobre | 2 | 2064 | 181.08 |
A. G. Armada | 3 | 69 | 13.61 |