Abstract

The development of Internet of Things (IoT) technology depends on technologies such as high-efficiency storage and high computing power. Mobile cloud computing (MCC) technology will be an important foundation for the development of IoT. The efficient scheduling of tasks in IoT devices in MCC environment is challenging. The requirements for task scheduling in MCC are becoming more and more complex. As the core problem in MCC, task scheduling aims to allocate tasks reasonably, achieve optimal scheduling strategies, and complete tasks effectively. In this paper, efficient delay-aware task scheduling algorithm (EDTSA) is proposed, with the optimization goal of minimizing task running time. The matching of tasks and virtual machines is modeled as a bipartite graph. The problem is divided into multiple subproblems to solve the optimal solution separately. The combined solution is used as the initial solution of the local search algorithm. The efficiency of the local search depends on the quality and nature of the initial solution. We can generate multiple initial solutions according to different division criteria. The initial solution is the combination of the optimal solutions of the subproblems, so the quality of the initial solution has been greatly improved and generating multiple initial solutions according to the division can reduce the probability of falling into the local optimal solution. This algorithm also divides the neighborhood to reduce unnecessary searches. Finally, we verify the efficiency and practicability of the algorithm through experiments.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.