CN110879743B - Task eliminating method, device, system and medium based on edge computing environment - Google Patents
Task eliminating method, device, system and medium based on edge computing environment Download PDFInfo
- Publication number
- CN110879743B CN110879743B CN201911144599.5A CN201911144599A CN110879743B CN 110879743 B CN110879743 B CN 110879743B CN 201911144599 A CN201911144599 A CN 201911144599A CN 110879743 B CN110879743 B CN 110879743B
- Authority
- CN
- China
- Prior art keywords
- task
- target
- storage space
- total
- ratio
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/461—Saving or restoring of program or task context
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0629—Configuration or reconfiguration of storage systems
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The invention provides a task eliminating method, equipment, a system and a medium based on an edge computing environment, wherein the method comprises the following steps: acquiring target information of an edge node in an edge computing environment, wherein the target information comprises an idle storage space of the edge node, an occupied space of each task on the edge node and data corresponding to each task; receiving a target storage space configured on the edge node; dividing the data corresponding to each task by the occupied space of each task when the free storage space is smaller than the target storage space, and obtaining the ratio of each task; determining a target task according to the ratio, the occupied space of each task and the target storage space; and eliminating the target task. The invention can not only minimize the loss of task rejection, but also ensure the normal operation of other tasks on the premise of ensuring the normal operation of the operating system on the edge node.
Description
Technical Field
The present invention relates to the field of computer network technologies, and in particular, to a method, an apparatus, a system, and a medium for task rejection based on an edge computing environment.
Background
In an edge computing environment, when the free storage space on a node is fully occupied by computing tasks running on the edge node, the running of the operating system on the edge node and the running of other edge computing tasks will be affected. The current practice is to directly reject the task occupying the largest memory space to release the memory space, however, the loss caused by rejecting the task is not considered in the way.
Disclosure of Invention
The invention mainly aims to provide a task eliminating method, equipment, a system and a medium based on an edge computing environment, so that on the premise of ensuring normal operation of an operating system on an edge node, the loss of task elimination can be minimized, and normal operation of other tasks can be ensured.
In order to achieve the above object, the present invention provides a task rejection method based on an edge computing environment, the method comprising:
acquiring target information of an edge node in an edge computing environment, wherein the target information comprises an idle storage space of the edge node, an occupied space of each task on the edge node and data corresponding to each task;
receiving a target storage space configured on the edge node;
Dividing the data corresponding to each task by the occupied space of each task when the free storage space is smaller than the target storage space, and obtaining the ratio of each task;
determining a target task according to the ratio, the occupied space of each task and the target storage space;
and eliminating the target task.
Preferably, before obtaining the target information of the edge node in the edge computing environment, the method further comprises:
performing Agent deployment on the edge nodes to obtain deployed edge nodes;
creating a request according to preset requirements;
and responding to the request on the deployed edge node to obtain the target information.
Preferably, the determining the target task according to the ratio, the occupied space of each task and the target storage space includes:
when the occupied space of each task is larger than the target storage space, determining the minimum ratio in the ratios;
and determining the task corresponding to the minimum ratio as the target task.
Preferably, the determining the target task according to the ratio, the occupied space of each task and the target storage space further includes:
when the occupied space of each task is smaller than the target storage space, subtracting the target storage space from the free storage space to obtain a storage space difference value of the edge node;
Sequencing the tasks according to the ratio and the order from small to large to obtain a queue;
sequentially adding the tasks in the queue to a first task until the occupied space of the first task is larger than or equal to the storage space difference value;
and determining the first task as the target task.
Preferably, the determining the target task according to the ratio, the occupied space of each task and the target storage space further includes:
when the occupied space of the task in the tasks is larger than the target storage space and the occupied space of the task in the tasks is smaller than the target storage space, determining at least one task with the occupied space smaller than the target storage space as a total task;
summing the occupied space of each task in the total tasks to obtain the total occupied space of the total tasks;
summing the data corresponding to each task in the total tasks to obtain total data corresponding to the total tasks;
determining a total ratio of the total tasks according to the total data and the total occupied space;
determining a task with occupied space larger than or equal to the target storage space as a second task;
Selecting a task with the smallest ratio from the second tasks as a third task;
when the total occupied space is smaller than the target storage space, determining the third task as the target task; or alternatively
And when the total occupied space is larger than or equal to the target storage space, determining a third ratio of the third task, and if the third ratio is smaller than or equal to the total ratio, determining the third task as the target task, or if the third ratio is larger than the total ratio, determining the total task as the target task.
Preferably, after rejecting the target task, the method further comprises:
acquiring a target node with a free storage space larger than a configuration storage space;
and adding the target task to a task process of the target node.
To achieve the above object, the present invention further provides an electronic device including:
a memory storing at least one instruction; a kind of electronic device with high-pressure air-conditioning system
And the processor executes the instructions stored in the memory to realize the task eliminating method based on the edge computing environment.
Preferably, the electronic device is a node constituting a content distribution network or a blockchain network.
To achieve the above object, the present invention further provides a task rejection system based on an edge computing environment, the system comprising:
the system comprises an acquisition unit, a storage unit and a storage unit, wherein the acquisition unit is used for acquiring target information of an edge node in an edge computing environment, and the target information comprises an idle storage space of the edge node, an occupied space of each task on the edge node and data corresponding to each task;
a receiving unit, configured to receive a target storage space configured on the edge node;
the computing unit is used for dividing the data corresponding to each task by the occupied space of each task when the free storage space is smaller than the target storage space to obtain the ratio of each task;
the determining unit is used for determining a target task according to the ratio, the occupied space of each task and the target storage space;
and the deleting unit is used for eliminating the target task.
Preferably, the system further comprises:
the deployment unit is used for performing Agent deployment on the edge nodes before acquiring target information of the edge nodes in the edge computing environment to obtain deployed edge nodes;
the creation unit is used for creating a request according to preset requirements;
And the response unit is used for responding to the request on the deployed edge node to obtain the target information.
Preferably, the determining unit is specifically configured to:
when the occupied space of each task is larger than the target storage space, determining the minimum ratio in the ratios;
and determining the task corresponding to the minimum ratio as the target task.
Preferably, the determining unit is specifically further configured to:
when the occupied space of each task is smaller than the target storage space, subtracting the target storage space from the free storage space to obtain a storage space difference value of the edge node;
sequencing the tasks according to the ratio and the order from small to large to obtain a queue;
sequentially adding the tasks in the queue to a first task until the occupied space of the first task is larger than or equal to the storage space difference value;
and determining the first task as the target task.
Preferably, the determining unit is specifically further configured to:
when the occupied space of the task in the tasks is larger than the target storage space and the occupied space of the task in the tasks is smaller than the target storage space, determining at least one task with the occupied space smaller than the target storage space as a total task;
Summing the occupied space of each task in the total tasks to obtain the total occupied space of the total tasks;
summing the data corresponding to each task in the total tasks to obtain total data corresponding to the total tasks;
determining a total ratio of the total tasks according to the total data and the total occupied space;
determining a task with occupied space larger than or equal to the target storage space as a second task;
selecting a task with the smallest ratio from the second tasks as a third task;
when the total occupied space is smaller than the target storage space, determining the third task as the target task; or alternatively
And when the total occupied space is larger than or equal to the target storage space, determining a third ratio of the third task, and if the third ratio is smaller than or equal to the total ratio, determining the third task as the target task, or if the third ratio is larger than the total ratio, determining the total task as the target task.
Preferably, the obtaining unit is further configured to obtain, after the target task is rejected, a target node with a free storage space larger than a configuration storage space;
The system further comprises:
and the adding unit is used for adding the target task to the task process of the target node.
To achieve the above object, the present invention further provides a computer-readable storage medium having stored thereon an edge computing environment-based task culling program executable by one or more processors to implement the edge computing environment-based task culling method.
In summary, the method and the device not only can minimize the loss of task rejection, but also can ensure the normal operation of other tasks on the premise of ensuring the normal operation of the operating system on the edge node.
Drawings
FIG. 1 is a flow chart of an embodiment of the present invention;
FIG. 2 is a schematic diagram illustrating an internal structure of an electronic device according to an embodiment of the invention;
FIG. 3 is a functional block diagram of a task elimination system based on an edge computing environment according to the invention.
Description of the main reference signs
Detailed Description
The present invention will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims and in the foregoing drawings, if any, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order, and should not be understood to indicate or imply relative importance or imply the number of technical features indicated. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments described herein may be implemented in other sequences than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
In addition, the technical solutions of the embodiments may be combined with each other, but it is necessary to base that the technical solutions can be realized by those skilled in the art, and when the technical solutions are contradictory or cannot be realized, the combination of the technical solutions should be considered to be absent and not within the scope of protection claimed in the present invention.
The invention provides a task eliminating method based on an edge computing environment.
Referring to fig. 1, fig. 1 is a flow chart of an embodiment of the present invention. The order of the steps in the flow diagram may be changed and some steps may be omitted according to different needs.
The task eliminating method based on the edge computing environment is applied to one or more electronic devices, wherein the electronic devices are devices capable of automatically performing numerical calculation and/or information processing according to preset or stored instructions, and the hardware of the electronic devices comprises, but is not limited to, microprocessors, application specific integrated circuits (Application Specific Integrated Circuit, ASICs), programmable gate arrays (Field-Programmable Gate Array, FPGAs), digital processors (Digital Signal Processor, DSPs), embedded devices and the like.
The electronic device may be any electronic product that can interact with a user in a human-computer manner, such as a personal computer, tablet computer, smart phone, personal digital assistant (Personal Digital Assistant, PDA), game console, interactive internet protocol television (Internet Protocol Television, IPTV), smart wearable device, etc.
The electronic device may also include a network device and/or a user device. Wherein the network device includes, but is not limited to, a single network electronic device, a group of electronic devices made up of multiple network electronic devices, or a Cloud based Cloud Computing (Cloud Computing) made up of a large number of hosts or network electronic devices.
The network in which the electronic device is located includes, but is not limited to, the internet, a wide area network, a metropolitan area network, a local area network, a virtual private network (Virtual Private Network, VPN), and the like.
In one embodiment, the method comprises:
s10, acquiring target information of an edge node in an edge computing environment, wherein the target information comprises an idle storage space of the edge node, an occupied space of each task on the edge node and data corresponding to each task.
In at least one embodiment of the invention, the edge node may be a server. Further, the data corresponding to each task characterizes the revenue of each task on the edge node.
In at least one embodiment of the present invention, before obtaining the target information of the edge node in the edge computing environment, the method further comprises:
the electronic equipment performs Agent deployment on the edge nodes to obtain deployed edge nodes, and further, the electronic equipment creates a request according to preset requirements, and responds to the request on the deployed edge nodes to obtain the target information.
Wherein the preset requirements include, but are not limited to: the method comprises the steps of storing free storage space of the edge node, all tasks on the edge node, occupied space of each task on the edge node and corresponding data of each task on the edge node.
By the implementation mode, the required target information can be acquired quickly.
In at least one embodiment of the present invention, the electronic device creates a request at preset time intervals, and responds to the request at the edge node to obtain the target information.
The value of the preset time interval can be configured in a self-defined manner, and the invention is not limited.
By the implementation mode, the method and the device are beneficial to periodically updating the target information on the edge node so that the acquired target information is up-to-date, and the electronic equipment is prevented from processing tasks on the edge node according to the outdated target information.
S11, receiving a target storage space configured on the edge node.
In at least one embodiment of the present invention, the target storage space refers to a storage space capable of maintaining normal operation of an operating system on the edge node, and further, the target storage space may be configured according to an actual requirement of the edge node, for example, the target storage space may be 100M, which is not limited by the present invention.
And by receiving the target storage space, whether the edge node needs to reject the task or not is facilitated to be judged.
And S12, dividing the data corresponding to each task by the occupied space of each task when the free storage space is smaller than the target storage space, and obtaining the ratio of each task.
In at least one embodiment of the invention, the ratio characterizes the revenue of a task in a unit of storage space.
When the free storage space is smaller than the target storage space, the electronic equipment provides a data basis for determining the target task by determining the ratio of each task on the edge node, so as to provide a condition for ensuring that an operating system on the edge node can normally operate.
In other embodiments, when the free storage space is greater than the target storage space, the operating system on the edge node can operate normally, so that the electronic device does not need to guarantee normal operation of the operating system by eliminating tasks.
S13, determining a target task according to the ratio, the occupied space of each task and the target storage space.
In at least one embodiment of the present invention, the determining, by the electronic device, a target task according to the ratio, the occupied space of each task, and the target storage space includes:
When the occupied space of each task is larger than the target storage space, the electronic equipment determines the minimum ratio of the ratios, and further, the electronic equipment determines the task corresponding to the minimum ratio as the target task.
For example: the target storage space on the edge node is 100M, the tasks on the edge node comprise a task A, a task B and a task C, the occupied space of the task A is 120M, the ratio is 0.7, the occupied space of the task B is 150M, the ratio is 0.8, the occupied space of the task C is 200M, the ratio is 0.6, the minimum ratio is determined to be 0.6 by the electronic equipment, and the task C corresponding to the ratio of 0.6 is determined to be the target task by the electronic equipment.
When the occupied space of each task is larger than the target storage space, the task with the smallest ratio is determined to be the target task, so that the loss of task rejection can be minimized under the condition of ensuring the normal operation of the operating system.
In at least one embodiment of the present invention, the determining, by the electronic device, a target task according to the ratio, the occupied space of each task, and the target storage space further includes:
when the occupied space of each task is smaller than the target storage space, the electronic equipment performs subtraction operation on the target storage space and the idle storage space to obtain a storage space difference value of the edge node, further, the electronic equipment orders the tasks according to the ratio according to the order from small to large to obtain a queue, and sequentially adds the tasks in the queue into a first task until the occupied space of the first task is larger than or equal to the storage space difference value, and the first task is determined to be the target task.
For example: the target storage space on the edge node is 100M, the free storage space on the edge node is 50M, the tasks on the edge node are task D, task E and task F, the occupation space of task D is 80M, the ratio is 0.7, the occupation space of task E is 70M, the ratio is 0.8 and the occupation space of task F is 40M, the ratio is 0.6, the electronic device performs subtraction operation on the target storage space 100M and the free storage space 50M to obtain a storage space difference value of 50M of the edge node, the electronic device sorts all the tasks according to the size of the ratio from small to large to obtain queues of task F, task D and task E, further, the task F is added to a first task, the occupation space of the first task is the occupation space 40M of task F, the occupation space 40M of the first task is smaller than the storage space difference value 50M, the electronic device continues to add the target storage space 100M and the free storage space 50M to the first task F, and the first task F is further comprises the occupation space of the first task F and the first task F, and the occupation space of the first task F is 120 (the first task F is the occupation space of the first task F and the first task is the task F is the occupied space of the first task F and the task is the task F is the large); the task F and the task D) are determined to be the target task.
When the occupied space of each task is smaller than the target storage space, tasks corresponding to the minimum ratio in the ratios are added to the first task in sequence, so that the loss of task rejection can be minimized under the condition of ensuring normal operation of the operating system.
In at least one embodiment of the present invention, the determining, by the electronic device, a target task according to the ratio, the occupied space of each task, and the target storage space further includes:
when the occupied space of the task in the tasks is larger than the target storage space and the occupied space of the task in the tasks is smaller than the target storage space, the electronic device determines at least one task with the occupied space smaller than the target storage space in the tasks as a total task, further, the electronic device performs summation operation on the occupied space of each task in the total tasks to obtain the total occupied space of the total tasks, performs summation operation on data corresponding to each task in the total tasks to obtain total data corresponding to the total tasks, determines the total ratio of the total tasks according to the total data and the total occupied space, further, determines the task with the occupied space larger than or equal to the target storage space as a second task, further, the electronic device selects the task with the smallest ratio from the second task as a third task, and when the total occupied space is smaller than the target storage space, the electronic device determines the third task as the target task, or when the total occupied space is larger than or equal to the target storage space, determines the electronic device as the third task, and further determines the electronic device with the ratio larger than or equal to the third task.
Specifically, the determining, by the electronic device, the total ratio of the total tasks according to the total data and the total occupied space includes:
the electronic device divides the total data by the total occupied space to obtain a total ratio of the total tasks.
S14, eliminating the target task.
In at least one embodiment of the present invention, before rejecting the target task, the method further comprises:
the electronic equipment generates prompt information according to the target task, further encrypts the prompt information to obtain a target ciphertext, further transmits the target ciphertext to terminal equipment of a designated contact person, and displays the prompt information when the target ciphertext is detected to be successfully decrypted.
Wherein, the prompt information may include, but is not limited to: the target task, the ratio corresponding to the target task, the data corresponding to the target task, the occupied space of the target task, the expected completion time of the target task and the like.
Further, the designated contact refers to a principal responsible person of the edge computing environment.
And in addition, the prompt information can be prevented from being tampered by encrypting the prompt information.
In at least one embodiment of the present invention, after rejecting the target task, the method further comprises:
the electronic equipment acquires a target node with the free storage space larger than the configuration storage space, and further, the electronic equipment adds the target task into a task process of the target node.
The configuration storage space may be configured according to a storage space required by the normal operation of the operating system on the target node, which is not limited by the present invention.
In addition, after the target task is removed, the idle storage space of the edge node is larger than the target storage space, so that other tasks on the edge node are not affected, and further, other tasks can normally run.
In summary, the method and the system can acquire the target information of the edge node in the edge computing environment, wherein the target information comprises the free storage space of the edge node, the occupied space of each task on the edge node and the data corresponding to each task, a data basis is provided for judging whether to reject the task on the edge node, the target storage space configured on the edge node is received, when the free storage space is smaller than the target storage space, the data corresponding to each task is divided by the occupied space of each task to obtain the ratio of each task, a data basis is provided for determining the target task, and the target task is rejected according to the ratio, the occupied space of each task and the target storage space, so that the loss of task rejection can be minimized and the normal operation of other tasks can be ensured on the premise of ensuring the normal operation of an operating system on the edge node.
Referring to fig. 2, fig. 2 is a schematic diagram illustrating an internal structure of an electronic device according to an embodiment of the invention.
The electronic device 1 may be a node constituting a content distribution network or a blockchain network.
The electronic device 1 may comprise a memory 12, a processor 13 and a bus, and may further comprise a computer program stored in the memory 12 and executable on the processor 13, such as a task culling program based on an edge computing environment.
It will be appreciated by those skilled in the art that the schematic diagram is merely an example of the electronic device 1 and does not constitute a limitation of the electronic device 1, and may comprise more or less components than illustrated, or may combine certain components, or different components, e.g. the electronic device 1 may further comprise input-output devices, network access devices, etc.
It should be noted that the electronic device 1 is only used as an example, and other electronic products that may be present in the present invention or may be present in the future are also included in the scope of the present invention by way of reference.
The memory 12 includes at least one type of readable storage medium including flash memory, a removable hard disk, a multimedia card, a card memory (e.g., SD or DX memory, etc.), magnetic memory, magnetic disk, optical disk, etc. The memory 12 may in some embodiments be an internal storage unit of the electronic device 1, such as a mobile hard disk of the electronic device 1. The memory 12 may in other embodiments also be an external storage device of the electronic device 1, such as a plug-in mobile hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card) or the like, which are provided on the electronic device 1. Further, the memory 12 may also include both an internal storage unit and an external storage device of the electronic device 1. The memory 12 may be used not only for storing application software installed in the electronic device 1 and various types of data, such as codes of task culling programs based on an edge computing environment, but also for temporarily storing data that has been output or is to be output.
The processor 13 may be comprised of integrated circuits in some embodiments, for example, a single packaged integrated circuit, or may be comprised of multiple integrated circuits packaged with the same or different functions, including one or more central processing units (Central Processing unit, CPU), microprocessors, digital processing chips, graphics processors, a combination of various control chips, and the like. The processor 13 is a Control Unit (Control Unit) of the electronic device 1, connects the respective components of the entire electronic device 1 using various interfaces and lines, and executes various functions of the electronic device 1 and processes data by running or executing programs or modules (for example, executing a data storage program or the like) stored in the memory 12, and calling data stored in the memory 12.
The processor 13 executes the operating system of the electronic device 1 and various types of applications installed. The processor 13 executes the application program to implement the steps in the respective data storage method embodiments described above, such as steps S10, S11, S12, S13, S14 shown in fig. 1.
Alternatively, the processor 13 may implement the functions of the modules/units in the above-described device embodiments when executing the computer program, for example: acquiring target information of an edge node in an edge computing environment, wherein the target information comprises an idle storage space of the edge node, an occupied space of each task on the edge node and data corresponding to each task; receiving a target storage space configured on the edge node; dividing the data corresponding to each task by the occupied space of each task when the free storage space is smaller than the target storage space, and obtaining the ratio of each task; determining a target task according to the ratio, the occupied space of each task and the target storage space; and eliminating the target task.
Illustratively, the computer program may be partitioned into one or more modules/units that are stored in the memory 12 and executed by the processor 13 to complete the present invention. The one or more modules/units may be a series of instruction segments of a computer program capable of performing a specific function for describing the execution of the computer program in the electronic device 1. For example, the computer program may be divided into an acquisition unit 110, a reception unit 111, an operation unit 112, a determination unit 113, a deletion unit 114, a deployment unit 115, a creation unit 116, a response unit 117, an addition unit 118, a generation unit 119, an encryption unit 120, a transmission unit 121, and a display unit 122.
The bus may be a peripheral component interconnect standard (peripheral component interconnect, PCI) bus or an extended industry standard architecture (extended industry standard architecture, EISA) bus, among others. The bus may be classified as an address bus, a data bus, a control bus, etc. For ease of illustration, only one arrow is shown in FIG. 2, but not only one bus or type of bus. The bus is arranged to enable a connection communication between the memory 12 and the at least one processor 13 etc.
Although not shown, the electronic device 1 may further comprise a power source (such as a battery) for powering the various components, which may preferably be logically connected to the at least one processor 13 by power management means, so as to perform functions of managing charging, discharging, and power consumption management by the power management means. The power supply may also include one or more of any of a direct current or alternating current power supply, recharging device, power failure detection circuit, power converter or inverter, power status indicator, etc. The electronic device 1 may further include various sensors, bluetooth modules, wi-Fi modules, etc., which will not be described herein.
Further, the electronic device may also comprise a network interface, which may optionally comprise a wired interface and/or a wireless interface (e.g. WI-FI interface, bluetooth interface, etc.), typically used for establishing a communication connection between the electronic device 1 and other electronic devices.
Optionally, the electronic device 1 may further comprise a user interface, which may comprise a Display (Display), an input unit such as a Keyboard (Keyboard), and a standard wired interface, a wireless interface. Alternatively, in some embodiments, the display may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode) touch, or the like. The display may also be referred to as a display screen or display unit, as appropriate, for displaying information processed in the electronic device 1 and for displaying a visual user interface.
It should be understood that the embodiments described are for illustrative purposes only and are not limited to this configuration in the scope of the patent application.
The integrated units implemented in the form of software functional modules described above may be stored in a computer readable storage medium. The software functional modules described above are stored in a storage medium and include instructions for causing a computer device (which may be a personal computer, a computer device, or a network device, etc.) or processor (processor) to perform portions of the methods described in the various embodiments of the invention.
The integrated modules/units of the electronic device 1 may be stored in a computer readable storage medium if implemented in the form of software functional units and sold or used as separate products. Based on such understanding, the present invention may implement all or part of the flow of the method of the above embodiment, or may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, and when the computer program is executed by a processor, the computer program may implement the steps of each of the method embodiments described above.
Wherein the computer program comprises computer program code which may be in source code form, object code form, executable file or some intermediate form etc. The computer readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM).
Fig. 2 shows only the electronic device 1 with components 12-13, and a workflow visualization configuration program, it will be appreciated by those skilled in the art that the structure shown in fig. 2 is not limiting of the electronic device 1, and may include fewer or more components than shown, or may combine certain components, or a different arrangement of components.
In connection with fig. 1, the memory 12 in the electronic device 1 stores a plurality of instructions to implement a workflow visualization configuration method, the processor 13 being executable to implement: acquiring target information of an edge node in an edge computing environment, wherein the target information comprises an idle storage space of the edge node, an occupied space of each task on the edge node and data corresponding to each task; receiving a target storage space configured on the edge node; dividing the data corresponding to each task by the occupied space of each task when the free storage space is smaller than the target storage space, and obtaining the ratio of each task; determining a target task according to the ratio, the occupied space of each task and the target storage space; and eliminating the target task.
Specifically, the specific implementation method of the above instructions by the processor 13 may refer to the description of the relevant steps in the corresponding embodiment of fig. 1, which is not repeated herein.
Referring to fig. 3, a functional block diagram of a task eliminating system based on an edge computing environment according to the present invention is shown. The task eliminating system 11 based on the edge computing environment includes an acquisition unit 110, a receiving unit 111, an operation unit 112, a determination unit 113, a deletion unit 114, a deployment unit 115, a creation unit 116, a response unit 117, an addition unit 118, a generation unit 119, an encryption unit 120, a transmission unit 121, and a display unit 122. The module/unit referred to in the present invention refers to a series of computer program segments capable of being executed by the processor 13 and of performing a fixed function, which are stored in the memory 12. In the present embodiment, the functions of the respective modules/units will be described in detail in the following embodiments.
The obtaining unit 110 obtains target information of an edge node in an edge computing environment, where the target information includes an idle storage space of the edge node, an occupied space of each task on the edge node, and data corresponding to each task.
In at least one embodiment of the invention, the edge node may be a server. Further, the data corresponding to each task characterizes the revenue of each task on the edge node.
In at least one embodiment of the present invention, before obtaining the target information of the edge node in the edge computing environment, the method further comprises:
the deployment unit 115 performs Agent deployment on the edge node to obtain a deployed edge node, and further, the creation unit 116 creates a request according to a preset requirement, and the response unit 117 responds to the request on the deployed edge node to obtain the target information.
Wherein the preset requirements include, but are not limited to: the method comprises the steps of storing free storage space of the edge node, all tasks on the edge node, occupied space of each task on the edge node and corresponding data of each task on the edge node.
By the implementation mode, the required target information can be acquired quickly.
In at least one embodiment of the present invention, the creating unit 116 creates a request at every preset time interval, and the responding unit 117 responds to the request at the edge node, thereby acquiring the target information.
The value of the preset time interval can be configured in a self-defined manner, and the invention is not limited.
By the implementation mode, the method is beneficial to periodically updating the target information on the edge node so that the acquired target information is up-to-date, and tasks on the edge node are avoided being processed according to the outdated target information.
The receiving unit 111 receives a target storage space configured on the edge node.
In at least one embodiment of the present invention, the target storage space refers to a storage space capable of maintaining normal operation of an operating system on the edge node, and further, the target storage space may be configured according to an actual requirement of the edge node, for example, the target storage space may be 100M, which is not limited by the present invention.
And by receiving the target storage space, whether the edge node needs to reject the task or not is facilitated to be judged.
When the free storage space is smaller than the target storage space, the operation unit 112 divides the data corresponding to each task by the occupied space of each task to obtain the ratio of each task.
In at least one embodiment of the invention, the ratio characterizes the revenue of a task in a unit of storage space.
And when the free storage space is smaller than the target storage space, a data base is provided for determining the target task by determining the ratio of each task on the edge node, so that conditions are provided for ensuring that an operating system on the edge node can normally run.
In other embodiments, when the free storage space is larger than the target storage space, the operating system on the edge node can operate normally, so that the normal operation of the operating system is not required to be ensured by eliminating tasks.
The determining unit 113 determines a target task based on the ratio, the occupied space of each task, and the target storage space.
In at least one embodiment of the present invention, the determining unit 113 determines a target task according to the ratio, the occupied space of each task, and the target storage space, including:
when the occupied space of each task is larger than the target storage space, the determining unit 113 determines a minimum ratio of the ratios, and further, the determining unit 113 determines a task corresponding to the minimum ratio as the target task.
For example: the target storage space on the edge node is 100M, the tasks on the edge node comprise a task a, a task B and a task C, the occupied space of the task a is 120M, the ratio is 0.7, the occupied space of the task B is 150M, the ratio is 0.8, the occupied space of the task C is 200M, the ratio is 0.6, the minimum ratio is determined to be 0.6 by the determining unit 113, and the task C corresponding to the ratio of 0.6 is determined to be the target task by the determining unit 113.
When the occupied space of each task is larger than the target storage space, the task with the smallest ratio is determined to be the target task, so that the loss of task rejection can be minimized under the condition of ensuring the normal operation of the operating system.
In at least one embodiment of the present invention, the determining unit 113 determines a target task according to the ratio, the occupied space of each task, and the target storage space further includes:
when the occupied space of each task is smaller than the target storage space, the determining unit 113 performs subtraction operation on the target storage space and the idle storage space to obtain a storage space difference value of the edge node, further, the determining unit 113 orders the tasks according to the ratio from small to large to obtain a queue, and sequentially adds the tasks in the queue to a first task until the occupied space of the first task is larger than or equal to the storage space difference value, and the determining unit 113 determines the first task as the target task.
For example: the target storage space on the edge node is 100M, the free storage space on the edge node is 50M, the tasks on the edge node are task D, task E and task F, the occupied space of task D is 80M, the ratio is 0.7, the occupied space of task E is 70M, the ratio is 0.8 and the occupied space of task F is 40M, the ratio is 0.6, the determining unit 113 performs subtraction operation on the target storage space 100M and the free storage space 50M to obtain a storage space difference value of 50M of the edge node, the determining unit 113 sorts all the tasks according to the ratio from small to large, the queues are the task F, the task D and the task E, further, the task F is added to a first task, the occupied space of the first task is the occupied space 40M of the task F, the occupied space 40M of the first task is smaller than the storage space difference value 50M, the tasks are added to the first task F, the occupied space of the first task F is further determined to be the occupied space of the first task F, the task F is further the occupied space of the first task F, and the task F is further determined to be the occupied space of the task F is 120.
When the occupied space of each task is smaller than the target storage space, tasks corresponding to the minimum ratio in the ratios are added to the first task in sequence, so that the loss of task rejection can be minimized under the condition of ensuring normal operation of the operating system.
In at least one embodiment of the present invention, the determining unit 113 determines a target task according to the ratio, the occupied space of each task, and the target storage space further includes:
when the occupied space of the task in the task is larger than the target storage space and the occupied space of the task in the task is smaller than the target storage space, the determining unit 113 determines at least one task with the occupied space smaller than the target storage space in the task as a total task, further, the determining unit 113 performs summation operation on the occupied space of each task in the total task to obtain the total occupied space of the total task, performs summation operation on data corresponding to each task in the total task to obtain total data corresponding to the total task, determines a total ratio of the total task according to the total data and the total occupied space, further, the determining unit 113 determines the task with the occupied space larger than or equal to the target storage space as a second task, further, the determining unit 113 selects a task with the smallest ratio from the second task as a third task, when the total occupied space is smaller than the target storage space, the determining unit 113 determines the third task as the target task, or determines the total ratio as the third task, and when the total occupied space is larger than or equal to the third task, the determining unit determines the ratio is larger than or equal to the third task, and the determining the ratio is greater than or equal to the third task is determined as the third task.
Specifically, the determining unit 113 determines, according to the total data and the total occupied space, a total ratio of the total tasks, including:
the determining unit 113 divides the total data by the total occupied space to obtain a total ratio of the total tasks.
The deletion unit 114 rejects the target task.
In at least one embodiment of the present invention, before rejecting the target task, the method further comprises:
the generating unit 119 generates prompt information according to the target task, further, the encrypting unit 120 encrypts the prompt information to obtain a target ciphertext, further, the transmitting unit 121 transmits the target ciphertext to the terminal device of the designated contact person, and when the target ciphertext is detected to be successfully decrypted, the displaying unit 122 displays the prompt information.
Wherein, the prompt information may include, but is not limited to: the target task, the ratio corresponding to the target task, the data corresponding to the target task, the occupied space of the target task, the expected completion time of the target task and the like.
Further, the designated contact refers to a principal responsible person of the edge computing environment.
And in addition, the prompt information can be prevented from being tampered by encrypting the prompt information.
In at least one embodiment of the present invention, after rejecting the target task, the method further comprises:
the acquiring unit 110 acquires a target node with a free storage space larger than a configuration storage space, and further, the adding unit 118 adds the target task to a task process of the target node.
The configuration storage space may be configured according to a storage space required by the normal operation of the operating system on the target node, which is not limited by the present invention.
In addition, after the target task is removed, the idle storage space of the edge node is larger than the target storage space, so that other tasks on the edge node are not affected, and further, other tasks can normally run.
In summary, the method and the system can acquire the target information of the edge node in the edge computing environment, wherein the target information comprises the free storage space of the edge node, the occupied space of each task on the edge node and the data corresponding to each task, a data basis is provided for judging whether to reject the task on the edge node, the target storage space configured on the edge node is received, when the free storage space is smaller than the target storage space, the data corresponding to each task is divided by the occupied space of each task to obtain the ratio of each task, a data basis is provided for determining the target task, and the target task is rejected according to the ratio, the occupied space of each task and the target storage space, so that the loss of task rejection can be minimized and the normal operation of other tasks can be ensured on the premise of ensuring the normal operation of an operating system on the edge node.
In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product.
The computer program product includes one or more computer instructions. When loaded and executed on a computer, produces a flow or function in accordance with embodiments of the present invention, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from one website, computer, electronic device, or data center to another website, computer, electronic device, or data center by a wired (e.g., coaxial cable, fiber optic, digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer readable storage medium may be any available medium that can be stored by a computer or a data storage device such as an electronic device, a data center, or the like that contains an integration of one or more available media. The usable medium may be a magnetic medium (e.g., floppy Disk, removable hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid State Disk (SSD)), etc.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, which are not repeated herein.
In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods may be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or all or part of the technical solution, in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, an electronic device, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a usb disk, a removable hard disk, a Read-Only Memory (ROM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
It should be noted that, the foregoing reference numerals of the embodiments of the present invention are merely for describing the embodiments, and do not represent the advantages and disadvantages of the embodiments. And the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, apparatus, article, or method that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, apparatus, article, or method. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, apparatus, article or method that comprises the element.
The foregoing description is only of the preferred embodiments of the present invention, and is not intended to limit the scope of the invention, but rather is intended to cover any equivalents of the structures or equivalent processes disclosed herein or in the alternative, which may be employed directly or indirectly in other related arts.
Claims (9)
1. A method for task culling based on an edge computing environment, the method comprising:
Acquiring target information of an edge node in an edge computing environment, wherein the target information comprises an idle storage space of the edge node, an occupied space of each task on the edge node and data corresponding to each task;
receiving a target storage space configured on the edge node;
dividing the data corresponding to each task by the occupied space of each task when the free storage space is smaller than the target storage space, and obtaining the ratio of each task;
determining a target task according to the ratio, the occupied space of each task and the target storage space, wherein the method comprises the following steps: when the occupied space of the task in the tasks is larger than the target storage space and the occupied space of the task in the tasks is smaller than the target storage space, determining at least one task with the occupied space smaller than the target storage space as a total task; summing the occupied space of each task in the total tasks to obtain the total occupied space of the total tasks; summing the data corresponding to each task in the total tasks to obtain total data corresponding to the total tasks; determining a total ratio of the total tasks according to the total data and the total occupied space; determining a task with occupied space larger than or equal to the target storage space as a second task; selecting a task with the smallest ratio from the second tasks as a third task; when the total occupied space is smaller than the target storage space, determining the third task as the target task; or when the total occupied space is greater than or equal to the target storage space, determining a third ratio of the third task, if the third ratio is less than or equal to the total ratio, determining the third task as the target task, or if the third ratio is greater than the total ratio, determining the total task as the target task;
And eliminating the target task.
2. The edge computing environment-based task culling method of claim 1, wherein before obtaining target information of edge nodes in an edge computing environment, the method further comprises:
performing Agent deployment on the edge nodes to obtain deployed edge nodes;
creating a request according to preset requirements;
and responding to the request on the deployed edge node to obtain the target information.
3. The edge computing environment-based task culling method of claim 1, wherein the determining a target task based on the ratio, the occupied space of each task, and the target storage space comprises:
when the occupied space of each task is larger than the target storage space, determining the minimum ratio in the ratios;
and determining the task corresponding to the minimum ratio as the target task.
4. The edge computing environment-based task culling method of claim 1, wherein the determining a target task according to the ratio, the occupied space of each task, and the target storage space further comprises:
when the occupied space of each task is smaller than the target storage space, subtracting the target storage space from the free storage space to obtain a storage space difference value of the edge node;
Sequencing the tasks according to the ratio and the order from small to large to obtain a queue;
sequentially adding the tasks in the queue to a first task until the occupied space of the first task is larger than or equal to the storage space difference value;
and determining the first task as the target task.
5. A method of task culling based on an edge computing environment as defined in claim 1, wherein after culling the target task, the method further comprises:
acquiring a target node with a free storage space larger than a configuration storage space;
and adding the target task to a task process of the target node.
6. An electronic device, the electronic device comprising:
a memory storing at least one instruction; a kind of electronic device with high-pressure air-conditioning system
A processor executing instructions stored in the memory to implement the edge computing environment based task culling method of any one of claims 1 to 5.
7. The electronic device of claim 6, wherein the electronic device is a node comprising a content distribution network or a blockchain network.
8. A task culling system based on an edge computing environment, the system comprising:
The system comprises an acquisition unit, a storage unit and a storage unit, wherein the acquisition unit is used for acquiring target information of an edge node in an edge computing environment, and the target information comprises an idle storage space of the edge node, an occupied space of each task on the edge node and data corresponding to each task;
a receiving unit, configured to receive a target storage space configured on the edge node;
the computing unit is used for dividing the data corresponding to each task by the occupied space of each task when the free storage space is smaller than the target storage space to obtain the ratio of each task;
the determining unit is configured to determine a target task according to the ratio, the occupied space of each task, and the target storage space, and includes: when the occupied space of the task in the tasks is larger than the target storage space and the occupied space of the task in the tasks is smaller than the target storage space, determining at least one task with the occupied space smaller than the target storage space as a total task; summing the occupied space of each task in the total tasks to obtain the total occupied space of the total tasks; summing the data corresponding to each task in the total tasks to obtain total data corresponding to the total tasks; determining a total ratio of the total tasks according to the total data and the total occupied space; determining a task with occupied space larger than or equal to the target storage space as a second task; selecting a task with the smallest ratio from the second tasks as a third task; when the total occupied space is smaller than the target storage space, determining the third task as the target task; or when the total occupied space is greater than or equal to the target storage space, determining a third ratio of the third task, if the third ratio is less than or equal to the total ratio, determining the third task as the target task, or if the third ratio is greater than the total ratio, determining the total task as the target task;
And the deleting unit is used for eliminating the target task.
9. A computer-readable storage medium having stored thereon an edge computing environment-based task culling program executable by one or more processors to implement the edge computing environment-based task culling method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911144599.5A CN110879743B (en) | 2019-11-20 | 2019-11-20 | Task eliminating method, device, system and medium based on edge computing environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911144599.5A CN110879743B (en) | 2019-11-20 | 2019-11-20 | Task eliminating method, device, system and medium based on edge computing environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110879743A CN110879743A (en) | 2020-03-13 |
| CN110879743B true CN110879743B (en) | 2023-07-18 |
Family
ID=69729861
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911144599.5A Active CN110879743B (en) | 2019-11-20 | 2019-11-20 | Task eliminating method, device, system and medium based on edge computing environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110879743B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010108368A1 (en) * | 2009-03-25 | 2010-09-30 | 中兴通讯股份有限公司 | Distributed file system of supporting data block dispatching and file processing method thereof |
| WO2016204790A1 (en) * | 2015-06-19 | 2016-12-22 | Hitachi Data Systems Engineering UK Limited | Deleting a directory tree using limited system resources |
| CN109815007A (en) * | 2018-12-15 | 2019-05-28 | 平安科技（深圳）有限公司 | Thread control method, device, electronic equipment and storage medium based on cloud monitoring |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103716383B (en) * | 2013-12-13 | 2017-12-15 | 华为技术有限公司 | A kind of method and device for accessing shared resource |
| US10176182B2 (en) * | 2015-08-31 | 2019-01-08 | International Business Machines Corporation | File deletion in storage devices based on the deletion priority rules |
| CN105677240B (en) * | 2015-12-30 | 2019-04-23 | 上海联影医疗科技有限公司 | Data-erasure method and system |
| CN109582236B (en) * | 2018-11-29 | 2023-08-25 | 努比亚技术有限公司 | Terminal storage space management method, terminal and storage medium |
-
2019
- 2019-11-20 CN CN201911144599.5A patent/CN110879743B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010108368A1 (en) * | 2009-03-25 | 2010-09-30 | 中兴通讯股份有限公司 | Distributed file system of supporting data block dispatching and file processing method thereof |
| WO2016204790A1 (en) * | 2015-06-19 | 2016-12-22 | Hitachi Data Systems Engineering UK Limited | Deleting a directory tree using limited system resources |
| CN109815007A (en) * | 2018-12-15 | 2019-05-28 | 平安科技（深圳）有限公司 | Thread control method, device, electronic equipment and storage medium based on cloud monitoring |
Non-Patent Citations (1)
| Title |
|---|
| 面向网络功能虚拟化的高性能负载均衡机制;王煜炜;刘敏;马诚;李鹏飞;;计算机研究与发展(04);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110879743A (en) | 2020-03-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105592123B (en) | Storage management system, management device and method | |
| CN111694843B (en) | Missing number detection method and device, electronic equipment and storage medium | |
| CN110647409B (en) | Message writing method, electronic device, system and medium | |
| CN111582815A (en) | Engineering management method and device for nuclear power station, terminal equipment and storage medium | |
| CN103959252A (en) | Host computing device control component status display | |
| CN111400126A (en) | Network service abnormal data detection method, device, equipment and medium | |
| CN113506045A (en) | Risk user identification method, device, equipment and medium based on mobile equipment | |
| CN113911872B (en) | Fault processing method and system and early warning rescue system | |
| CN110688073B (en) | Data storage method, electronic device, system and medium | |
| CN109848052B (en) | Goods sorting method and terminal equipment | |
| CN109889325B (en) | Verification method, verification device, electronic equipment and medium | |
| CN112700261B (en) | Method, device, equipment and medium for detecting single file of brushing on basis of suspicious communities | |
| CN114124968A (en) | Load balancing method, device, equipment and medium based on market data | |
| CN110879743B (en) | Task eliminating method, device, system and medium based on edge computing environment | |
| CN110716806B (en) | Edge node computing capability determining method, electronic equipment, system and medium | |
| CN109936477B (en) | Method and apparatus for transmitting information | |
| CN110874729A (en) | Switching method and switching device for electronic red packet identification strategy and mobile terminal | |
| CN114329164A (en) | Method, apparatus, device, medium and product for processing data | |
| CN110597682B (en) | Application deployment method and device, computer equipment and storage medium | |
| CN111082982A (en) | Data transmission method, electronic device, system and medium | |
| CN113839973B (en) | Communication connection method, device, equipment and storage medium | |
| CN106528337B (en) | Data backup method, device and system | |
| CN110336823A (en) | Method for allocating tasks, electronic equipment, system and medium based on RTT | |
| CN112135187B (en) | Multimedia data generation method, intercepting method, device, equipment and storage medium | |
| CN112000945B (en) | Authorization method, device, equipment and medium based on artificial intelligence |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |