CN102455941B - Multitask scheduling method and device based on normal form - Google Patents
Multitask scheduling method and device based on normal form Download PDFInfo
- Publication number
- CN102455941B CN102455941B CN201010525056.0A CN201010525056A CN102455941B CN 102455941 B CN102455941 B CN 102455941B CN 201010525056 A CN201010525056 A CN 201010525056A CN 102455941 B CN102455941 B CN 102455941B
- Authority
- CN
- China
- Prior art keywords
- normal form
- form expression
- expression formula
- node
- resolve
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Devices For Executing Special Programs (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention is applicable to the field of computer, and provides a multitask scheduling method, device and communication terminal based on a normal form. The method comprises the following steps of: receiving and analyzing a normal form expression which defines the execution sequence and serial and parallel relations of tasks; and performing scheduling processing on the multitask according to the analyzed normal form expression. According to the invention, after the normal form expression which represents the execution sequence of multitask and the serial and parallel relations of tasks is received, the received normal form expression is analyzed according to a normal form rule stored as a separate definition file, and simultaneously, the analyzed normal form expression is executed according to a fixed program provided for the normal form. When the execution sequence or the serial or parallel relations of the tasks are changed, only the normal form expression representing the tasks needs to be modified, thereby saving the time for recompiling codes and achieving the aim of quickly adapting to required change.
Description
Technical field
The invention belongs to computer realm, relate in particular to a kind of multi-task scheduling method, device based on normal form.
Background technology
When carrying out a plurality of task, can carry out one by one according to certain order, also can a plurality of tasks carry out simultaneously.In practical application, the priority execution sequence of string, concurrency relation and the task of conventional coded representation task.When the serial parallel relation of task or the sequencing of execution difference, its corresponding code is also different.
Suppose there is A, B, tri-tasks of C, require first to carry out A, then carry out B and C simultaneously, while stating demand in realization, by following code, realize:
The first step, the A:callTask that executes the task (A);
Second step, newly created threads T:createThread (T);
The 3rd step, carries out T, and B starts to carry out: T.run ()
The 4th step, the C:callTask that executes the task (C)
Wherein, the 3rd step is carried out by new thread, and the 4th step is carried out by main thread, and new thread and main thread are execute the task B and C simultaneously.
When requiring to become order and carry out A, B, C, code is changed into:
The first step, carries out A:callTask (A);
Second step, carries out B:callTask (B);
The 3rd step, carries out C:callTask (C);
In the time need to changing the execution sequence of task or concurrency relation, the code of corresponding its realization flow also needs to revise, and need to again debug, compile, test, dispose, if debugging or test job are incorrect, also has the risk of makeing mistakes.
Summary of the invention
The invention provides a kind of multi-task scheduling method based on normal form, while being intended to solve the execution sequence of change task or string, concurrency relation, need to remodify code, write, the problem of compiled code.
The present invention is achieved in that a kind of multi-task scheduling method based on normal form, and described method comprises the steps:
Receive and resolve normal form expression formula, described normal form expression formula has defined execution sequence and the serial parallel relation of task;
According to the normal form expression formula after resolving, multitask is carried out to dispatch deal;
Wherein said reception the step of resolving normal form expression formula are specially:
Whether the number that judges node in described normal form expression formula is 0, if 0, resolve and finish; If not 0, continue to judge whether the number of node in the normal form expression formula receiving is 1, if 1, directly resolve this node; If not 1, by normal form expression parsing, be two normal form expression formulas;
Recurrence carries out describedly judge whether the number of node in described normal form expression formula is 0, if 0, resolve and finish; If not 0, continue to judge whether the number of node in the normal form expression formula receiving is 1, if 1, directly resolve this node; If not 1, by normal form expression parsing, be the step of two normal form expression formulas, until the number of node is 0 in normal form expression formula.
Another object of the present invention is to provide a kind of multi-task scheduling device based on normal form, described device comprises:
Resolve normal form module, for receiving and resolve normal form expression formula, described normal form expression formula has defined execution sequence and the serial parallel relation of task;
Scheduling normal form module, for carrying out dispatch deal according to the normal form expression formula after resolving to multitask;
Wherein said parsing normal form module comprises:
The first judging unit, for judging whether the number of normal form expression formula node is 0, if 0, resolve and finish; If not 0, continue to judge whether the number of node in the normal form expression formula receiving is 1, if 1, directly resolve this node; If not 1, by normal form expression parsing, be two normal form expression formulas, recurrence carries out describedly judge whether the number of node in described normal form expression formula is 0, if 0, resolve and finish; If not 0, continue to judge whether the number of node in the normal form expression formula receiving is 1, if 1, directly resolve this node; If not 1, by normal form expression parsing, be the step of two normal form expression formulas, until the number of node is 0 in normal form expression formula.
The embodiment of the present invention, after receiving and resolve the priority execution sequence and the serial between task and concurrency relation normal form expression formula of the execution sequence of the task that defined and a plurality of tasks of expression of serial parallel relation, the normal form expression formula receiving according to the normal form rule parsing getting up as independent configuration file stores, according to the fixed routine providing for normal form expression formula, carry out the dispatch deal that the normal form expression formula after resolving is carried out to multitask more simultaneously, during due to the priority execution sequence in task or serial or concurrency relation change, only need to revise the normal form expression formula that has defined the execution sequence of a plurality of tasks and the expression task of serial parallel relation, therefore saved again and write, the time of compiled code, reach the object of quick adaption demand change.
Accompanying drawing explanation
Fig. 1 is the multi-task scheduling method flow process based on normal form that the embodiment of the present invention provides;
Fig. 2 is the structure of the multi-task scheduling device based on normal form that provides of the embodiment of the present invention.
Embodiment
In order to make object of the present invention, technical scheme and advantage clearer, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein, only in order to explain the present invention, is not intended to limit the present invention.
After the invention process receives and resolves the priority execution sequence and the serial between task and concurrency relation normal form expression formula of the execution sequence of the task that defined and a plurality of tasks of expression of serial parallel relation, the normal form expression formula receiving according to the normal form rule parsing getting up as independent configuration file stores carries out according to the fixed routine providing for normal form expression formula the dispatch deal that the normal form expression formula after resolving is carried out to multitask simultaneously again.
The invention provides a kind of multi-task scheduling method, device and communication terminal based on normal form:
Described method comprises: receive and resolve normal form expression formula, described normal form expression formula has defined execution sequence and the serial parallel relation of task;
According to the normal form expression formula after resolving, multitask is carried out to dispatch deal.
Described device comprises: resolve normal form module, for receiving and resolve normal form expression formula, described normal form expression formula has defined execution sequence and the serial parallel relation of task;
Scheduling normal form module, for carrying out dispatch deal according to the normal form expression formula after resolving to multitask.
Described communication terminal comprises: the communication terminal that comprises the above-mentioned multi-task scheduling device based on normal form.
In the embodiment of the present invention, after receiving and resolve the priority execution sequence and the serial between task and concurrency relation normal form expression formula of the execution sequence of the task that defined and a plurality of tasks of expression of serial parallel relation, the normal form expression formula receiving according to the normal form rule parsing getting up as independent configuration file stores, according to the fixed routine providing for normal form expression formula, carry out the dispatch deal that the normal form expression formula after resolving is carried out to multitask more simultaneously, during due to the priority execution sequence in task or serial or concurrency relation change, only need to revise the normal form expression formula that has defined the execution sequence of a plurality of tasks and the expression task of serial parallel relation, therefore saved again and write, the time of compiled code, reach the object of quick adaption demand change.
embodiment mono-:
Fig. 1 shows the multi-task scheduling method flow process based on normal form that the embodiment of the present invention provides, and details are as follows:
In step S11, receive and resolve normal form expression formula, described normal form expression formula has defined execution sequence and the serial parallel contextual definition of task;
Normal form expression formula is node of each task definition, such as, with node A sign task A, with node B sign task B, guarantee a task of each node sign; Execution sequence between definition task, such as defining the order of from left to right carrying out normal form expression formula, the order of each task that in normal form expression formula, each node represents is carried out in i.e. definition, wherein, the sequencing of carrying out normal form expression formula can also be used the bracket of definition to change, the priority of determining bracket is the highest, i.e. it is similar to the order of carrying out the arithmetic of only having unlike signs, bracket on mathematics that the order of each task is carried out in definition; Further, this normal form expression formula also comprises definition: between two nodes that represent two tasks, define a separator, this separator represents two nodes that serial or executed in parallel are spaced, such as, with comma, " represent that serial carries out two nodes that are spaced, with branch "; " represent two nodes that executed in parallel is spaced.
Suppose that a normal form expression formula is A, (B; C), comma, " two nodes of expression serial execution, branch "; " representing two nodes of executed in parallel, the priority of round bracket is higher than serial, parallel executive mode, and execution sequence is order from left to right, and this normal form expression formula represents first to carry out (B; C), obtain result D, then carry out A, D, wherein, and executed in parallel node B and node C, node A and node D are carried out in serial.
Certainly, for the node of each task definition, execution sequence between task and the symbol of separating two nodes can change according to the change of actual conditions, be not construed as limiting herein.
Wherein, receive and resolve normal form expression formula, described normal form expression formula has defined the execution sequence of task and the step of serial parallel relation is specially:
Whether the number that judges node in normal form expression formula is 0, if 0, return; If not 0, continue to judge whether the number of node in the normal form expression formula of this reception is 1, if 1, directly resolve this node; If not 1, by this normal form expression parsing, be two normal form expression formulas, recurrence is carried out above-mentioned steps, until the number of node is 0 in normal form expression formula.
By a normal form expression parsing, be after two normal form expression formulas, continue to resolve respectively this two normal form expression formulas.Obtain respectively the number of node in these two normal form expression formulas, if there is no node in normal form expression formula, return, if only have a node, directly resolve this node, if there are two or more nodes, continuing normal form expression parsing is two normal form expression formulas, and the separator serial between two normal form expression formulas that obtain according to parsing or parallel these two normal form expression formulas of resolving, if separator is identical with the serial separator of normal form expression formula definition, first resolve the normal form expression formula that priority is higher, resolve again the normal form expression formula that priority is lower, if separator and normal form rule definition and line Separator identical, newly-built thread is resolved the higher normal form expression formula of priority, in main thread, resolve again the normal form expression formula that priority is lower.Recurrence is carried out above-mentioned steps, until the node number in normal form expression formula is 0.
As an alternative embodiment of the invention, at normal form expression formula node, be more than or equal at 2 o'clock, the step that is two normal form expression formulas by normal form expression parsing is specially: whether the step that two normal form expression formulas that obtain are resolved in judgement execution is last execution step in former normal form expression formula, if, last execution step of this former normal form expression formula is resolved to two normal form expression formulas, recurrence is carried out above-mentioned steps, until the node number in normal form expression formula is 0.
Suppose that normal form expression formula is A; (B, C), D, the priority of round bracket is higher than serial and parallel execution sequence, comma, " represent that serial carries out, branch "; " represent executed in parallel, and execution sequence is order from left to right.Resolve this normal form expression formula, because the node number of this normal form expression formula is 4, therefore first judge execution [A; (B, C)], whether D is last execution step in former normal form expression formula, is judging [A; (B, C)], D be in former normal form expression formula last execution step after, by normal form expression formula A; (B, C), D resolves to normal form expression formula D and normal form expression formula A; (B, C).Again because normal form expression formula A; In (B, C), the number of node is 3, therefore must be by normal form expression formula A; (B, C) resolves to two normal form expression formulas: because round bracket priority is higher than string, parallel execution sequence, therefore by normal form expression formula A; (B, C) resolves to normal form expression formula A and normal form expression formula (B, C).Continue to resolve normal form expression formula (B, C), resolved to normal form expression formula C and normal form expression formula B, in the embodiment of the present invention, by a former normal form expression parsing, be two normal form expression formulas, be all last execution step of resolving this former normal form expression formula, recurrence is carried out above-mentioned steps, until the number of node is that 1 just to stop a normal form expression parsing be two normal form expression formulas in normal form expression formula.
In step S12, according to the normal form expression formula after resolving, multitask is carried out to dispatch deal.
The step of wherein, according to the normal form expression formula after resolving, multitask being carried out to dispatch deal is specially:
If node number is 0, processing finishes; If node number is 1, directly carry out this node termination routine; If node number is more than or equal to 2, according to separator serial or these two normal form expression formulas of Parallel Scheduling between two normal form expression formulas that obtain from former normal form expression parsing.
Suppose that normal form expression formula is A; (B, C), D, the priority of round bracket is higher than serial and parallel execution sequence, comma, " represent that serial carries out, branch "; " represent executed in parallel, and execution sequence is order from left to right.This normal form expression formula is progressively resolved to normal form expression formula D, normal form expression formula A, normal form expression formula C and normal form expression formula B from last execution step.Whole recurrence is carried out according to the order of popping, first carry out normal form expression formula B, carry out again normal form expression formula C, and obtain result E, and because the separator between normal form expression formula A and normal form expression formula (B, C) is and line identifier, so newly-built thread execution E, in main thread, carry out normal form expression formula A again, finally just carry out normal form expression formula D, the processing procedure that this recurrence is popped is identical with the execution sequence of normal form expression formula definition.
In the embodiment of the present invention, after receiving and resolve the execution sequence of the task that defined and the normal form expression formula of serial parallel relation, the dispatch deal that according to the fixed routine providing for normal form expression formula, the normal form expression formula after resolving is carried out to multitask again, during due to the priority execution sequence in task or serial or concurrency relation change, only need to revise defined the execution sequence of a plurality of tasks and serial parallel relation normal form expression formula, therefore saved again write, time of compiled code, reach the object of quick adaption demand change.
embodiment bis-:
Fig. 2 shows the structure of the multi-task scheduling device based on normal form that the embodiment of the present invention provides, and for convenience of explanation, only shows the part relevant to the embodiment of the present invention.
Should the multi-task scheduling device based on normal form can be to run on the unit that software unit, hardware cell or software and hardware in communication terminal combine, also can be used as independently suspension member is integrated in these communication terminals or runs in the application system of these communication terminals, wherein:
Resolve normal form module 21 and receive and resolve normal form expression formula, described normal form expression formula has defined execution sequence and the serial parallel relation of task;
Normal form expression formula is node of each task definition, such as, with node A sign task A, with node B sign task B, guarantee a task of each node sign; Execution sequence between definition task, such as defining the order of from left to right carrying out normal form expression formula, the order of each task that in normal form expression formula, each node represents is carried out in i.e. definition, wherein, the sequencing of carrying out normal form expression formula can also be used the bracket of definition to change, the priority of determining bracket is the highest, i.e. it is similar to the order of carrying out the arithmetic of only having unlike signs, bracket on mathematics that the order of each task is carried out in definition; Further, this normal form expression formula also comprises definition: between two nodes that represent two tasks, define a separator, this separator represents two nodes that serial or executed in parallel are spaced, such as, with comma, " represent that serial carries out two nodes that are spaced, with branch "; " represent two nodes that executed in parallel is spaced.
Certainly, for the node of each task definition, execution sequence between task and the symbol of separating two nodes can change according to the change of actual conditions, be not construed as limiting herein.
Scheduling normal form module 22 is carried out dispatch deal according to the normal form expression formula of resolving after normal form module 21 is resolved to multitask.
In the embodiment of the present invention, resolve normal form module 21 and read the normal form expression formula of the normal form rule parsing reception of getting up as independent configuration file stores, this normal form expression formula has defined execution sequence and the serial parallel relation of task, scheduling normal form module 22 is provided by the normal form expression formula after the fixed routine scheduling providing for normal form expression formula is resolved, during due to the priority execution sequence in task or serial or concurrency relation change, only need to revise defined the execution sequence of a plurality of tasks and serial parallel relation normal form expression formula, therefore saved again and write, the time of compiled code, reach the object of quick adaption demand change.
As one embodiment of the present of invention, resolve normal form module 21 and also comprise the first judging unit 211, for judging whether the number of normal form expression formula node is 0, if 0, return; If not 0, continue to judge whether the number of node in the normal form expression formula of this reception is 1, if 1, directly resolve this node; If not 1, by this normal form expression parsing, be two normal form expression formulas, recurrence is carried out above-mentioned steps, until the node number in normal form expression formula is 0.
As an alternative embodiment of the invention, the first judging unit 211 also comprises the second judging unit 2111, for judging execution, resolve whether the step of two normal form expression formulas that obtain is last execution step of former normal form expression formula, if, last execution step of this former normal form expression formula is resolved to two normal form expression formulas, recurrence is carried out above-mentioned steps, until the node number in normal form expression formula is 0.
As an alternative embodiment of the invention, scheduling normal form module 22 also comprises: differentiated treatment unit 221, if node number is 0, processing finishes; If node number is 1, directly carry out this node termination routine; If node number is more than or equal to 2, according to separator serial or these two normal form expression formulas of Parallel Scheduling between two normal form expression formulas that obtain from former normal form expression parsing.
The embodiment of the present invention, after receiving and resolve the execution sequence of the task that defined and the normal form expression formula of serial parallel relation, the dispatch deal that according to the fixed routine providing for normal form expression formula, the normal form expression formula after resolving is carried out to multitask again, during due to the priority execution sequence in task or serial or concurrency relation change, only need to revise defined the execution sequence of a plurality of tasks and serial parallel relation normal form expression formula, therefore saved again write, time of compiled code, reach the object of quick adaption demand change.
The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, all any modifications of doing within the spirit and principles in the present invention, be equal to and replace and improvement etc., within all should being included in protection scope of the present invention.
Claims (6)
1. the multi-task scheduling method based on normal form, is characterized in that, described method comprises the steps:
Receive and resolve normal form expression formula, described normal form expression formula has defined execution sequence and the serial parallel relation of task;
According to the normal form expression formula after resolving, multitask is carried out to dispatch deal;
Wherein said reception the step of resolving normal form expression formula are specially:
Whether the number that judges node in described normal form expression formula is 0, if 0, resolve and finish; If not 0, continue to judge whether the number of node in the normal form expression formula receiving is 1, if 1, directly resolve this node; If not 1, by normal form expression parsing, be two normal form expression formulas;
Recurrence carries out describedly judge whether the number of node in described normal form expression formula is 0, if 0, resolve and finish; If not 0, continue to judge whether the number of node in the normal form expression formula receiving is 1, if 1, directly resolve this node; If not 1, by normal form expression parsing, be the step of two normal form expression formulas, until the number of node is 0 in normal form expression formula.
2. the method for claim 1, is characterized in that, if not described 1, by normal form expression parsing, be that the step of two normal form expression formulas is specially:
Whether the step that two normal form expression formulas that obtain are resolved in judgement execution is last execution step in former normal form expression formula, if so, last execution step of former normal form expression formula is resolved to two normal form expression formulas.
3. the method for claim 1, is characterized in that, described step of multitask being carried out to dispatch deal according to the normal form expression formula after resolving is specially:
If node number is 0, task scheduling finishes; If node number is 1, directly carry out this node, and task scheduling finishes; If node number is more than or equal to 2, according to separator serial or these two normal form expression formulas of Parallel Scheduling between two normal form expression formulas that obtain from former normal form expression parsing.
4. the multi-task scheduling device based on normal form, is characterized in that, described device comprises:
Resolve normal form module, for receiving and resolve normal form expression formula, described normal form expression formula has defined execution sequence and the serial parallel relation of task; Scheduling normal form module, for carrying out dispatch deal according to the normal form expression formula after resolving to multitask;
Wherein said parsing normal form module comprises:
The first judging unit, for judging whether the number of normal form expression formula node is 0, if 0, resolve and finish; If not 0, continue to judge whether the number of node in the normal form expression formula receiving is 1, if 1, directly resolve this node; If not 1, by normal form expression parsing, be two normal form expression formulas, recurrence carries out describedly judge whether the number of node in described normal form expression formula is 0, if 0, resolve and finish; If not 0, continue to judge whether the number of node in the normal form expression formula receiving is 1, if 1, directly resolve this node; If not 1, by normal form expression parsing, be the step of two normal form expression formulas, until the number of node is 0 in normal form expression formula.
5. device as claimed in claim 4, is characterized in that, described the first judging unit also comprises:
The second judging unit, for judging whether the step of two normal form expression formulas that execution parsing obtains is last execution step of former normal form expression formula, if so, last execution step of former normal form expression formula is resolved to two normal form expression formulas.
6. device as claimed in claim 4, is characterized in that, described scheduling normal form module also comprises:
Differentiated treatment unit, if node number is 0, task scheduling finishes; If node number is 1, directly carry out this node, and task scheduling finishes; If node number is more than or equal to 2, according to separator serial or these two normal form expression formulas of Parallel Scheduling between two normal form expression formulas that obtain from former normal form expression parsing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010525056.0A CN102455941B (en) | 2010-10-29 | 2010-10-29 | Multitask scheduling method and device based on normal form |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010525056.0A CN102455941B (en) | 2010-10-29 | 2010-10-29 | Multitask scheduling method and device based on normal form |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102455941A CN102455941A (en) | 2012-05-16 |
| CN102455941B true CN102455941B (en) | 2014-03-26 |
Family
ID=46039153
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010525056.0A Active CN102455941B (en) | 2010-10-29 | 2010-10-29 | Multitask scheduling method and device based on normal form |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102455941B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107168789B (en) * | 2016-03-08 | 2021-05-11 | 创新先进技术有限公司 | Multitask serial scheduling method and device |
| CN107273191B (en) * | 2016-04-06 | 2020-09-29 | 北京京东尚科信息技术有限公司 | Method and device for scheduling timed tasks by using logical clone expression |
| CN107391255A (en) * | 2017-06-15 | 2017-11-24 | 武汉斗鱼网络科技有限公司 | A kind of task executing method and system based on internal memory optimization |
| CN110489125B (en) * | 2019-07-29 | 2023-07-25 | 恩亿科(北京)数据科技有限公司 | File management method and computer storage medium |
| CN111880853A (en) * | 2020-07-29 | 2020-11-03 | 北京浪潮数据技术有限公司 | Starting method, system and related device of clustered service |
| CN112367205B (en) * | 2020-11-12 | 2023-04-18 | 深圳前海微众银行股份有限公司 | Processing method and scheduling system for HTTP scheduling request |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101295382A (en) * | 2008-06-30 | 2008-10-29 | 金蝶软件（中国）有限公司 | Method and device for implementing service logical relation between business object properties |
-
2010
- 2010-10-29 CN CN201010525056.0A patent/CN102455941B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101295382A (en) * | 2008-06-30 | 2008-10-29 | 金蝶软件（中国）有限公司 | Method and device for implementing service logical relation between business object properties |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102455941A (en) | 2012-05-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102455941B (en) | Multitask scheduling method and device based on normal form | |
| CN106547527B (en) | JavaScript file construction method and device | |
| CN107203401B (en) | Front-end project construction method, device and system | |
| CN107729240B (en) | Embedded software stack overflow detection method and device | |
| US8347278B2 (en) | Instrumenting a compiled software routine for augmentation | |
| CN111966597B (en) | Test data generation method and device | |
| CN112925587A (en) | Method and apparatus for initializing applications | |
| CN107179982B (en) | Cross-process debugging method and device | |
| CN104899369A (en) | Simulator multithreading operation method utilizing PERL script | |
| CN112181522A (en) | Data processing method and device and electronic equipment | |
| CN107015840B (en) | Quick execution method and quick execution system of resolver | |
| CN110955503B (en) | Task scheduling method and device | |
| US8661293B2 (en) | Test architecture based on intelligent test sequence | |
| US9304743B1 (en) | Converting from incorrect program code to correct program code | |
| US8819625B2 (en) | Sharable development environment bookmarks for functional/data flow | |
| US9710360B2 (en) | Optimizing error parsing in an integrated development environment | |
| CN110489124A (en) | Source code executes method, apparatus, storage medium and computer equipment | |
| US9959101B2 (en) | Conditional sequential selection of external reference solutions | |
| CN114327673A (en) | Task starting method and device, electronic equipment and storage medium | |
| US9396044B2 (en) | Memory efficient thread-level speculation | |
| CN102567195A (en) | Object file walkthrough method and object file walkthrough system | |
| CN112783574A (en) | Application program development method, device, equipment and storage medium | |
| CN113050952B (en) | Pseudo instruction compiling method, pseudo instruction compiling device, computer equipment and storage medium | |
| US12007880B2 (en) | Dynamic test automation prioritization | |
| CN113377660B (en) | Test method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |