WO2021013124A1 - Method and device for managing automated testing resources - Google Patents
Method and device for managing automated testing resources Download PDFInfo
- Publication number
- WO2021013124A1 WO2021013124A1 PCT/CN2020/103017 CN2020103017W WO2021013124A1 WO 2021013124 A1 WO2021013124 A1 WO 2021013124A1 CN 2020103017 W CN2020103017 W CN 2020103017W WO 2021013124 A1 WO2021013124 A1 WO 2021013124A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- resources
- task
- subtask
- tasks
- allocated
- Prior art date
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/48—Program initiating; Program switching, e.g. by interrupt
-
- 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]
-
- 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
Definitions
- the embodiments of the present disclosure relate to, but are not limited to, automated testing technology.
- test resource allocation is to manually occupy resources according to the task level, first come first served, this strategy will not cause imbalance problems when the task execution time is relatively short, but now the time to execute a task may be It lasts for more than 10 to 20 hours. In this process, resources cannot be released, and other tasks can only be in a long waiting process.
- the embodiment of the present disclosure provides a method for automatic test resource management, which includes: regularly checking whether there are idle resources; when there are idle resources, sorting tasks of the resources to be allocated according to weights; and calculating whether the idle resources have the highest weight And when matching, allocate resources to the subtask with the highest priority among the tasks with the highest weight.
- the embodiment of the present disclosure also provides a device for automatic test resource management, including: a checking unit, used to periodically check whether there are idle resources; a sorting unit, when there are idle resources, tasks to be allocated resources are performed according to weights Sorting; a calculation unit for calculating whether the idle resource matches the task with the highest weight; and an allocation unit for allocating resources to the subtask with the highest priority in the task with the highest weight when matching.
- a checking unit used to periodically check whether there are idle resources
- a sorting unit when there are idle resources, tasks to be allocated resources are performed according to weights Sorting
- a calculation unit for calculating whether the idle resource matches the task with the highest weight
- an allocation unit for allocating resources to the subtask with the highest priority in the task with the highest weight when matching.
- the embodiment of the present disclosure also provides a device for automated test resource management, including a memory, a processor, and a computer program stored on the memory and capable of running on the processor, and the computer program is executed by the processor. Implement the above-mentioned resource management method during execution.
- the embodiments of the present disclosure also provide a computer-readable storage medium on which an information processing program is stored, and when the information processing program is executed by a processor, the steps of the above resource management method are implemented.
- FIG. 1 is a schematic flowchart of a method for automated test resource management according to an embodiment of the present disclosure
- FIG. 2 is another schematic flowchart of a method for automated test resource management according to an embodiment of the present disclosure
- FIG. 3 is a schematic diagram of the architecture of an automated test resource management system according to an embodiment of the present disclosure.
- Fig. 4 is a schematic structural diagram of an apparatus for automatic test resource management according to an embodiment of the present disclosure.
- FIG. 1 is a schematic flowchart of a method for automated test resource management according to an embodiment of the present disclosure. As shown in FIG. 1, the method includes steps 101 to 104.
- step 101 it is periodically checked whether there are free resources.
- step 102 when there are idle resources, the tasks to be allocated resources are sorted according to their weights.
- step 103 it is calculated whether the idle resource matches the task with the highest weight.
- step 104 when there is a match, resources are allocated to the subtask with the highest priority among the tasks with the highest weight.
- the method further includes: reducing the weight of the task with the highest weight according to a preset ratio; if there are remaining free resources, waiting again Tasks that allocate resources are sorted by weight; calculate whether the remaining idle resources match the task with the highest weight; when matching, allocate resources to the subtask with the highest priority among the tasks with the highest weight; and so on, until There are no free resources.
- the method further includes: executing the subtask with the highest priority according to the allocated resources; and releasing the allocated resources when the execution of the subtask with the highest priority is completed or fails.
- the method further includes: when there is no match, allocating resources to the subtask with the highest priority among the tasks with the second highest weight.
- the method further includes: when there is no subtask that needs to be allocated resources in any task to be allocated resources, deleting the task to be allocated resources.
- the method further includes: when the execution of the subtask with the highest priority is completed, saving the execution result; checking whether the task in which the subtask with the highest priority is located is all completed; and when all are completed, collecting all the tasks in the task The execution result of the subtask.
- the method further includes: receiving tasks of resources to be allocated; and splitting each task of resources to be allocated into one or more subtasks according to business attributes.
- Fig. 2 is another schematic flowchart of a method for automated test resource management according to an embodiment of the present disclosure.
- the system includes: task module, resource module, message queue (MQ), database (database, DB) and resource pool.
- MQ message queue
- database database, DB
- Each module entity uses MQ to complete message transmission. This system needs to have multiple MQ channels, using Queue mode.
- the message queue MQ includes the following queues.
- the task queue task.queue which transfers tasks to be allocated resources.
- the subtask queue subTask.queue which is used to deliver resource messages to the subtask execution module. After the subtask execution module listens to the message, it will extract the corresponding resource and perform a test operation on the resource.
- the resource release queue release.resource.queue which is used to transfer the resource information that needs to be released to the resource management module through the message queue after the execution of the subtask is completed.
- the execution failed subtask queue subTaskFailed.queue which is used to inform the resource management module that a certain subtask has failed to execute and resources need to be released.
- the task module includes a task management module, which is used to receive tasks for resources to be allocated, and split each task for resources to be allocated into one or more subtasks according to business attributes.
- the resource module includes a task collection unit to be assigned and a resource management module.
- the resource management module monitors the MQ message, and if it receives the task of the resource to be allocated, it puts it into the local Task List (TL) of the resource to be allocated.
- TL Task List
- the task management module determines all subtasks and the priority order of the subtasks in the task according to user needs, and at the same time assigns an initial weight W to the task, and also needs to specify the environmental conditions (for example, machine Frame, main control, line card, number of boards, etc.).
- the way to split subtasks needs to be determined according to specific business attributes.
- the principle is that subtasks must be executable entities, for example, a testable module or a testable group.
- the task management module is also used to trigger task execution and generate task queue messages.
- the task management module issues the task to the task-to-be-allocated collection unit (also called a resource allocation unit) to apply for appropriate resources.
- the resource allocation unit manages a task queue of resources to be allocated currently, and adds tasks to the resource queue to be allocated after listening to the task queue message.
- the distribution engine maintained in the background is a timing worker (for example, it can be processed once a minute, and it can also be modified as appropriate).
- the distribution engine first sorts the task queue according to the weight, and the highest weight is the first. The low-weight ones are ranked last, and then the resource allocation services are accepted according to the weight in turn. After the subtask matches the resource, the subtask resource message is released to the subtask queue.
- the resource module first checks whether there are idle resources in the current resource pool, and if there are idle resources, the idle resources are processed in turn.
- the processing process each time is as follows: The tasks in the list TL are sorted according to the weight W; and the task T1 with the highest weight is obtained, and the idle resource is calculated whether the idle resource matches the task T1. If it matches, the resource is allocated to the highest priority subtask ST1 of the task T1; if it does not match, Then get the task T2 with the second highest weight, and do the same calculation, and so on.
- Another situation is that if the task has no subtasks that need to be allocated, the task needs to be deleted from the local task list TL of resources to be allocated.
- the matching work can be completed by the entity of the matching module (not shown in the figure, the matching module can be set in the resource module).
- the matching module obtains the resource requirements of the task, that is, the resource requirements of the task.
- the resource requirements of the task are: at least one device, a line card of a coil detector (visual leak detector, VLD), and a master control of the T1042, and no attention is paid to other attributes.
- the resources of the resource pool are matched one by one. If it can be matched, the subtask assigned to the resource is returned to the subtask execution module, and if it does not match, the next resource is replaced.
- the task module also includes a subtask execution module, which is used to occupy resources for test execution.
- the execution process is done at the granularity of subtasks. Therefore, each subtask will occupy different test resources, and the results of the execution will be written into the database.
- the task module When the subtask is completed, the task module will check whether the parent task of the subtask is completed, and if it is completed, it will collect the results of all the subtasks and send emails to notify the relevant parties.
- a resource release message will be generated to the resource release queue release.resource.queue.
- the resource pool management module reads the resource release message, it releases the resource and reclaims the resource into the resource pool.
- the method includes the following steps.
- the system user creates a task with a version number in the task module, and then executes step 1.1 to write to the database.
- Step 2 Query task.
- step 2.1 query the database
- step 2.2 the database returns the query result (with execution status);
- step 2.3 return the result.
- Step 3 Start the task.
- Step 4 The task module adds tasks to the task queue.
- the resource management module executes step 0, that is, after monitoring the task queue message, executes step 4.1 to add the task to the task list (Task List).
- the priority (weight) of a task is 100 by default, and the weight of a subtask is reduced by 1.
- Step 5 Find the task after matching the resource.
- the resource management module executes step 0, that is, starts the worker every minute to determine whether there are idle resources. After matching the resource (that is, there is an idle resource), sort the tasks to be allocated resources according to the weight; calculate whether the idle resource matches the task with the highest weight; when it matches, it is the priority among the tasks with the highest weight The highest subtask allocates resources.
- Step 6 When the resource meets the subtask execution condition, add the subtask to the subtask queue.
- the execution module proceeds to step 0, that is, monitoring.
- Step 7 Execution step.
- Step 0 in Figure 2 indicates that this step is the following worker task thread, which is similar to a daemon thread, which always exists and will be executed once every minute, and has no relationship with other steps.
- the resource management module is a big module name, which is used to manage all resources.
- the local resource management module is a module that records the current task resources and resource information in the resource management module. It can be said that the local resource management module is resource management The most important part of the module.
- the technical solution provided by this embodiment can realize fine-grained execution and scheduling of task execution, overcome the extensive scheduling dimension of using tasks as the scheduling unit in resource scheduling in the prior art, and can complete dynamic and intelligent allocation of resources And management, through intelligent resource occupation and release solutions to solve the problem of inefficient resource occupation caused by manual occupation. It solves the problem of dynamic resource allocation of automated tasks in the distributed environment of hardware automated testing, and can effectively avoid long-term occupation of resources by large tasks with a long execution time in the non-discriminatory mode, leading to "starvation" of other tasks with higher priority .
- Fig. 4 is a schematic structural diagram of an apparatus for automatic test resource management according to an embodiment of the present disclosure.
- the device includes: a checking unit for checking whether there are idle resources at regular intervals; a sorting unit for sorting tasks to be allocated resources according to weights when there are idle resources; a calculation unit for calculating Whether the idle resource matches the task with the highest weight; and an allocation unit configured to allocate resources to the subtask with the highest priority among the tasks with the highest weight when matching.
- the device also includes: a weight management unit, configured to reduce the weight of the task with the highest weight according to a preset ratio after allocating resources to the subtask with the highest priority among the tasks with the highest weight; the ranking unit also uses If there are remaining free resources, the tasks to be allocated are again sorted according to their weights; the calculation unit is also used to calculate whether the remaining free resources match the task with the highest weight; the allocation unit also uses When matching, resources are allocated to the subtask with the highest priority among the tasks with the highest weight. And so on, until there are no free resources.
- a weight management unit configured to reduce the weight of the task with the highest weight according to a preset ratio after allocating resources to the subtask with the highest priority among the tasks with the highest weight
- the ranking unit also uses If there are remaining free resources, the tasks to be allocated are again sorted according to their weights; the calculation unit is also used to calculate whether the remaining free resources match the task with the highest weight; the allocation unit also uses When matching, resources are allocated to the subtask with the highest priority among the tasks
- the device also includes: an execution unit for executing the subtask with the highest priority according to the allocated resources; and a release unit for releasing the subtask when the execution of the subtask with the highest priority is completed or fails.
- the resources allocated are allocated.
- the matching unit is further configured to allocate resources to the subtask with the highest priority among the tasks with the second highest weight when there is no match.
- the matching unit is further configured to delete any task to be allocated when there is no subtask that needs to be allocated in any task to be allocated.
- the device also includes: a saving unit for saving the execution result when the execution of the subtask with the highest priority is completed; a checking unit for checking whether the task of the subtask with the highest priority is all completed; and collecting The unit is used to collect the execution results of all subtasks in the task when all are completed.
- the device also includes: a task management unit for receiving tasks of resources to be allocated; and splitting each task of resources to be allocated into one or more subtasks according to business attributes.
- the checking unit, sorting unit, calculating unit, allocation unit, releasing unit, checking unit, and collecting unit in this embodiment can be set in the resource module shown in FIG. 3.
- the weight management unit, execution unit, and task management unit in this embodiment can be set in the task module shown in FIG. 3.
- the embodiment of the present disclosure also provides a device for automated test resource management, including a memory, a processor, and a computer program stored on the memory and capable of running on the processor, and the computer program is executed by the processor.
- the processor implements the resource management method according to the foregoing embodiment of the present disclosure.
- the embodiments of the present disclosure also provide a computer-readable storage medium having an information processing program stored on the computer-readable storage medium.
- the processor implements the foregoing implementation according to the present disclosure. Examples of resource management methods.
- Such software may be distributed on a computer-readable medium
- the computer-readable medium may include a computer storage medium (or non-transitory medium) and a communication medium (or transitory medium).
- the term computer storage medium includes volatile and non-volatile memory implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data).
- Computer storage media include but are not limited to RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cassette, tape, magnetic disk storage or other magnetic storage device, or Any other medium used to store desired information and that can be accessed by a computer.
- communication media usually contain computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as carrier waves or other transmission mechanisms, and may include any information delivery media .
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
Description
Claims (10)
- 一种自动化测试资源管理的方法,包括:A method for automated test resource management, including:定时检查是否存在空闲资源;Regularly check whether there are idle resources;响应于存在空闲资源,将待分配资源的任务按照权重进行排序;In response to the existence of idle resources, sort the tasks to be allocated resources according to their weights;计算所述空闲资源是否与权重最高的任务匹配;以及Calculate whether the idle resource matches the task with the highest weight; and响应于匹配,为所述权重最高的任务中优先级最高的子任务分配资源。In response to the match, resources are allocated to the subtask with the highest priority among the tasks with the highest weight.
- 根据权利要求1所述的方法,其中,在为所述权重最高的任务中优先级最高的子任务分配资源的步骤之后,该方法还包括:The method according to claim 1, wherein after the step of allocating resources to the subtask with the highest priority among the tasks with the highest weight, the method further comprises:按照预设比例降低所述权重最高的任务的权重;Reduce the weight of the task with the highest weight according to a preset ratio;响应于还存在剩余的空闲资源,再次将待分配资源的任务按照权重进行排序;In response to remaining idle resources, the tasks to be allocated resources are again sorted according to their weights;计算所述剩余的空闲资源是否与权重最高的任务匹配;Calculating whether the remaining idle resources match the task with the highest weight;响应于匹配,为所述权重最高的任务中优先级最高的子任务分配资源,In response to matching, resources are allocated to the subtask with the highest priority among the tasks with the highest weight,以此类推,直至不存在空闲资源。And so on, until there are no free resources.
- 根据权利要求1所述的方法,还包括:The method according to claim 1, further comprising:根据所述分配的资源执行所述优先级最高的子任务;以及Execute the subtask with the highest priority according to the allocated resources; and响应于所述优先级最高的子任务执行完成或者执行失败,释放所述分配的资源。In response to the completion or failure of the execution of the subtask with the highest priority, the allocated resources are released.
- 根据权利要求1所述的方法,还包括:The method according to claim 1, further comprising:响应于不匹配,为权重第二高的任务中优先级最高的子任务分配资源。In response to the mismatch, resources are allocated to the subtask with the highest priority among the tasks with the second highest weight.
- 根据权利要求1所述的方法,还包括:The method according to claim 1, further comprising:响应于待分配资源的任务中没有需要分配资源的子任务,删除 所述待分配资源的任务。In response to that there is no subtask requiring resource allocation among the tasks to be allocated resources, the task to be allocated resources is deleted.
- 根据权利要求3所述的方法,还包括:The method according to claim 3, further comprising:响应于所述优先级最高的子任务执行完成,保存执行结果;In response to the completion of the execution of the subtask with the highest priority, save the execution result;检查所述优先级最高的子任务所在的任务是否全部完成;以及Check whether the tasks of the subtasks with the highest priority are all completed; and响应于全部完成,收集所述任务中所有子任务的执行结果。In response to all completion, the execution results of all subtasks in the task are collected.
- 根据权利要求1所述的方法,还包括:The method according to claim 1, further comprising:接收所述待分配资源的任务;Receiving the task of the resource to be allocated;根据业务属性将所述待分配资源的任务拆分为一个或多个子任务。Split the task of the resource to be allocated into one or more subtasks according to the business attributes.
- 一种自动化测试资源管理的装置,包括:An automatic test resource management device, including:检查单元,用于定时检查是否存在空闲资源;The checking unit is used to periodically check whether there are idle resources;排序单元,用于当存在空闲资源时,将待分配资源的任务按照权重进行排序;The sorting unit is used to sort tasks to be allocated resources according to their weights when there are idle resources;计算单元,用于计算所述空闲资源是否与权重最高的任务匹配;以及A calculation unit for calculating whether the idle resource matches the task with the highest weight; and分配单元,用于当匹配时,为所述权重最高的任务中优先级最高的子任务分配资源。The allocation unit is configured to allocate resources to the subtask with the highest priority among the tasks with the highest weight when matching.
- 一种自动化测试资源管理的装置,包括存储器、处理器及存储在所述存储器上并可在所述处理器上运行的计算机程序,所述计算机程序被所述处理器执行时,所述处理器实现根据权利要求1-7中任一项所述资源管理的方法。A device for automatic test resource management includes a memory, a processor, and a computer program stored on the memory and capable of running on the processor. When the computer program is executed by the processor, the processor A method for implementing resource management according to any one of claims 1-7.
- 一种计算机可读存储介质,其上存储有信息处理程序,所述信息处理程序被处理器执行时,所述处理器实现根据权利要求1-7中任一项所述资源管理的方法。A computer-readable storage medium having an information processing program stored thereon, and when the information processing program is executed by a processor, the processor implements the resource management method according to any one of claims 1-7.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910672201.9 | 2019-07-24 | ||
CN201910672201.9A CN112286651A (en) | 2019-07-24 | 2019-07-24 | Method and device for automatically testing resource management |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2021013124A1 true WO2021013124A1 (en) | 2021-01-28 |
Family
ID=74192823
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2020/103017 WO2021013124A1 (en) | 2019-07-24 | 2020-07-20 | Method and device for managing automated testing resources |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN112286651A (en) |
WO (1) | WO2021013124A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20230318918A1 (en) * | 2022-03-31 | 2023-10-05 | Lenovo (United States) Inc. | Unused device repurposing system |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102932279A (en) * | 2012-10-30 | 2013-02-13 | 北京邮电大学 | Multidimensional resource scheduling system and method for cloud environment data center |
CN104268018A (en) * | 2014-09-22 | 2015-01-07 | 浪潮(北京)电子信息产业有限公司 | Job scheduling method in Hadoop cluster and job scheduler |
US9158591B2 (en) * | 2012-10-24 | 2015-10-13 | Metric Holdings, Llc | System and method for controlled sharing of consumable resources in a computer cluster |
CN110019487A (en) * | 2018-08-16 | 2019-07-16 | 联动优势电子商务有限公司 | A kind of database connection management method and device |
-
2019
- 2019-07-24 CN CN201910672201.9A patent/CN112286651A/en active Pending
-
2020
- 2020-07-20 WO PCT/CN2020/103017 patent/WO2021013124A1/en active Application Filing
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9158591B2 (en) * | 2012-10-24 | 2015-10-13 | Metric Holdings, Llc | System and method for controlled sharing of consumable resources in a computer cluster |
CN102932279A (en) * | 2012-10-30 | 2013-02-13 | 北京邮电大学 | Multidimensional resource scheduling system and method for cloud environment data center |
CN104268018A (en) * | 2014-09-22 | 2015-01-07 | 浪潮(北京)电子信息产业有限公司 | Job scheduling method in Hadoop cluster and job scheduler |
CN110019487A (en) * | 2018-08-16 | 2019-07-16 | 联动优势电子商务有限公司 | A kind of database connection management method and device |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20230318918A1 (en) * | 2022-03-31 | 2023-10-05 | Lenovo (United States) Inc. | Unused device repurposing system |
US11968087B2 (en) * | 2022-03-31 | 2024-04-23 | Lenovo (Singapore) Pte. Ltd. | Unused device repurposing system |
Also Published As
Publication number | Publication date |
---|---|
CN112286651A (en) | 2021-01-29 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2020181813A1 (en) | Task scheduling method based on data processing and related device | |
WO2020147330A1 (en) | Data stream processing method and system | |
CN107992359B (en) | Task scheduling method for cost perception in cloud environment | |
US20170357531A1 (en) | Priority-based resource allocation | |
US8458712B2 (en) | System and method for multi-level preemption scheduling in high performance processing | |
US8006003B2 (en) | Apparatus, system, and method for enqueue prioritization | |
CN106293893B (en) | Job scheduling method and device and distributed system | |
US20060070072A1 (en) | Information processing apparatus, memory area management method, and computer program | |
CN107515781B (en) | Deterministic task scheduling and load balancing system based on multiple processors | |
CN111190691A (en) | Automatic migration method, system, device and storage medium suitable for virtual machine | |
CN111427670A (en) | Task scheduling method and system | |
WO2024082584A1 (en) | Resource allocation method, container management assembly and resource allocation system | |
CN113032125A (en) | Job scheduling method, device, computer system and computer-readable storage medium | |
WO2021013124A1 (en) | Method and device for managing automated testing resources | |
US8108573B2 (en) | Apparatus, system, and method for enqueue prioritization | |
CN112699098A (en) | Index data migration method, device and equipment | |
CN111580951A (en) | Task allocation method and resource management platform | |
US20070174836A1 (en) | System for controlling computer and method therefor | |
CN110912949B (en) | Method and device for submitting sites | |
US7680921B2 (en) | Management system, management computer, managed computer, management method and program | |
CN115454718A (en) | Automatic database backup file validity detection method | |
CN115878910A (en) | Line query method, device and storage medium | |
US11348656B2 (en) | Efficient resource sharing | |
CN111352710B (en) | Process management method and device, computing equipment and storage medium | |
Chen et al. | Speculative slot reservation: Enforcing service isolation for dependent data-parallel computations |
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: 20844286 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 20844286 Country of ref document: EP Kind code of ref document: A1 |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 20844286 Country of ref document: EP Kind code of ref document: A1 |
|
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 21/09/2022) |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 20844286 Country of ref document: EP Kind code of ref document: A1 |