WO2021147382A1 - Procédé et dispositif d'exécution de tâches de test - Google Patents
Procédé et dispositif d'exécution de tâches de test Download PDFInfo
- Publication number
- WO2021147382A1 WO2021147382A1 PCT/CN2020/120885 CN2020120885W WO2021147382A1 WO 2021147382 A1 WO2021147382 A1 WO 2021147382A1 CN 2020120885 W CN2020120885 W CN 2020120885W WO 2021147382 A1 WO2021147382 A1 WO 2021147382A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- execution
- executed
- detection
- time
- task
- 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/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. 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
Definitions
- determining the synchronous detection information and the asynchronous detection information in the detection task to be executed includes:
- the asynchronous execution time between any detection task to be executed in the asynchronous execution relationship is determined according to the detection time of the detection task currently to be executed and the information of the asynchronous detection.
- determining the basic time consumed by the execution of the detection task currently to be executed according to the judgment result and the related information of the detection task currently to be executed includes:
- the execution end point of the currently to-be-executed detection task is the same as the execution start point of the next-to-be-executed detection task, then the execution safety point of the current to-be-executed detection task is ,
- the execution start point determines the basic time consumed for execution.
- the remaining detection tasks to be executed are sequentially inserted into the sorting queue according to a preset insertion manner, and the task execution queue is obtained after the insertion of the last detection task to be executed is completed.
- this application obtains relevant information of multiple to-be-executed detection tasks, where the relevant information includes the execution safety point, the execution start point, the detection time, and the execution end point; determining the to-be-executed The information of synchronous detection and asynchronous detection in the detection task; the basic time consumed by the execution of each detection task to be executed is determined according to the related information of the detection task, the information of the synchronous detection and the information of the asynchronous detection, Synchronous execution time and asynchronous execution time; according to the basic time, synchronous execution time and asynchronous execution time consumed by the execution of each detection task to be executed, all the detection tasks to be executed are arranged into the task execution queue. Therefore, the optimal execution sequence of the detection task can be dynamically calculated based on the starting and ending path of the detection and the time-consuming comparison of multiple stages, so as to achieve the minimum overall time-consuming, improve task execution efficiency and allocate resources more reasonably.
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
L'objet de la présente demande est de pourvoir à un procédé et un dispositif d'exécution de tâches de test. La présente demande consiste à : acquérir des informations pertinentes concernant une pluralité de tâches de test à exécuter, les informations pertinentes comprenant un point de sécurité d'exécution, un point de début d'exécution, un temps de test et un point de fin d'exécution ; déterminer des informations concernant un test synchrone et des informations concernant un test asynchrone dans lesdites tâches de test ; en fonction des informations pertinentes concernant lesdites tâches de test, des informations concernant un test synchrone et des informations concernant un test asynchrone, déterminer un temps de base, un temps d'exécution synchrone et un temps d'exécution asynchrone consommés pour exécuter chacune desdites tâches de test ; et ordonner toutes lesdites tâches de test en fonction du temps de base, du temps d'exécution synchrone et du temps d'exécution asynchrone consommés pour exécuter chacune desdites tâches de test, et placer lesdites tâches de test dans une file d'attente d'exécution de tâches. De cette manière, la séquence d'exécution optimale de tâches de test à exécuter peut être calculée de manière dynamique sur la base d'un chemin de test de départ et d'un chemin de test de fin et par comparaison de la consommation de temps dans une pluralité de phases, de manière à obtenir la consommation de temps totale globale minimale.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010072757.7 | 2020-01-21 | ||
CN202010072757.7A CN111309475B (zh) | 2020-01-21 | 2020-01-21 | 一种检测任务执行方法及设备 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2021147382A1 true WO2021147382A1 (fr) | 2021-07-29 |
Family
ID=71148917
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2020/120885 WO2021147382A1 (fr) | 2020-01-21 | 2020-10-14 | Procédé et dispositif d'exécution de tâches de test |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN111309475B (fr) |
WO (1) | WO2021147382A1 (fr) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111309475B (zh) * | 2020-01-21 | 2022-12-02 | 上海万物新生环保科技集团有限公司 | 一种检测任务执行方法及设备 |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20140053157A1 (en) * | 2012-08-16 | 2014-02-20 | Microsoft Corporation | Asynchronous execution flow |
US20150227389A1 (en) * | 2014-02-07 | 2015-08-13 | International Business Machines Corporation | Interleave-scheduling of correlated tasks and backfill-scheduling of depender tasks into a slot of dependee tasks |
CN106598725A (zh) * | 2016-10-31 | 2017-04-26 | 武汉斗鱼网络科技有限公司 | 一种基于Android的Handler防内存泄漏装置及方法 |
CN109298951A (zh) * | 2018-08-21 | 2019-02-01 | 平安科技(深圳)有限公司 | Celery任务的执行方法及终端设备 |
CN109710407A (zh) * | 2018-12-21 | 2019-05-03 | 浪潮电子信息产业股份有限公司 | 分布式系统实时任务调度方法、装置、设备及存储介质 |
CN111309475A (zh) * | 2020-01-21 | 2020-06-19 | 上海悦易网络信息技术有限公司 | 一种检测任务执行方法及设备 |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109213080B (zh) * | 2017-06-29 | 2020-10-23 | 深圳模德宝科技有限公司 | 一种机床的控制方法及其装置 |
CN108255589A (zh) * | 2017-08-29 | 2018-07-06 | 平安科技(深圳)有限公司 | 任务调度方法及服务器 |
CN109445926A (zh) * | 2018-11-09 | 2019-03-08 | 杭州玳数科技有限公司 | 数据任务调度方法及数据任务调度系统 |
CN109992385B (zh) * | 2019-03-19 | 2021-05-14 | 四川大学 | 一种基于任务均衡调度的gpu内部能耗优化方法 |
CN110489217A (zh) * | 2019-07-11 | 2019-11-22 | 新华三大数据技术有限公司 | 一种任务调度方法及系统 |
-
2020
- 2020-01-21 CN CN202010072757.7A patent/CN111309475B/zh active Active
- 2020-10-14 WO PCT/CN2020/120885 patent/WO2021147382A1/fr active Application Filing
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20140053157A1 (en) * | 2012-08-16 | 2014-02-20 | Microsoft Corporation | Asynchronous execution flow |
US20150227389A1 (en) * | 2014-02-07 | 2015-08-13 | International Business Machines Corporation | Interleave-scheduling of correlated tasks and backfill-scheduling of depender tasks into a slot of dependee tasks |
CN106598725A (zh) * | 2016-10-31 | 2017-04-26 | 武汉斗鱼网络科技有限公司 | 一种基于Android的Handler防内存泄漏装置及方法 |
CN109298951A (zh) * | 2018-08-21 | 2019-02-01 | 平安科技(深圳)有限公司 | Celery任务的执行方法及终端设备 |
CN109710407A (zh) * | 2018-12-21 | 2019-05-03 | 浪潮电子信息产业股份有限公司 | 分布式系统实时任务调度方法、装置、设备及存储介质 |
CN111309475A (zh) * | 2020-01-21 | 2020-06-19 | 上海悦易网络信息技术有限公司 | 一种检测任务执行方法及设备 |
Also Published As
Publication number | Publication date |
---|---|
CN111309475A (zh) | 2020-06-19 |
CN111309475B (zh) | 2022-12-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN107450979B (zh) | 一种区块链共识方法及装置 | |
WO2017076184A1 (fr) | Procédé et dispositif d'écriture de données dans un système de fichier distribué | |
WO2017167105A1 (fr) | Procédé et dispositif de planification de tâches-ressources | |
CN111427859B (zh) | 一种消息处理方法、装置、电子设备及存储介质 | |
CN111949568B (zh) | 一种报文处理方法、装置及网络芯片 | |
CN116167463B (zh) | 一种面向智能计算的分布式模型训练容器调度方法及装置 | |
US9870314B1 (en) | Update testing by build introspection | |
US9921951B2 (en) | Optimizations for regression tracking and triaging in software testing | |
WO2021147382A1 (fr) | Procédé et dispositif d'exécution de tâches de test | |
CN117234859B (zh) | 一种性能事件监控方法、装置、设备和存储介质 | |
CN113282402A (zh) | 一种面向复杂资源约束的测试任务调度方法 | |
CN114861579A (zh) | 集成电路中时序瓶颈节点分析和时序优化方法及系统 | |
WO2018127012A1 (fr) | Procédé et dispositif de détection de grappe de nœuds de transmission | |
US10929054B2 (en) | Scalable garbage collection | |
CN112989758B (zh) | 对多个原型验证板同步复位的方法、验证系统及存储介质 | |
CN113918322A (zh) | 在内存中动态存储逻辑系统设计的仿真数据的方法及设备 | |
WO2024032781A1 (fr) | Procédé et appareil de test d'algorithme, et support de stockage | |
CN117251275A (zh) | 多应用异步i/o请求的调度方法及系统、设备及介质 | |
CN107451038B (zh) | 硬件事件采集方法、处理器和计算系统 | |
CN109669735B (zh) | 基于延时注册的应用启动方法、装置和存储介质 | |
CN110046194A (zh) | 一种扩展节点关系图的方法、装置和电子设备 | |
CN111045959B (zh) | 一种基于存储优化的复杂算法变量映射方法 | |
CN113419832A (zh) | 一种延迟任务的处理方法、装置及终端 | |
CN111367785A (zh) | 基于sdn的故障检测方法、装置和服务器 | |
CN116090382B (zh) | 时序报告生成方法和设备 |
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: 20915960 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: 20915960 Country of ref document: EP Kind code of ref document: A1 |