CN108255602A - Task combined method and terminal device - Google Patents
Task combined method and terminal device Download PDFInfo
- Publication number
- CN108255602A CN108255602A CN201711056184.3A CN201711056184A CN108255602A CN 108255602 A CN108255602 A CN 108255602A CN 201711056184 A CN201711056184 A CN 201711056184A CN 108255602 A CN108255602 A CN 108255602A
- Authority
- CN
- China
- Prior art keywords
- task
- waiting
- waiting task
- packet assembling
- tasks
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/20—Natural language analysis
- G06F40/205—Parsing
-
- 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
Abstract
The present invention is suitable for technical field of data processing, provides a kind of task combined method and terminal device.This method includes：Obtain each waiting task in data processing task；By inquiring the field in each waiting task of data dictionary acquisition；Morphological analysis is carried out to the field in each waiting task, identifies the task key word in each waiting task；Syntactic analysis is carried out to the task key word in each waiting task, determines the incidence relation between each waiting task；According to the incidence relation between each waiting task, combination is grouped to each waiting task by the way of serial or parallel, it can realize the intellectual analysis combination of data processing task, promote the treatment effeciency of data processing task, the accuracy of data O＆M is improved, meets practical application needs.
Description
Technical field
The invention belongs to technical field of data processing more particularly to a kind of task combined method and terminal devices.
Background technology
Under the big data environment of cloud computing era, data high-speed increases expansion, the quantity of various data processing tasks
In the situation of rapid growth.Data processing task can only be combined simply in the prior art, and task processing speed is slow, efficiency
It is low, existing task processing requirements can not be met.
Invention content
The embodiment of the present invention provides a kind of task combined method and terminal device, can only to solve available data processing task
It is simply combined, the problem of task processing speed is slow, efficiency is low.
The first aspect of the embodiment of the present invention provides a kind of task combined method, including：
Obtain each waiting task in data processing task；
By inquiring the field in each waiting task of data dictionary acquisition；
Morphological analysis is carried out to the field in each waiting task, identifies the task key in each waiting task
Word；
Syntactic analysis is carried out to the task key word in each waiting task, determines the pass between each waiting task
Connection relationship；
According to the incidence relation between each waiting task, to each waiting task by the way of serial or parallel
It is grouped combination.
Optionally, it according to the incidence relation between each waiting task, is treated by the way of serial or parallel to each
Processing task is grouped combination and includes：
Two waiting tasks are arbitrarily obtained from each waiting task；
Whether the incidence relation for detecting two waiting tasks obtained is context relation；
If the incidence relation for detecting two waiting tasks obtained is context relation, by the way of serial or parallel
First time packet assembling is carried out to two waiting tasks of acquisition, is completed in each waiting task first time packet assembling
Afterwards, it using the result of first time packet assembling as new waiting task, re-executes and described appoints from each waiting task
Meaning obtains two waiting tasks；
After the completion of each waiting task n-th packet assembling, if maximum in the result of detection n-th packet assembling
Packet assembling result reaches the default packet assembling upper limit, stops operation, and n is the integer more than 1.
Optionally, each waiting task carries task identification；
Before by the field in inquiring data dictionary to obtain each waiting task, further include：
Each waiting task is grouped according to the task identification that each waiting task carries.
Optionally, each waiting task is grouped in the task identification carried according to each waiting task
Later, it further includes：
According to the task identification and the correspondence of task priority to prestore, the task that each waiting task carries is determined
Corresponding task priority is identified, each waiting task is ranked up according to determining task priority.
Optionally, above-mentioned task combined method further includes：
The group result after each waiting task packet assembling is encoded according to the coding method to prestore
The second aspect of the embodiment of the present invention provides a kind of task combination terminal device, including memory, processor with
And the computer program that can be run in the memory and on the processor is stored in, the processor performs the calculating
Following steps are realized during machine program：
Obtain each waiting task in data processing task；
By inquiring the field in each waiting task of data dictionary acquisition；
Morphological analysis is carried out to the field in each waiting task, identifies the task key in each waiting task
Word；
Syntactic analysis is carried out to the task key word in each waiting task, determines the pass between each waiting task
Connection relationship；
According to the incidence relation between each waiting task, to each waiting task by the way of serial or parallel
It is grouped combination.
Optionally, it according to the incidence relation between each waiting task, is treated by the way of serial or parallel to each
Processing task is grouped combination and includes：
Two waiting tasks are arbitrarily obtained from each waiting task；
Whether the incidence relation for detecting two waiting tasks obtained is context relation；
If the incidence relation for detecting two waiting tasks obtained is context relation, by the way of serial or parallel
First time packet assembling is carried out to two waiting tasks of acquisition, is completed in each waiting task first time packet assembling
Afterwards, it using the result of first time packet assembling as new waiting task, re-executes and described appoints from each waiting task
Meaning obtains two waiting tasks；
After the completion of each waiting task n-th packet assembling, if maximum in the result of detection n-th packet assembling
Packet assembling result reaches the default packet assembling upper limit, stops operation, and n is the integer more than 1.
Optionally, each waiting task carries task identification；
Before by the field in inquiring data dictionary to obtain each waiting task, further include：
Each waiting task is grouped according to the task identification that each waiting task carries.
Optionally, each waiting task is grouped in the task identification carried according to each waiting task
Later, it further includes：
According to the task identification and the correspondence of task priority to prestore, the task that each waiting task carries is determined
Corresponding task priority is identified, each waiting task is ranked up according to determining task priority.
The third aspect of the embodiment of the present invention provides a kind of computer readable storage medium, the computer-readable storage
Media storage has computer program, realizes that above-mentioned task groups such as close the step of method when the computer program is executed by processor
Suddenly.
Existing advantageous effect is the embodiment of the present invention compared with prior art：The embodiment of the present invention is obtaining data processing
After each waiting task in task, by inquiring the field in each waiting task of data dictionary acquisition；It is treated to each
Field in processing task carries out morphological analysis, identifies the task key word in each waiting task；To each pending
Task key word in task carries out syntactic analysis, determines the incidence relation between each waiting task；It waits to locate according to each
Incidence relation between reason task is grouped combination, Ke Yishi by the way of serial or parallel to each waiting task
The intellectual analysis combination of existing data processing task promotes the treatment effeciency of data processing task, improves the accuracy of data O＆M,
Meet practical application needs.
Description of the drawings
It to describe the technical solutions in the embodiments of the present invention more clearly, below will be to embodiment or description of the prior art
Needed in attached drawing be briefly described, it should be apparent that, the accompanying drawings in the following description be only the present invention some
Embodiment, for those of ordinary skill in the art, without having to pay creative labor, can also be according to these
Attached drawing obtains other attached drawings.
Fig. 1 is a kind of schematic flow diagram of task combined method provided in an embodiment of the present invention；
Fig. 2 is a kind of schematic flow diagram for task combined method that another embodiment of the present invention provides；
Fig. 3 is a kind of schematic flow diagram for task combined method that yet another embodiment of the invention provides；
Fig. 4 is a kind of schematic flow diagram for task combined method that further embodiment of this invention provides；
Fig. 5 is a kind of schematic flow diagram for task combined method that further embodiment of this invention provides；
Fig. 6 is a kind of schematic block diagram of task combination terminal device provided in an embodiment of the present invention；
Fig. 7 is a kind of schematic block diagram of task combinator provided in an embodiment of the present invention.
Specific embodiment
In being described below, in order to illustrate rather than in order to limit, it is proposed that such as tool of particular system structure, technology etc
Body details, to understand thoroughly the embodiment of the present invention.However, it will be clear to one skilled in the art that there is no these specifically
The present invention can also be realized in the other embodiments of details.In other situations, it omits to well-known system, device, electricity
Road and the detailed description of method, in case unnecessary details interferes description of the invention.
In order to illustrate technical solutions according to the invention, illustrated below by specific embodiment.
Referring to Fig. 1, Fig. 1 is a kind of schematic flow diagram of task combined method provided in an embodiment of the present invention, in the implementation
It in example, is illustrated by taking the angle triggering of terminal as an example, here, terminal can be the mobile terminals such as smart mobile phone, tablet computer.
As shown in Figure 1, in this embodiment, the processing procedure of terminal may comprise steps of：
S101：Obtain each waiting task in data processing task.
Here, after each waiting task is obtained, can also include：Integrality school is carried out to each waiting task
It tests, format check etc..Carrying out completeness check to each waiting task can include：Verify in each waiting task whether
Carry preset keyword.Carrying out format check to each waiting task can include：Verify the form of each waiting task
Whether preset format requirement is met.After above-mentioned verification is completed, delete in each waiting task not over completeness check
And/or the waiting task of format check, it determines new each waiting task, performs step S102.
Specifically, processing task threshold can also be preset, each waiting task in data processing task is obtained is sentenced
Whether the number of the disconnected each waiting task obtained is more than default processing task threshold, if it is determined that being not above, then performs step
Otherwise rapid S102, according to the number more than default processing task threshold, some is deleted from each waiting task of acquisition
Business determines new each waiting task, performs step S102.Here presetting at processing task threshold can set according to actual needs
It puts, follow-up work group speed can be improved, while terminal is avoided to work overloadingly by default processing task threshold, being suitble to should
With.
S102：By inquiring the field in each waiting task of data dictionary acquisition.
Data dictionary is often referred to the data item to data, data structure, data flow, data storage etc. and is defined and describes
Set, here, data dictionary can be the collection that logarithm be defined and describe according to field, order of the field etc. of processing task
It closes.
Specifically, can be included by inquiring the field in each waiting task of data dictionary acquisition：Obtain each treat
The task processing time of processing task；According to current time and the task processing time of each waiting task obtained, determine
The remaining processing time of each waiting task；According to the remaining processing time of determining each waiting task, treated to each
Processing task is ranked up, such as is ranked up from small to large according to remaining processing time, according to ranking results successively in data
Inquiry obtains the field in each waiting task in dictionary.
S103：Morphological analysis is carried out to the field in each waiting task, identifies appointing in each waiting task
Business keyword.
Here, morphological analysis is to identify all kinds of words, and generate the attribute word of respective word according to the morphological rule of language.
Task key word is the keyword that can characterize waiting task.
Specifically, carrying out morphological analysis to the field in each waiting task can include：Check each pending
Whether the length of the field in business is more than pre-set length threshold, if checking, the length of the field in waiting task is less than
Pre-set length threshold then performs the step of field in each waiting task carries out morphological analysis, otherwise, stops behaviour
Make, generation error prompting, the miscue carries the waiting task that field length is more than pre-set length threshold.
S104：To in each waiting task task key word carry out syntactic analysis, determine each waiting task it
Between incidence relation.
Here, syntactic analysis is the syntax rule according to original language, and corresponding language is identified from the result of morphological analysis
Law areas is carried out at the same time syntax check.Incidence relation between each waiting task includes context relation, mutex relation
Deng.
Specifically, by taking task A and task B as an example, syntactic analysis is carried out to the task key word in two tasks, if two
The task key word of a task there are task A keywords->The relationship of task B keywords, it is determined that the association of task A and task B
Relationship is context relation.If analyzing two tasks according to the task key word of two tasks has common write-in object,
The incidence relation for determining task A and task B is mutex relation, and mutex relation represents that two tasks are unable to simultaneously perform.
S105：According to the incidence relation between each waiting task, wait to locate to each by the way of serial or parallel
Reason task is grouped combination.
Specifically, pending with context relation is determined from the incidence relation between each waiting task
Business, combination is grouped by the way of serial or parallel to the waiting task with context relation.
Here or by taking above-mentioned task A and task B as an example, if the incidence relation between two tasks is context relation,
Then two tasks are combined in a grouped task by the way of serial or parallel.If the incidence relation between two tasks
For mutex relation, then by two grouped tasks to two different grouped tasks, task A is with dividing in grouped task other
The mode of serial or parallel may be used in the combination of business, similarly, task B and the combination for dividing other tasks in grouped task
Mode can also be by the way of serial or parallel.
It is evidenced from the above discussion that the task combined method of the embodiment of the present invention, the intelligence of data processing task can be realized
Analysis combination promotes the treatment effeciency of data processing task, improves the accuracy of data O＆M, meet practical application needs.
Referring to Fig. 2, Fig. 2 is a kind of schematic flow diagram for task combined method that another embodiment of the present invention provides.With
The corresponding embodiments of Fig. 1 difference lies in：According to the incidence relation between each waiting task, using the side of serial or parallel
Formula, which is grouped each waiting task combination, can include S205.Wherein S201~S204 and the S101 in a upper embodiment
~S104 is identical, referring specifically to the associated description of S101~S104 in above-described embodiment, does not repeat herein.Specifically, S205
It can include S2051~S2054：
S2051：Two waiting tasks are arbitrarily obtained from each waiting task.
Here, each waiting task is pairwise grouping, block form is arbitrary combination.
Specifically, can also include：Grouping number determine instruction is received, determines to be grouped according to the grouping number determine instruction
Number, arbitrarily obtains m waiting task from each waiting task, and m is equal to above-mentioned grouping number.
S2052：Whether the incidence relation for detecting two waiting tasks obtained is context relation.
Here, the incidence relation between each waiting task includes context relation, mutex relation etc..Detecting step
Whether the incidence relation for two waiting tasks that S2051 is obtained is context relation, if so, step S2053 is performed, otherwise,
It stops operation.
Specifically, detecting the mode of two waiting task incidence relations can include：It is obtained by inquiring data dictionary
Field in two waiting tasks, in two waiting tasks field carry out morphological analysis, identify two it is pending
Task key word in task, in two waiting tasks task key word carry out syntactic analysis, determine two it is pending
Incidence relation between task.
S2053：If the incidence relation for detecting two waiting tasks obtained is context relation, using serial or parallel
Mode first time packet assembling is carried out to two waiting tasks of acquisition, in each waiting task first time packet assembling
After the completion, it using the result of first time packet assembling as new waiting task, re-executes described from each waiting task
In arbitrarily obtain two waiting tasks.
Specifically, step S2051~S2053 has all been performed in each waiting task any two waiting task,
After completing first time packet assembling, using the result of each waiting task first time packet assembling as new waiting task,
Re-execute above-mentioned steps.For example, each waiting task includes A, B, C, D, the result of first time packet assembling is A+B, C+
D using A+B and C+D as new waiting task, reappears and performs step S2051~S2053.
S2054：After the completion of each waiting task n-th packet assembling, if in the result of detection n-th packet assembling
Maximum packet assembling result reaches the default packet assembling upper limit, stops operation, and n is the integer more than 1.
Here, presetting the packet assembling upper limit can be set according to actual needs, in each waiting task n-th grouping group
After the completion of conjunction, if packet assembling result maximum in the result of n-th packet assembling reaches the default packet assembling upper limit, stop behaviour
Make, using the result of n-th packet assembling as the last result that combination is grouped to each waiting task.
Specifically, the grouping number upper limit can also be preset, when the grouping number of each waiting task reaches default grouping
The number upper limit, stops operation, and exports the result of each waiting task packet assembling at this time.
Here, the grouping to each waiting task is completed by way of searching loop, improves grouping speed, is solved existing
There is data processing task that can only simply be combined, the problem of task processing speed is slow, efficiency is low.
Referring to Fig. 3, Fig. 3 is the schematic flow diagram of a kind of task combined method that yet another embodiment of the invention provides.Respectively
A waiting task carries task identification, and here, task identification can be task names, mission number etc., and the present embodiment is above-mentioned
Difference lies in S302 for embodiment, and wherein S301 is identical with the S101 in a upper embodiment, S303~S306 and a upper embodiment
In S102~S105 it is identical, referring specifically to the associated description of S101~S105 in above-described embodiment, do not repeat herein.This reality
The task combined method applied in example can also include：
S302：Each waiting task is grouped according to the task identification that each waiting task carries.
Here, the task identification carried first according to each waiting task is grouped, and subsequently waits to locate further according to each
Incidence relation between reason task is grouped the result being grouped according to task identification again, and grouping twice is completed to appoint
Business combination, can further improve grouping speed, meet a variety of grouping demands.
Specifically, can also include：Show the task identification that each waiting task carries, whether just generation task identification
True prompting if receiving the correct information of task identification, performs step S302, otherwise, generation task identification modification prompting, if
Task identification modification instruction is received, according to the instruction modification task identification, after the completion of modification, performs step S302.
Referring to Fig. 4, Fig. 4 is the schematic flow diagram of a kind of task combined method that further embodiment of this invention provides.This
Difference lies in S402~S403 for embodiment above-described embodiment, and wherein S401 is identical with the S101 in a upper embodiment, and S404~
S407 is identical with S102~S105 in a upper embodiment, is retouched referring specifically to the correlation of S101~S105 in above-described embodiment
It states, does not repeat herein.Task combined method in the present embodiment can also include：
S402：Each waiting task is grouped according to the task identification that each waiting task carries.
Here, after completing to be grouped, can also include：Show the task identification carried according to each waiting task to each
The group result of a waiting task.
S403：According to the task identification and the correspondence of task priority to prestore, determine that each waiting task carries
The corresponding task priority of task identification, each waiting task is ranked up according to determining task priority.
Specifically, the above-mentioned result being grouped according to task identification is ranked up according to task priority, is tied according to sequence
Fruit performs subsequent step, and the high task of timely processing priority meets existing task processing requirement.
After above-mentioned completion sequence, it can also include：Sequence adjust instruction is received, root is adjusted according to the sequence adjust instruction
The ranking results being ranked up according to task priority to each waiting task.
Referring to Fig. 5, Fig. 5 is the schematic flow diagram of a kind of task combined method that further embodiment of this invention provides.This
Difference lies in S506 for embodiment above-described embodiment, and wherein S501~S505 is identical with S101~S105 in a upper embodiment,
Referring specifically to the associated description of S101~S105 in above-described embodiment, do not repeat herein.Task combination side in the present embodiment
Method can also include：
S506：The group result after each waiting task packet assembling is encoded according to the coding method to prestore.
Here, the coding method to prestore can be set according to actual needs, for example, unipolar code, polar code, bipolarity
Code, zero code, diphase code, non-return to zero code, Manchester's code, Differential Manchester Encoding, multilevel coding, 4B/5B codings
Etc. coding modes.According to the coding method to prestore to being grouped to each waiting task by the way of serial or parallel
Group result is encoded, and is reduced the size of the transmission data packet of combination request, is suitble to application.
Specifically, can include：Coding method selection instruction is received, is selected in the coding method to prestore according to the instruction
A kind of coding method encodes the group result after each waiting task packet assembling according to the coding method of selection.
It can also include：Coding method addition instruction is received, new coding method is added to the volume to prestore according to the instruction
In code method, convenient follow-up use.
It should be understood that the size of the serial number of each step is not meant to the priority of execution sequence, each process in above-described embodiment
Execution sequence should determine that the implementation process without coping with the embodiment of the present invention forms any limit with its function and internal logic
It is fixed.
Corresponding to the task combined method described in foregoing embodiments, Fig. 6 shows task groups provided in an embodiment of the present invention
Close the running environment schematic diagram of program.For convenience of description, part related to the present embodiment is illustrated only.
In the present embodiment, the task combinator 600 is installed and is run in terminal device 60.The terminal device
60 can be mobile terminal, palm PC, server etc..The terminal device 60 may include, but be not limited only to that memory 601 is located
Manage device 602 and display 603.Fig. 6 illustrates only the terminal device 60 with component 601-603, it should be understood that not
It is required that implement all components shown, the more or less component of the implementation that can be substituted.
The memory 601 can be the internal storage unit of the terminal device 60 in some embodiments, such as should
The hard disk or memory of terminal device 60.The memory 601 can also be the terminal device 60 in further embodiments
The plug-in type hard disk being equipped on External memory equipment, such as the terminal device 60, intelligent memory card (Smart Media
Card, SMC), secure digital (Secure Digital, SD) card, flash card (Flash Card) etc..Further, it is described to deposit
Reservoir 601 can also both include the internal storage unit of the terminal device 60 or including External memory equipment.The memory
601 are installed on the application software and Various types of data of the terminal device 60 for storing, such as the task combinator 600
Program code etc..The memory 601 can be also used for temporarily storing the data that has exported or will export.
The processor 602 can be a central processing unit (Central Processing in some embodiments
Unit, CPU), microprocessor or other data processing chips, for run the program code that is stored in the memory 601 or
Data are handled, such as perform described task combinator 600 etc..
The display 603 can be that light-emitting diode display, liquid crystal display, touch control type LCD are shown in some embodiments
Device and OLED (Organic Light-Emitting Diode, Organic Light Emitting Diode) touch device etc..The display 603
For being shown in the information that is handled in the terminal device 60 and for showing visual user interface, such as application menu
Interface, application icon interface etc..The component 601-603 of the terminal device 60 is in communication with each other by system bus.
Referring to Fig. 7, it is the functional block diagram of task combinator 600 provided in an embodiment of the present invention.In the present embodiment
In, the task combinator 600 can be divided into one or more modules, and one or more of modules are stored
In the memory 601, and it is performed by one or more processors (the present embodiment is the processor 602), to complete
The present invention.For example, in the figure 7, the task combinator 600 can be divided into task acquiring unit 701, Field Inquiry
Unit 702, morphological analysis unit 703, parsing unit 704 and first task assembled unit 705.The so-called unit of the present invention
It is the series of computation machine program instruction section for referring to complete specific function, journey is combined more suitable for describing the task than program
Implementation procedure of the sequence 600 in the terminal device 60.The function of specifically introducing the module 701-705 is described below.
Wherein, task acquiring unit 701, for obtaining each waiting task in data processing task.Field Inquiry
Unit 702, for passing through the field inquired in each waiting task of data dictionary acquisition.Morphological analysis unit 703, for pair
Field in each waiting task carries out morphological analysis, identifies the task key word in each waiting task.Grammer point
Analyse unit 704, for in each waiting task task key word carry out syntactic analysis, determine each waiting task it
Between incidence relation.First task assembled unit 705, for according to the incidence relation between each waiting task, using string
Row or parallel form are grouped combination to each waiting task.
Optionally, the first task assembled unit 705 can be divided into task processing unit 7051, relationship detection list
Member 7052, packet assembling unit 7053 and grouping stop unit 7054.
Wherein, task processing unit 7051, for arbitrarily obtaining two waiting tasks from each waiting task.It closes
It is detection unit 7052, whether the incidence relation for detecting two waiting tasks obtained is context relation.Grouping group
Unit 7053 is closed, if being context relation for detecting the incidence relation of two waiting tasks obtained, using serially or simultaneously
Capable mode carries out first time packet assembling to two waiting tasks of acquisition, in each waiting task first time grouping group
After the completion of conjunction, using the result of first time packet assembling as new waiting task, re-execute described from each pending
Two waiting tasks are arbitrarily obtained in business.Stop unit 7054 is grouped, in each waiting task n-th packet assembling
After the completion, if packet assembling result maximum in the result of detection n-th packet assembling reaches the default packet assembling upper limit, stop
Operation, n are the integer more than 1.
Optionally, each waiting task carries task identification.
The task combinator 600 can also be divided into the second task assembled unit 706.
Wherein, the second task assembled unit 706, the task identification for being carried according to each waiting task are treated to each
Processing task is grouped.
Optionally, the task combinator 600 can also be divided into task ranking unit 707.
Wherein, task ranking unit 707, the task identification and the correspondence of task priority to prestore for basis, really
The corresponding task priority of task identification that fixed each waiting task carries, waits to locate according to determining task priority to each
Reason task is ranked up.
Optionally, the task combinator 600 can also be divided into task encoding unit 708.
Wherein, task encoding unit 708, after according to the coding method to prestore to each waiting task packet assembling
Group result encoded.
It is apparent to those skilled in the art that for convenience of description and succinctly, only with above-mentioned each work(
Can unit, module division progress for example, in practical application, can be as needed and by above-mentioned function distribution by different
Functional unit, module are completed, i.e., the internal structure of described device are divided into different functional units or module, more than completion
The all or part of function of description.Each functional unit, module in embodiment can be integrated in a processing unit, also may be used
To be that each unit is individually physically present, can also two or more units integrate in a unit, it is above-mentioned integrated
The form that hardware had both may be used in unit is realized, can also be realized in the form of SFU software functional unit.In addition, each function list
Member, the specific name of module are not limited to the protection domain of the application also only to facilitate mutually distinguish.Above system
The specific work process of middle unit, module can refer to the corresponding process in preceding method embodiment, and details are not described herein.
In the above-described embodiments, it all emphasizes particularly on different fields to the description of each embodiment, is not described in detail or remembers in some embodiment
The part of load may refer to the associated description of other embodiments.
Those of ordinary skill in the art may realize that each exemplary lists described with reference to the embodiments described herein
Member and algorithm steps can be realized with the combination of electronic hardware or computer software and electronic hardware.These functions are actually
It is performed with hardware or software mode, specific application and design constraint depending on technical solution.Professional technician
Described function can be realized using distinct methods to each specific application, but this realization is it is not considered that exceed
The scope of the present invention.
In embodiment provided by the present invention, it should be understood that disclosed device/terminal device and method, it can be with
It realizes by another way.For example, device described above/terminal device embodiment is only schematical, for example, institute
The division of module or unit is stated, only a kind of division of logic function can have other dividing mode in actual implementation, such as
Multiple units or component may be combined or can be integrated into another system or some features can be ignored or does not perform.Separately
A bit, shown or discussed mutual coupling or direct-coupling or communication connection can be by some interfaces, device
Or the INDIRECT COUPLING of unit or communication connection, can be electrical, machinery or other forms.
The unit illustrated as separating component may or may not be physically separate, be shown as unit
The component shown may or may not be physical unit, you can be located at a place or can also be distributed to multiple
In network element.Some or all of unit therein can be selected according to the actual needs to realize the mesh of this embodiment scheme
's.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, it can also
That each unit is individually physically present, can also two or more units integrate in a unit.Above-mentioned integrated list
The form that hardware had both may be used in member is realized, can also be realized in the form of SFU software functional unit.
If the integrated module/unit realized in the form of SFU software functional unit and be independent product sale or
In use, it can be stored in a computer read/write memory medium.Based on such understanding, the present invention realizes above-mentioned implementation
All or part of flow in example method, can also instruct relevant hardware to complete, the meter by computer program
Calculation machine program can be stored in a computer readable storage medium, the computer program when being executed by processor, it can be achieved that on
The step of stating each embodiment of the method.Wherein, the computer program includes computer program code, the computer program generation
Code can be source code form, object identification code form, executable file or certain intermediate forms etc..The computer-readable medium
It can include：Any entity of the computer program code or device, recording medium, USB flash disk, mobile hard disk, magnetic can be carried
Dish, CD, computer storage, read-only memory (ROM, Read-Only Memory), random access memory (RAM,
Random Access Memory), electric carrier signal, telecommunication signal and software distribution medium etc..It is it should be noted that described
The content that computer-readable medium includes can carry out appropriate increasing according to legislation in jurisdiction and the requirement of patent practice
Subtract, such as in certain jurisdictions, according to legislation and patent practice, computer-readable medium does not include electric carrier signal and electricity
Believe signal.
Embodiment described above is merely illustrative of the technical solution of the present invention, rather than its limitations；Although with reference to aforementioned reality
Example is applied the present invention is described in detail, it will be understood by those of ordinary skill in the art that：It still can be to aforementioned each
Technical solution recorded in embodiment modifies or carries out equivalent replacement to which part technical characteristic；And these are changed
Or replace, the spirit and scope for various embodiments of the present invention technical solution that it does not separate the essence of the corresponding technical solution should all
It is included within protection scope of the present invention.
Claims (10)
1. a kind of task combined method, which is characterized in that including：
Obtain each waiting task in data processing task；
By inquiring the field in each waiting task of data dictionary acquisition；
Morphological analysis is carried out to the field in each waiting task, identifies the task key word in each waiting task；
Syntactic analysis is carried out to the task key word in each waiting task, determines that the association between each waiting task is closed
System；
According to the incidence relation between each waiting task, each waiting task is carried out by the way of serial or parallel
Packet assembling.
2. task combined method as described in claim 1, which is characterized in that closed according to the association between each waiting task
It is that being grouped combination to each waiting task by the way of serial or parallel includes：
Two waiting tasks are arbitrarily obtained from each waiting task；
Whether the incidence relation for detecting two waiting tasks obtained is context relation；
If the incidence relation for detecting two waiting tasks obtained is context relation, to obtaining by the way of serial or parallel
Two waiting tasks taken carry out first time packet assembling, will after the completion of each waiting task first time packet assembling
The result of first time packet assembling is re-executed and described is arbitrarily obtained from each waiting task as new waiting task
Two waiting tasks；
After the completion of each waiting task n-th packet assembling, if grouping maximum in the result of detection n-th packet assembling
Combined result reaches the default packet assembling upper limit, stops operation, and n is the integer more than 1.
3. task combined method as described in claim 1, which is characterized in that each waiting task carries task identification；
Before by the field in inquiring data dictionary to obtain each waiting task, further include：
Each waiting task is grouped according to the task identification that each waiting task carries.
4. task combined method as claimed in claim 3, which is characterized in that it is described according to each waiting task carry
After task identification is grouped each waiting task, further include：
According to the task identification and the correspondence of task priority to prestore, the task identification that each waiting task carries is determined
Corresponding task priority is ranked up each waiting task according to determining task priority.
5. task combined method as described in claim 1, which is characterized in that further include：
The group result after each waiting task packet assembling is encoded according to the coding method to prestore.
6. a kind of task combines terminal device, which is characterized in that including memory, processor and is stored in the memory
And the computer program that can be run on the processor, the processor realize following step when performing the computer program
Suddenly：
Obtain each waiting task in data processing task；
By inquiring the field in each waiting task of data dictionary acquisition；
Morphological analysis is carried out to the field in each waiting task, identifies the task key word in each waiting task；
Syntactic analysis is carried out to the task key word in each waiting task, determines that the association between each waiting task is closed
System；
According to the incidence relation between each waiting task, each waiting task is carried out by the way of serial or parallel
Packet assembling.
7. task as claimed in claim 6 combines terminal device, which is characterized in that according to the pass between each waiting task
Connection relationship, by the way of serial or parallel being grouped combination to each waiting task includes：
Two waiting tasks are arbitrarily obtained from each waiting task；
Whether the incidence relation for detecting two waiting tasks obtained is context relation；
If the incidence relation for detecting two waiting tasks obtained is context relation, to obtaining by the way of serial or parallel
Two waiting tasks taken carry out first time packet assembling, will after the completion of each waiting task first time packet assembling
The result of first time packet assembling is re-executed and described is arbitrarily obtained from each waiting task as new waiting task
Two waiting tasks；
After the completion of each waiting task n-th packet assembling, if grouping maximum in the result of detection n-th packet assembling
Combined result reaches the default packet assembling upper limit, stops operation, and n is the integer more than 1.
8. task as claimed in claim 6 combines terminal device, which is characterized in that each waiting task carries task mark
Know；
Before by the field in inquiring data dictionary to obtain each waiting task, further include：
Each waiting task is grouped according to the task identification that each waiting task carries.
9. task as claimed in claim 8 combines terminal device, which is characterized in that is taken described according to each waiting task
After the task identification of band is grouped each waiting task, further include：
According to the task identification and the correspondence of task priority to prestore, the task identification that each waiting task carries is determined
Corresponding task priority is ranked up each waiting task according to determining task priority.
10. a kind of computer readable storage medium, the computer-readable recording medium storage has computer program, and feature exists
In the step of realization task combined method as described in any one of claim 1 to 5 when the computer program is executed by processor
Suddenly.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711056184.3A CN108255602B (en) | 2017-11-01 | 2017-11-01 | Task combination method and terminal equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711056184.3A CN108255602B (en) | 2017-11-01 | 2017-11-01 | Task combination method and terminal equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108255602A true CN108255602A (en) | 2018-07-06 |
| CN108255602B CN108255602B (en) | 2020-11-27 |
Family
ID=62722032
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711056184.3A Active CN108255602B (en) | 2017-11-01 | 2017-11-01 | Task combination method and terminal equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108255602B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109766540A (en) * | 2018-12-10 | 2019-05-17 | 平安科技（深圳）有限公司 | Generic text information extracting method, device, computer equipment and storage medium |
| CN109918116A (en) * | 2019-03-12 | 2019-06-21 | 中国工商银行股份有限公司 | O&M object support method and system |
| CN110458407A (en) * | 2019-07-12 | 2019-11-15 | 平安普惠企业管理有限公司 | A kind of method for allocating tasks, device and computer readable storage medium |
| CN111259212A (en) * | 2020-02-14 | 2020-06-09 | 北京和德宇航技术有限公司 | Telemetering data interpretation method, device, equipment and storage medium |
| CN112181636A (en) * | 2020-09-02 | 2021-01-05 | 深圳市欢太科技有限公司 | Internet content identification method and device, terminal and readable storage medium |
| CN113139108A (en) * | 2020-01-17 | 2021-07-20 | 北京京东振世信息技术有限公司 | Data processing method and device |
| CN114942790A (en) * | 2022-05-31 | 2022-08-26 | 广州小马慧行科技有限公司 | Task processing method, device, equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104216888A (en) * | 2013-05-30 | 2014-12-17 | 中国电信股份有限公司 | Data processing task relation setting method and system |
| US20150012766A1 (en) * | 2008-02-29 | 2015-01-08 | Herbert Hum | Distribution of tasks among asymmetric processing elements |
| US9047129B2 (en) * | 2012-07-23 | 2015-06-02 | Adobe Systems Incorporated | Systems and methods for load balancing of time-based tasks in a distributed computing system |
| CN105183871A (en) * | 2015-09-17 | 2015-12-23 | 北京京东尚科信息技术有限公司 | Data query method and device |
-
2017
- 2017-11-01 CN CN201711056184.3A patent/CN108255602B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150012766A1 (en) * | 2008-02-29 | 2015-01-08 | Herbert Hum | Distribution of tasks among asymmetric processing elements |
| US9047129B2 (en) * | 2012-07-23 | 2015-06-02 | Adobe Systems Incorporated | Systems and methods for load balancing of time-based tasks in a distributed computing system |
| CN104216888A (en) * | 2013-05-30 | 2014-12-17 | 中国电信股份有限公司 | Data processing task relation setting method and system |
| CN105183871A (en) * | 2015-09-17 | 2015-12-23 | 北京京东尚科信息技术有限公司 | Data query method and device |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109766540A (en) * | 2018-12-10 | 2019-05-17 | 平安科技（深圳）有限公司 | Generic text information extracting method, device, computer equipment and storage medium |
| CN109766540B (en) * | 2018-12-10 | 2022-05-03 | 平安科技（深圳）有限公司 | General text information extraction method and device, computer equipment and storage medium |
| CN109918116A (en) * | 2019-03-12 | 2019-06-21 | 中国工商银行股份有限公司 | O&M object support method and system |
| CN109918116B (en) * | 2019-03-12 | 2022-05-27 | 中国工商银行股份有限公司 | Operation and maintenance object supporting method and system |
| CN110458407A (en) * | 2019-07-12 | 2019-11-15 | 平安普惠企业管理有限公司 | A kind of method for allocating tasks, device and computer readable storage medium |
| CN113139108A (en) * | 2020-01-17 | 2021-07-20 | 北京京东振世信息技术有限公司 | Data processing method and device |
| CN111259212A (en) * | 2020-02-14 | 2020-06-09 | 北京和德宇航技术有限公司 | Telemetering data interpretation method, device, equipment and storage medium |
| CN112181636A (en) * | 2020-09-02 | 2021-01-05 | 深圳市欢太科技有限公司 | Internet content identification method and device, terminal and readable storage medium |
| CN114942790A (en) * | 2022-05-31 | 2022-08-26 | 广州小马慧行科技有限公司 | Task processing method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108255602B (en) | 2020-11-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108255602A (en) | Task combined method and terminal device | |
| CN108595157B (en) | Block chain data processing method, device, equipment and storage medium | |
| CN109241068A (en) | The method, apparatus and terminal device that foreground and background data compares | |
| CN107729251A (en) | Testing case management and device | |
| CN103902535A (en) | Method, device and system for obtaining associational word | |
| CN109146095A (en) | The treating method and apparatus of multiservice system problem | |
| CN109491857A (en) | A kind of data monitoring method, system and the terminal device of rule-based engine | |
| CN107133263A (en) | POI recommends method, device, equipment and computer-readable recording medium | |
| CN109471893A (en) | Querying method, equipment and the computer readable storage medium of network data | |
| CN107133233A (en) | A kind of processing method and processing device of configuration data inquiry | |
| CN106649210A (en) | Data conversion method and device | |
| CN111813517A (en) | Task queue allocation method and device, computer equipment and medium | |
| CN107783953A (en) | Information input method and terminal device | |
| CN110390011A (en) | The method and apparatus of data classification | |
| CN117093619A (en) | Rule engine processing method and device, electronic equipment and storage medium | |
| CN112214402A (en) | Code verification algorithm selection method and device and storage medium | |
| CN116956326A (en) | Authority data processing method and device, computer equipment and storage medium | |
| CN107169005A (en) | POI recommends method, device, equipment and computer-readable recording medium | |
| CN111917848A (en) | Data processing method based on edge computing and cloud computing cooperation and cloud server | |
| CN109120731B (en) | Universal communication method, system and device | |
| CN107786308B (en) | Data transmission method and terminal device | |
| CN104216986A (en) | Device and method for improving data query efficiency through pre-operation according to data update period | |
| CN111506784B (en) | Asset creditor matching method, device, computer equipment and storage medium | |
| CN115129885A (en) | Entity chain pointing method, device, equipment and storage medium | |
| CN107729347A (en) | Acquisition methods, device, equipment and the computer-readable recording medium of synonymous label |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |