CN110308976B - Task processing method and device - Google Patents
Task processing method and device Download PDFInfo
- Publication number
- CN110308976B CN110308976B CN201810258039.1A CN201810258039A CN110308976B CN 110308976 B CN110308976 B CN 110308976B CN 201810258039 A CN201810258039 A CN 201810258039A CN 110308976 B CN110308976 B CN 110308976B
- Authority
- CN
- China
- Prior art keywords
- task
- service party
- server
- identifier
- cache space
- 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
Images
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/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- 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/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
Abstract
The disclosure relates to a task processing method and device. The method is applied to a first server of a server cluster, wherein the server cluster comprises the first server and a plurality of second servers, and comprises the following steps: when a task sent by a service party is received, judging whether the service party is an isolated service party or not; when the service party is the isolation service party, marking a task according to a first identifier of the service party to obtain a marked first task; and sending the first task to the task cache space so that the second server corresponding to the business party acquires and executes the first task from the task cache space. The task processing method and the task processing device provided by the embodiment of the disclosure realize the isolation processing of the tasks sent by the isolation service party, reduce the interaction difficulty between the first server and the second server, improve the coupling degree between the first server and the second server, and realize the dynamic configuration of the second server.
Description
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a task processing method and apparatus.
Background
Server clustering refers to the collection of many servers to provide one or more services to a business party. The server cluster comprises a main server and a plurality of slave servers. The master server is responsible for scheduling tasks and monitoring the state of the slave servers, the slave servers are responsible for executing specific tasks sent by the master server, and adaptive task allocation is carried out on the slave servers according to different master servers of the tasks. For the tasks of some service parties needing to be isolated for processing, the method provided by the related technology is difficult to realize the dynamic configuration of the slave server, and the interaction difficulty between the master server and the slave server is high.
Disclosure of Invention
In view of this, the present disclosure provides a task processing method and apparatus.
According to a first aspect of the present disclosure, a task processing method and apparatus are provided, which are applied to a first server of a server cluster, where the server cluster includes the first server and a plurality of second servers, and the method includes:
when a task sent by a service party is received, judging whether the service party is an isolated service party or not;
when the service party is an isolation service party, marking the task according to a first identifier of the service party to obtain a marked first task;
and sending the first task to a task cache space so that a second server corresponding to the service party acquires and executes the first task from the task cache space.
For the above method, in one possible implementation, the method further includes:
when the service party is a non-isolated service party, determining the task as an unmarked second task;
and sending the second task to a task cache space so that a second server corresponding to a non-isolated service party acquires and executes the second task from the task cache space.
For the above method, in one possible implementation, the method further includes:
when the service party is a non-isolated service party, marking the task by adopting a third identifier to obtain a marked third task;
and sending the third task to a task cache space so that a second server corresponding to a non-isolated service party acquires and executes the third task from the task cache space.
For the above method, in one possible implementation, the method further includes:
when an isolation request of a service party is received, determining the service party as an isolation service party, and distributing a corresponding first identifier for the service party;
according to the isolation request, distributing a second server for executing the task sent by the service party to the service party;
establishing a corresponding relation table according to the first identifier of the service party and a second identifier of a second server for executing the task sent by the service party;
and storing the corresponding relation table into the task cache space so as to obtain the corresponding relation table from the task cache space.
According to a second aspect of the present disclosure, there is provided a task processing method applied to any one of second servers of a server cluster, the server cluster including a first server and a plurality of second servers, the method including:
determining a service party corresponding to the second server according to a second identifier of the second server and a corresponding relation table;
acquiring a task from the service party from a task cache space of the first server;
the task of the business party is performed,
and the corresponding relation table comprises the corresponding relation between the identification of the service party and the identification of the second server.
For the above method, in a possible implementation manner, determining, according to the second identifier of the second server and the correspondence table, the service party corresponding to the second server includes:
when the second identifier exists in the corresponding relation table, determining the service party corresponding to the second server according to the service party identifier corresponding to the second identifier,
the service party identification comprises a first identification of an isolated service party and a third identification of a non-isolated service party.
For the above method, in a possible implementation manner, determining, according to the second identifier of the second server and the correspondence table, the service party corresponding to the second server includes:
when the second identifier does not exist in the corresponding relation table, determining the service party which does not exist in the corresponding relation table as the service party corresponding to the second server,
and the service party which does not exist in the corresponding relation table is a non-isolated service party.
For the above method, in one possible implementation, the method further includes:
and acquiring the corresponding relation table from the task cache space.
According to a third aspect of the present disclosure, there is provided a task processing apparatus applied to a first server of a server cluster including the first server and a plurality of second servers, the apparatus including:
the isolation determination module is used for judging whether the service party is an isolation service party or not when receiving a task sent by the service party;
the first marking module is used for marking the task according to the first identification of the service party to obtain a marked first task when the service party is an isolated service party;
and the first sending module is used for sending the first task to a task cache space so that a second server corresponding to the service party acquires and executes the first task from the task cache space.
For the above apparatus, in one possible implementation manner, the apparatus further includes:
the second marking module is used for determining the task as an unmarked second task when the service party is a non-isolated service party;
and the second sending module is used for sending the second task to a task cache space so that a second server corresponding to the non-isolated service party acquires and executes the second task from the task cache space.
For the above apparatus, in one possible implementation manner, the apparatus further includes:
the third marking module is used for marking the task by adopting a third identifier when the service party is a non-isolated service party to obtain a marked third task;
and the third sending module is used for sending the third task to a task cache space so that a second server corresponding to the non-isolated service party acquires and executes the third task from the task cache space.
For the above apparatus, in one possible implementation manner, the apparatus further includes:
the request receiving module is used for determining a service party as an isolated service party and distributing a corresponding first identifier for the service party when receiving an isolation request of the service party;
the server distribution module is used for distributing a second server for executing the task sent by the service party to the service party according to the isolation request;
the relation table establishing module is used for establishing a corresponding relation table according to the first identifier of the service party and a second identifier of a second server for executing the task sent by the service party;
and the relation table sending module is used for storing the corresponding relation table into the task cache space so as to enable the second server to obtain the corresponding relation table from the task cache space.
According to a fourth aspect of the present disclosure, there is provided a task processing apparatus applied to any one of second servers of a server cluster, the server cluster including a first server and a plurality of second servers, the apparatus including:
the service party determining module is used for determining a service party corresponding to the second server according to the second identifier of the second server and the corresponding relation table;
the task obtaining module is used for obtaining a task from the service party from a task cache space of the first server;
a task execution module for executing the task of the service party,
and the corresponding relation table comprises the corresponding relation between the identification of the service party and the identification of the second server.
For the above apparatus, in a possible implementation manner, the service party determining module includes:
a first determining module, for determining the service party corresponding to the second server according to the service party identifier corresponding to the second identifier when the second identifier exists in the corresponding relationship table,
the service party identification comprises a first identification of an isolated service party and a third identification of a non-isolated service party.
For the above apparatus, in a possible implementation manner, the service party determining module includes:
a second determining module, configured to determine, when the second identifier does not exist in the correspondence table, a service party that does not exist in the correspondence table as a service party corresponding to the second server,
and the service party which does not exist in the corresponding relation table is a non-isolated service party.
For the above apparatus, in one possible implementation manner, the apparatus further includes:
and the relation table acquisition module acquires the corresponding relation table from the task cache space.
According to a fifth aspect of the present disclosure, there is provided a task processing device including: a processor; a memory for storing processor-executable instructions; wherein the processor is configured to perform the above-described task processing method for the first server.
According to a sixth aspect of the present disclosure, there is provided a non-transitory computer readable storage medium having stored thereon computer program instructions, wherein the computer program instructions, when executed by a processor, implement the above-described task processing method for a first server.
According to a seventh aspect of the present disclosure, there is provided a task processing device including: a processor; a memory for storing processor-executable instructions; wherein the processor is configured to perform the above-described task processing method for the second server.
According to an eighth aspect of the present disclosure, there is provided a non-transitory computer-readable storage medium having stored thereon computer program instructions, wherein the computer program instructions, when executed by a processor, implement the above-described task processing method for a second server.
The task processing method and the task processing device provided by the embodiment of the disclosure realize the isolation processing of the tasks sent by the isolation service party, reduce the interaction difficulty between the first server and the second server, improve the coupling degree between the first server and the second server, and realize the dynamic configuration of the second server.
Other features and aspects of the present disclosure will become apparent from the following detailed description of exemplary embodiments, which proceeds with reference to the accompanying drawings.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate exemplary embodiments, features, and aspects of the disclosure and, together with the description, serve to explain the principles of the disclosure.
FIG. 1 shows a flow diagram of a task processing method according to an embodiment of the present disclosure;
FIG. 2 illustrates a flow diagram of a task processing method according to an embodiment of the present disclosure;
FIG. 3 is a diagram illustrating a correspondence table in a task processing method according to an embodiment of the present disclosure;
FIG. 4 illustrates a flow diagram of a task processing method according to an embodiment of the present disclosure;
FIG. 5 shows a flow diagram of a task processing method according to an embodiment of the present disclosure;
FIG. 6 is a diagram illustrating a correspondence table in a task processing method according to an embodiment of the present disclosure;
FIG. 7 shows a flow diagram of a task processing method according to an embodiment of the present disclosure;
fig. 8 illustrates a flowchart of step S201 in a task processing method according to an embodiment of the present disclosure;
fig. 9 illustrates a flowchart of step S201 in a task processing method according to an embodiment of the present disclosure;
FIG. 10 shows a flow diagram of a task processing method according to an embodiment of the present disclosure;
11a, 11b show schematic diagrams of application scenarios of a task processing method according to an embodiment of the present disclosure;
FIG. 12 shows a block diagram of a task processing device according to an embodiment of the present disclosure;
FIG. 13 shows a block diagram of a task processing device according to an embodiment of the present disclosure;
FIG. 14 shows a block diagram of a task processing device according to an embodiment of the present disclosure;
FIG. 15 shows a block diagram of a task processing device according to an embodiment of the present disclosure;
fig. 16 shows a block diagram of a task processing device according to an embodiment of the present disclosure.
Detailed Description
Various exemplary embodiments, features and aspects of the present disclosure will be described in detail below with reference to the accompanying drawings. In the drawings, like reference numbers can indicate functionally identical or similar elements. While the various aspects of the embodiments are presented in drawings, the drawings are not necessarily drawn to scale unless specifically indicated.
The word "exemplary" is used exclusively herein to mean "serving as an example, embodiment, or illustration. Any embodiment described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments.
Furthermore, in the following detailed description, numerous specific details are set forth in order to provide a better understanding of the present disclosure. It will be understood by those skilled in the art that the present disclosure may be practiced without some of these specific details. In some instances, methods, means, elements and circuits that are well known to those skilled in the art have not been described in detail so as not to obscure the present disclosure.
Fig. 1 illustrates a flowchart of a task processing method according to an embodiment of the present disclosure. As shown in fig. 1, the method is applied to a first server of a server cluster, and the server cluster may include the first server and a plurality of second servers. The task processing method may include steps S101 to S103.
In step S101, when a task sent by a service side is received, it is determined whether the service side is an isolated service side.
In this embodiment, the first server may be a master server in a server cluster, and the second server may be a slave server in the server cluster. The service party can be a user or a service object of the service provided by the server cluster such as a website, a platform and the like, and the service party can send out tasks executable by the server cluster through the corresponding server, the terminal and the like. The business party can be set by those skilled in the art according to actual needs, and the disclosure does not limit this.
In this embodiment, the service party may be classified in advance according to the service requirement of the service party, and when the service party needs to perform isolation processing on a task sent by the server cluster, the service party may be determined as an isolated service party. When a service party does not need the server cluster to perform isolation processing on tasks sent by the service party, the service party can be determined as a non-isolated service party. In this way, isolation processing for the business side can be achieved. The isolation processing refers to separating and executing tasks sent by an isolation service party and tasks of other service parties so as to prevent the task execution of other service parties from influencing the task execution of the isolation service party.
In step S102, when the service party is the isolated service party, the marked first task is obtained according to the first identifier marking task of the service party.
In this embodiment, the first identifier of the service party may be a number, a name, and other identifiers that are different from the numbers, names, and the like of other service parties in a table allocated to the service party by the first server, and may also be an identifier that represents an identity characteristic of the service party, such as a name of the service party itself, which is not limited in this disclosure. For example, the first flag is 001, and labeling is performed for the task biz according to the first flag 001, and a labeled first task biz-001 is obtained.
In step S103, the first task is sent to the task cache space, so that the second server corresponding to the business party acquires and executes the first task from the task cache space.
In this embodiment, each of the plurality of second servers may access the task cache space, and acquire and execute the task corresponding to the second server.
According to the task processing method provided by the embodiment of the disclosure, under the condition that a service party sending a task is determined to be an isolated service party, the task is marked according to a first identification of the service party, and a marked first task is obtained; and sending the first task to the task cache space so that the second server corresponding to the business party acquires and executes the first task from the task cache space. The isolation processing of tasks sent by the isolation service party is realized, the interaction difficulty between the first server and the second server is reduced, the coupling degree between the first server and the second server is improved, and the dynamic configuration of the second server is realized.
Fig. 2 illustrates a flowchart of a task processing method according to an embodiment of the present disclosure. As shown in fig. 2, the method may further include steps S104 to S107.
In step S104, when an isolation request of a service party is received, the service party is determined as an isolated service party, and a corresponding first identifier is allocated to the service party.
In this embodiment, the isolation request issued by the service party may include information about the type of task, the speed and the amount of task required for processing the task, which are to be issued by the service party, and the task required for performing the isolation processing by the service party. The quarantine request may also include information about the business party, such as the name of the business party. The first identifier assigned by the first server to the service party may be determined according to the name of the service party and the like. The first identifier allocated by the first server to the service party may also be a number, a serial number, or other identifiers directly allocated to the service party and different from other service parties accessed in the server cluster. The person skilled in the art can set the allocation manner of the first identifier according to actual needs, and the disclosure does not limit this.
In step S105, according to the quarantine request, a second server for performing a task issued by the service party is allocated to the service party.
In this embodiment, the resource configuration required by the server cluster to process the task to be issued by the service party in the isolation request may be determined according to the related information of the task to be issued by the service party, and one or more required second servers may be allocated to the service party, which is not limited by the present disclosure.
In step S106, a corresponding relationship table is established according to the first identifier of the service party and the second identifier of the second server for executing the task sent by the service party.
In this embodiment, the second identifier of the second server may be information that distinguishes the second server from other second servers by an Internet Protocol Address (IP Address), a serial number, a name, a serial number, and the like of the second server, which is not limited in this disclosure. Fig. 3 is a schematic diagram illustrating a correspondence table in a task processing method according to an embodiment of the present disclosure. As shown in fig. 3, a corresponding relationship table may be established according to a corresponding relationship between the first identifier of the service party and the second identifier of the second server for executing the task sent by the service party, so that the second server determines the first identifier of the service party (isolated service party) corresponding to the second server according to the second identifier of the second server and the corresponding relationship table, and obtains the first task marked according to the first identifier from the task cache space according to the first identifier.
In step S107, the correspondence table is stored in the task cache space, so that the second server acquires the correspondence table from the task cache space.
In this embodiment, the second server may obtain the correspondence table from the task cache space at regular or irregular time as needed. When the corresponding relation table is changed, the first server can store the changed corresponding relation table in the task cache space, and the second server can acquire the changed corresponding relation table in time. In this way, the second server for executing the task sent by a certain service party can be dynamically configured, and the process of configuring the corresponding second server for the service party is simplified. The first server can also store the corresponding relation table into the own relation table storage space, so that the second server can acquire the corresponding relation table from the relation table storage space. Those skilled in the art can set the storage location of the correspondence table according to actual needs, which is not limited in this disclosure.
In this embodiment, the first server may further determine, according to a request for releasing isolation sent by the service party, that the service party is a non-isolated service party, release a corresponding relationship between the second server, which is allocated to the service party and used for the task sent by the executor, and the service party, and delete a corresponding relationship between the first identifier of the service party and the second identifier of the second server from the corresponding relationship table, so that the second server may be allocated to execute tasks of other task parties.
In this embodiment, to meet the requirements of different service parties, only the tasks that need to be isolated may be determined, and the corresponding second servers may be allocated to the isolated tasks. And establishing a task corresponding relation table according to the identification of the task subjected to the isolation processing and a second identification of the second server, so that the second server obtains the corresponding task from the task cache space according to the task corresponding relation table, and the isolation processing aiming at the task is realized. The specific implementation process is the same as the isolation process for the service party implemented based on the service party, and is not described here again.
Fig. 4 illustrates a flowchart of a task processing method according to an embodiment of the present disclosure. As shown in fig. 4, the method may further include step S108 and step S109.
In step S108, when the service party is a non-isolated service party, the task is determined as an unmarked second task.
In step S109, the second task is sent to the task cache space, so that the second server corresponding to the non-isolated service party obtains and executes the second task from the task cache space.
In this embodiment, when the service party is a non-isolated service party, it may be determined that the task issued by the service party does not need the isolation process. The task may not be marked (to be distinguished from a first task which is sent by other isolated service parties and marked according to the first identification), and the task is determined to be an unmarked second task and sent to the task cache space. Any second server in the server cluster that is idle and not designated to execute the task issued by the isolated service party is made to acquire and execute the second task.
Fig. 5 illustrates a flowchart of a task processing method according to an embodiment of the present disclosure. As shown in fig. 5, the method may further include step S110 and step S111.
In step S110, when the service party is a non-isolated service party, the task is marked by using the third identifier, and a marked third task is obtained.
In this embodiment, the first server may set the third identifier as an arbitrary identifier different from the first identifier and the second identifier. For example, the third identifier is all, and the task biz is marked according to the third identifier all, so that a marked third task biz-all is obtained. The third identifier can be set by those skilled in the art according to actual needs, and the present disclosure does not limit this.
In step S111, the third task is sent to the task cache space, so that the second server corresponding to the non-isolated service party obtains and executes the third task from the task cache space.
In this embodiment, after the third task is sent to the task cache space, any second server in the server cluster that is idle and is not designated to execute the task sent by the isolated service provider may obtain and execute the third task.
In a possible implementation manner, the correspondence table may further include a third identifier corresponding to the service party determined as the non-isolated service party and a second identifier of a second server that can perform the task issued by the non-isolated service party. Fig. 6 is a schematic diagram illustrating a correspondence table in a task processing method according to an embodiment of the present disclosure. As shown in fig. 6, the service party 7, and the service party 8 are non-isolated service parties, and third identifiers corresponding to the non-isolated service parties are all, the second servers capable of performing the tasks sent by the service party 6, the service party 7, and the service party 8 are the server 7, the server 8, the server 9, and the server 10, and second identifiers corresponding to the second servers are 192.168.0.7, 192.168.0.8, 192.168.0.9, and 192.168.0.10, respectively.
Fig. 7 shows a flowchart of a task processing method according to an embodiment of the present disclosure. As shown in fig. 7, the method is applied to any one of the second servers of a server cluster, where the server cluster includes a first server and a plurality of second servers. The task processing method may include steps S201 to S203.
In step S201, a service party corresponding to the second server is determined according to the second identifier of the second server and the corresponding relationship table. Wherein, the corresponding relation table comprises the corresponding relation between the identification of the service party and the identification of the second server.
In this embodiment, the determined service party corresponding to the second server may be an isolated service party that needs to perform isolation processing on the task sent by the service party, or may be a non-isolated service party that does not need to perform isolation processing on the task sent by the service party.
In this embodiment, the correspondence table may include an identifier of the portion served by the server cluster determined as the isolated service party and a second identifier of a second server for performing a task issued by the corresponding isolated service party. The corresponding relation table may further include a third identifier corresponding to the non-isolated service party and a second identifier of any idle second server in the server cluster that is not designated to execute the task issued by the isolated service party. Those skilled in the art can set the content included in the correspondence table according to actual needs, and the disclosure does not limit this.
In step S202, a task from a service is acquired from a task cache space of a first server.
In this embodiment, the second server obtains the task from the service party from the task cache space of the first server, where the task is sent by the isolated service party and needs to be isolated, and the task is sent by the non-isolated service party and does not need to be isolated.
In step S203, the task of the business side is performed.
According to the task processing method provided by the embodiment of the disclosure, a service party corresponding to a second server is determined according to a second identifier of the second server and a corresponding relation table, a task from the service party is acquired from a task cache space of a first server, and the task of the service party is executed. The interaction difficulty between the first server and the second server is reduced, the coupling degree between the first server and the second server is improved, and the dynamic configuration of the second server is realized.
Fig. 8 illustrates a flowchart of step S201 in a task processing method according to an embodiment of the present disclosure. In one possible implementation, as shown in fig. 8, step S201 may include step S2011.
In step S2011, when the second identifier exists in the correspondence table, the service party corresponding to the second server is determined according to the service party identifier corresponding to the second identifier. The service party identification comprises a first identification of the isolated service party and a third identification of the non-isolated service party.
In this implementation manner, when the second identifier of the second server exists in the correspondence table, the second server may directly obtain and execute the corresponding task from the task cache space according to the first identifier or the third identifier of the service party corresponding to the second identifier of the second server in the correspondence table. The task of obtaining the task from the service party from the task cache space of the first server may be: the first task is sent by the isolation service party and marked according to the first identification of the isolation service party; and the third task is sent by the non-isolated service party and marked according to the corresponding third identifier.
Fig. 9 illustrates a flowchart of step S201 in a task processing method according to an embodiment of the present disclosure. In one possible implementation, as shown in fig. 9, step S201 may include step S2012.
In step S2012, when the second identifier does not exist in the correspondence table, the service party that does not exist in the correspondence table is determined as the service party corresponding to the second server. And the service party which does not exist in the corresponding relation table is a non-isolated service party.
In this implementation manner, when the second identifier does not exist in the correspondence table, the second server may determine that the second server is not allocated to execute a task sent by a certain isolated service party, and the second server may obtain and execute a corresponding task from the task cache space. The task of obtaining the task from the service party from the task cache space of the first server may be: and the second task which is sent by the non-isolated service party and is not marked.
Fig. 10 illustrates a flowchart of a task processing method according to an embodiment of the present disclosure. As shown in fig. 10, the method may further include step S204.
In step S204, a correspondence table is acquired from the task cache space.
In this embodiment, the second server may obtain the corresponding relationship table from the task cache space at regular or irregular time according to its own needs, which is not limited in this disclosure. Therefore, the second server can determine the corresponding service party according to the corresponding relation table and the second identifier of the second server, and execute the task sent by the service party.
It should be noted that, although the task processing method is described above by taking the above-described embodiment as an example, those skilled in the art can understand that the present disclosure should not be limited thereto. In fact, the user can flexibly set each step according to personal preference and/or actual application scene, as long as the technical scheme of the disclosure is met.
Application example
An application example according to the embodiment of the present disclosure is given below in conjunction with "task processing procedure of a certain server cluster" as an exemplary application scenario to facilitate understanding of a flow of a task processing method. It is to be understood by those skilled in the art that the following application examples are for the purpose of facilitating understanding of the embodiments of the present disclosure only and are not to be construed as limiting the embodiments of the present disclosure.
Fig. 11a and 11b are schematic diagrams illustrating application scenarios of a task processing method according to an embodiment of the present disclosure. According to the difference of the corresponding relation table, the implementation process of the task processing method is explained by two examples below.
Example 1
As shown in fig. 11a, when the correspondence table only includes the first identifier of the isolated service party and the second identifier of the second server for executing the task sent by the isolated service party, the working processes of the first server and each second server are as follows:
the working process of the first server comprises the steps of establishing a corresponding relation table and task allocation. The method comprises the following specific steps:
establishing a corresponding relation table, comprising: when receiving an isolation request sent by a service party, determining the service party as an isolation service party, and allocating a corresponding first identifier to the service party, for example, allocating a first identifier 001 to the service party 1. According to the isolation request, a second server for executing the task sent by the service party is allocated to the service party, for example, server 1 is allocated to service party 1. And then establishing a corresponding relation table D according to the first identifier of the service party and a second server for executing tasks sent by the service party. And sending the corresponding relation table D to the task cache space R.
Task allocation, comprising: when receiving a task sent by a certain service party, judging whether the service party is an isolated service party. And when the service party is the isolated service party, marking the task sent by the service party according to the first identifier of the service party to obtain the marked first task. The first task is sent to the task cache space R. For example, for task 2A sent by service provider 2, which is an isolated service provider, task 2A is marked according to first identifier 002 of service provider 2, and marked first task 2A' is obtained. And when the service party is a non-isolated service party, determining the task as an unmarked second task. The second task is sent to the task cache space R. For example, for task 12A issued by business party 12, which is a non-isolated business party, the unmarked task 12A is determined to be a second task 12K.
The working process of the second server comprises the steps of obtaining the corresponding relation table and executing the task. The method comprises the following specific steps:
acquiring a corresponding relation table, comprising: and acquiring a corresponding relation table D from the task cache space R.
Performing tasks, including: and judging whether the corresponding relation table D has the second identification of the corresponding relation table D. For example, the second logo is 192.168.0.2 and the second logo 192.168.0.15. When the second identifier 192.168.0.2 of the corresponding relation table D exists, the first identifier 002 of the isolated service party corresponding to the second identifier 192.168.0.2 is determined from the corresponding relation table D. And acquiring a first task 2A 'marked according to the first identifier 002 from the task cache space R according to the first identifier 002, and executing the acquired first task 2A'. When the corresponding relation table D does not have the second identifier 192.168.0.15 of its own, the unmarked second task, for example, the second task 15K, is obtained from the task cache space R, and the second task 15K is executed.
Example 2
As shown in fig. 11b, when the correspondence table only includes the first identifier of the isolated service party, the second identifier of the second server for executing the task sent by the isolated service party, and the third identifier of the non-isolated service, the working processes of the first server and each second server are as follows:
the working process of the first server comprises the steps of establishing a corresponding relation table and task allocation. The method comprises the following specific steps:
establishing a corresponding relation table, comprising: when receiving an isolation request sent by a service party, determining the service party as an isolation service party, and allocating a corresponding first identifier to the service party, for example, allocating a first identifier 001 to the service party 1. According to the isolation request, a second server for executing the task sent by the service party is allocated to the service party, for example, server 1 is allocated to service party 1. A third identity, e.g., all, is set for the non-isolated traffic party. Any second server of the plurality of second servers that is idle and not designated for performing tasks issued by an isolated service party is determined and configured to perform tasks issued by a non-isolated service party. And then establishing a corresponding relation table D according to the first identifier of the service party, the second identifier of the second server used for executing the task sent by the service party, the third identifier of the non-isolated service party and the second identifier of the second server used for executing the task sent by the non-isolated service party. And sending the corresponding relation table D to the task cache space R.
Task allocation, comprising: when receiving a task sent by a certain service party, judging whether the service party is an isolated service party. And when the service party is the isolated service party, marking the task sent by the service party according to the first identifier of the service party to obtain the marked first task. The first task is sent to the task cache space R. For example, for task 3A issued by business party 3, which is the quarantine business party, task 3A is marked according to first identity 003 of business party 1, and marked first task 3A' is obtained. And when the service party is a non-isolated service party, marking the task sent by the service party according to the third identifier to obtain a marked third task. And sending the third task to the task cache space R. For example, for the task 7A sent by the service party 7 which is a non-isolated service party, the task 7A is marked according to the first identifier all, and a marked third task 7A ″ is obtained.
The working process of the second server comprises the steps of obtaining the corresponding relation table and executing the task. The method comprises the following specific steps:
acquiring a corresponding relation table, comprising: and acquiring a corresponding relation table D from the task cache space R.
Performing tasks, including: and acquiring a first identifier or a third identifier corresponding to the second identifier of the user from the corresponding relation table D according to the determined first identifier or third identifier, acquiring a first task marked according to the first identifier or a third task marked according to the third identifier, and executing the acquired first task or third task.
Therefore, the isolation processing of tasks sent by the isolation service party is realized, the interaction difficulty between the first server and the second server is reduced, the coupling degree between the first server and the second server is improved, and the dynamic configuration of the second server is realized.
Fig. 12 illustrates a block diagram of a task processing device according to an embodiment of the present disclosure. As shown in fig. 12, the apparatus is applied to a first server of a server cluster, the server cluster includes the first server and a plurality of second servers, and the apparatus may include an isolation determination module 501, a first marking module 502, and a first sending module 503. The quarantine determination module 501 is configured to determine whether a service party is a quarantine service party when a task sent by the service party is received. The first marking module 502 is configured to obtain a marked first task according to a first identification marking task of a service party when the service party is an isolated service party. The first sending module 503 is configured to send the first task to the task cache space, so that the second server corresponding to the business party acquires and executes the first task from the task cache space.
Fig. 13 illustrates a block diagram of a task processing device according to an embodiment of the present disclosure.
In one possible implementation, as shown in fig. 13, the apparatus may further include a second marking module 504 and a second sending module 505. The second tagging module 504 is configured to determine the task as an untagged second task when the business party is a non-isolated business party. The second sending module 505 is configured to send the second task to the task cache space, so that the second server corresponding to the non-isolated service party obtains the second task from the task cache space and executes the second task.
In one possible implementation, as shown in fig. 13, the apparatus may further include a third marking module 506 and a third sending module 507. The third marking module 506 is configured to mark the task with a third identifier to obtain a marked third task when the service party is a non-isolated service party. The third sending module 507 is configured to send the third task to the task cache space, so that the second server corresponding to the non-isolated service party obtains the third task from the task cache space and executes the third task.
In a possible implementation manner, as shown in fig. 13, the apparatus may further include a request receiving module 508, a server allocating module 509, a relation table establishing module 510, and a relation table sending module 511. The request receiving module 508 is configured to determine the service party as an isolated service party and assign a corresponding first identifier to the service party when receiving an isolation request of the service party. The server allocation module 509 is configured to allocate a second server for performing a task issued by the service party to the service party according to the quarantine request. The relationship table establishing module 510 is configured to establish a correspondence table according to a first identifier of a service party and a second identifier of a second server for performing a task issued by the service party. The relation table sending module 511 is configured to store the corresponding relation table into the task cache space, so that the second server obtains the corresponding relation table from the task cache space.
With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.
It should be noted that, although the task processing device is described above by taking the above-described embodiment as an example, those skilled in the art can understand that the present disclosure should not be limited thereto. In fact, the user can flexibly set each module according to personal preference and/or actual application scene, as long as the technical scheme of the disclosure is met.
The task processing device provided by the embodiment of the disclosure, under the condition that a service party sending a task is determined to be an isolated service party, marks the task according to a first identifier of the service party, and obtains a marked first task; and sending the first task to the task cache space so that the second server corresponding to the business party acquires and executes the first task from the task cache space. The isolation processing of tasks sent by the isolation service party is realized, the interaction difficulty between the first server and the second server is reduced, the coupling degree between the first server and the second server is improved, and the dynamic configuration of the second server is realized.
Fig. 14 illustrates a block diagram of a task processing device according to an embodiment of the present disclosure. As shown in fig. 14, the apparatus is applied to any one of the second servers of a server cluster, where the server cluster includes a first server and a plurality of second servers, and the apparatus may include a business party determining module 601, a task obtaining module 602, and a task executing module 603. The service party determining module 601 is configured to determine a service party corresponding to the second server according to the second identifier of the second server and the corresponding relationship table. The task obtaining module 602 is configured to obtain a task from a business party from a task cache space of a first server. The task execution module 603 is configured to execute tasks of the business party. Wherein, the corresponding relation table comprises the corresponding relation between the identification of the service party and the identification of the second server.
Fig. 15 illustrates a block diagram of a task processing device according to an embodiment of the present disclosure.
In one possible implementation, as shown in fig. 15, the business party determining module 601 may include a first determining module 6011. The first determining module 6011 is configured to, when the second identifier exists in the correspondence table, determine the service party corresponding to the second server according to the service party identifier corresponding to the second identifier. The service party identification comprises a first identification of the isolated service party and a third identification of the non-isolated service party.
In one possible implementation, as shown in fig. 15, the business party determining module 601 may include a second determining module 6012. The second determining module 6012 is configured to, when the second identifier does not exist in the correspondence table, determine the service party that does not exist in the correspondence table as the service party corresponding to the second server. And the service party which does not exist in the corresponding relation table is a non-isolated service party.
In one possible implementation, as shown in fig. 15, the apparatus may further include a relation table obtaining module 604. The relationship table obtaining module 604 is configured to obtain a correspondence table from the task cache space.
With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.
It should be noted that, although the task processing device is described above by taking the above-described embodiment as an example, those skilled in the art can understand that the present disclosure should not be limited thereto. In fact, the user can flexibly set each module according to personal preference and/or actual application scene, as long as the technical scheme of the disclosure is met.
The task processing device provided by the embodiment of the present disclosure determines a service party corresponding to the second server according to the second identifier of the second server and the corresponding relationship table, obtains a task from the service party from the task cache space of the first server, and executes the task of the service party. The interaction difficulty between the first server and the second server is reduced, the coupling degree between the first server and the second server is improved, and the dynamic configuration of the second server is realized.
Fig. 16 shows a block diagram of a task processing device according to an embodiment of the present disclosure. For example, the apparatus 1900 may be provided as a server. Referring to FIG. 16, the device 1900 includes a processing component 1922 further including one or more processors and memory resources, represented by memory 1932, for storing instructions, e.g., applications, executable by the processing component 1922. The application programs stored in memory 1932 may include one or more modules that each correspond to a set of instructions. Further, the processing component 1922 is configured to execute instructions to perform the above-described method.
The device 1900 may also include a power component 1926 configured to perform power management of the device 1900, a wired or wireless network interface 1950 configured to connect the device 1900 to a network, and an input/output (I/O) interface 1958. The device 1900 may operate based on an operating system stored in memory 1932, such as Windows Server, Mac OS XTM, UnixTM, LinuxTM, FreeBSDTM, or the like.
In an exemplary embodiment, a non-transitory computer readable storage medium, such as the memory 1932, is also provided that includes computer program instructions executable by the processing component 1922 of the apparatus 1900 to perform the above-described methods.
The present disclosure may be systems, methods, and/or computer program products. The computer program product may include a computer-readable storage medium having computer-readable program instructions embodied thereon for causing a processor to implement various aspects of the present disclosure.
The computer readable storage medium may be a tangible device that can hold and store the instructions for use by the instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic memory device, a magnetic memory device, an optical memory device, an electromagnetic memory device, a semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical coding device, such as punch cards or in-groove projection structures having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media as used herein is not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission medium (e.g., optical pulses through a fiber optic cable), or electrical signals transmitted through electrical wires.
The computer-readable program instructions described herein may be downloaded from a computer-readable storage medium to a respective computing/processing device, or to an external computer or external storage device via a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. The network adapter card or network interface in each computing/processing device receives computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in a computer-readable storage medium in the respective computing/processing device.
The computer program instructions for carrying out operations of the present disclosure may be assembler instructions, Instruction Set Architecture (ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer-readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider). In some embodiments, the electronic circuitry that can execute the computer-readable program instructions implements aspects of the present disclosure by utilizing the state information of the computer-readable program instructions to personalize the electronic circuitry, such as a programmable logic circuit, a Field Programmable Gate Array (FPGA), or a Programmable Logic Array (PLA).
Various aspects of the present disclosure are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-readable program instructions.
These computer-readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer-readable program instructions may also be stored in a computer-readable storage medium that can direct a computer, programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer-readable medium storing the instructions comprises an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer, other programmable apparatus or other devices implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Having described embodiments of the present disclosure, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the disclosed embodiments. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terms used herein were chosen in order to best explain the principles of the embodiments, the practical application, or technical improvements to the techniques in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.
Claims (8)
1. A task processing method applied to a first server of a server cluster, wherein the server cluster comprises the first server and a plurality of second servers, and the method comprises the following steps:
when an isolation request of a service party is received, determining the service party as an isolation service party, and distributing a corresponding first identifier for the service party;
according to the isolation request, distributing a second server for executing the task sent by the service party to the service party;
establishing a corresponding relation table according to the first identifier of the service party and a second identifier of a second server for executing the task sent by the service party;
storing the corresponding relation table into the task cache space so that the second server can obtain the corresponding relation table from the task cache space;
when a task sent by a service party is received, judging whether the service party is an isolated service party or not;
when the service party is an isolation service party, marking the task according to a first identifier of the service party to obtain a marked first task;
and sending the first task to a task cache space so that a second server corresponding to the service party acquires and executes the first task from the task cache space.
2. The method of claim 1, further comprising:
when the service party is a non-isolated service party, determining the task as an unmarked second task;
and sending the second task to a task cache space so that a second server corresponding to a non-isolated service party acquires and executes the second task from the task cache space.
3. The method of claim 1, further comprising:
when the service party is a non-isolated service party, marking the task by adopting a third identifier to obtain a marked third task;
and sending the third task to a task cache space so that a second server corresponding to a non-isolated service party acquires and executes the third task from the task cache space.
4. A task processing apparatus applied to a first server of a server cluster including the first server and a plurality of second servers, the apparatus comprising:
the request receiving module is used for determining a service party as an isolated service party and distributing a corresponding first identifier for the service party when receiving an isolation request of the service party;
the server distribution module is used for distributing a second server for executing the task sent by the service party to the service party according to the isolation request;
the relation table establishing module is used for establishing a corresponding relation table according to the first identifier of the service party and a second identifier of a second server for executing the task sent by the service party;
the relation table sending module is used for storing the corresponding relation table into the task cache space so that the second server can obtain the corresponding relation table from the task cache space;
the isolation determination module is used for judging whether the service party is an isolation service party or not when receiving a task sent by the service party;
the first marking module is used for marking the task according to the first identification of the service party to obtain a marked first task when the service party is an isolated service party;
and the first sending module is used for sending the first task to a task cache space so that a second server corresponding to the service party acquires and executes the first task from the task cache space.
5. The apparatus of claim 4, further comprising:
the second marking module is used for determining the task as an unmarked second task when the service party is a non-isolated service party;
and the second sending module is used for sending the second task to a task cache space so that a second server corresponding to the non-isolated service party acquires and executes the second task from the task cache space.
6. The apparatus of claim 4, further comprising:
the third marking module is used for marking the task by adopting a third identifier when the service party is a non-isolated service party to obtain a marked third task;
and the third sending module is used for sending the third task to a task cache space so that a second server corresponding to the non-isolated service party acquires and executes the third task from the task cache space.
7. A task processing apparatus, comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to perform the method of any one of claims 1 to 3.
8. A non-transitory computer readable storage medium having stored thereon computer program instructions, wherein the computer program instructions, when executed by a processor, implement the method of any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810258039.1A CN110308976B (en) | 2018-03-27 | 2018-03-27 | Task processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810258039.1A CN110308976B (en) | 2018-03-27 | 2018-03-27 | Task processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110308976A CN110308976A (en) | 2019-10-08 |
| CN110308976B true CN110308976B (en) | 2022-02-11 |
Family
ID=68074066
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810258039.1A Active CN110308976B (en) | 2018-03-27 | 2018-03-27 | Task processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110308976B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111125223B (en) * | 2019-12-20 | 2023-10-10 | 北京爱奇艺科技有限公司 | Database connection pool updating method and device |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7437725B1 (en) * | 1999-01-04 | 2008-10-14 | General Electric Company | Processing techniques for servers handling client/server traffic and communications |
| US7644188B2 (en) * | 2002-02-25 | 2010-01-05 | Intel Corporation | Distributing tasks in data communications |
| CN102404786A (en) * | 2010-09-14 | 2012-04-04 | 中国移动通信集团江苏有限公司 | Method and device for controlling service jam |
| CN105204941A (en) * | 2015-08-18 | 2015-12-30 | 耿懿超 | Data processing method and data processing device |
| CN106101074A (en) * | 2016-05-31 | 2016-11-09 | 北京大学 | A kind of sacurity dispatching method based on user's classification towards big data platform |
| CN106406983A (en) * | 2015-07-27 | 2017-02-15 | 阿里巴巴集团控股有限公司 | Task scheduling method and device in cluster |
| CN107341051A (en) * | 2016-05-03 | 2017-11-10 | 北京京东尚科信息技术有限公司 | Cluster task coordination approach, system and device |
| CN107423131A (en) * | 2017-03-29 | 2017-12-01 | 努比亚技术有限公司 | A kind of sharing method and server |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106888245B (en) * | 2016-06-07 | 2020-04-24 | 阿里巴巴集团控股有限公司 | Data processing method, device and system |
-
2018
- 2018-03-27 CN CN201810258039.1A patent/CN110308976B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7437725B1 (en) * | 1999-01-04 | 2008-10-14 | General Electric Company | Processing techniques for servers handling client/server traffic and communications |
| US7644188B2 (en) * | 2002-02-25 | 2010-01-05 | Intel Corporation | Distributing tasks in data communications |
| CN102404786A (en) * | 2010-09-14 | 2012-04-04 | 中国移动通信集团江苏有限公司 | Method and device for controlling service jam |
| CN106406983A (en) * | 2015-07-27 | 2017-02-15 | 阿里巴巴集团控股有限公司 | Task scheduling method and device in cluster |
| CN105204941A (en) * | 2015-08-18 | 2015-12-30 | 耿懿超 | Data processing method and data processing device |
| CN107341051A (en) * | 2016-05-03 | 2017-11-10 | 北京京东尚科信息技术有限公司 | Cluster task coordination approach, system and device |
| CN106101074A (en) * | 2016-05-31 | 2016-11-09 | 北京大学 | A kind of sacurity dispatching method based on user's classification towards big data platform |
| CN107423131A (en) * | 2017-03-29 | 2017-12-01 | 努比亚技术有限公司 | A kind of sharing method and server |
Non-Patent Citations (1)
| Title |
|---|
| 网格计算中Min-Min算法及改进算法的研究;蒋瀚洋，等；;《计算机时代》;20100131(第1期);39-41 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110308976A (en) | 2019-10-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110896355B (en) | Network slice selection method and device | |
| CN111124604B (en) | Method, device, equipment and storage medium for distributing pod IP address | |
| KR102247993B1 (en) | Network slice management method, management unit and system | |
| US10924966B2 (en) | Management method, management unit, and system | |
| CN109155994B (en) | User plane resource management method, user plane network element and control plane network element | |
| JP2013511207A5 (en) | ||
| CN108733449B (en) | Method, apparatus, and computer-readable storage medium for managing virtual machines | |
| CN105323229A (en) | CPE-based data transmission method, network element, platform and system | |
| EP3261299A1 (en) | Method and apparatus for establishing network service instance | |
| CN110308976B (en) | Task processing method and device | |
| CN104426816A (en) | Virtual machine communication method and device | |
| CN113423120A (en) | Data distribution processing method and device based on private network terminal and electronic equipment | |
| CN113162836A (en) | Virtual local area network communication method and device, cloud server, medium and electronic equipment | |
| CN107547437B (en) | Application identification method and device | |
| US10528625B2 (en) | Client cloud synchronizer | |
| CN111274017A (en) | Resource processing method and device, electronic equipment and storage medium | |
| CN113904871B (en) | Access method of network slice, PCF entity, terminal and communication system | |
| CN112650710B (en) | Data migration sending method and device, storage medium and electronic device | |
| CN113986995A (en) | Request distribution method and device, storage medium and electronic equipment | |
| CN114257545A (en) | Message forwarding method and device | |
| CN111294888B (en) | Network selection method and device | |
| CN107493216B (en) | Controller area network CAN bus data processing method and device | |
| EP3040891A1 (en) | Method for providing information to determine a graph associated with a data item | |
| CN114586398A (en) | Leaser management | |
| CN111324778A (en) | Data and service processing method and device and electronic equipment |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200508 Address after: 310052 room 508, floor 5, building 4, No. 699, Wangshang Road, Changhe street, Binjiang District, Hangzhou City, Zhejiang Province Applicant after: Alibaba (China) Co.,Ltd. Address before: 100080 Beijing Haidian District city Haidian street A Sinosteel International Plaza No. 8 block 5 layer A, C Applicant before: Youku network technology (Beijing) Co., Ltd |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |