Search

With the increasing of data and the calculation scale in the mobile terminal, this paper proposed TPMM based on the min-min scheduling algorithms to reduce the task processing delay and meet the priority scheduling requirements of the task, it also combined the task priority and deadline constraints. The algorithm calculated the priority of the task according to the processing value and data volume, then formulated the resource matching scheme according to the task deadline and the number of server scheduling times, to solve the problem that the server in the edge network allocated resources for users with different priorities. Simulations show that the algorithm can balance the server utilization, effectively reduce the delay of the calculation process and improve the success rate of the server to complete the task calculation within the task deadline processing time. Comparing with the min-min scheduling algorithm, TPMM algorithm can reduce the delay by 78.45% and increase the calculation success rate by 80%. Comparing with the max-min scheduling algorithm, TPMM algorithm can reduce the delay by 80.15% and improve the calculation success rate by 59.7%. Comparing with HPF scheduling algorithm, TPMM algorithm reduces the delay up to 59.49% and increases the computational success rate by 57.7%. [ABSTRACT FROM AUTHOR]

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)