CN108595253A - Time-varying path QoS based on atomic node services sets ensures dispatching method and device - Google Patents
Time-varying path QoS based on atomic node services sets ensures dispatching method and device Download PDFInfo
- Publication number
- CN108595253A CN108595253A CN201711470937.5A CN201711470937A CN108595253A CN 108595253 A CN108595253 A CN 108595253A CN 201711470937 A CN201711470937 A CN 201711470937A CN 108595253 A CN108595253 A CN 108595253A
- Authority
- CN
- China
- Prior art keywords
- business
- atomic node
- time
- processing
- atomic
- 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.)
- Pending
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/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/48—Indexing scheme relating to G06F9/48
- G06F2209/486—Scheduler internals
Abstract
The time-varying path QoS based on atomic node services sets that the present invention relates to a kind of ensureing that the processing of complete complicated business is decomposed into each atomic node business by dispatching method, this method；Structure, running logic tree；Operation logic tree is traversed, path length when each atomic node business is completed to entire business is calculated；It is scheduled according to the dynamic real-time of global change in the implementation procedure of processing service.The present invention also provides a kind of, and the time-varying path QoS based on atomic node services sets ensures dispatching device.The method nuclear device that this patent provides, fast and easy can effectively shorten the disposed of in its entirety used time, ensure time QoS demand.The present invention converts complicated business processing to operation logic tree, convert the time demand guarantee of QoS to scheduling problem, it is provided for the field and a kind of new solves the problems, such as angle and thinking, and, the method of the present invention considers the dynamic real-time of global change in the implementation procedure that processing services, and effectively shortens and completes the time that complicated business is handled.
Description
Technical field
The present invention relates to service quality guarantee dispatching technique field more particularly to it is a kind of based on atomic node services sets when
Become path QoS and ensures dispatching method and device.
Background technology
In the system of complicated industry processing, service quality (Quality of Service, QoS) demand embodies a concentrated expression of
Real-time quality requirement, and the demand of real-time is then embodied in system and completes time of a certain complete complicated business processing service and wants
It asks, shortens the means of complete complicated business processing service time, then can be converted into forming complete complicated business processing service
Each node traffic processing service carries out rational management.
For the time for shortening complete complicated business processing service, ensure that time QoS in the system of complicated industry processing needs
It asks, it can be by handling the operation logic tree that service is converted to each node traffic processing service, the tune of service to complete complicated business
It is that the scheduling process of this operation logic tree, but previous method are not carried out complete complicated business and patrolled to running to spend journey
The conversion of tree is collected, does not also consider the dynamic real-time of global change in scheduling process.
Thus, there is an urgent need for it is a kind of according to processing service scheduling process in global change dynamic real-time based on atom section
The time-varying path QoS of point services sets ensures dispatching method and device.
Invention content
Based on this, it is necessary in the method for above-mentioned conventional needle to shortening the time that complete complicated business processing services not
Conversion of the complete complicated business to operation logic tree is carried out, does not also consider the dynamic real-time of global change in scheduling process
Problem, provide it is a kind of according to processing service scheduling process in global change dynamic real-time based on atomic node services sets
Time-varying path QoS ensure dispatching method and device.
Dispatching method is ensured according to a kind of time-varying path QoS based on atomic node services sets that the object of the invention provides,
Include the following steps：
The processing of complete complicated business is decomposed into each atomic node business；
Structure, running logic tree；
Operation logic tree is traversed, path length when each atomic node business is completed to entire business is calculated；
It is scheduled according to the dynamic real-time of global change in the implementation procedure of processing service.
In one of the embodiments, it is described according to processing service implementation procedure in global change dynamic real-time into
Row, which is adjusted, to be specifically comprised the following steps：
D1 establishes atomic node business to be selected pond；
D2 waits for executable atomic node business and the addition of pending atomic node business according to the operation logic tree
Select atomic node business pond；
D3 judges whether atomic node business to be selected pond is empty, if so then execute step D6；
The D4 scheduling longest atomic node business in path chooses consumption if the longest atomic node business in path is not unique
When minimum atomic node business, then remove it whole service logic tree, temporarily abandon currently selected path, described in refreshing
Operation logic tree state；
D5 deletes this atomic node business from atomic node business to be selected pond, goes to D3.
D6 completes whole business, terminates scheduling process.
The atomic node business is each node on operation logic tree in one of the embodiments,.
The operation logic tree is that the composition system complexity partial order of complete complicated business processing is closed in one of the embodiments,
The tree of system.
Atomic node business to be selected pond is that all can perform atom under current real-time status in one of the embodiments,
The set that node traffic processing is constituted with pending atomic node business processing is atomic node business processing to be selected pond.
The executable atomic node business is original state in one of the embodiments, is only in leaf position
Atomic node business processing can be scheduled execution, if not the processing of the preamble in a certain atomic node business processing is performed both by
It finishes, then it is in leaf position in logic, which is the atomic node business that can perform.
The pending atomic node business is in one of the embodiments, when executable atomic node business processing
A certain service is needed to supply, but this service is in busy state, then the processing is pending atomic node business processing.
Atomic node business to be selected pond is that under current real-time status, all can perform atom in one of the embodiments,
The set that node traffic processing is constituted with pending atomic node business processing is atomic node business processing to be selected pond.
Another purpose according to the present invention also provides a kind of time-varying path QoS guarantee based on atomic node services sets
Dispatching device, including：
Decomposing module, for the processing of complete complicated business to be decomposed into each atomic node business；
Constructing module is used for structure, running logic tree；
Computing module is traversed, for traversing operation logic tree, when calculating each atomic node business and being completed to entire business
Path length；
Real-Time Scheduling module is scheduled according to the dynamic real-time of global change in the implementation procedure of processing service.
The Real-Time Scheduling module includes in one of the embodiments,：
Unit is established, for establishing atomic node business to be selected pond；
Unit is added, for according to operation logic tree by executable atomic node business and pending atomic node business
Atomic node business to be selected pond is added；
Judging unit, if then completing whole business, terminates to adjust for judging whether atomic node business to be selected pond is empty
Spend journey；
Scheduling unit, for dispatching the longest atomic node business in path, if the longest atomic node business in path is not only
One, then it chooses and takes minimum atomic node business；
Unit is removed, the atomic node business for transferring the scheduling unit removes entire logic tree, temporarily abandons
Currently selected path；
Refresh unit, for refreshing the operation logic tree state；
Deleting unit, the atomic node industry transferred for deleting the scheduling unit from atomic node business to be selected pond
Business.
Beneficial effects of the present invention include：A kind of time-varying path QoS based on atomic node services sets provided by the invention
It ensures dispatching method and device, the processing of complete complicated business is decomposed into each atomic node business；Structure, running logic tree；Traversal
Operation logic tree calculates path length when each atomic node business is completed to entire business；According to the execution of processing service
The dynamic real-time of global change is scheduled in the process.A kind of time-varying road based on atomic node services sets proposed by the present invention
Diameter QoS ensures dispatching method, fast and easy, can effectively shorten the disposed of in its entirety used time, ensures time QoS demand.The present invention will answer
Miscellaneous business processing is converted into operation logic tree, converts the time demand guarantee of QoS to scheduling problem, one is provided for the field
It is kind new to solve the problems, such as angle and thinking, also, the method for the present invention considers global change in the implementation procedure of processing service
Dynamic real-time effectively shortens and completes the time that complicated business is handled.
Description of the drawings
Fig. 1 is that the time-varying path QoS based on atomic node services sets of one embodiment of the invention ensures the stream of dispatching method
Cheng Tu；
Fig. 2 is the schematic diagram that a kind of time-varying path QoS based on atomic node services sets of the present invention ensures dispatching device；
Fig. 3 is that the time-varying path QoS based on atomic node services sets of another embodiment of the present invention ensures dispatching method
Flow chart；
Fig. 4 is embodiment illustrated in fig. 3 logic tree schematic diagram；
Fig. 5 is the scheduling result figure using this method；
Fig. 6 is the result figure that real-time dynamic change is not used.
Specific implementation mode
In order to make the purpose , technical scheme and advantage of the present invention be clearer, below in conjunction with attached drawing to of the invention real
The specific implementation mode for applying the method and device of the Face datection of example illustrates.It should be appreciated that specific reality described herein
It applies example to be only used to explain the present invention, be not intended to limit the present invention.
As described above, for the time for shortening complete complicated business processing service, in the system for ensureing complicated industry processing
Time QoS demand can be converted to the operation logic tree that each node traffic processing services by handling service to complete complicated business,
The scheduling process of service is not carry out complete complicated business to the scheduling process of this operation logic tree, but previous method
To the conversion of operation logic tree, the dynamic real-time of global change in scheduling process is not also considered.And provided by the invention one
Time-varying path QoS of the kind based on atomic node services sets ensures dispatching method and device, and the processing of complete complicated business is decomposed into
Each atomic node business；Structure, running logic tree；Operation logic tree is traversed, it is complete to entire business to calculate each atomic node business
At when path length；It is scheduled according to the dynamic real-time of global change in the implementation procedure of processing service.The present invention carries
A kind of time-varying path QoS based on atomic node services sets gone out ensures dispatching method, fast and easy, can effectively shorten whole place
The used time is managed, ensures time QoS demand.The present invention converts complicated business processing to operation logic tree, and the time demand of QoS is protected
Barrier is converted into scheduling problem, for the field provide it is a kind of it is new solve the problems, such as angle and thinking, also, the method for the present invention considers
The dynamic real-time of global change in the implementation procedure of processing service, effectively shortens the time for completing complicated business processing.
With reference to figure 1, the flow of dispatching method is ensured for a kind of time-varying path QoS based on atomic node services sets of the present invention
Figure.A kind of time-varying path QoS guarantee dispatching method 100 based on atomic node services sets, includes the following steps：
Step S120：The processing of complete complicated business is decomposed into each atomic node business；
Step S140：Structure, running logic tree；
Step S160：Operation logic tree is traversed, path length when each atomic node business is completed to entire business is calculated
Degree；It is scheduled according to the dynamic real-time of global change in the implementation procedure of processing service.
Wherein, step S160 carries out adjusting specific packet according to the dynamic real-time of global change in the implementation procedure of processing service
Include following steps：
D1 establishes atomic node business to be selected pond；
D2 waits for executable atomic node business and the addition of pending atomic node business according to the operation logic tree
Select atomic node business pond；
D3 judges whether atomic node business to be selected pond is empty, if so then execute step D6；
The D4 scheduling longest atomic node business in path chooses consumption if the longest atomic node business in path is not unique
When minimum atomic node business, then remove it whole service logic tree, temporarily abandon currently selected path, described in refreshing
Operation logic tree state；
D5 deletes this atomic node business from atomic node business to be selected pond, goes to D3.
D6 completes whole business, terminates scheduling process.
Above-mentioned atomic node business is each node on operation logic tree.Operation logic tree is the processing of complete complicated business
Constitute the tree of the complicated partial ordering relation of system.Atomic node business to be selected pond is that all can perform original under current real-time status
The set that child node business processing is constituted with pending atomic node business processing is atomic node business processing to be selected pond.It can
The atomic node business of execution is original state, is only in the atomic node business processing of leaf position and can be scheduled execution,
It is finished if not the preamble processing in a certain atomic node business processing is performed both by, then it is in leaf position, the atom in logic
Node traffic processing is executable atomic node business.Pending atomic node business is, when executable atomic node business
Processing needs a certain service supply, but this service is in busy state, then the processing is pending atomic node business processing.
Atomic node business to be selected pond is, under current real-time status, all can perform atomic node business processing and pending atom section
The set that point business processing is constituted is atomic node business processing to be selected pond.
With reference to figure 2, the signal of dispatching device is ensured for a kind of time-varying path QoS based on atomic node services sets of the present invention
Figure.A kind of time-varying path QoS guarantee dispatching device 200 based on atomic node services sets, including：Decomposing module 220 constructs mould
Block 240 and traversal computing module 260.Decomposing module 220, for the processing of complete complicated business to be decomposed into each atomic node industry
Business, constructing module 240 are used for structure, running logic tree, and traversal computing module 260 traverses operation logic tree, calculates each atom section
Path length when point business is completed to entire business；Real-Time Scheduling module becomes according to global in the implementation procedure of processing service
The dynamic real-time of change is scheduled.
Wherein above-mentioned Real-Time Scheduling module 260 includes：Unit is established, unit, judging unit is added, scheduling unit removes
Unit, refresh unit and deleting unit.Unit is established, for establishing atomic node business to be selected pond；Unit is added, is used for basis
Atomic node business to be selected pond is added in executable atomic node business and pending atomic node business by operation logic tree；Sentence
Disconnected unit, if then completing whole business, terminates scheduling process for judging whether atomic node business to be selected pond is empty；It adjusts
Degree unit, if the longest atomic node business in path is not unique, chooses consumption for dispatching the longest atomic node business in path
When minimum atomic node business；Unit is removed, the atomic node business removal for transferring the scheduling unit is entirely patrolled
Tree is collected, currently selected path is temporarily abandoned；Refresh unit, for refreshing the operation logic tree state；Deleting unit, for from
The atomic node business that the scheduling unit is transferred is deleted in atomic node business to be selected pond.
A kind of time-varying path QoS based on atomic node services sets provided by the invention ensures dispatching method and device, will
Complete complicated business processing is decomposed into each atomic node business；Structure, running logic tree；Operation logic tree is traversed, is calculated each former
Path length when child node business is completed to entire business；It is real according to the dynamic of global change in the implementation procedure of processing service
When property is scheduled.A kind of time-varying path QoS based on atomic node services sets proposed by the present invention ensures dispatching method, convenient
Quickly, it can effectively shorten the disposed of in its entirety used time, ensure time QoS demand.The present invention converts complicated business processing to operation and patrols
Volume tree, converts the time demand guarantee of QoS to scheduling problem, is provided for the field and a kind of new solve the problems, such as angle and think
Road, also, the method for the present invention considers the dynamic real-time of global change in the implementation procedure of processing service, effectively shortens completion
The time of complicated business processing.
Fig. 3 is that the time-varying path QoS based on atomic node services sets of another embodiment of the present invention ensures dispatching method
Flow chart；
Fig. 4 is embodiment illustrated in fig. 3 logic tree schematic diagram；
Fig. 5 is the scheduling result figure using this method；
Fig. 6 is the result figure that real-time dynamic change is not used.
Below by taking embodiment illustrated in fig. 3 as an example, the present invention is elaborated.
A kind of time-varying path QoS guarantee dispatching method based on atomic node services sets, this method comprises the following steps：Fortune
The processing of complete complicated business is decomposed into each atom business, is handled according to complete complicated business each by row logic tree constructing module
The partial ordering relation of atom business is configured to operation logic tree；It ensures that scheduler module traverses operation logic tree, calculates each former
Path length when child node business is completed to entire business, it is real according to the dynamic of global change in the implementation procedure of processing service
Shi Xing, critical path real-time change, therefore ensure that the scheduling process of scheduler module is：The longest atom section in path is dispatched first
Point business chooses the atomic node business for taking minimum, then removes it entire logic tree, temporarily abandon if that can not select
Currently selected path after flush logic tree state, recycles entire scheduling process, until the atom service node of entire logic tree moves
Except finishing, complete complicated business processing scheduling is completed.
Wherein, above-mentioned noun is illustrated as follows：
Operation logic tree：The tree of the complicated partial ordering relation of composition system of complete complicated business processing；Such as complicated business
P is handled, the service for providing processing capacity forms { M1, M2 ... Mm } by m, constitutes the atomic node industry of entire business processing
Business be that a is { A1, A2 ... Aa }.
Atomic node business：Each node on operation logic tree.As each node is made of a triple (Ax, My,
Tz), indicate that atomic node business Ax needs execute on My, and it is tz to need the processing time consumed.
Executable atomic node business：Original state, the atomic node business processing for being only in leaf position can be by
Scheduling executes, if not the processing of the preamble in a certain atomic node business processing is performed both by and finishes, then it is in leaf position in logic
It sets, it is executable atomic node business to deserve to be called and state atomic node business processing；As A1, A2 ... Ax are both needed to by My processing, and My
Idle available mode in no task.
Pending atomic node business：When executable atomic node business processing needs a certain service supply, but this service
In busy state, then the processing is pending atomic node business processing；As A1, A2 ... Ax are both needed to by My processing, and
My is in the seizure condition for the task that is carrying out.
Atomic node business to be selected pond：Under current real-time status, all executable atomic node business processings with it is pending
The set that atomic node business processing is constituted is atomic node business processing to be selected pond.
Specific reference chart 3, the time-varying path QoS based on atomic node services sets ensure that dispatching method, the QoS are protected
It is as follows to hinder dispatching method specific implementation step：
Step1. the processing of complete complicated business is decomposed into each atomic node business, each atomic node business is by one three
Tuple is constituted (number, required service, service take).
Step2. the execution partial ordering relation structure, running logic tree handled according to complete complicated business.
Step3. extreme saturation operation logic tree calculates path length when each atomic node business is completed to entire business
Degree；If the service path trend of Ax business to last A1 business is Ax ..., A2, A1, path length is the sum of processing time.
Step4. atomic node business to be selected pond A is established, the original state T=0 moment, object number L (A)=0 in pond；
Step5. executable atomic node business is added with pending atomic node business according to operation logic tree to be selected
Atomic node business pond；
Step6. judge whether atomic node business to be selected pond is empty, if then going to Step9.
Step7. the longest atomic node business Max () in path is dispatched, is chosen if not unique and takes minimum atom section
Point business, then removes it entire logic tree, temporarily abandons currently selected path, flush logic tree state.
Step8. this this atomic node business is deleted from atomic node business to be selected pond, goes to Step6.
Step9. whole business is completed, scheduling process is terminated.
Time-varying path QoS based on atomic node services sets ensures dispatching method, this technology mainly for scheduler object
For the processing of complete complicated business, the used time is reduced in the system that complicated industry is handled for it, convenient effective guarantee dispatching party is provided
Method has generality.Complicated business processing, the service for providing processing capacity are formed { M1, M2 ..., Mm } by m, are constituted whole
The atomic node business of a business processing is n { A1, A2 ..., An }, and atomic node business is in the service for handling the business
It taking as Ti, each atomic node business is made of a triple, and number, required service, service take, i.e., (Ai, Mj,
Ti)。
Complicated business handles P, and the service for providing processing capacity forms { M1, M2, M3 } by 3, constitutes at entire business
The atomic node business of reason be 9 for (A1, M3,20), (A2, M2,40), (A3, M1,50), (A4, M2,20), (A5, M1,
30), (A6, M3,60), (A7, M1,20), (A8, M2,10), (A9, M3,10) }, what atomic node business complex relationship was constituted
Operation logic tree is as shown in Fig. 4, show that scheduling result Gantt chart is attached drawing 5 according to the method for the present invention, entire to handle the used time
For T=170, if only considering that a longest path does not consider that the characteristic of its real-time dynamic change show that scheduling result is attached drawing according to previous
6, it is entire to handle the used time as T=180.As it can be seen that this method scheduling result used time is less.
Therefore, a kind of time-varying path QoS based on atomic node services sets proposed by the present invention ensures dispatching method, convenient
Quickly, it can effectively shorten the disposed of in its entirety used time, ensure time QoS demand.
To sum up, a kind of time-varying path QoS based on atomic node services sets provided by the invention ensures dispatching method and dress
It sets, the processing of complete complicated business is decomposed into each atomic node business；Structure, running logic tree；Operation logic tree is traversed, is calculated
Path length when each atomic node business is completed to entire business；According to global change in the implementation procedure of processing service
Dynamic real-time is scheduled.A kind of time-varying path QoS based on atomic node services sets proposed by the present invention ensures dispatching party
Method, fast and easy can effectively shorten the disposed of in its entirety used time, ensure time QoS demand.The present invention converts complicated business processing to
Operation logic tree converts the time demand guarantee of QoS to scheduling problem, is provided for the field and a kind of new solves the problems, such as angle
Degree and thinking, also, the method for the present invention considers the dynamic real-time of global change in the implementation procedure that processing services, and effectively contracts
The short time for completing complicated business processing.
One of ordinary skill in the art will appreciate that realizing all or part of flow in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the program can be stored in a computer read/write memory medium
In, the program is when being executed, it may include such as the flow of the embodiment of above-mentioned each method.Wherein, the storage medium can be magnetic
Dish, CD, read-only memory (Read-Only Memory, ROM) or random access memory (Random Access
Memory, RAM) etc..
Several embodiments of the invention above described embodiment only expresses, the description thereof is more specific and detailed, but simultaneously
Cannot the limitation to the scope of the claims of the present invention therefore be interpreted as.It should be pointed out that for those of ordinary skill in the art
For, without departing from the inventive concept of the premise, various modifications and improvements can be made, these belong to the guarantor of the present invention
Protect range.Therefore, the protection domain of patent of the present invention should be determined by the appended claims.
Claims (10)
1. a kind of time-varying path QoS based on atomic node services sets ensures dispatching method, which is characterized in that including walking as follows
Suddenly：
The processing of complete complicated business is decomposed into each atomic node business；
Structure, running logic tree；
Operation logic tree is traversed, path length when each atomic node business is completed to entire business is calculated；
It is scheduled according to the dynamic real-time of global change in the implementation procedure of processing service.
2. the time-varying path QoS according to claim 1 based on atomic node services sets ensures that dispatching method, feature exist
In the dynamic real-time of global change adjust and specifically comprises the following steps in the implementation procedure according to processing service：
D1 establishes atomic node business to be selected pond；
Original to be selected is added according to the operation logic tree, by executable atomic node business and pending atomic node business in D2
Child node business pond；
D3 judges whether atomic node business to be selected pond is empty, if so then execute step D6；
D4 dispatches the longest atomic node business in path, if the longest atomic node business in path is not unique, chooses and takes most
Small atomic node business, then removes it whole service logic tree, temporarily abandons currently selected path, refreshes the operation
Logic tree state；
D5 deletes this atomic node business from atomic node business to be selected pond, goes to D3.
D6 completes whole business, terminates scheduling process.
3. the time-varying path QoS according to claim 1 or 2 based on atomic node services sets ensures dispatching method, special
Sign is that the atomic node business is each node on operation logic tree.
4. the time-varying path QoS according to claim 1 or 2 based on atomic node services sets ensures dispatching method, special
Sign is that the operation logic tree is the tree of the complicated partial ordering relation of composition system of complete complicated business processing.
5. the time-varying path QoS according to claim 2 based on atomic node services sets ensures that dispatching method, feature exist
In atomic node business to be selected pond is that all can perform atomic node business processing and pending atom under current real-time status
The set that node traffic processing is constituted is atomic node business processing to be selected pond.
6. the time-varying path QoS according to claim 2 based on atomic node services sets ensures that dispatching method, feature exist
In the executable atomic node business is original state, and the atomic node business processing for being only in leaf position can be by
Scheduling executes, if not the processing of the preamble in a certain atomic node business processing is performed both by and finishes, then it is in leaf position in logic
It sets, which is the atomic node business that can perform.
7. the time-varying path QoS according to claim 2 based on atomic node services sets ensures that dispatching method, feature exist
In the pending atomic node business is, when executable atomic node business processing needs a certain service supply, but this service
In busy state, then the processing is pending atomic node business processing.
8. the time-varying path QoS according to claim 2 based on atomic node services sets ensures that dispatching method, feature exist
In atomic node business to be selected pond is, under current real-time status, all can perform atomic node business processing and pending atom
The set that node traffic processing is constituted is atomic node business processing to be selected pond.
9. a kind of time-varying path QoS based on atomic node services sets ensures dispatching device, which is characterized in that including：
Decomposing module, for the processing of complete complicated business to be decomposed into each atomic node business；
Constructing module is used for structure, running logic tree；
Traversal computing module calculates road when each atomic node business is completed to entire business for traversing operation logic tree
Electrical path length；
Real-Time Scheduling module is scheduled according to the dynamic real-time of global change in the implementation procedure of processing service.
10. the time-varying path QoS according to claim 9 based on atomic node services sets ensures dispatching device, feature
It is, the Real-Time Scheduling module includes：
Unit is established, for establishing atomic node business to be selected pond；
Unit is added, for executable atomic node business and pending atomic node business to be added according to operation logic tree
Atomic node business to be selected pond；
Judging unit, for judging whether atomic node business to be selected pond is empty, if then completing whole business, end was dispatched
Journey；
Scheduling unit, for dispatching the longest atomic node business in path, if the longest atomic node business in path is not unique,
It chooses and takes minimum atomic node business；
Unit is removed, the atomic node business for transferring the scheduling unit removes entire logic tree, temporarily abandons current
Selected path；
Refresh unit, for refreshing the operation logic tree state；
Deleting unit, the atomic node business transferred for deleting the scheduling unit from atomic node business to be selected pond.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711470937.5A CN108595253A (en) | 2017-12-29 | 2017-12-29 | Time-varying path QoS based on atomic node services sets ensures dispatching method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711470937.5A CN108595253A (en) | 2017-12-29 | 2017-12-29 | Time-varying path QoS based on atomic node services sets ensures dispatching method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108595253A true CN108595253A (en) | 2018-09-28 |
Family
ID=63633398
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711470937.5A Pending CN108595253A (en) | 2017-12-29 | 2017-12-29 | Time-varying path QoS based on atomic node services sets ensures dispatching method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108595253A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110262879A (en) * | 2019-05-17 | 2019-09-20 | 杭州电子科技大学 | A kind of Monte Carlo tree searching method explored and utilized based on balance |
| CN111966479A (en) * | 2020-08-19 | 2020-11-20 | 支付宝(杭州)信息技术有限公司 | Business processing method, risk identification business processing device and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140222490A1 (en) * | 2012-05-30 | 2014-08-07 | International Business Machines Corporation | Identifying direct and indirect cost of a disruption of a resource |
| CN104678959A (en) * | 2015-01-28 | 2015-06-03 | 哈尔滨理工大学 | Component disassembling method for facilitating different-equipment multi-workshop comprehensive scheduling |
| CN105279598A (en) * | 2015-05-18 | 2016-01-27 | 哈尔滨理工大学 | Brother procedure grouping integrated dispatching method based on dynamic critical path method |
| CN105511432A (en) * | 2015-12-09 | 2016-04-20 | 哈尔滨理工大学 | Serial process integrated dispatching method based on path length |
-
2017
- 2017-12-29 CN CN201711470937.5A patent/CN108595253A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140222490A1 (en) * | 2012-05-30 | 2014-08-07 | International Business Machines Corporation | Identifying direct and indirect cost of a disruption of a resource |
| CN104678959A (en) * | 2015-01-28 | 2015-06-03 | 哈尔滨理工大学 | Component disassembling method for facilitating different-equipment multi-workshop comprehensive scheduling |
| CN105279598A (en) * | 2015-05-18 | 2016-01-27 | 哈尔滨理工大学 | Brother procedure grouping integrated dispatching method based on dynamic critical path method |
| CN105511432A (en) * | 2015-12-09 | 2016-04-20 | 哈尔滨理工大学 | Serial process integrated dispatching method based on path length |
Non-Patent Citations (2)
| Title |
|---|
| 常宁宁: "基于设备工序紧凑的综合调度算法的研究", 《中国优秀硕士学位论文全文数据库工程科技II辑》 * |
| 谢志强: "工件间有约束的复杂产品工序调度研究", 《中国博士学位论文全文数据库经济与管理科学辑》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110262879A (en) * | 2019-05-17 | 2019-09-20 | 杭州电子科技大学 | A kind of Monte Carlo tree searching method explored and utilized based on balance |
| CN111966479A (en) * | 2020-08-19 | 2020-11-20 | 支付宝(杭州)信息技术有限公司 | Business processing method, risk identification business processing device and electronic equipment |
| CN111966479B (en) * | 2020-08-19 | 2024-03-29 | 支付宝(杭州)信息技术有限公司 | Service processing and risk identification service processing method and device and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105190543B (en) | For the coordination based on getatability of looping traffic | |
| US7788237B2 (en) | Method and system for tracking changes in a document | |
| Aydın et al. | Multi-objective temporal bin packing problem: An application in cloud computing | |
| CN106776395B (en) | A kind of method for scheduling task and device of shared cluster | |
| US20200110761A1 (en) | System and method for providing an artificially-intelligent graph database | |
| CN110569252B (en) | Data processing system and method | |
| KR20140070231A (en) | Map-reduce workflow processing device and method, and storage media storing the same | |
| CN106910045A (en) | Design of Workflow method and system | |
| CN108595253A (en) | Time-varying path QoS based on atomic node services sets ensures dispatching method and device | |
| CN109284180A (en) | A kind of method for scheduling task, device, electronic equipment and storage medium | |
| CN106375360A (en) | Method, device and system for updating graph data | |
| US11948005B2 (en) | Managed integration of constituent services of multi-service applications | |
| CN110297810A (en) | A kind of stream data processing method, device and electronic equipment | |
| Yuan et al. | Solving job shop scheduling problems via deep reinforcement learning | |
| CN107392387A (en) | A kind of dispatching method of AGV optimal control times | |
| CN110196835A (en) | The processing method of metadata, the processing unit of metadata and electronic equipment | |
| CN104901998B (en) | integrated cloud service monitoring method | |
| CN104361017B (en) | A kind of information processing method understood based on Uniform semantic | |
| CN108874375A (en) | A kind of implementation method and device of timer | |
| CN111597035A (en) | Simulation engine time advancing method and system based on multiple threads | |
| WO2022116667A1 (en) | Training task queuing cause analysis method and system, device and medium | |
| WO2022193460A1 (en) | Presentation template transition method and device | |
| CN111506407B (en) | Resource management and job scheduling method and system combining Pull mode and Push mode | |
| CN107368338A (en) | A kind of software automatic deployment method and device | |
| CN109614386B (en) | Data processing method, device, server and computer readable storage medium |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180928 |