WO2020211358A1 - Procédé et appareil de planification de base de données, et dispositif informatique et support d'informations - Google Patents

Procédé et appareil de planification de base de données, et dispositif informatique et support d'informations Download PDF

Info

Publication number
WO2020211358A1
WO2020211358A1 PCT/CN2019/118039 CN2019118039W WO2020211358A1 WO 2020211358 A1 WO2020211358 A1 WO 2020211358A1 CN 2019118039 W CN2019118039 W CN 2019118039W WO 2020211358 A1 WO2020211358 A1 WO 2020211358A1
Authority
WO
WIPO (PCT)
Prior art keywords
executed
path
steps
priority
time required
Prior art date
Application number
PCT/CN2019/118039
Other languages
English (en)
Chinese (zh)
Inventor
李家捷
Original Assignee
平安普惠企业管理有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 平安普惠企业管理有限公司 filed Critical 平安普惠企业管理有限公司
Publication of WO2020211358A1 publication Critical patent/WO2020211358A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23—Updating
    • 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

Definitions

  • This application relates to the field of scheduling and application of database platforms, and in particular to a database scheduling method, device, computer equipment, and storage medium.
  • Database scheduling is to perform a series of operations in order. At present, the inventor found that in database scheduling, priority settings are often only performed for scheduling jobs, and there is no optimization method for scheduling jobs themselves, and the overall scheduling time is longer.
  • this application proposes a database scheduling method, device, computer equipment, and storage medium, which can optimize the scheduling timeliness of jobs in the database scheduling process.
  • this application proposes a database scheduling method, the method includes: calculating a plurality of paths included in a triggered operation series; wherein, the operation series includes a plurality of steps to be executed; The to-be-executed steps required by the path calculate the time required to execute each path; database scheduling is performed, and the to-be-executed steps of the path with the longest time required are preferentially executed in the database scheduling process.
  • the present application also provides a database scheduling device, which includes: a path calculation module adapted to calculate multiple paths included in a triggered operation series; wherein the operation series includes a plurality of steps to be executed;
  • the time calculation module is adapted to calculate the time required to execute each path according to the to-be-executed steps required for each path;
  • the scheduling module is adapted to perform database scheduling, and in the database scheduling process, the execution of the longest time required The steps to be executed on the path.
  • the present application also provides a computer device, including a memory, a processor, and computer-readable instructions stored in the memory and capable of running on the processor.
  • the processor executes the computer-readable instructions when the computer-readable instructions are executed.
  • the present application also provides a non-volatile computer-readable storage medium having computer-readable instructions stored thereon, and the computer-readable instructions implement the foregoing database scheduling method when executed by a processor.
  • the computer can calculate the key steps of the critical path in the database scheduling process and give it higher Priority allows computer resources to be used first on the key steps of the critical path, thereby optimizing the overall scheduling timeliness and reducing the overall delay of the computer scheduling process.
  • FIG. 1 is a diagram of an optional application environment of the database scheduling method of each embodiment of the present application
  • Figure 2 is a topological diagram of a set of operation series in the database of each embodiment of the present application.
  • FIG. 3 is a schematic flowchart of the database scheduling method according to the first embodiment of the present application.
  • FIG. 4 is a schematic flow chart of determining key steps in the database scheduling method of the first embodiment of the present application.
  • FIG. 5 is a schematic flowchart of another critical step in the database scheduling method of the first embodiment of the present application.
  • FIG. 6 is a schematic diagram of the process of judging the critical path in the database scheduling method of the first embodiment of the present application.
  • FIG. 7 is a schematic diagram of program modules of the database scheduling device according to the second embodiment of the present application.
  • FIG. 8 is a schematic diagram of the hardware structure of the computer device according to the third embodiment of the present application.
  • FIG. 1 is a schematic diagram of an optional application environment for database scheduling.
  • the business system 20 communicates with the database 10 in a wired or wireless manner.
  • the user can interact with the business system 20 to make the business system 20 perform all operations.
  • the business system 20 may be in the form of hardware with computing capabilities such as computers, mobile phones, tablet computers, and servers.
  • the database 10 can be a private resource for users to use alone.
  • the database 10 is a shared resource that can be used by multiple users.
  • the database 10 can provide multiple resources including access data.
  • the user can also customize a series of operations including multiple operations.
  • This series of operations includes multiple steps to be performed.
  • the steps to be performed include trigger conditions that trigger one or more other steps to be performed, that is, these steps to be performed There is a dependency relationship in the steps, and the execution of some steps depends on other steps being executed first. Once the series of operations including these steps to be executed are triggered to be executed, the steps to be executed will be executed in order, which is equivalent to that one operation can Multiple operations were performed.
  • the database needs to store the customer's order information, and the database needs to update the inventory quantity of the product. .
  • the database call includes 7 steps S1, S2, S3, S4, S5, S6, S7, where step S1 includes trigger conditions for triggering steps S2 and S3.
  • S2 includes the trigger conditions for triggering step S4,
  • step S3 includes the trigger conditions for triggering steps S4 and S6,
  • step S4 includes the trigger conditions for triggering step S5, and both steps S5 and S6 include the trigger conditions for triggering step S7.
  • FIG. 3 is a flowchart of an embodiment of a database scheduling method of the present application.
  • the method includes the following steps S301-S303:
  • Step S301 Calculate multiple paths included in the triggered operation series.
  • the path is an orderly execution chain formed by a series of multiple steps to be executed in the series of operations.
  • each step to be executed may include conditions that trigger the execution of multiple steps.
  • step S1 includes conditions for triggering the execution of steps S2 and S3. After step S1 is executed, this trigger condition is triggered, and then steps S2 and S3 are executed. Steps S2 and S3 both include the trigger conditions that trigger the execution of step S4. Therefore, there are two execution paths from steps S1-S4, which are steps S1-S2-S4 and steps S1-S3-S4, because steps S2 and S3 The required time is not used, so the paths S1-S2-S4 and paths S1-S3-S4 take different time.
  • the method for calculating the multiple paths included in the triggered operation series specifically includes steps S301a-S301b:
  • Step S301a Form the topological relationship between all the steps to be executed according to all the trigger conditions; specifically, determine in turn whether each step to be executed contains a trigger condition, if the step to be executed contains a trigger condition, The trigger condition obtains the sequence number of each to-be-executed step that depends on the to-be-executed step, and establishes the topological relationship between the to-be-executed step and the triggered to-be-executed step.
  • Step S301b generating all the orderly execution chains composed of the steps to be executed according to the topological relationship, and these orderly execution chains are the paths.
  • Step S302 Calculate the time required to execute each path according to the to-be-executed steps required for each path.
  • the time required to load each step to be executed can be manually entered in the database, but preferably, the following step is included before this step is executed: separately loading all the steps to be executed included in the operation series , Record the loading time required to load each step to be executed.
  • the individual loading process of the steps to be executed is a trial execution of the steps to be executed, that is, each step to be executed is individually loaded into the CPU cache of the business system 20, and the computing resources required to execute each step to be executed separately can be known according to the loading time. It can provide a basis for optimizing the use of computing resources during the subsequent execution of the entire series of operations. In this way, before calculating the total time of each path, the time required for each step to be executed can be known by preloading and entered into the database 10. During the implementation of this step, each path included Add the loading time of all the steps to be executed to get the time required to execute each path.
  • step S303 database scheduling is performed, and the steps to be executed of the path with the longest time required are preferentially executed in the database scheduling process.
  • each different path is automatically based on trigger conditions.
  • a certain key step of the path that takes a long time to be executed may take a long time, but it is executed later. At this time, computer resources are already occupied by other steps, resulting in a long overall time.
  • the steps to be executed in the path that takes the longest time to be executed first can be embodied as: if a previous step to be executed contains the trigger conditions of the other two steps to be executed, the previous step to be executed runs After completion, the next step will give priority to the steps to be executed on the path that takes a longer time.
  • the steps to be executed of the path with the longest time required to be executed first can also be embodied as: each step of the path with the longest time in the database scheduling process is assigned higher The priority of each step on this path will be executed first, and the steps of the path with less time will be executed after the path with the longest time is executed, so as to ensure that the computer resources are given priority to execute these time On the critical path, thereby reducing the overall delay.
  • steps S1, S3, S6, and S7 in the longest path L3 are assigned a higher priority.
  • steps S1, S3, S6, and S7 are executed first to ensure the priority use of computer resources In the critical steps of the critical path, the overall delay of the database scheduling process can be reduced.
  • the priority in addition to the priority optimization for the steps to be executed on the path with the longest running time, for other paths, the priority can be set according to the length of the running time, that is, the path with the longer running time is required
  • the steps to be executed are assigned a higher priority, and the steps to be executed with a shorter running time are assigned a lower priority.
  • the order of the running time of the three paths is T3> T2>T1, based on this, in addition to assigning higher priority to the steps to be executed on the L3 path, the steps to be executed on the L2 path are assigned the next level of priority, and the steps to be executed on the L1 path have the lowest priority.
  • Step S1, S3, S6, S7 included, and then steps S4, S5, S7 included in the L2 path (where steps S1, S3 overlap with the L3 path), and finally steps S2, S4, S5, and S5 included in the L1 path are executed.
  • S7 (where step S1 coincides with the path L2 and L3).
  • the second type is to exercise priority only between multiple to-be-executed steps that rely on the same to-be-executed step.
  • step S3 includes the triggering conditions of step S4 and step S6, due to the time required to load path L3 It is longer than the time required for the loading of path L2, so the priority of step S6 is higher than the priority of step S4, and step S6 is executed first.
  • the running time of one or more of all the paths included is not the longest, but among them
  • the included steps to be executed are more critical.
  • the key steps to be executed in these paths are ignored, and computing resources are preferentially allocated to the path with the longest running time.
  • individual weights are preset for specific steps to be executed in several paths.
  • Step S401 sequentially determining whether each path includes a step to be executed with a separate weight
  • step S402 among the multiple to-be-executed steps that rely on the same to-be-executed step, priority is given to sequentially execute the weighted to-be-executed steps according to their weights, or to assign and The weight corresponds to the priority.
  • step S4 in path L2 and step S6 in path L3 have separate weights, set the weight of step S4 in path L2 to 0.7, and step S6 in path L3 The weight of is 0.3.
  • step S3 includes the triggering conditions of step S4 and step S6, when step S3 is executed, since the weight of step S4 is higher than that of step S6, step S4 is executed first. The execution of other steps to be executed is still carried out according to the priority assigned according to the time required for path execution.
  • the priority corresponding to the weight is assigned to each step to be executed in the path where the step to be executed with a higher weight is located, so that the entire path where the key step to be executed is located is executed first.
  • the weight of step S4 in L2 is greater than the weight of step S6 in path L3
  • all the steps to be executed in path L2 are assigned the highest priority
  • the time required to execute path L3 is greater than the time required to execute path L1
  • the priority of path L3 is higher than that of path L1.
  • the calculated critical path can be made more scientific and reasonable.
  • the running time of one or more of all the paths included is not the longest, but among them
  • the included steps to be executed are more critical.
  • the key steps to be executed in these paths are ignored, and computing resources are preferentially allocated to the path with the longest running time.
  • you can The database 10 presets special priorities for specific steps to be executed in several paths.
  • steps S501-S502 are executed first in the database scheduling process. Steps to be executed for the long path:
  • Step S501 sequentially determine whether each path includes a step to be executed with a special priority
  • Step S502 is to preferentially execute a to-be-executed step with a special priority among multiple to-be-executed steps that rely on the same to-be-executed step, or assign each to-be-executed step in the path where the to-be-executed step with a special priority is located priority.
  • step S502 can ensure that when relying on the same previous step to be executed, the next step to be executed with a special priority is executed first, or the entire critical path with key steps is executed first.
  • step S3 includes the trigger conditions of step S4 and step S6,
  • step S4 is executed first, and the execution of other steps to be executed is still executed according to the priority allocated according to the time required for path execution; in the latter case, in the database
  • step S4 in path L2 since step S4 in path L2 has a special priority, each step to be executed in path L2 is assigned the highest priority.
  • path L1 and path L3 the time required to execute path L3 is longer than the execution time.
  • the path L1 takes time, so the priority of the path L3 is higher than the priority of the path L1.
  • the critical path can be assigned a preset priority. As shown in Figure 6, priority is given to the database scheduling process. Perform the following steps S601-S602, and then prioritize the execution of the pending steps of the path that takes the longest time:
  • Step S601 Determine whether each path has priority in turn
  • step S602 each step to be executed on the path with priority is executed first.
  • the steps with priority are executed in sequence according to the priority level.
  • steps S1, S2, S4, S5, and S7 of path L1 will be executed first in the database scheduling process, and the remaining path L2 In path L3, since the time required to execute path L3 is greater than the time required to execute path L2, the priority of path L3 is higher than that of path L2.
  • step S3 of path L3 is executed.
  • S6, S7 and finally execute steps S4, S5, S7 of path L2. If path L1 has the preset highest priority and path L2 has the preset second highest priority, then in the database scheduling process, the execution order of the three paths is: L1, L2, L3.
  • FIG. 7 shows a schematic diagram of program modules of a database scheduling apparatus 700 according to a second embodiment of the present application.
  • the database scheduling device 700 may include or be divided into one or more program modules, and the one or more program modules are stored in a storage medium and executed by one or more processors to complete this Apply, and implement the above database scheduling method.
  • the program module referred to in the embodiments of the present application refers to a series of computer-readable instruction segments that can complete specific functions, and is more suitable for describing the execution process of the database scheduling method in the storage medium than the program itself. The following description will specifically introduce the functions of each program module in this embodiment:
  • the path calculation module 701 is adapted to calculate multiple paths included in the triggered operation series.
  • the path is an orderly execution chain formed by a series of multiple steps to be executed in the series of operations.
  • each step to be executed may include conditions that trigger the execution of multiple steps.
  • step S1 includes the conditions that trigger the execution of steps S2 and S3. After step S1 is executed, this trigger condition is triggered, and then steps S2 and S3 are executed. Steps S2 and S3 both include the trigger conditions that trigger the execution of step S4. Therefore, there are two execution paths from steps S1-S4, which are steps S1-S2-S4 and steps S1-S3-S4, because steps S2 and S3 The required time is not used, so the paths S1-S2-S4 and paths S1-S3-S4 take different time.
  • the method for the path calculation module 701 to calculate the multiple paths included in the triggered operation series specifically includes steps S301a-S301b:
  • step S301a the path calculation module 701 forms the topological relationship between all the steps to be executed according to all the trigger conditions; specifically, it sequentially determines whether each step to be executed includes a trigger condition, and if the step to be executed includes The trigger condition is to obtain the sequence number of each to-be-executed step dependent on the to-be-executed step according to the triggering condition, and establish the topological relationship between the to-be-executed step and the triggered to-be-executed step.
  • step S301b the path calculation module 701 generates all the orderly execution chains composed of the steps to be executed according to the topological relationship, and these orderly execution chains are the paths.
  • the time calculation module 702 is adapted to calculate the time required to execute each path according to the to-be-executed steps required for each path.
  • the time required to load each step to be executed may be manually entered in the database, but preferably, the following step is included before the execution of this step: the time calculation module 702 performs all the steps to be executed included in the operation series
  • the steps are loaded individually, and the loading time required to load each step to be executed is recorded.
  • the separate loading process of the time calculation module 702 for the steps to be executed is a trial execution of the steps to be executed, that is, the time calculation module 702 individually loads each step to be executed into the CPU cache of the business system 20, and can know that each step is executed separately according to the loading time.
  • the computing resources required for each step to be executed can provide a basis for optimizing the use of computing resources during the subsequent execution of the entire series of operations.
  • the time calculation module 702 can know the time required for each step to be executed separately by preloading and enter it into the database 10, and respectively record all the paths contained in each path. The loading time of the steps to be executed is added to obtain the time required to execute each path.
  • the scheduling module 703 performs database scheduling, and in the database scheduling process, the to-be-executed steps of the path with the longest time required are preferentially executed.
  • each different path is automatically based on trigger conditions.
  • a certain key step of the path that takes a long time to be executed may take a long time, but it is executed later. At this time, computer resources are already occupied by other steps, resulting in a long overall time.
  • the steps to be executed in the path that takes the longest time to be executed first can be embodied as: if a previous step to be executed contains the trigger conditions of the other two steps to be executed, the previous step to be executed runs After completion, the next step will give priority to the steps to be executed on the path that takes a longer time.
  • the steps to be executed of the path with the longest time required to be executed first can also be embodied as: each step of the path with the longest time in the database scheduling process is assigned higher The priority of each step on this path will be executed first, and the steps of the path with less time will be executed after the path with the longest time is executed, so as to ensure that the computer resources are given priority to execute these time On the critical path, thereby reducing the overall delay.
  • the scheduling module 703 assigns higher priority to steps S1, S3, S6, and S7 in the longest path L3.
  • steps S1, S3, S6, and S7 are executed first to ensure that the computer The resources are prioritized in the key steps of the critical path, which can reduce the overall delay of the database scheduling process.
  • the priority in addition to the priority optimization of the scheduling module 703 for the steps to be executed on the path with the longest running time, for other paths, the priority can be set according to the length of the running time, that is, the required running time is longer.
  • the steps to be executed in the long path are assigned a higher priority, and the steps to be executed with a shorter running time are assigned a lower priority.
  • the order of the running time of the three paths For T3>T2>T1 in addition to assigning a higher priority to the steps to be executed on the L3 path, the steps to be executed on the L2 path are assigned the next level of priority, and the steps to be executed on the L1 path have priority The lowest level.
  • Step S1, S3, S6, S7 included, and then steps S4, S5, S7 included in the L2 path (where steps S1, S3 overlap with the L3 path), and finally steps S2, S4, S5, and S5 included in the L1 path are executed.
  • S7 (where step S1 coincides with the path L2 and L3).
  • the second type is to exercise priority only between multiple to-be-executed steps that rely on the same to-be-executed step.
  • step S3 includes the triggering conditions of step S4 and step S6, due to the time required to load path L3 It is longer than the time required for the loading of path L2, so the priority of step S6 is higher than the priority of step S4, and step S6 is executed first.
  • the scheduling module 703 ignores the key steps to be executed in these paths, and preferentially allocates computing resources to the path with the longest running time, in order to avoid the above situation.
  • individual weights can be preset for specific to-be-executed steps in several paths, so in the above step S303, referring to FIG. 4, the scheduling module 703 preferentially executes the following steps S401-S402 during the database scheduling process. Then give priority to the steps to be executed on the path that takes the longest time:
  • Step S401 The scheduling module 703 sequentially determines whether each path includes a step to be executed with a separate weight
  • Step S402 the scheduling module 703, among the multiple to-be-executed steps that depend on the same step-to-be-executed, preferentially executes the weighted to-be-executed steps according to the weights, or each path in which the weighted to-be-executed steps are located.
  • the steps are assigned a priority corresponding to the weight.
  • step S4 in path L2 and step S6 in path L3 have separate weights, set the weight of step S4 in path L2 to 0.7, and step S6 in path L3 The weight of is 0.3.
  • step S3 since step S3 includes the triggering conditions of step S4 and step S6, when step S3 is executed, since the weight of step S4 is higher than that of step S6, step S4 is executed first. The execution of other steps to be executed is still carried out according to the priority assigned according to the time required for path execution.
  • the priority corresponding to the weight is assigned to each step to be executed in the path where the step to be executed with a higher weight is located, so that the entire path where the key step to be executed is located is executed first.
  • the weight of step S4 in L2 is greater than the weight of step S6 in path L3
  • all the steps to be executed in path L2 are assigned the highest priority
  • the time required to execute path L3 is greater than the time required to execute path L1
  • the priority of path L3 is higher than that of path L1.
  • the calculated critical path can be made more scientific and reasonable.
  • the scheduling module 703 ignores the key steps to be executed in these paths, and preferentially allocates computing resources to the path with the longest running time, in order to avoid the above situation.
  • special priorities may be preset for specific steps to be executed in several paths.
  • the scheduling module 703 preferentially executes the following steps S501-S502 during the database scheduling process. Then give priority to the steps to be executed on the path that takes the longest time:
  • Step S501 The scheduling module 703 sequentially determines whether each path includes a step to be executed with a special priority
  • step S502 the scheduling module 703 preferentially executes the to-be-executed steps with a special priority among multiple to-be-executed steps that rely on the same to-be-executed step, or for each of the paths where the to-be-executed steps with special priority are located. Prioritize execution steps.
  • step S502 can ensure that when relying on the same previous step to be executed, the next step to be executed with a special priority is executed first, or the entire critical path with key steps is executed first.
  • step S3 includes the trigger conditions of step S4 and step S6,
  • step S4 is executed first, and the execution of other steps to be executed is still executed according to the priority allocated according to the time required for path execution; in the latter case, in the database
  • step S4 in path L2 since step S4 in path L2 has a special priority, each step to be executed in path L2 is assigned the highest priority.
  • path L1 and path L3 the time required to execute path L3 is longer than the execution time.
  • the path L1 takes time, so the priority of the path L3 is higher than the priority of the path L1.
  • the critical path can be assigned a preset priority. As shown in Figure 6, priority is given to the database scheduling process. Perform the following steps S601-S602, and then prioritize the execution of the pending steps of the path that takes the longest time:
  • Step S601 the scheduling module 703 sequentially determines whether each path has a priority
  • step S602 if yes, the scheduling module 703 preferentially executes each to-be-executed step on the path with priority.
  • the steps with priority are executed in sequence according to the priority level.
  • the scheduling module 703 will give priority to executing steps S1, S2, S4, S5, and S7 of path L1 in the database scheduling process, and the rest In path L2 and path L3, since the time required to execute path L3 is greater than the time required to execute path L2, the priority of path L3 is higher than that of path L2.
  • path L3 is executed again Steps S3, S6, S7 of path L2, and finally steps S4, S5, S7 of path L2 are executed. If the path L1 has the preset highest priority, and the path L2 has the preset second highest priority, the scheduling module 703 performs the order of the three paths in the database scheduling process: L1, L2, L3.
  • the computer device 800 is a device that can automatically perform numerical calculation and/or information processing according to pre-set or stored instructions.
  • the computer equipment 800 at least includes, but is not limited to, a memory 801, a processor 802, a network interface 803, and a database scheduling device 804 that can communicate with each other through a system bus. among them:
  • the memory 801 includes at least one type of non-volatile computer-readable storage medium.
  • the readable storage medium includes flash memory, hard disk, multimedia card, card-type memory (for example, SD or DX memory, etc.), Random access memory (RAM), static random access memory (SRAM), read only memory (ROM), electrically erasable programmable read only memory (EEPROM), programmable read only memory (PROM), magnetic memory, magnetic disk, optical disk Wait.
  • the memory 801 may be an internal storage unit of the computer device 800, such as a hard disk or memory of the computer device 800.
  • the memory 801 may also be an external storage device of the computer device 800, for example, a plug-in hard disk, a smart media card (SMC), and a secure digital (Secure Digital, SD card, Flash Card, etc.
  • the memory 801 may also include both an internal storage unit of the computer device 800 and an external storage device thereof.
  • the memory 801 is generally used to store the operating system and various application software installed in the computer device 800, such as the program code of the database scheduling device 804.
  • the memory 801 can also be used to temporarily store various types of data that have been output or will be output.
  • the processor 802 may be a central processing unit (Central Processing Unit, CPU), a controller, a microcontroller, a microprocessor, or other data processing chips.
  • the processor 802 is generally used to control the overall operation of the computer device 800.
  • the processor 802 is used to run the program code or process data stored in the memory 801, for example, to run the database scheduling device 804, to implement the database scheduling method in the first embodiment.
  • the network interface 803 may include a wireless network interface or a wired network interface, and the network interface 803 is usually used to establish a communication connection between the computer device 800 and other electronic devices.
  • the network interface 803 is used to connect the computer device 800 with an external terminal through a network, and establish a data transmission channel and a communication connection between the computer device 800 and the external terminal.
  • the network may be Intranet, Internet, Global System of Mobile Communication (GSM), Wideband Code Division Multiple Access (WCDMA), 4G network, 5G Network, Bluetooth (Bluetooth), Wi-Fi and other wireless or wired networks.
  • FIG. 8 only shows a computer device 800 with components 801-804, but it should be understood that it is not required to implement all the components shown, and more or fewer components may be implemented instead.
  • the database scheduling device 804 stored in the memory 801 may also be divided into one or more program modules.
  • the one or more program modules are stored in the memory 801 and are composed of one or more program modules. Are executed by two processors (the processor 802 in this embodiment) to complete the database scheduling method of this application.
  • This embodiment also provides a non-volatile computer-readable storage medium, such as flash memory, hard disk, multimedia card, card-type memory (for example, SD or DX memory, etc.), random access memory (RAM), static random access memory ( SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, magnetic disk, optical disk, server, App application mall, etc., on which storage There are computer-readable instructions, and the corresponding functions are realized when the program is executed by the processor.
  • the non-volatile computer-readable storage medium of this embodiment is used to store the database scheduling device 700 or 804, and when executed by a processor, the database scheduling method of this application is implemented.
  • the method of the above embodiments can be implemented by means of software plus the necessary general hardware platform. Of course, it can also be implemented by hardware, but in many cases the former is better. ⁇
  • the technical solution of this application essentially or the part that contributes to the existing technology can be embodied in the form of a software product, and the computer software product is stored in a storage medium (such as ROM/RAM, magnetic disk, The optical disc) includes several instructions to enable a terminal device (which can be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to execute the method described in each embodiment of the present application.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

La présente invention concerne un procédé et un appareil de planification de base de données, ainsi qu'un dispositif informatique et un support d'informations. Le procédé consiste : à calculer une pluralité de trajets contenus dans une série d'opérations déclenchée (S301) ; à calculer le temps nécessaire pour exécuter chaque trajet selon une étape à exécuter requise par chaque trajet (S302) ; et enfin, à réaliser une planification de base de données, et à exécuter de préférence ladite étape du trajet qui prend le temps le plus long dans un processus de planification de base de données (S303). Par l'introduction d'un procédé de trajet clé dans une conception de planification de base de données, un ordinateur peut obtenir les étapes clés du trajet clé dans le processus de planification de base de données au moyen d'un calcul et conférer une priorité plus élevée aux étapes clés, de telle sorte que des ressources informatiques peuvent être utilisées de préférence dans les étapes clés du trajet clé, ce qui permet de mettre en œuvre l'optimisation du caractère opportun de la planification globale, et de réduire le retard global du processus de planification informatique.
PCT/CN2019/118039 2019-04-15 2019-11-13 Procédé et appareil de planification de base de données, et dispositif informatique et support d'informations WO2020211358A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910300315.0A CN110147270A (zh) 2019-04-15 2019-04-15 数据库调度方法、装置、计算机设备及存储介质
CN201910300315.0 2019-04-15

Publications (1)

Publication Number Publication Date
WO2020211358A1 true WO2020211358A1 (fr) 2020-10-22

Family

ID=67589656

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/118039 WO2020211358A1 (fr) 2019-04-15 2019-11-13 Procédé et appareil de planification de base de données, et dispositif informatique et support d'informations

Country Status (2)

Country Link
CN (1) CN110147270A (fr)
WO (1) WO2020211358A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110147270A (zh) * 2019-04-15 2019-08-20 平安普惠企业管理有限公司 数据库调度方法、装置、计算机设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007018268A (ja) * 2005-07-07 2007-01-25 Sumitomo Heavy Ind Ltd タスクスケジューリング方法、タスクスケジューリング装置、及びタスクスケジューリングプログラム
CN103336723A (zh) * 2013-07-21 2013-10-02 哈尔滨理工大学 基于关键路径的适应处理器内核紧缺调度方法
CN107301500A (zh) * 2017-06-02 2017-10-27 北京工业大学 一种基于关键路径任务前瞻的工作流调度方法
CN110147270A (zh) * 2019-04-15 2019-08-20 平安普惠企业管理有限公司 数据库调度方法、装置、计算机设备及存储介质

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10152349B1 (en) * 2016-09-27 2018-12-11 Juniper Networks, Inc. Kernel scheduling based on precedence constraints and/or artificial intelligence techniques
CN107015856A (zh) * 2017-03-30 2017-08-04 青海大学 云环境下科学工作流中的任务调度方案生成方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007018268A (ja) * 2005-07-07 2007-01-25 Sumitomo Heavy Ind Ltd タスクスケジューリング方法、タスクスケジューリング装置、及びタスクスケジューリングプログラム
CN103336723A (zh) * 2013-07-21 2013-10-02 哈尔滨理工大学 基于关键路径的适应处理器内核紧缺调度方法
CN107301500A (zh) * 2017-06-02 2017-10-27 北京工业大学 一种基于关键路径任务前瞻的工作流调度方法
CN110147270A (zh) * 2019-04-15 2019-08-20 平安普惠企业管理有限公司 数据库调度方法、装置、计算机设备及存储介质

Also Published As

Publication number Publication date
CN110147270A (zh) 2019-08-20

Similar Documents

Publication Publication Date Title
CN108462760B (zh) 电子装置、集群访问域名自动生成方法及存储介质
US10225145B2 (en) Method and device for updating client
CN102855216B (zh) 改进多处理器计算机系统的性能
CN109300217B (zh) 排队叫号方法、计算机存储介质、排队叫号服务器及系统
US20060206894A1 (en) Method of scheduling jobs using database management system for real-time processing
CN110704177B (zh) 计算任务处理方法、装置、计算机设备和存储介质
US20100153957A1 (en) System and method for managing thread use in a thread pool
US20150143382A1 (en) Scheduling workloads and making provision decisions of computer resources in a computing environment
CN109960575B (zh) 一种计算能力共享方法、系统及相关设备
US20150150016A1 (en) Method and apparatus for a user-driven priority based job scheduling in a data processing platform
US20100042723A1 (en) Method and system for managing load in a network
CN111338779B (zh) 资源分配方法、装置、计算机设备和存储介质
CN111490963A (zh) 基于quic协议栈的数据处理方法、系统、设备及存储介质
WO2019105379A1 (fr) Procédé et appareil de gestion de ressources, dispositif électronique et support de stockage
CN108829519A (zh) 基于云平台的任务调度方法、云平台及计算机可读存储介质
CN111885184A (zh) 高并发场景下热点访问关键字处理方法和装置
CN112988185A (zh) 云应用更新方法、装置、系统、电子设备及存储介质
CN111709723A (zh) Rpa业务流程智能处理方法、装置、计算机设备和存储介质
CN116185623A (zh) 任务分配方法、装置、电子设备及存储介质
CN113886069A (zh) 一种资源分配方法、装置、电子设备及存储介质
CN115686805A (zh) Gpu资源共享的方法和装置、调度gpu资源共享的方法和装置
CN114629960B (zh) 资源调度方法、装置、系统、设备、介质和程序产品
WO2021012506A1 (fr) Procédé et appareil pour réaliser un équilibrage de charge dans un système de reconnaissance de la parole et dispositif informatique
WO2015042904A1 (fr) Procédé, appareil et système de programmation d'ensemble de ressources dans un système à multiples cœurs
ul Hassan et al. An efficient dynamic decision-based task optimization and scheduling approach for microservice-based cost management in mobile cloud computing applications

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19924812

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 02.02.2022)

122 Ep: pct application non-entry in european phase

Ref document number: 19924812

Country of ref document: EP

Kind code of ref document: A1