CN110928667A - Task scheduling method and device, electronic equipment and storage medium - Google Patents
Task scheduling method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN110928667A CN110928667A CN201911248660.0A CN201911248660A CN110928667A CN 110928667 A CN110928667 A CN 110928667A CN 201911248660 A CN201911248660 A CN 201911248660A CN 110928667 A CN110928667 A CN 110928667A
- Authority
- CN
- China
- Prior art keywords
- node
- code
- nodes
- task
- level
- 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.)
- Granted
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
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mobile Radio Communication Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application relates to a task scheduling method and device, electronic equipment and a storage medium, and belongs to the technical field of computers. The method comprises the following steps: receiving a first operation input by a user on a current display interface aiming at a relation label, wherein the relation label is used for representing the relation between a node of a task to be forwarded and a self node in a cluster; responding to the first operation, acquiring a node code corresponding to the node of the node, and acquiring and displaying all nodes meeting the relationship label according to the node code, wherein different fields in the node code represent different levels, and different numerical values under the same field represent different numbers; receiving a second operation of a target node selected by a user from all nodes meeting the relation label; and responding to the second operation, and sending the corresponding task to the target node. And the task scheduling is carried out based on a new coding mode, so that the calculation time for obtaining all the nodes meeting the relation labels can be reduced, the efficiency is improved, and the task scheduling in the nodes is smoother.
Description
Technical Field
The application belongs to the technical field of computers, and particularly relates to a task scheduling method and device, electronic equipment and a storage medium.
Background
In the operation and development process of each group/cluster (such as organization), the service types of each group/cluster can be gradually enriched, and accordingly, more and more nodes (such as mechanisms) in the cluster are needed, the relationship is more and more complex, a plurality of tasks are needed to be circulated and scheduled in the cluster, and each node in the cluster is instructed to complete the own work. For example, a cluster with a relatively simple internal structure: there are 4 levels of this cluster, the cluster architecture diagram of which is shown in fig. 1. In the cluster shown in fig. 1, there are 18 nodes in total at 4 levels, and task scheduling needs to be performed in the cluster in order to instruct each node to complete corresponding work. In order to smoothly perform task scheduling, each node in the cluster needs to be encoded, and during the encoding process, the upper-level and lower-level relationships of each node need to be clarified, and the encoding result of each node in the cluster is also shown in fig. 2 by taking the cluster as an example.
When a task is scheduled in a cluster, a node code table is searched to determine a scheduling target, and when a directly subordinate node is determined, for example, taking node C (code 03) as an example, a node having "upper node code" of "03" is searched directly in a data table, that is, it can be confirmed that the subordinate node is: node G (code 07), and node H (code 08). For example, when determining the directly higher-level structure, taking node C (code 03) as an example, the data table is directly searched for "node code" of "06", and it can be confirmed that the directly higher-level node is: node B (code 02).
Disclosure of Invention
In view of this, an object of the present application is to provide a task scheduling method, a task scheduling apparatus, an electronic device, and a storage medium, so as to solve the problem that the existing task scheduling is time-consuming and relatively inefficient.
The embodiment of the application is realized as follows:
in a first aspect, an embodiment of the present application provides a task scheduling method, where the method includes: receiving a first operation input by a user on a current display interface aiming at a relation label, wherein the relation label is used for representing the relation between a node of a task to be forwarded and a self node which belong to a cluster in the cluster; responding to the first operation, acquiring a node code corresponding to the node of the node, and acquiring and displaying all nodes meeting the relationship label according to the node code, wherein different fields in the node code represent different levels, and different numerical values in the same field represent different numbers; receiving a second operation of a target node selected by a user from all nodes meeting the relationship label; and responding to the second operation, and sending a corresponding task to the target node. In the embodiment of the application, when the nodes in the cluster are coded, the strengthening codes play a role in task scheduling, the codes of all the nodes are based on the codes of the nodes at the upper level, the codes of the nodes at the level are added, different fields in the codes finally represent different levels, different numerical values (numbers) under the same field represent different numbers (sequences), and then when the tasks are scheduled, the calculation time for acquiring all the nodes meeting the relation labels can be reduced, the pressure of a database is reduced, the efficiency is improved, and the task scheduling in the nodes is smoother.
With reference to a possible implementation manner provided by the embodiment of the first aspect, when the node representing the task to be forwarded is a subordinate node of its own node, acquiring, according to the node code, all nodes that satisfy the relationship label, including: determining the target level of the self node according to the node code; and searching a node of which the code is the same as the value in the field of the target level, the value in the field of the next level of the target level is not zero, and the value in other fields with lower levels than the next level is zero from a preset node code table. In the embodiment of the application, when the relation label represents that the node of the task to be forwarded is the directly subordinate node of the own node, database operation is not needed, the directly subordinate node can be conveniently confirmed according to the node code, that is, the subordinate node is the node (the code satisfies the condition that the value in the field of the target level is the same as the value in the field of the target level, the value in the field of the next level of the target level is not zero, and the values in other fields of the levels lower than the next level are zero), and then the node satisfying the requirement is obtained by looking up the table, so that all nodes satisfying the relation label can be quickly obtained.
With reference to a possible implementation manner provided by the embodiment of the first aspect, when the node representing the task to be forwarded is any subordinate node of its own node, acquiring, according to the node code, all nodes that satisfy the relationship label, including: determining the target level of the self node according to the node code; and searching a node of which the code is the same as the numerical value in the field of the target level and the code is not the same as the node code from a preset node code table. In the embodiment of the application, when the relation label represents that the node of the task to be forwarded is any subordinate node of the node, database operation is not needed, any subordinate node can be conveniently confirmed according to the node code, namely any subordinate node is (the code obtains all nodes meeting the relation label, including determining the target level of the node according to the node code, searching the node which meets the requirement that the value in the field of the target level is the same and the code is not the same as the node code from a preset node code table), and then obtaining the node meeting the requirement through table searching, so that all nodes meeting the relation label can be quickly obtained.
With reference to a possible implementation manner provided by the embodiment of the first aspect, when the relationship label represents that the node of the task to be forwarded is a hierarchical node that directly belongs to the same higher-level node as the self node, acquiring all nodes that satisfy the relationship label according to the node code includes: determining the target level of the self node according to the node code; and searching a preset node coding table for nodes of which the codes meet the conditions that the codes are the same as the numerical value in the field of the last level of the target level, are different from the numerical value in the field of the target level and are not zero, and the numerical values in other fields of which the levels are lower than the target level are zero. In the embodiment of the application, when the relation label represents that the node of the task to be forwarded is a level node directly belonging to the same upper node as the self node, database operation is not required, the level node directly belonging to the same upper node as the self node can be conveniently confirmed according to the node code, that is, the level node meeting the requirement is the node (the code meets the condition that the value in the field of the upper level of the target level is the same as the value in the field of the upper level of the target level, the value in the field of the target level is different from the value in the field of the target level and is not zero, and the value in other fields of the lower level than the target level is zero), and then the node meeting the requirement is obtained by looking up a table, so that all nodes meeting the relation label can be quickly obtained.
With reference to a possible implementation manner provided by the embodiment of the first aspect, when the node representing the task to be forwarded is a directly subordinate lower node of another node having a same level as a directly subordinate upper node of the own node, acquiring, according to the node code, all nodes satisfying the relationship label, including: determining the target level of the self node according to the node code; and searching nodes of which the codes meet the conditions that the numerical values in the fields of which the levels are not lower than the target level are not zero, the numerical values in other fields of which the levels are lower than the target level are not zero and the codes are not the same as the codes of the nodes from a preset node code table. In the embodiment of the application, when the relation label represents that the node of the task to be forwarded is the directly subordinate node of other nodes with the same level as the directly subordinate superior level of the self node, database operation is not needed, the directly subordinate nodes of other nodes with the same level as the directly subordinate superior level of the self node can be conveniently confirmed according to the node code, namely, the level node meeting the requirement is (the value in the field with the code meeting the level not lower than the target level is not zero, the value in the other field with the level lower than the target level is not zero and the code is not the same as the node code), then the node meeting the requirement is obtained through table lookup, and all the nodes meeting the relation label can be quickly obtained.
In combination with a possible implementation manner provided by the embodiment of the first aspect, the method further includes: and responding to the task submitting operation input by the user, determining the directly superior node of the self node according to the node code, and submitting the task to the directly superior node. In the embodiment of the application, when the task is submitted, the database does not need to be searched, the directly superior node of the node can be directly determined according to the node code, and the task efficiency is further improved.
With reference to a possible implementation manner provided by the embodiment of the first aspect, determining a directly superior node of the self node according to the node code includes: determining the target level of the self node according to the node code; and setting the numerical value in the field of the target level in the node code to zero to obtain the directly superior node of the self node. In the embodiment of the application, when the directly-subordinate upper node of the node is determined, the value in the field of the target level in the node coding is directly set to zero.
In a second aspect, an embodiment of the present application further provides a task scheduling apparatus, where the apparatus includes: the device comprises a first receiving module, a first response module, a second receiving module and a second response module; the first receiving module is used for receiving a first operation input by a user on a current display interface aiming at a relation label, wherein the relation label is used for representing the relation between a node belonging to a task to be forwarded in a cluster and a node of the node; the first response module is used for responding to the first operation, acquiring a node code corresponding to the node per se, and acquiring and displaying all nodes meeting the relationship label according to the node code, wherein different fields in the node code represent different levels, and different numerical values under the same field represent different sequences; a second receiving module, configured to receive a second operation of a target node selected by a user from all nodes satisfying the relationship label; and the second response module is used for responding to the second operation and sending the corresponding task to the target node.
In a third aspect, an embodiment of the present application further provides an electronic device, including: a memory and a processor, the memory and the processor connected; the memory is used for storing programs; the processor is configured to invoke a program stored in the memory to perform the method according to the first aspect and/or any one of the possible implementation manners provided in connection with the first aspect.
In a fourth aspect, embodiments of the present application further provide a storage medium, on which a computer program is stored, where the computer program is executed by a computer to perform the method provided in the foregoing first aspect and/or any one of the possible implementation manners provided in connection with the first aspect.
Additional features and advantages of the application will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the embodiments of the application. The objectives and other advantages of the application may be realized and attained by the structure particularly pointed out in the written description and drawings.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts. The foregoing and other objects, features and advantages of the application will be apparent from the accompanying drawings. Like reference numerals refer to like parts throughout the drawings. The drawings are not intended to be to scale as practical, emphasis instead being placed upon illustrating the subject matter of the present application.
Fig. 1 shows a topological diagram of relationships between nodes in a cluster in the prior art.
Fig. 2 is a schematic diagram illustrating an encoding result of encoding each node in the cluster in fig. 1 by using an existing encoding rule.
Fig. 3 is a schematic diagram illustrating an effect obtained by applying a new coding to each node in the cluster in fig. 1 by using the coding method provided by the embodiment of the present application.
Fig. 4 is a schematic diagram illustrating a topology of relationships between nodes in another cluster according to an embodiment of the present application.
Fig. 5 is a flowchart illustrating a task scheduling method according to an example of the present application.
Fig. 6 shows a block diagram of a task scheduling device provided in an example of the present application.
Fig. 7 shows a schematic structural diagram of an electronic device provided in an example of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures. Meanwhile, relational terms such as "first," "second," and the like may be used solely in the description herein to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
Further, the term "and/or" in the present application is only one kind of association relationship describing the associated object, and means that three kinds of relationships may exist, for example, a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone.
In view of the problems of time consumption and relatively low efficiency of the conventional task scheduling, the inventors have found that, currently, when a node is directly subordinate or subordinate, it is necessary to search in a database. When determining any lower structure of a node, the process is more complicated, and taking node C (code 03) shown in fig. 2 as an example, a node having "upper node code" of "03" is first directly searched in the data table, and it can be confirmed that the lower node is: node G (code 07), node H (code 08); next, a node having "upper node code" of "07 or 08" is searched, and all search results are merged to confirm all nodes in the lower stage. When the level forwarding in the node at the same upper level is to be realized, taking node F (code 06) as an example, the level node at the same upper level is: however, in order to confirm the two nodes, the node D and the node E need to search the upper node first and then search all the nodes below the upper node, so that confirmation can be performed. If it is to implement horizontal forwarding across upper nodes, this operation is complex, taking node F (code 06) as an example, and the horizontal nodes across upper nodes are: node D, node E, node G, and node H. However, in order to confirm the four nodes, the upper node needs to be continuously searched upwards until the node a (code 01) is searched to confirm the level of the node F; then, starting from node A (code 01), all nodes at the level are searched downwards, and confirmation is carried out.
The inventor finds that in the current coding mode, the following disadvantages exist in performing the above logical operations:
1. when the nodes in the cluster are more complex or the tasks to be scheduled are more and more, the pressure of the database is increased, and the task scheduling efficiency is reduced. 2. When the level of a certain node is determined each time, multiple upward searches are needed until the first node is searched, and the level of the node can not be determined. 3. When all subordinate nodes of a certain node are confirmed each time, all the subordinate nodes can be traversed only by continuously traversing downwards and searching for many times, so that the mode is too complex, and the pressure of a database is greatly increased.
It should be noted that the defects existing in the above solutions are the results obtained after the inventor has practiced and studied carefully, and therefore, the discovery process of the above problems and the solutions proposed by the following embodiments of the present application to the above problems should be the contribution of the inventor to the present application in the process of the present application.
In view of this, the embodiment of the present application provides a new node encoding method, which is based on the new node encoding method to optimize the problems existing in the original technology, reduce the computation time, and reduce the database pressure, thereby improving the efficiency and making the task scheduling in the node smoother. The idea of the new node coding mode is that each field represents the coding in the level where the new node is located, meanwhile, the coding of each node is added with the coding of the node at the level on the basis of the coding of the node at the upper level, finally, different fields in the coding represent different levels, and different numerical values (numbers) under the same field represent different numbers (sequences). The encoding result of encoding each node in the cluster in fig. 1 by using the encoding method in the present application is shown in table 1.
TABLE 1
For ease of understanding, a new code is added to the node architecture diagram of the cluster, a schematic diagram of which is shown in fig. 3. Under the new coding mode, the defects of the current coding in executing the following logic operations can be easily solved:
1. when confirming the subordinate node of a certain node: in this way, it is convenient to confirm the subordinate nodes directly, taking node C (code 1200) as an example, and only needs to confirm that: all nodes with 1 st bit being 1, 2 nd bit being 2, 3 rd bit not being 0, and 4 th bit being 0 are directly subordinate nodes of the node C (code 1200).
2. When confirming the directly superior node of a certain node: in this way, it is very convenient to confirm the upper node, and it is not necessary to perform database operation, taking node F (code 1130) as an example, it is only necessary to set the value whose last bit is not 0 to 0, so that the code of the upper node is 1100, and the corresponding node is node B.
3. When confirming the level of a certain node: in this way, without the need for database operations, the level can be confirmed based on the number of bits of the last digit other than 0, for example node F (code 1130), where the last digit other than 0 is bit 3 and all the levels are level 3.
4. When all subordinate nodes of a certain node are confirmed: in this way, all nodes under a certain node can be conveniently found, taking node C (code 1200) as an example, all nodes with the 1 st bit and the 2 nd bit being 12 are directly searched, and 1200 is excluded, that is, all nodes under the node are obtained.
It can be seen that, after the new coding mode provided by the present application is adopted, the defects existing in the current coding in executing the above 4 logic operations can be easily solved. It should be noted that, in the above example, since there are only 4 levels in the cluster and the number of the directly subordinate nodes of a certain node is less than 10, the node code in the above example has 4 fields, one field represents 1 bit, that is, the 1 st field (the first bit) represents a first-level node, the second field (the 2 nd bit) represents a second-level node, the third field (the 3 rd bit) represents a third-level node, and the fourth field (the 4 th bit) represents a fourth-level node.
When the level in the cluster is increased and/or the number of the directly subordinate nodes of a certain node is more than 10, the new coding mode provided by the application is also applicable. A second example will be given below, in which the cluster in this example has 5 levels, and a number of third-level nodes under the jurisdiction of a certain second-level node is larger, and is 15, and a schematic diagram thereof is shown in fig. 4. The coding of each node in the cluster of fig. 4 is shown in tabular form as shown in table 2:
TABLE 2
Since the number of nodes under the jurisdiction of B2 exceeds 10, one digit cannot complete the coding of the node at this stage, so two digits are adopted for representation (it is understood that when the number of nodes exceeds 100, 3 digits can be adopted for representation). It can be seen that the coding of each node is 6 bits, since the node level shown is 5 levels, corresponding to 5 fields, the first field in the coding (bit 1) representing a level one node, the second field in the coding (bit 2) representing a level two node, the third field in the coding (bits 3, 4) representing a level three node, the fourth field in the coding (bit 5) representing a level four node, and the fifth field in the coding (bit 6) representing a level five node. It should be noted that although only the nodes under B2 have more than 10 nodes, all the nodes at the third level are represented by two digits for flexible scheduling and to ensure uniformity of coding of all the nodes. It can be seen that different fields represent different levels, the number of bits corresponding to a field may be 1 bit, or 2 bits or more, depending on the number of nodes in the level, and if the number is less than 10, the corresponding number of bits is 1 bit, and if the number is greater than or equal to 10 and less than 100, the corresponding number of bits is 2 bits.
Under the new coding mode, the defects of the current coding in executing the following logic operations can be easily solved:
1. when confirming the subordinate node of a certain node: in this way, it is easy to confirm the subordinate nodes directly, for example, B2 (code 120000), and only the following codes need to be confirmed: all nodes with 1 st bit 1, 2 nd bit 2, 3 rd and 4 th bits not 0, 5 th bit 0 and 6 th bit 0 are the direct subordinate nodes of B2 (code 120000), i.e. 120100-121500.
2. When confirming the directly superior node of a certain node: in this way, the superordinate node can be easily identified without performing database operation, and for example, D6 (code 121310), only the number whose last bit is not 0 needs to be set to 0, so that the superordinate node code is 121300, and the node is node C6.
3. When confirming the level of a certain node: in this way, the database operation is not required, and the level can be confirmed only according to the number of digits of the number whose last digit is not 0, for example, the node D6 (code 121310), and the last digit which is not 0 is the 5 th digit, which indicates that the level is the fourth level.
4. When all subordinate nodes of a certain node are confirmed: in this way, all nodes under a certain node can be conveniently found, taking B2 (code 120000) as an example, all nodes with 12 at 1 st and 2 nd are directly searched, and 120000 is excluded, that is, all nodes under the node are found.
Based on the new coding mode provided by the application, when task scheduling is carried out, the calculation time can be reduced, and the database pressure is reduced, so that the efficiency is improved, and the task scheduling in the node is smoother. Referring to fig. 5, steps included in a task scheduling method according to an embodiment of the present application will be described with reference to fig. 5.
Step S101: and receiving a first operation input by a user for the relation label on the current display interface.
The corresponding authorities of the nodes at different levels in the cluster are different, each node is provided with different codes, when a certain node receives a task distributed by a superior node, the task can be completed by the node, and when the task is not processed by the node, the task can be dispatched to a subordinate node or a level node with the same level as the node. When a user wants to perform task scheduling on a task to be processed, the user can schedule the task to be processed to a lower-level node or a level node with the same level as the node of the user through logging in a task system (wherein, the login name can be a code corresponding to the node). During task scheduling, the relationship label can be operated on the current display interface, for example, the relationship label is clicked.
The relationship label is used for representing the relationship between the node belonging to the same cluster and the task to be forwarded and the node in the cluster. The number of the relation labels displayed on the current display interface can be 1 or more (2 or more), the relations represented by different relation labels are different, and when different relation labels are clicked, the displayed nodes are different.
Step S102: and responding to the first operation, acquiring the node code corresponding to the node of the node, and acquiring and displaying all the nodes meeting the relationship label according to the node code.
And responding to a first operation input by a user aiming at the relation label on the current display interface, acquiring a node code corresponding to the node of the user, and acquiring and displaying all nodes meeting the relation label according to the node code. Different fields in the node code represent different levels, and different numerical values in the same field represent different numbers (sequences). For example, taking the cluster shown in fig. 3 as an example, assuming that the current node is node C (code 1200), the node code corresponding to the node itself is obtained as 1200 in response to the first operation input by the user for the relationship tag on the current display interface.
As an implementation manner, when the node representing the task to be forwarded is a subordinate node of its own node (that is, when the task is forwarded to the subordinate node), the process of acquiring all nodes satisfying the relationship label according to the node code may be: determining the target level of the self node according to the node code; and searching a node of which the code is the same as the value in the field of the target level, the value in the field of the next level of the target level is not zero, and the value in other fields with lower levels than the next level is zero from a preset node code table. Taking the node C (code 1200) shown in fig. 3 as an example, since the second field (i.e. 2 nd bit) in the code of the node C is 2, the target level is 2, during the search, all nodes whose 2 nd bit is 2, 3 rd bit is not 0, and 4 th bit is 0 are searched from the preset node code table (as shown in table 1), and thus the directly subordinate nodes are: node G (1210), node H (1220). Taking the node B1 (code 120000) shown in fig. 4 as an example, since the second field (i.e., bit 2) in the code of the node B1 is 2, the target level is 2, and when searching, the 2 nd bit is 2, the value in the fields (bits 3 and 4) of the next level of the target level is not 0, the 5 th bit is 0, and the 6 th bit is 0, all nodes are searched from the preset node code table (see table 2), so that the nodes whose directly subordinate nodes are C4-C18 (codes 120100-121500) can be obtained.
As another embodiment, when the node representing the task to be forwarded is any subordinate node of its own node (that is, when the task is forwarded to any subordinate node), the process of acquiring all nodes satisfying the relationship label according to the node code may be: determining the target level of the self node according to the node code; and searching a node of which the code is the same as the numerical value in the field of the target level and the code is not the same as the node code from a preset node code table. Taking the node C (code 1200) shown in fig. 3 as an example, since the second field (i.e. 2 nd bit) in the code of the node C is 2, the target level is 2, when retrieving, all nodes whose 2 nd bit is 2 are directly retrieved from the preset node code table (as table 1), and 1200 is excluded, so that any lower-level node of the node C is obtained as: node G (1210), node H (1220), node O (1211), node P (1212), node Q (1221), and node R (1222). Taking the node B1 (encoding 110000) shown in fig. 4 as an example, since the second field (i.e., bit 2) in the encoding of the node B1 is 2, the target level is 2, during the retrieval, all nodes whose bit 2 is 1 are retrieved from the preset node encoding table (such as table 2), and 110000 is excluded, so that any next-level node thereof can be obtained as: c1(110100), C2(110200), C3(110300), D1(110110), D2(110120), D3(110310), D4(110320), D5 (110330).
As another embodiment, when the node of the task to be forwarded is a hierarchical node directly belonging to the same higher-level node as the node itself (that is, when the hierarchical forwarding task in the same higher-level node is implemented), the process of obtaining all nodes satisfying the relationship label according to the node code may be: determining the target level of the self node according to the node code; and searching a preset node coding table for nodes of which the codes meet the conditions that the codes are the same as the numerical value in the field of the last level of the target level, are different from the numerical value in the field of the target level and are not zero, and the numerical values in other fields of which the levels are lower than the target level are zero. Taking node F (code 1130) in fig. 3 as an example, the same level nodes in the upper level nodes are: node D (encoding 1110), node E (encoding 1120). Since the third field (i.e., the third bit) in the code of the node F is 3, the target level is 3, and when retrieving, all nodes having the same value (i.e., the 2 nd bit is 1), the 3 rd bit is not 3 and not 0, and the 4 th bit is 0, as the value in the field of the previous level of the target level, are directly retrieved from the preset node code table (e.g., table 1), so as to obtain the level nodes in the same previous level node. Taking node D6 (code 121310) shown in fig. 4 as an example, the same level nodes in the upper level nodes are: d7 (code 121320), D8 (code 121330). Since the 5 th bit in the code of the node D6 is 1, the level thereof is the fourth level, and during the search, the node whose value (3 rd and 4 th bits) in the third field is 13, the 5 th bit is not 1 and not 0, and the 6 th bit is 0 is searched from the preset node code table (e.g. table 2), so as to obtain the level node in the same upper level node.
As another embodiment, when the node of the task to be forwarded is represented by a relationship label and is a subordinate node of another node having the same level as the subordinate higher level of the node itself (that is, when the task is forwarded across the higher level nodes), a process of acquiring all nodes satisfying the relationship label according to the node code may be: determining the target level of the self node according to the node code; and searching nodes of which the codes meet the conditions that the numerical values in the fields of which the levels are not lower than the target level are not zero, the numerical values in other fields of which the levels are lower than the target level are not zero and the codes are not the same as the codes of the nodes from a preset node code table. Taking node F (code 1130) shown in fig. 3 as an example, according to the node code, it can be confirmed that the node is a level 3 node (since the third field (i.e. the third bit) in the code of node F is 3, the target level is 3), and when the search is performed, all the level three nodes are directly searched from the preset node code table (as shown in table 1), that is: the 1 st node is not 0, the 2 nd node is not 0, the 3 rd node is not 0, and the 4 th node is 0, excluding 1130, that is, all the hierarchical nodes across the upper nodes, that is, the node D (code 1110), the node E (code 1120), the node G (code 1210), and the node H (code 1220) are obtained. Taking node D6 (code 121310) shown in fig. 4 as an example, according to the node code, the node can be identified as the level 4 node, and when the node is retrieved, all the level 4 nodes are retrieved directly from the preset node code table (as shown in table 2), that is: the 1 st node is not zero, the 2 nd node is not zero, the 3 rd and 4 th nodes are not zero, the 5 th node is not 0, and the 6 th node is 0, excluding 121310, that is, all the hierarchical nodes across the superior node, that is, the node D1 (coding 110110), the node D2 (coding 110120), the node D3 (coding 110310), the node D4 (coding 110320), the node D5 (coding 110330), the node D7 (coding 121320), and the node D8 (coding 121330) are obtained.
Of course, it can be understood that only 4 relationship labels representing different relationships are shown, and of course, different relationship labels may also be combined, for example, the relationship label representing the node to be forwarded as the directly subordinate node of the node itself and the relationship label representing the node to be forwarded as any subordinate node of the node itself are combined. At this time, a node whose code satisfies the same value in the field of the target level as the node code of the node itself and whose code is not the same as the node code is displayed on the display interface, for example, taking node C (code 1200) as an example, at this time, the display interface displays: node G (1210), node H (1220), node O (1211), node P (1212), node Q (1221), and node R (1222).
Step S103: and receiving a second operation of a target node selected by the user from all the nodes meeting the relationship label.
After all the nodes meeting the relation labels are obtained and displayed according to the node codes corresponding to the nodes, the user can select an object for forwarding the task to be processed, and the node selected by the user is the target node.
The number of the target nodes is at least one, and if the relationship label represents that the node of the task to be forwarded is any subordinate node of its own node, taking node B1 (code 110000) as an example, then any subordinate node thereof is: c1(110100), C2(110200), C3(110300), D1(110110), D2(110120), D3(110310), D4(110320), and D5(110330), and assuming that the nodes selected by the user are D1(110110) and D2(110120), the target nodes are D1(110110) and D2 (110120).
Step S104: and responding to the second operation, and sending a corresponding task to the target node.
And responding to a second operation of a target node selected by the user from all nodes meeting the relation label, and sending a corresponding task to the target node.
Two core operations to be executed in task scheduling are task forwarding and task submission. When a task is submitted, the task is generally submitted to a directly subordinate superior node, and after the task is submitted, the task is transferred to the superior node for auditing, so that the method further comprises the following steps: and responding to the task submitting operation input by the user, determining the directly superior node of the self node according to the node code, and submitting the task to the directly superior node.
The process of determining the directly superior node of the self node according to the node code may be: determining the target level of the self node according to the node code; and setting the numerical value in the field of the target level in the node code to zero to obtain the directly superior node of the self node. Taking node F (code 1130) as an example, the task submission can be completed by directly confirming its upper node as 1100 without searching a preset node code table.
The task scheduling method provided by the embodiment of the application can be applied to two different architecture environments, namely, a CS (Client/Server) architecture or a BS (Browser/Server) architecture. Next, hardware deployment of two application scenarios is described with reference to the implementation of the task scheduling method according to the embodiment of the present application.
When the CS architecture is adopted, the corresponding task scheduling system includes: a server and a client. In the implementation of the application, the number of the clients is at least one, and each client is in communication connection with the server to perform data interaction. The client may be an Application (APP) installed on the electronic device and corresponding to the server, or a fixed computer terminal or a mobile phone terminal.
In the implementation mode, the client receives a first operation input by a user aiming at the relation label on the current display interface and sends the first operation to the server, namely, the server receives the first operation input by the user aiming at the relation label on the current display interface through the client; the server responds to the first operation, acquires the node codes corresponding to the self nodes, acquires all the nodes meeting the relationship labels according to the node codes, and simultaneously sends all the nodes meeting the relationship labels to the client for display, namely the server responds to the first operation and indicates the client to display all the nodes meeting the relationship labels; and the client receives second operation of a target node selected by the user from all the nodes meeting the relationship label and sends the second operation to the server, and the server responds to the second operation and sends a corresponding task to the target node. In the implementation flow in the application scenario, detailed implementation manners of each step involved in the implementation flow have been described in detail in the foregoing method embodiments, and for brevity of the description, descriptions are not repeated here.
When the BS architecture is adopted, the corresponding task scheduling system includes: a browser and a server, in which the server and the browser communicate with each other through a network protocol, such as HyperText transfer protocol (HTTP).
In this embodiment, different users can log in the browser through various electronic devices (including computers, mobile phones, etc.), and perform information interaction with the server through the browser. For example, after a user logs in a server through a browser, a displayed interface sends a first operation input by the user for a relationship tag on a current display interface to the server, that is, the server receives the first operation input by the user for the relationship tag on the current display interface through the browser; the server responds to the first operation, acquires the node codes corresponding to the self nodes, acquires all the nodes meeting the relationship labels according to the node codes, and simultaneously sends all the nodes meeting the relationship labels to the browser for display, namely the server responds to the first operation and indicates the browser to display all the nodes meeting the relationship labels; and the browser receives second operation of a target node selected by the user from all the nodes meeting the relationship label and sends the second operation to the server, and the server responds to the second operation and sends a corresponding task to the target node. In the implementation flow in the application scenario, detailed implementation manners of each step involved in the implementation flow have been described in detail in the foregoing method embodiments, and for brevity of the description, descriptions are not repeated here.
The embodiment of the present application further provides a task scheduling device 100, as shown in fig. 6. The task scheduling device 100 includes: a first receiving module 110, a first responding module 120, a second receiving module 130, and a second responding module 140.
A first receiving module 110, configured to receive a first operation input by a user on a current display interface for a relationship label, where the relationship label is used to represent a relationship between a node belonging to a same cluster and a task to be forwarded and a node of the node in the cluster.
A first response module 120, configured to respond to the first operation, obtain a node code corresponding to the node itself, and obtain and display all nodes meeting the relationship label according to the node code, where different fields in the node code represent different levels, and different values in the same field represent different orders.
A second receiving module 130, configured to receive a second operation of a target node selected by the user from all nodes satisfying the relationship label.
A second response module 140, configured to send, in response to the second operation, a corresponding task to the target node.
Optionally, when the relationship label represents that the node of the task to be forwarded is a directly subordinate node of the self node, the first response module 120 is configured to determine, according to the node code, a target level where the self node is located; and searching a node of which the code is the same as the value in the field of the target level, the value in the field of the next level of the target level is not zero, and the value in other fields with lower levels than the next level is zero from a preset node code table.
Optionally, when the relationship label indicates that the node of the task to be forwarded is any subordinate node of the self node, the first response module 120 is configured to determine, according to the node code, a target level where the self node is located; and searching a node of which the code is the same as the numerical value in the field of the target level and the code is not the same as the node code from a preset node code table.
Optionally, when the relationship label represents that the node of the task to be forwarded is a hierarchical node directly belonging to the same higher-level node as the self node, the first response module 120 is configured to determine a target level of the self node according to the node code; and searching a preset node coding table for nodes of which the codes meet the conditions that the codes are the same as the numerical value in the field of the last level of the target level, are different from the numerical value in the field of the target level and are not zero, and the numerical values in other fields of which the levels are lower than the target level are zero.
Optionally, when the relationship label represents that the node of the task to be forwarded is a directly subordinate lower node of another node having the same level as the directly subordinate upper node of the self node, the first response module 120 is configured to determine, according to the node code, a target level where the self node is located; and searching nodes of which the codes meet the conditions that the numerical values in the fields of which the levels are not lower than the target level are not zero, the numerical values in other fields of which the levels are lower than the target level are not zero and the codes are not the same as the codes of the nodes from a preset node code table.
Optionally, the task scheduling device 100 further includes: and the third response module is used for responding to the task submitting operation input by the user, determining the directly superior node of the self node according to the node code, and submitting the task to the directly superior node. Optionally, the third response module is configured to determine, according to the node code, a target level where the self node is located; and setting the numerical value in the field of the target level in the node code to zero to obtain the directly superior node of the self node.
The task scheduling device 100 provided in the embodiment of the present application has the same implementation principle and the same technical effect as those of the foregoing method embodiments, and for the sake of brief description, reference may be made to corresponding contents in the foregoing method embodiments for parts that are not mentioned in the device embodiments.
As shown in fig. 7, fig. 7 is a block diagram illustrating a structure of an electronic device 200 according to an embodiment of the present disclosure. The electronic device 200 may be a client in the foregoing embodiment, may be equipped with a browser in the foregoing embodiment, and may also be a server in the foregoing embodiment. The electronic device 200 includes: a communication module 210, a memory 220, a communication bus 230, and a processor 240.
The communication module 210, the memory 220, and the processor 240 are electrically connected to each other directly or indirectly to realize data transmission or interaction. For example, the components may be electrically coupled to each other via one or more communication buses 230 or signal lines. The communication module 210 is used for transceiving data. The memory 220 is used for storing a computer program, such as the software functional module shown in fig. 6, i.e., the task scheduling device 100. The task scheduler 100 includes at least one software functional module, which may be stored in the memory 220 in the form of software or firmware (firmware) or fixed in an Operating System (OS) of the electronic device 200. The processor 240 is configured to execute an executable module stored in the memory 220, such as a software functional module or a computer program included in the task scheduling device 100. For example, the processor 240 is configured to receive a first operation input by a user on a current display interface for a relationship label, where the relationship label is used to represent a relationship between a node belonging to a same cluster and a task to be forwarded and a node of the node in the cluster; the node code corresponding to the node is obtained in response to the first operation, and all nodes meeting the relationship label are obtained and displayed according to the node code, wherein different fields in the node code represent different levels, and different numerical values in the same field represent different numbers; and the second operation is also used for receiving a target node selected by a user from all the nodes meeting the relationship labels; and further configured to send a corresponding task to the target node in response to the second operation.
The Memory 220 may be, but is not limited to, a Random Access Memory (RAM), a Read Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable Read-Only Memory (EPROM), an electrically Erasable Read-Only Memory (EEPROM), and the like.
The processor 240 may be an integrated circuit chip having signal processing capabilities. The processor may be a general-purpose processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components. The various methods, steps, and logic blocks disclosed in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor 240 may be any conventional processor or the like.
The server includes, but is not limited to, a web server, a database server, a cloud server, and the like.
The embodiment of the present application further provides a non-volatile computer-readable storage medium (hereinafter, referred to as a storage medium), where the storage medium stores a computer program, and when the computer program is run by the electronic device 200 as described above, the computer program executes the task scheduling method shown in the foregoing method embodiment.
It should be noted that, in the present specification, the embodiments are all described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments may be referred to each other.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented in other ways. The apparatus embodiments described above are merely illustrative, and for example, the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, 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.
In addition, functional modules in the embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a notebook computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A method for task scheduling, the method comprising:
receiving a first operation input by a user on a current display interface aiming at a relation label, wherein the relation label is used for representing the relation between a node of a task to be forwarded and a self node which belong to a cluster in the cluster;
responding to the first operation, acquiring a node code corresponding to the node of the node, and acquiring and displaying all nodes meeting the relationship label according to the node code, wherein different fields in the node code represent different levels, and different numerical values in the same field represent different numbers;
receiving a second operation of a target node selected by a user from all nodes meeting the relationship label;
and responding to the second operation, and sending a corresponding task to the target node.
2. The method according to claim 1, wherein when the relationship label indicates that the node of the task to be forwarded is a subordinate node of its own node, acquiring all nodes satisfying the relationship label according to the node code, including:
determining the target level of the self node according to the node code;
and searching a node of which the code is the same as the value in the field of the target level, the value in the field of the next level of the target level is not zero, and the value in other fields with lower levels than the next level is zero from a preset node code table.
3. The method according to claim 1, wherein when the relation label indicates that the node of the task to be forwarded is any subordinate node of its own node, acquiring all nodes satisfying the relation label according to the node code, including:
determining the target level of the self node according to the node code;
and searching a node of which the code is the same as the numerical value in the field of the target level and the code is not the same as the node code from a preset node code table.
4. The method according to claim 1, wherein when the relation label indicates that the node of the task to be forwarded is a hierarchical node directly belonging to the same higher node as the self node, acquiring all nodes satisfying the relation label according to the node code, including:
determining the target level of the self node according to the node code;
and searching a preset node coding table for nodes of which the codes meet the conditions that the codes are the same as the numerical value in the field of the last level of the target level, are different from the numerical value in the field of the target level and are not zero, and the numerical values in other fields of which the levels are lower than the target level are zero.
5. The method according to claim 1, wherein when the relation label indicates that the node of the task to be forwarded is a directly subordinate node of another node having a same level as that of the own node directly subordinate higher node, acquiring all nodes satisfying the relation label according to the node code, includes:
determining the target level of the self node according to the node code;
and searching nodes of which the codes meet the conditions that the numerical values in the fields of which the levels are not lower than the target level are not zero, the numerical values in other fields of which the levels are lower than the target level are not zero and the codes are not the same as the codes of the nodes from a preset node code table.
6. The method according to any one of claims 1-5, further comprising:
and responding to the task submitting operation input by the user, determining the directly superior node of the self node according to the node code, and submitting the task to the directly superior node.
7. The method according to claim 6, wherein determining the directly superior node of the self node according to the node coding comprises:
determining the target level of the self node according to the node code;
and setting the numerical value in the field of the target level in the node code to zero to obtain the directly superior node of the self node.
8. A task scheduling apparatus, characterized in that the apparatus comprises:
the first receiving module is used for receiving a first operation input by a user on a current display interface aiming at a relation label, wherein the relation label is used for representing the relation between a node belonging to a task to be forwarded in a cluster and a node of the node;
the first response module is used for responding to the first operation, acquiring a node code corresponding to the node per se, and acquiring and displaying all nodes meeting the relationship label according to the node code, wherein different fields in the node code represent different levels, and different numerical values under the same field represent different sequences;
a second receiving module, configured to receive a second operation of a target node selected by a user from all nodes satisfying the relationship label;
and the second response module is used for responding to the second operation and sending the corresponding task to the target node.
9. An electronic device, comprising: a memory and a processor, the memory and the processor connected;
the memory is used for storing programs;
the processor to invoke a program stored in the memory to perform the method of any of claims 1-7.
10. A storage medium, having stored thereon a computer program which, when executed by a computer, performs the method of any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911248660.0A CN110928667B (en) | 2019-12-06 | 2019-12-06 | Task scheduling method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911248660.0A CN110928667B (en) | 2019-12-06 | 2019-12-06 | Task scheduling method and device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110928667A true CN110928667A (en) | 2020-03-27 |
| CN110928667B CN110928667B (en) | 2022-03-01 |
Family
ID=69858365
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911248660.0A Active CN110928667B (en) | 2019-12-06 | 2019-12-06 | Task scheduling method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110928667B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101477555A (en) * | 2009-01-09 | 2009-07-08 | 南京联创科技股份有限公司 | Fast retrieval and generation display method for task tree based on SQL database |
| CN102833333A (en) * | 2012-08-23 | 2012-12-19 | 华南理工大学 | Scalable network server group frame system |
| US8640137B1 (en) * | 2010-08-30 | 2014-01-28 | Adobe Systems Incorporated | Methods and apparatus for resource management in cluster computing |
| CN106599043A (en) * | 2016-11-09 | 2017-04-26 | 中国科学院计算技术研究所 | Middleware used for multilevel database and multilevel database system |
| CN109298948A (en) * | 2018-10-31 | 2019-02-01 | 北京国信宏数科技有限责任公司 | Distributed computing method and system |
| CN109800251A (en) * | 2019-01-16 | 2019-05-24 | 北京明略软件***有限公司 | A kind of relationship discovery method and apparatus, computer readable storage medium |
| CN110134505A (en) * | 2019-05-15 | 2019-08-16 | 湖南麒麟信安科技有限公司 | A kind of distributed computing method of group system, system and medium |
| US20190281588A1 (en) * | 2018-06-11 | 2019-09-12 | Intel Corporation | Enhanced uplink beam management |
| CN111460832A (en) * | 2020-03-27 | 2020-07-28 | 北京百度网讯科技有限公司 | Object coding method, device, system, equipment and computer storage medium |
| US20210006614A1 (en) * | 2019-09-20 | 2021-01-07 | Intel Corporation | Dash-based streaming of point cloud content based on recommended viewports |
| CN112929271A (en) * | 2021-02-04 | 2021-06-08 | 华控清交信息科技(北京)有限公司 | Route configuration method and device for configuring route |
| CN113259391A (en) * | 2021-06-25 | 2021-08-13 | 北京华云安信息技术有限公司 | Data transmission method and device applied to multi-level node network |
-
2019
- 2019-12-06 CN CN201911248660.0A patent/CN110928667B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101477555A (en) * | 2009-01-09 | 2009-07-08 | 南京联创科技股份有限公司 | Fast retrieval and generation display method for task tree based on SQL database |
| US8640137B1 (en) * | 2010-08-30 | 2014-01-28 | Adobe Systems Incorporated | Methods and apparatus for resource management in cluster computing |
| CN102833333A (en) * | 2012-08-23 | 2012-12-19 | 华南理工大学 | Scalable network server group frame system |
| CN106599043A (en) * | 2016-11-09 | 2017-04-26 | 中国科学院计算技术研究所 | Middleware used for multilevel database and multilevel database system |
| US20190281588A1 (en) * | 2018-06-11 | 2019-09-12 | Intel Corporation | Enhanced uplink beam management |
| CN109298948A (en) * | 2018-10-31 | 2019-02-01 | 北京国信宏数科技有限责任公司 | Distributed computing method and system |
| CN109800251A (en) * | 2019-01-16 | 2019-05-24 | 北京明略软件***有限公司 | A kind of relationship discovery method and apparatus, computer readable storage medium |
| CN110134505A (en) * | 2019-05-15 | 2019-08-16 | 湖南麒麟信安科技有限公司 | A kind of distributed computing method of group system, system and medium |
| US20210006614A1 (en) * | 2019-09-20 | 2021-01-07 | Intel Corporation | Dash-based streaming of point cloud content based on recommended viewports |
| CN111460832A (en) * | 2020-03-27 | 2020-07-28 | 北京百度网讯科技有限公司 | Object coding method, device, system, equipment and computer storage medium |
| CN112929271A (en) * | 2021-02-04 | 2021-06-08 | 华控清交信息科技(北京)有限公司 | Route configuration method and device for configuring route |
| CN113259391A (en) * | 2021-06-25 | 2021-08-13 | 北京华云安信息技术有限公司 | Data transmission method and device applied to multi-level node network |
Non-Patent Citations (4)
| Title |
|---|
| B. KAILKHURA等: "Distributed Inference in Tree Networks Using Coding Theory", 《IEEE TRANSACTIONS ON SIGNAL PROCESSING》 * |
| MILOSZ CIZNICKI等: "Energy aware scheduling model and online heuristics for stencil", 《CLUSTER COMPUTING》 * |
| 许丞等: "Hadoop云平台的一种新的任务调度和监控机制", 《计算机科学》 * |
| 陈郑平等: "面向调控业务的多级一体化数据交换***设计与实现", 《电力***自动化》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110928667B (en) | 2022-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110825957A (en) | Deep learning-based information recommendation method, device, equipment and storage medium | |
| US20160132904A1 (en) | Influence score of a brand | |
| US20150161207A1 (en) | Assisting query and querying | |
| CN104092555B (en) | A kind of methods, devices and systems of undated parameter value | |
| CN102682017B (en) | Information retrieval method and system | |
| EP3465586A1 (en) | Providing travel or promotion based recommendation associated with social graph | |
| WO2014176182A1 (en) | Auto-completion of partial line pattern | |
| US9401846B2 (en) | Information handling system configuration identification tool and method | |
| CN110335165B (en) | Link prediction method and device | |
| CN110059172B (en) | Method and device for recommending answers based on natural language understanding | |
| CN110019193B (en) | Similar account number identification method, device, equipment, system and readable medium | |
| CN110928667B (en) | Task scheduling method and device, electronic equipment and storage medium | |
| US11636377B1 (en) | Artificial intelligence system incorporating automatic model updates based on change point detection using time series decomposing and clustering | |
| CN111815258A (en) | Human resource matching method, device, equipment and storage medium | |
| CN111143568A (en) | Method, device and equipment for buffering during paper classification and storage medium | |
| US20100057733A1 (en) | Method, computer program product, and apparatus for enabling access to enterprise information | |
| CN116127154A (en) | Knowledge tag recommendation method and device, electronic equipment and storage medium | |
| CN115186151A (en) | Resume screening method, device, equipment and storage medium | |
| CN115222256A (en) | Supply chain management method and device, electronic equipment and readable storage medium | |
| US20180052696A1 (en) | Providing teaching user interface activated by user action | |
| CN113051293A (en) | Resource query method and device based on tree structure and electronic equipment | |
| JP5743826B2 (en) | Configuration information management program and configuration information management method | |
| CN111831130A (en) | Input content recommendation method, terminal device and storage medium | |
| US20240134704A1 (en) | Device cohort resource management | |
| CN115001628B (en) | Data encoding method and device, data decoding method and device and data structure |
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 |