Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Edge computing task allocation method based on deep Monte Carlo tree search

An edge computing and task allocation technology, applied in the field of intelligent communication, can solve problems such as inability to handle complex allocation tasks, complex optimization problems, and increased number of mobile devices

Inactive Publication Date: 2019-11-08
UNIV OF ELECTRONICS SCI & TECH OF CHINA
View PDF5 Cites 39 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The first method uses a linear programming algorithm to optimize computing resources and bandwidth resources to increase the maximum throughput of the system and reduce the service response delay to improve the performance of the mobile edge system, but this method cannot adjust the unloading rate of tasks
The second is an optimization method based on Lyapunov, which is an algorithm that dynamically adjusts the unloading rate of computing tasks, which can reduce the time for completing computing tasks. Task
In addition, the number of mobile devices in the 5G Internet of Things scenario has increased significantly, and the computing tasks of mobile user terminals are diverse, and the optimization problem has become complicated. Existing methods are difficult to deal with high-complexity optimization problems.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Edge computing task allocation method based on deep Monte Carlo tree search
  • Edge computing task allocation method based on deep Monte Carlo tree search
  • Edge computing task allocation method based on deep Monte Carlo tree search

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0058] An edge task allocation method based on deep reinforcement learning, the overall allocation method is as follows Figure 4 shown, including the following steps:

[0059] The edge server refreshes the state information of the mobile edge computing system; the state information of the mobile edge computing system includes the computing resource situation of the edge server, the communication resource situation of the wireless communication base station, and the task request information of the mobile device, and the task request information includes each mobile The historical channel gain information of the device terminal and the base station, the data size of the current task to be processed, the number of CPU clock cycles required to complete the current task, and the local CPU clock frequency of the mobile device terminal;

[0060] The edge server transmits the state information of the mobile edge computing system to DNN, MCTS and LSTM; the edge server receives N task ...

Embodiment 2

[0075] Multiple adjacent edge servers can cooperate with each other to complete the computing task of the mobile user terminal, including the following steps:

[0076] The local edge server refreshes the state information of the mobile edge computing system; the state information of the mobile edge computing system includes the computing resource situation of the local edge server, the computing resource situation of the cooperative edge server, the address of the cooperative edge server, the wireless bandwidth resource of the wireless communication base station and The task request information of the mobile device, the task request information includes the historical channel gain information of each mobile device terminal and base station, the data volume of the current task to be processed, the number of CPU clock cycles required to complete the current task, and the mobile device terminal local CPU clock frequency;

[0077] The local edge server transmits the status informa...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses an edge computing task allocation method based on deep Monte Carlo tree search, and aims to support optimization of resource allocation by an edge server. And the edge server takes the state of a mobile edge computing system as input, the edge server resource scheduling module outputs an optimal resource allocation scheme through a deep reinforcement learning algorithm, andthe mobile equipment terminal unloads the task according to the optimal resource allocation scheme and executes the task together with the edge server. The deep reinforcement learning algorithm is completed by mutual cooperation of DNN, MCTS and LSTM, and compared with greedy search and DQN algorithms, the algorithm provided by the invention is greatly improved in the aspects of optimizing service time delay and optimizing service energy consumption of the mobile terminal.

Description

technical field [0001] The invention relates to the field of intelligent communication, in particular to an edge computing task allocation method based on deep Monte Carlo tree search. Background technique [0002] At present, some algorithms have been applied to the optimal allocation of mobile edge computing resources. The first method uses a linear programming algorithm to optimize computing resources and bandwidth resources to increase the maximum throughput of the system and reduce the service response delay to improve the performance of the mobile edge system, but this method cannot adjust the offload rate of tasks. The second is an optimization method based on Lyapunov, which is an algorithm that dynamically adjusts the unloading rate of computing tasks, which can reduce the time for completing computing tasks. Task. Moreover, the linear programming algorithm and Lyapunov algorithm used in these two resource allocation optimization methods are all heuristic learning...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F9/48G06F9/50G06N3/04G06N3/08G06Q10/04
CPCG06F9/4843G06F9/5027G06N3/08G06Q10/047G06N3/045Y02D10/00
Inventor 陈杰男陈思宇李帅王琪
Owner UNIV OF ELECTRONICS SCI & TECH OF CHINA
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products