CN113472896B - Public cloud-based data transmission method - Google Patents
Public cloud-based data transmission method Download PDFInfo
- Publication number
- CN113472896B CN113472896B CN202110897186.5A CN202110897186A CN113472896B CN 113472896 B CN113472896 B CN 113472896B CN 202110897186 A CN202110897186 A CN 202110897186A CN 113472896 B CN113472896 B CN 113472896B
- Authority
- CN
- China
- Prior art keywords
- task queue
- task
- data
- splitting
- sending
- 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
- 230000005540 biological transmission Effects 0.000 title claims abstract description 37
- 238000000034 method Methods 0.000 title claims abstract description 24
- 238000004590 computer program Methods 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005012 migration Effects 0.000 description 1
- 238000013508 migration Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
- H04L67/1078—Resource delivery mechanisms
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention discloses a public cloud-based data transmission method, which comprises the steps of obtaining a data transmission task; splitting the sending task to obtain a sending subtask; determining a task queue corresponding to the sending subtask; the send subtasks are performed through the task queue to send data onto the public cloud. According to the method provided by the invention, the task is split into the subtasks, the task queue corresponding to the transmission subtask is determined, and then the transmission subtask is executed through the task queue so as to transmit the data to the public cloud, so that the task is transmitted to the public cloud through a plurality of queues.
Description
Technical Field
The invention relates to cloud technology, in particular to a public cloud-based data transmission method.
Background
The cloud service market has changed tremendously from 2017 to 2018. Enterprises have shifted from low risk attempts to use clouds to comprehensive, large scale use of clouds. Cloud projects have entered the core of data centers, and thorough cloud migration is becoming a common phenomenon.
Public cloud generally refers to a cloud which can be used and is provided by a third party provider for users, the public cloud can be generally used through the Internet, and the core attribute of the public cloud is shared resource service.
Disclosure of Invention
First, the technical problem to be solved
In order to solve the problems in the prior art, the invention provides a public cloud-based data transmission method.
(II) technical scheme
In order to achieve the above purpose, the main technical scheme adopted by the invention comprises the following steps:
a public cloud-based data transmission method comprises the following steps:
s1, acquiring a data sending task;
s2, splitting the sending task to obtain a sending subtask;
s3, determining a task queue corresponding to the sending subtask;
and S4, executing the sending subtasks through the task queue so as to send the data to the public cloud.
Optionally, the step S2 includes:
s2-1, acquiring the size of the data and the task queue attribute;
s2-2, splitting the data according to the size of the data and the task queue attribute;
s2-3, each split sub-data corresponds to one sending sub-task.
Optionally, the task queue attribute includes: the number of the task queues, the number of resources corresponding to each task queue, the maximum sending delay and the minimum sending delay of each task queue in a preset time period, the number of tasks in each task queue at present and the resource usage amount of each task queue at present.
Optionally, the step S2-2 includes:
s2-2-1, calculating the resource occupancy rate of each task queue=the current resource usage amount of each task queue/the corresponding resource number of each task queue;
s2-2-2, calculating the execution degree of each task queue= (1-the resource occupancy rate of each task queue) ×the number of tasks in each task queue currently (1+the maximum transmission delay of each task queue in a preset time period) ×W/the minimum transmission delay of each task queue in the preset time period, wherein W is the preset minimum resource occupancy rate of the tasks;
s2-2-3, determining ideal splitting quantity according to the execution degree of each task queue and the size of the data;
s2-2-4, splitting the data according to the relation between the ideal splitting number and the task queue number.
Optionally, the step S2-2-3 includes:
s2-2-3-1, determining the mean value of the execution degree
S2-2-3-2, determining a standard value of a data splitting block
S2-2-3-3, if D 0 =0, then ideal split number=1, otherwise, according to D 0 Determining an ideal splitting number;
wherein N is the total number of task queues, i is the task queue identification, A i For the execution degree of the ith task queue, C min Min { the number of resources corresponding to each task queue-the current number of resources used in each task queue }, min { } is a minimum function, q is a preset minimum value of a data block, and D is the size of the data.
Optionally, the step S2-2-3-3 includes:
wherein ,to top-round operators.
Optionally, the step S2-2-3-3 includes:
wherein , to top-round operators.
Optionally, the step S2-2-4 includes:
if the ideal splitting number is larger than the task queue number, splitting the data into the task queue number sub-data;
if the ideal splitting number is not greater than the task queue number, splitting the data into the ideal splitting number of sub-data.
Optionally, the step S3 includes:
s3-1-1, determining the residual resources of each task queue = the corresponding resource quantity of each task queue-the current resource usage quantity of each task queue;
s3-1-2, D is selected from high to low according to the residual resources of each task queue 1 The task queues are used as task queues corresponding to the sending subtasks, wherein D 1 To send the number of subtasks.
Optionally, if the number of subtasks D is sent 1 Less than the total number of task queues, the step S3 includes:
s3-2-1, determining the residual resources of each task queue = the corresponding resource quantity of each task queue-the current resource usage quantity of each task queue;
s3-2-2, arranging the residual resources of each task queue from high to low to obtain a first sequence { X } u -wherein u is the identity of an element in the first sequence;
s3-2-3, according to the size of the transmission data corresponding to each transmission subtask, arranging from high to low to obtain a second sequence { Y } v -wherein v is the identity of an element in the second sequence;
s3-2-4, starting from the first element, selecting one element Y in the second sequence in turn j If the element meeting the preset relation exists in the first sequence, taking the element meeting the preset relation with the smallest label as Y 1 Corresponding task queues; if no element meeting the preset relation exists in the first sequence, taking the element with the smallest label and not corresponding to any element in the first sequence as Y j Corresponding task queues;
wherein the preset relationship is that Y is satisfied j And does not correspond to any element in the first sequence.
(III) beneficial effects
The method divides the task into the subtasks, determines the task queue corresponding to the transmission subtask, and then executes the transmission subtask through the task queue so as to transmit the data to the public cloud, thereby realizing the transmission of the task to the public cloud through a plurality of queues.
Drawings
Fig. 1 is a flow chart of a public cloud-based data transmission method according to an embodiment of the present invention.
Detailed Description
The invention will be better explained for understanding by referring to the following detailed description of the embodiments in conjunction with the accompanying drawings.
Public cloud generally refers to a cloud which can be used and is provided by a third party provider for users, the public cloud can be generally used through the Internet, and the core attribute of the public cloud is shared resource service. The invention provides a public cloud-based data transmission method, which divides a task into subtasks, determines a task queue corresponding to the subtask to be transmitted, and then executes the subtask to be transmitted through the task queue so as to transmit data to the public cloud, thereby realizing that the task is transmitted to the public cloud through a plurality of queues.
Referring to fig. 1, the method provided in this embodiment is as follows:
s1, acquiring a data sending task.
The data required to be sent by the sending task are data to be transmitted to the public cloud for storage. The data may be input by a user or actively collected, and the embodiment does not limit the acquisition mode and content of the data to be transmitted.
The transmission task is a task for transmitting data, and the task may be a transmission request input by a user, or may be a transmission command obtained from a transmission request input by a user, a transmission signaling, or the like.
S2, splitting the sending task to obtain a sending subtask.
The task for sending the data is split to obtain a plurality of subtasks, and the subtasks send the data to the public cloud.
The implementation process of the step is as follows:
s2-1, acquiring the size of data and the task queue attribute.
The data are data which need to be sent to public cloud through a sending task.
The task queue attributes include: the number of the task queues, the number of resources corresponding to each task queue, the maximum sending delay and the minimum sending delay of each task queue in a preset time period, the number of tasks in each task queue at present and the resource usage amount of each task queue at present.
The task queues are currently existing task queues, such as Spark task queues, flink task queues and ELK task queues, which respectively correspond to a predetermined number of Spark connection pools, flink connection pools and ELK connection pools, wherein the connection pools are used for connecting corresponding execution resources when executing tasks to be executed; each type of task queue includes a plurality of tasks to be executed, each of which is matched with a task expiration time, a different priority, and some execution parameters.
S2-2, splitting the data according to the size of the data and the task queue attribute.
Specifically, the S2-2 is performed as follows:
s2-2-1, calculating the resource occupancy rate of each task queue=the current resource usage amount of each task queue/the corresponding resource amount of each task queue.
S2-2-2, calculating the execution degree of each task queue= (1-the resource occupancy rate of each task queue) ×the number of tasks in each task queue currently (1+the maximum transmission delay of each task queue in a preset time period) ×W/the minimum transmission delay of each task queue in the preset time period, wherein W is the preset minimum resource occupancy rate of the tasks.
S2-2-3, determining ideal splitting quantity according to the execution degree of each task queue and the size of data.
The implementation scheme of S2-2-3 is as follows:
S2-2-3-1, determining the mean value of the degree of execution
S2-2-3-2, determining a standard value of a data splitting block
S2-2-3-3, if D 0 =0, then ideal split number=1, otherwise, according to D 0 The number of ideal splits is determined.
Wherein N is the total number of task queues, i is the task queue identification, A i For the execution degree of the ith task queue, C min Min { the number of resources corresponding to each task queue-the current amount of resources used in each task queue }, min { } is a minimum function, q is a preset minimum value of a data block, and D is the size of the data.
In particular, the method comprises the steps of, or ,/>
wherein ,for the top rounding operator ++>
S2-2-4, splitting the data according to the relation between the ideal splitting number and the task queue number.
Specifically, if the ideal splitting number is greater than the task queue number, splitting the data into the sub-data of the task queue number. If the ideal splitting number is not greater than the number of task queues, splitting the data into the ideal splitting number of sub-data.
According to the scheme provided by the embodiment, the ideal splitting quantity of the data is determined based on the resource use condition of the current queue, after the data is split through the ideal splitting quantity or the task queue quantity, the resources of the current queue can be ensured to be more in line with the split data transmission requirements, and the efficient transmission of the data is ensured.
S2-3, each split sub-data corresponds to one sending sub-task.
S3, determining a task queue corresponding to the sending subtask.
The implementation scheme of the method comprises the following steps:
and S3-1-1, determining the residual resources of each task queue = the corresponding resource quantity of each task queue-the current resource usage quantity of each task queue.
S3-1-2, D is selected from high to low according to the residual resources of each task queue 1 The task queues are used as task queues corresponding to the sending subtasks, wherein D 1 To send the number of subtasks.
If the number D of sub-tasks is transmitted 1 The implementation scheme of step S3 is smaller than the total number of task queues, and may be implemented by the following scheme in addition to the above scheme.
And S3-2-1, determining the residual resources of each task queue = the corresponding resource quantity of each task queue-the current resource usage quantity of each task queue.
S3-2-2, arranging the residual resources of each task queue from high to low to obtain a first sequence { X } u And u is the identity of the element in the first sequence.
S3-2-3, according to the size of the transmission data corresponding to each transmission subtask, arranging from high to low to obtain a second sequence { Y } v And v is the identity of the element in the second sequence.
S3-2-4, starting from the first element, selecting one element Y in the second sequence in turn j If the element meeting the preset relation exists in the first sequence, taking the element meeting the preset relation with the smallest label as Y 1 A corresponding task queue. If no element meeting the preset relation exists in the first sequence, taking the element with the smallest label and not corresponding to any element in the first sequence as Y j A corresponding task queue.
Wherein the preset relationship is thatY j And does not correspond to any element in the first sequence.
And S4, executing a sending subtask through the task queue so as to send the data to the public cloud.
The scheme provided by the embodiment can dynamically split and transmit the data according to the resource use condition of the current queue, thereby improving the data transmission rate and quality.
According to the method, the task is split into the subtasks, after the task queue corresponding to the transmission subtask is determined, the transmission subtask is executed through the task queue so as to transmit data to the public cloud, and the task is transmitted to the public cloud through a plurality of queues.
It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions.
It should be noted that in the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The use of the terms first, second, third, etc. are for convenience of description only and do not denote any order. These terms may be understood as part of the component name.
Furthermore, it should be noted that in the description of the present specification, the terms "one embodiment," "some embodiments," "example," "specific example," or "some examples," etc., refer to a specific feature, structure, material, or characteristic described in connection with the embodiment or example being included in at least one embodiment or example of the present invention. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, the different embodiments or examples described in this specification and the features of the different embodiments or examples may be combined and combined by those skilled in the art without contradiction.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art upon learning the basic inventive concepts. Therefore, the appended claims should be construed to include preferred embodiments and all such variations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various modifications and variations can be made to the present invention without departing from the spirit or scope of the invention. Thus, the present invention should also include such modifications and variations provided that they come within the scope of the following claims and their equivalents.
Claims (7)
1. The public cloud-based data transmission method is characterized by comprising the following steps of:
s1, acquiring a data sending task;
s2, splitting the sending task to obtain a sending subtask;
s2 comprises the following steps:
s2-1, acquiring the size of the data and the task queue attribute;
s2-2, splitting the data according to the size of the data and the task queue attribute;
s2-2 comprises:
s2-2-1, calculating the resource occupancy rate of each task queue=the current resource usage amount of each task queue/the corresponding resource number of each task queue;
s2-2-2, calculating the execution degree of each task queue= (1-the resource occupancy rate of each task queue) ×the number of tasks in each task queue currently (1+the maximum transmission delay of each task queue in a preset time period) ×W/the minimum transmission delay of each task queue in the preset time period, wherein W is the preset minimum resource occupancy rate of the tasks;
s2-2-3, determining ideal splitting quantity according to the execution degree of each task queue and the size of the data;
s2-2-4, splitting the data according to the relation between the ideal splitting number and the task queue number;
s2-3, each split sub-data corresponds to a sending sub-task;
s3, determining a task queue corresponding to the sending subtask;
s4, executing the sending subtasks through the task queue so as to send the data to the public cloud;
the task queue attributes include: the number of the task queues, the number of resources corresponding to each task queue, the maximum sending delay and the minimum sending delay of each task queue in a preset time period, the number of tasks in each task queue at present and the resource usage amount of each task queue at present.
2. The method of claim 1, wherein S2-2-3 comprises:
s2-2-3-1, determining the mean value of the execution degree
S2-2-3-2, determining a standard value of a data splitting block
S2-2-3-3, if D 0 =0, then ideal split number=1, otherwise, according to D 0 Determining an ideal splitting number;
wherein N is the total number of task queues, i is the task queue identification, A i For the execution degree of the ith task queue, C min Min { the number of resources corresponding to each task queue-the current number of resources used in each task queue }, min { } is a minimum function, q is a preset minimum value of a data block, and D is the size of the data.
3. The method of claim 2, wherein S2-2-3-3 comprises:
wherein ,to top-round operators.
4. The method of claim 2, wherein S2-2-3-3 comprises:
wherein , to top-round operators.
5. The method of claim 1, wherein S2-2-4 comprises:
if the ideal splitting number is larger than the task queue number, splitting the data into the task queue number sub-data;
if the ideal splitting number is not greater than the task queue number, splitting the data into the ideal splitting number of sub-data.
6. The method according to claim 1, wherein S3 comprises:
s3-1-1, determining the residual resources of each task queue = the corresponding resource quantity of each task queue-the current resource usage quantity of each task queue;
s3-1-2, D is selected from high to low according to the residual resources of each task queue 1 The task queues are used as task queues corresponding to the sending subtasks, wherein D 1 To send the number of subtasks.
7. The method of claim 6, wherein if the number of subtasks D is transmitted 1 Less than the total number of task queues, then S3 comprises:
s3-2-1, determining the residual resources of each task queue = the corresponding resource quantity of each task queue-the current resource usage quantity of each task queue;
s3-2-2, arranging the residual resources of each task queue from high to low to obtain a first sequence { X } u -wherein u is the identity of an element in the first sequence;
s3-2-3, according to the size of the transmission data corresponding to each transmission subtask, arranging from high to low to obtain a second sequence { Y } v -wherein v is the identity of an element in the second sequence;
s3-2-4, starting from the first element, selecting one element Y in the second sequence in turn j If the element meeting the preset relation exists in the first sequence, taking the element meeting the preset relation with the smallest label as Y j Corresponding task queues; if no element satisfying the preset relation exists in the first sequence, the index is the smallest and the element of any element in the first sequence is not correspondingWith plain as Y j Corresponding task queues;
wherein the preset relationship is that Y is satisfied j And does not correspond to any element in the first sequence.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2020110182995 | 2020-09-24 | ||
| CN202011018299.5A CN112398904A (en) | 2020-09-24 | 2020-09-24 | Data sending method based on public cloud |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113472896A CN113472896A (en) | 2021-10-01 |
| CN113472896B true CN113472896B (en) | 2023-10-27 |
Family
ID=74597103
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011018299.5A Withdrawn CN112398904A (en) | 2020-09-24 | 2020-09-24 | Data sending method based on public cloud |
| CN202110897186.5A Active CN113472896B (en) | 2020-09-24 | 2021-08-05 | Public cloud-based data transmission method |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011018299.5A Withdrawn CN112398904A (en) | 2020-09-24 | 2020-09-24 | Data sending method based on public cloud |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN112398904A (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3179701A1 (en) * | 2015-12-09 | 2017-06-14 | Synology Incorporated | File upload and download methods and associated server |
| CN107528914A (en) * | 2017-09-12 | 2017-12-29 | 电子科技大学 | The resource requisition dispatching method of data fragmentation |
| CN108900434A (en) * | 2018-07-18 | 2018-11-27 | 北京木瓜移动科技股份有限公司 | Data collection distribution method and device |
| CN109542608A (en) * | 2018-11-30 | 2019-03-29 | 北京仿真中心 | A kind of cloud artificial tasks dispatching method based on mixing queuing network |
| WO2019196251A1 (en) * | 2018-04-12 | 2019-10-17 | 平安科技（深圳）有限公司 | Resource data packet processing method and apparatus, terminal device, and medium |
| CN111131450A (en) * | 2019-12-23 | 2020-05-08 | 北京奇艺世纪科技有限公司 | File uploading method, file recombining method and file recombining device |
| CN111414334A (en) * | 2020-02-21 | 2020-07-14 | 平安科技（深圳）有限公司 | File fragment uploading method, device, equipment and storage medium based on cloud technology |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10043017B2 (en) * | 2013-04-15 | 2018-08-07 | Paul Lewis | Systems and methods for jurisdiction independent data storage in a multi-vendor cloud environment |
| US11249857B2 (en) * | 2018-10-19 | 2022-02-15 | Netapp, Inc. | Methods for managing clusters of a storage system using a cloud resident orchestrator and devices thereof |
-
2020
- 2020-09-24 CN CN202011018299.5A patent/CN112398904A/en not_active Withdrawn
-
2021
- 2021-08-05 CN CN202110897186.5A patent/CN113472896B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3179701A1 (en) * | 2015-12-09 | 2017-06-14 | Synology Incorporated | File upload and download methods and associated server |
| CN107528914A (en) * | 2017-09-12 | 2017-12-29 | 电子科技大学 | The resource requisition dispatching method of data fragmentation |
| WO2019196251A1 (en) * | 2018-04-12 | 2019-10-17 | 平安科技（深圳）有限公司 | Resource data packet processing method and apparatus, terminal device, and medium |
| CN108900434A (en) * | 2018-07-18 | 2018-11-27 | 北京木瓜移动科技股份有限公司 | Data collection distribution method and device |
| CN109542608A (en) * | 2018-11-30 | 2019-03-29 | 北京仿真中心 | A kind of cloud artificial tasks dispatching method based on mixing queuing network |
| CN111131450A (en) * | 2019-12-23 | 2020-05-08 | 北京奇艺世纪科技有限公司 | File uploading method, file recombining method and file recombining device |
| CN111414334A (en) * | 2020-02-21 | 2020-07-14 | 平安科技（深圳）有限公司 | File fragment uploading method, device, equipment and storage medium based on cloud technology |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112398904A (en) | 2021-02-23 |
| CN113472896A (en) | 2021-10-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2021115480A1 (en) | Federated learning method, device, equipment, and storage medium | |
| JP7112919B2 (en) | Smart device task processing method and device | |
| CN106371918B (en) | Task cluster schedule management method and device | |
| CN109918184B (en) | Picture processing system, method and related device and equipment | |
| US10572285B2 (en) | Method and apparatus for elastically scaling virtual machine cluster | |
| US10652360B2 (en) | Access scheduling method and apparatus for terminal, and computer storage medium | |
| US20150143377A1 (en) | Dynamic scheduling of tasks for collecting and processing data using job configuration data | |
| CN107391243B (en) | Thread task processing equipment, device and method | |
| US20150363229A1 (en) | Resolving task dependencies in task queues for improved resource management | |
| CN110020757A (en) | Worksheet processing method, system, computer equipment and readable storage medium storing program for executing | |
| CN110209484B (en) | Credible cloud task scheduling system and method based on multiple clouds and security mapping | |
| CN110569252B (en) | Data processing system and method | |
| CN110781180B (en) | Data screening method and data screening device | |
| CN103139100A (en) | Business handling method and business handling system | |
| CN104850491A (en) | Software test method, equipment and system | |
| CN107888787A (en) | A kind of processing method and processing device of media access request | |
| CN111800447A (en) | Server scheduling method and device for cloud game and readable storage medium | |
| CN109491775B (en) | Task processing and scheduling method used in edge computing environment | |
| US9424078B2 (en) | Managing high performance computing resources using job preemption | |
| CN113472896B (en) | Public cloud-based data transmission method | |
| CN111124708B (en) | Microservice-oriented batch reasoning method, server and computer readable storage medium | |
| CN113411354B (en) | Data transmission method based on public cloud | |
| CN112667368A (en) | Task data processing method and device | |
| CN112104682A (en) | Intelligent distribution method and system for cloud desktop server, storage medium and central control server | |
| CN109246631B (en) | Method for sending short message |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| 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 |