CN106878039A - A kind of version task scheduling and managing method and system - Google Patents
A kind of version task scheduling and managing method and system Download PDFInfo
- Publication number
- CN106878039A CN106878039A CN201510924620.9A CN201510924620A CN106878039A CN 106878039 A CN106878039 A CN 106878039A CN 201510924620 A CN201510924620 A CN 201510924620A CN 106878039 A CN106878039 A CN 106878039A
- Authority
- CN
- China
- Prior art keywords
- task
- version
- present node
- node
- lock
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/085—Retrieval of network configuration; Tracking network configuration history
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer And Data Communications (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a kind of version task scheduling and managing method and system, the method includes：Whether the version task for determining present node is setting version task, when version task is for setting version task, transfer present node and to the task lock when related other nodes of prosthomere, detect whether version task dispatches completion；If version task scheduling is completed, the task lock of other nodes of the task lock and correlation of present node is unlocked, task lock here is version task for limiting node.In embodiments of the present invention, by dynamic dispatching and task lock mechanism, ensure that version task and node off-line event of the scheduled version task not by other during being carrying out are influenceed, the version task during other are carrying out is it also avoid simultaneously and is subject to influenceing for the current version task dispatched, so as to improve the reliability of version tasks carrying.
Description
Technical field
The present invention relates to communication technical field, more particularly to a kind of version task scheduling and managing method and system.
Background technology
Node administration system (English：Network element management system, referred to as：EMS)
It is certain types of one or more the telecommunication network element (English of management：Networkelement, referred to as：
NE system).In the prior art, EMS is by configuration management, alarm management, diagnosis management, performance
The subsystem such as management and version management is constituted.
Currently, in node administration system, version management task lot size scheduling is constrained between being limited to task, version
Multiple constraints such as this compatibility restriction and topological link constraint, common concurrent scheduling method cannot be applied directly to
The scheduling of version management task, so causes the dispatching efficiency and reliability of version task all relatively low.
The content of the invention
The present invention provides a kind of version task scheduling and managing method and system, is used to solve version in the prior art
Task scheduling efficiency and all relatively low problem of reliability.
Specific technical scheme is as follows：
A kind of version task scheduling and managing method, including：
Whether the version task for determining present node is setting version task, wherein, the version task is right
The executive mode of version file；
When the version task is for setting version task, transfers the present node and work as prosthomere with described
The task lock of other related nodes of point, wherein, the task is locked and locks corresponding version times for locking task
Business, makes the task lock corresponding version task and forbids performing；
Detect whether the version task of the present node dispatches completion；
If the version task scheduling is completed, unlock the present node task lock and correlation it is described
The task lock of other nodes.
Optionally, before it is determined that whether the version task of present node is setting version task, methods described
Also include:
According to the Link Layer Discovery Protocol LLDP messages that each node is reported, the physical topology knot of node is created
Structure, wherein, the physical topological structure characterizes annexation between each node；
The many ring protection ERPS messages of Spanning-Tree Protocol STP BPDUs and/or Ethernet enabled by node,
The loop in the physical topological structure is removed, node topology structure chart is generated.
Optionally, before it is determined that whether the version task of present node is setting version task, methods described
Also include：
Whether version task identical version task with the present node is deposited in Detection task ready queue；
If in the presence of deleting the version task of the present node；
If not existing, other version tasks that there is the present node are detected whether；
If there are other version tasks of the present node, refuse the version task and be added to task just
Thread queue；
If in the absence of other version tasks of the present node, allowing for the version task to be added to institute
In stating task ready queue.
Optionally, the version task for setting version task when, transfer the present node and with institute
The task lock when other related nodes of prosthomere is stated, including：
Whether the request times for judging the corresponding task lock of version task of present node are 0；
When the request times of the corresponding task lock of the task type of the present node are 0, described working as is transferred
Front nodal point and the task lock to other nodes related when prosthomere.
Optionally, when the request times in the corresponding task lock of task type of the present node are 0, adjust
Take the present node and locked to the task of other nodes related when prosthomere, specially：
Appoint in the download of the downloading task that the version task is scheduling present node, and the present node
When the request times of business lock are 0, transfer the activation task lock of the predecessor node of the present node and download
Task is locked, and dispatches the activation task lock of all predecessor nodes of the present node.
Optionally, when the request times in the corresponding task lock of task type of the present node are 0, adjust
Take the present node and locked to the task of other nodes related when prosthomere, specially：
Appoint in the activation of the activation task that the version task is scheduling present node, and the present node
When the request times of business lock are 0, the activation task lock of the predecessor node of the present node is transferred, transfer institute
The activation task lock of all predecessor nodes of present node is stated, all subsequent nodes of the present node are transferred
Activation task lock and downloading task lock.
Optionally, methods described also includes：
When the present node is offline, the activation task lock and downloading task lock of the present node are transferred,
And transfer the activation task lock and/or downloading task lock of all subsequent nodes of the present node.
A kind of version task scheduling management system, including：
Determining module, whether the version task for determining present node is setting version task；
Scheduler module, for the version task for setting version task when, transfer the present node with
And locked to the task of other nodes related when prosthomere, wherein, the task is locked for locking task lock
Corresponding version task forbids performing；
Whether detection module, the version task for detecting the present node dispatches completion；
Performing module, if being completed for the version task scheduling, unlocks the task lock of the present node
And the task lock of other nodes of correlation.
Optionally, the system also includes：
Topological structure generation module, for the Link Layer Discovery Protocol LLDP messages reported according to each node,
Create the physical topological structure of node, the Spanning-Tree Protocol STP BPDUs and/or Ethernet enabled by node
Many ring protection ERPS messages, remove the loop in the physical topological structure, generate node topology structure chart,
Wherein, the physical topological structure characterizes annexation between each node.
Optionally, whether the performing module, be additionally operable to deposit in Detection task ready queue work as prosthomere with described
The version task identical version task of point；If in the presence of deleting the version task of the present node；If
Do not exist, then detect whether other version tasks that there is the present node；If there is the present node
Other version tasks, then refuse the version task and be added to task ready queue；If working as in the absence of described
Other version tasks of front nodal point, then allow to be added to the version task in the task ready queue.
Optionally, the scheduler module, the corresponding task lock of version task specifically for judging present node
Request times whether be 0；It is in the request times of the corresponding task lock of the task type of the present node
When 0, transfer the present node and locked to the task of other nodes related when prosthomere.
Optionally, the scheduler module, specifically for being to dispatch the download of present node in the version task
Task, and the present node downloading task lock request times be 0 when, transfer the present node
Predecessor node activation task lock and downloading task lock, dispatch all predecessor nodes of the present node
Activation task lock.
Optionally, the scheduler module, specifically for being to dispatch the activation of present node in the version task
Task, and the present node activation task lock request times be 0 when, transfer the present node
Predecessor node activation task lock, transfer the present node all predecessor nodes activation task lock,
Transfer the activation task lock and downloading task lock of all subsequent nodes of the present node.
In technical solution of the present invention, when it is determined that the version task of present node is for setting version task, lead to
Cross transfer present node and to the task lock when related other nodes of prosthomere, whether detection version task adjust
Degree is completed；If version task scheduling is completed, the task lock of present node and other nodes of correlation are discharged
Task lock, task here locks the version task for forbidding performing for latch node.Therefore in the present invention
In embodiment, by dynamic dispatching and task lock mechanism, it is ensured that scheduled version task is not receiving other just
The influence of version task and node off-line event in the process of implementation, while it also avoid other being carrying out
During version task influenceed by the current version task dispatched, so as to improve version task
The reliability of execution.
Brief description of the drawings
Fig. 1 is a kind of course diagram of version task scheduling and managing method in the embodiment of the present invention；
Fig. 2 is embodiment of the present invention interior joint network topology structure figure；
Fig. 3 is another meshed network topology diagram in the embodiment of the present invention；
Fig. 4 is a kind of structural representation of version task scheduling management system in the embodiment of the present invention.
Specific embodiment
A kind of version task scheduling and managing method is provided in the embodiment of the present invention, the method includes：It is determined that working as
Whether the version task of front nodal point is setting version task, when version task is for setting version task, is transferred
Present node and to the task lock when related other nodes of prosthomere, whether detection version task dispatch completion；
If version task scheduling is completed, the task lock of other nodes of the task lock and correlation of present node is unlocked,
Here task lock is the version task for limiting node.In embodiments of the present invention, by dynamic dispatching
And task lock mechanism, it is ensured that scheduled version task version task not by other during being carrying out
With the influence of node off-line event, while it also avoid version task during other are carrying out to be subject to work as
The influence of the preceding version task dispatched, so as to improve the reliability of version tasks carrying.
Technical solution of the present invention is described in detail below by accompanying drawing and specific embodiment, it will be appreciated that
Particular technique feature in the embodiment of the present invention and embodiment is the explanation to technical solution of the present invention, and
It is not to limit, in the case where not conflicting, the particular technique feature in the embodiment of the present invention and embodiment can
To be mutually combined.
It is as shown in Figure 1 a kind of flow chart of version task scheduling and managing method of the embodiment of the present invention, the method
Including：
S101, whether the version task for determining present node is setting version task；
In embodiments of the present invention, before S101 is performed, the link that EMS first is reported according to node
Layer finds agreement (English：Link Layer Discovery Protocol, referred to as：LLDP) message, creates section
The physical topological structure of point, physical topological structure here characterizes the annexation between each node.Then
The spanning tree enabled according to node is assisted protocol massages and nets very much many ring protections (English：Ethernet Ring
Protection Switching, referred to as：ERPS) message, removes the loop in the physical topological structure,
Generation node topology structure chart.
In the node topology structure chart of generation, root node is EMS, and the ancestor node of arbitrary node A is
A predecessor node, the descendant nodes of node A are referred to as the subsequent node of node A, node A and EMS
Management passage depend on the management passage of predecessor node.
Based on above-mentioned node topology structure chart, EMS can directly determine the predecessor node of any node with
And subsequent node.
Further, in embodiments of the present invention, the version task for each node is processed respectively, and version is appointed
The management that business is carried out by different queues, i.e.,：Task ready queue and tasks carrying queue.User
The version task of the present node for creating is firstly the need of being added in task ready queue.Certainly, in this hair
In bright embodiment before the version task of present node is added in task ready queue, Detection task is just
Whether there is identical version task in thread queue, if there is identical version task, then directly ignore user
The version task of the present node of establishment.
If not existing identical version task in task ready queue, then detect whether there is present node
Other version tasks, if there are other version tasks of present node, then refuse the version task for creating
Be added in task ready queue, if in the absence of present node other version tasks when, then allow create
Version task be added in task ready queue.
Such as, when there is the version downloading task of present node in task ready queue, then do not allow current
The non-volatile task of node is added in task ready queue, if exist in task ready queue working as prosthomere
During the non-volatile task of point, then the version downloading task of present node is not allowed to be added to task ready queue
In.
Certainly, tasks carrying queue is used to place the version task being currently executing, therefore task ready team
When version task in row is scheduled, the version task in task ready queue is just added to tasks carrying team
In row, after current version tasks carrying is completed, then the version task is removed in tasks carrying queue.
When user's establishment version task is obtained, first to determine whether the version task is setting version task,
Here setting version task can be that version downloading task lives non-volatile task.For different versions
Task, the then mode for processing also is differed.
S102, it is determined that version task for setting version task when, transfer present node and with when prosthomere phase
The task lock of other nodes for closing；
Needing exist for explanation is, in embodiments of the present invention, task lock is node topology structure chart interior joint
One attribute, for controlling version task scheduling.Task lock includes downloading task lock and activation task lock, under
Load task is locked and forbids performing version downloading task for latch node, and activation task is locked and forbidden for latch node
Perform non-volatile task.The task lock of each node, can be repeated to apply and be discharged by system, topology section
The number of times that logger task lock is applied in point.The condition that version task can be scheduled is, the version task pair
The application quantity of task lock corresponding with the version task is 0 in the topological node answered.
Due to node version task before execution, it is thus necessary to determine that the application time of the corresponding task lock of the version task
Whether number is that 0 could perform, and thus during the version task of scheduling present node, first to judge present node
The request times of version task corresponding task lock whether be 0, if the Shen of the corresponding task lock of version task
Please number of times not be 0 when, then refusal perform the version task scheduling；If the corresponding task of version task
The request times of lock are 0, then the scheduling of the version task can be performed, below by version task inhomogeneity
Type is illustrated：
Situation one：
It is when dispatching the downloading task of present node, the downloading task of present node to be judged first in version task
Whether the request times of lock are 0, if not 0, then refuse the scheduling of downloading task；
If the downloading task lock of present node is 0, the scheduling of version downloading task is performed, now system will
Apply for that the downloading task of present node is locked the request times that request times add 1, activation task is locked and also adds 1, and
The request times of the activation task lock of all predecessor nodes of present node add 1, so ensure present node
Version downloading task will not be influenceed by the version task of predecessor node, and scheduling is appointed so as to improve version
Efficiency and reliability.
Such as, a simple meshed network topology diagram in the embodiment of the present invention as shown in Figure 2, figure
In, C represents any one node in topological diagram, and P represents any predecessor node of C nodes, and N represents C
Any descendant node of node, La represents the number of times that activation task lock is applied, and Ld represents that downloading task is locked
The number of times being applied.The number of times initial value that is applied of the task lock of all nodes is 0 in topological diagram.Scheduling is worked as
The condition of the downloading task on front nodal point C is that the Ld of C nodes is 0.When downloading task is dispatched, work as prosthomere
The Ld and La of point add 1, and the La of all predecessor nodes adds 1.
Situation two：
When version task is the activation task for transferring present node, the activation task of present node is judged first
Whether the request times of lock are 0, if not 0, then refuse the scheduling of activation task；
If the activation task lock of present node is 0, activation task scheduling is performed, now system will apply
The downloading task lock request times of present node add 1, the request times of activation task lock also add 1, and currently
All predecessor nodes of node activation task lock request times add 1, and all descendant nodes download
Task is locked and the request times of activation task lock all add 1, so ensures the version downloading task of present node
Will not be influenceed by the version task of predecessor node, so as to improve efficiency and reliability that version appoints scheduling
Property.
Such as, a simple meshed network topology diagram in the embodiment of the present invention as shown in Figure 2, figure
In, C represents any one node in topological diagram, and P represents any predecessor node of C nodes, and N represents C
Any descendant node of node, La represents the number of times that activation task lock is applied, and Ld represents that downloading task is locked
The number of times being applied.The number of times initial value that is applied of the task lock of all nodes is 0 in topological diagram.Scheduling is worked as
The condition of the activation task on front nodal point C is that the La of C nodes is 0.During activation task scheduling, work as prosthomere
The Ld and La of point add 1, and the La of all predecessor nodes adds 1, and the Ld and La of all descendant nodes add 1.
Further, in node topology structure as shown in Figure 3, during the activation tasks carrying of present node E,
The downloading task of node A, B, C, D can be scheduled, and the activation task of node C and D also can be same
When it is scheduled.When the activation tasks carrying of node E is finished, node A, B, C, F are discharged immediately, G's
Activation task is locked, and the downloading task of node E, F, G is locked..So ensure that version task is adjusted
The reliability of degree, and version task scheduling efficiency.
Situation three：
In embodiments of the present invention, the situation of node off-line is further comprises, node occurs offline in this prior
During situation, system locks the downloading task of present node and the request times of activation task lock all add 1, and
And the request times of the downloading task lock of all subsequent nodes and activation task lock are all added 1, so ensure
The subsequent node of present node will not be influenceed by the offline of present node, it is ensured that scheduling reliability higher
Property.
Such as, a simple meshed network topology diagram in the embodiment of the present invention as shown in Figure 2, figure
In, C represents any one node in topological diagram, and P represents any predecessor node of C nodes, and N represents C
Any descendant node of node, La represents the number of times that activation task lock is applied, and Ld represents that downloading task is locked
The number of times being applied.The number of times initial value that is applied of the task lock of all nodes is 0 in topological diagram.Work as prosthomere
When point C is offline.The Ld and La of present node add 1, and the Ld and La of all descendant nodes add 1.
For further, in node topology structure as shown in Figure 3, when there is offline event in present node E,
All version tasks of node E, F and G can all perform failure, the activation task scheduling of node A and B
The version tasks carrying of node E can be caused to fail.The present invention limits above-mentioned node by task lock mechanism
Inter-related task scheduling, until node E is finished, release task lock.So ensure that version
The reliability of this task scheduling.
S103, detects whether the version task of present node dispatches completion；
S104, if version task scheduling is completed, unlocks the task lock of present node and other sections of correlation
The task lock of point.
Further, in embodiments of the present invention, after the version tasks carrying of present node is completed, system
The task lock of present node will be unlocked, and the task of the descendant node of present node is locked, and present node
Predecessor node task lock, so ensure task lock in real time refreshing, it is ensured that the accuracy of version tasks carrying,
Reliability and dispatching efficiency.
A kind of version task scheduling and managing method in the correspondence embodiment of the present invention, also provides in the embodiment of the present invention
A kind of version task scheduling management system, a kind of version task is adjusted in being illustrated in figure 4 the embodiment of the present invention
The structural representation of management system is spent, the system includes：
Determining module 401, whether the version task for determining present node is setting version task；
Scheduler module 402, described prosthomere is worked as when the version task is for setting version task, transferring
Point and the task lock to other nodes related when prosthomere, wherein, the task is locked and is appointed for locking
The corresponding version task of business lock forbids performing；
Whether detection module 403, the version task for detecting the present node dispatches completion；
Performing module 404, if being completed for the version task scheduling, unlocks appointing for the present node
The task lock of other nodes of business lock and correlation.
Further, in embodiments of the present invention, the system also includes：
Topological structure generation module, for the Link Layer Discovery Protocol LLDP messages reported according to each node,
Create the physical topological structure of node, the Spanning-Tree Protocol STP BPDUs and/or Ethernet enabled by node
Many ring protection ERPS messages, remove the loop in the physical topological structure, generate node topology structure chart,
Wherein, the physical topological structure characterizes annexation between each node.
Further, in embodiments of the present invention, the performing module 404, is additionally operable to the ready team of Detection task
Whether version task identical version task with the present node is deposited in row；If in the presence of deletion is described
The version task of present node；If not existing, detect whether that other versions that there is the present node are appointed
Business；If there are other version tasks of the present node, refuse the version task and be added to task just
Thread queue；If in the absence of other version tasks of the present node, allowing to add the version task
To in the task ready queue.
Further, in embodiments of the present invention, the scheduler module 402, specifically for judging present node
Task type corresponding task lock whether be 0；In the corresponding task lock of the task type of the present node
For 0 when, transfer the present node and locked to the task of other nodes related when prosthomere.
Further, in embodiments of the present invention, the scheduler module 402, specifically for judging present node
The request times of version task corresponding task lock whether be 0；In the task type pair of the present node
When the request times of the task lock answered are 0, the present node is transferred and to described when related its of prosthomere
The task lock of his node.
Further, in embodiments of the present invention, the scheduler module 402, specifically for appointing in the version
It is engaged in dispatch the downloading task of present node, and the request times of the downloading task lock of the present node are
When 0, the activation task lock and downloading task lock of the predecessor node of the present node are transferred, scheduling is described
The activation task lock of all predecessor nodes of present node.
Further, in embodiments of the present invention, the scheduler module 402, specifically for appointing in the version
It is engaged in dispatch the activation task of present node, and the request times of the activation task lock of the present node are
When 0, the activation task lock of the predecessor node of the present node is transferred, transfer all of the present node
Predecessor node activation task lock, transfer the present node all subsequent nodes activation task lock and
Downloading task is locked.
Although having been described for the preferred embodiment of the application, one of ordinary skilled in the art once learns
Basic creative concept, then can make other change and modification to these embodiments.So, appended power
Profit is required to be intended to be construed to include preferred embodiment and falls into having altered and changing for the application scope.
Obviously, those skilled in the art can carry out various changes and modification without deviating from this Shen to the application
Spirit and scope please.So, if the application these modification and modification belong to the application claim and
Within the scope of its equivalent technologies, then the application is also intended to comprising these changes and modification.
Claims (13)
1. a kind of version task scheduling and managing method, it is characterised in that including：
Whether the version task for determining present node is preset task, wherein, the version task is to version
The executive mode of file；
The version task be preset task when, transfer the present node and with the present node phase
The task lock of other nodes for closing, wherein, the task is locked and locks corresponding version task for locking task,
Make the task lock corresponding version task to forbid performing；
Detect whether the version task of the present node dispatches completion；
If the version task scheduling is completed, unlock the present node task lock and correlation it is described
The task lock of other nodes.
2. the method for claim 1, it is characterised in that it is determined that the version task of present node
Whether before being setting version task, methods described also includes:
According to the Link Layer Discovery Protocol LLDP messages that each node is reported, the physical topology knot of node is created
Structure, wherein, the physical topological structure characterizes annexation between each node；
The many ring protection ERPS messages of Spanning-Tree Protocol STP BPDUs and/or Ethernet enabled by node,
The loop in the physical topological structure is removed, node topology structure chart is generated.
3. the method for claim 1, it is characterised in that it is determined that the version task of present node
Whether before being setting version task, methods described also includes：
Whether version task identical version task with the present node is deposited in Detection task ready queue；
If in the presence of deleting the version task of the present node；
If not existing, other version tasks that there is the present node are detected whether；
If there are other version tasks of the present node, refuse the version task and be added to task just
Thread queue；
If in the absence of other version tasks of the present node, allowing for the version task to be added to institute
In stating task ready queue.
4. the method for claim 1, it is characterised in that in the version task be setting version
During task, transfer the present node and locked to the task of other nodes related when prosthomere, including：
Whether the request times for judging the corresponding task lock of version task of present node are 0；
When the request times of the corresponding task lock of the task type of the present node are 0, described working as is transferred
Front nodal point and the task lock to other nodes related when prosthomere.
5. method as claimed in claim 4, it is characterised in that in the task type of the present node
When the request times of corresponding task lock are 0, the present node is transferred and to described when prosthomere is related
The task lock of other nodes, specially：
Appoint in the download of the downloading task that the version task is scheduling present node, and the present node
When the request times of business lock are 0, transfer the activation task lock of the predecessor node of the present node and download
Task is locked, and dispatches the activation task lock of all predecessor nodes of the present node.
6. method as claimed in claim 4, it is characterised in that in the task type of the present node
When the request times of corresponding task lock are 0, the present node is transferred and to described when prosthomere is related
The task lock of other nodes, specially：
Appoint in the activation of the activation task that the version task is scheduling present node, and the present node
When the request times of business lock are 0, the activation task lock of the predecessor node of the present node is transferred, transfer institute
The activation task lock of all predecessor nodes of present node is stated, all subsequent nodes of the present node are transferred
Activation task lock and downloading task lock.
7. method as claimed in claim 4, it is characterised in that methods described also includes：
When the present node is offline, the activation task lock and downloading task lock of the present node are transferred,
And transfer the activation task lock and/or downloading task lock of all subsequent nodes of the present node.
8. a kind of version task scheduling management system, it is characterised in that including：
Determining module, whether the version task for determining present node is setting version task；
Scheduler module, for the version task for setting version task when, transfer the present node with
And locked to the task of other nodes related when prosthomere, wherein, the task is locked for locking task lock
Corresponding version task forbids performing；
Whether detection module, the version task for detecting the present node dispatches completion；
Performing module, if being completed for the version task scheduling, unlocks the task lock of the present node
And the task lock of other nodes of correlation.
9. system as claimed in claim 8, it is characterised in that the system also includes：
Topological structure generation module, for the Link Layer Discovery Protocol LLDP messages reported according to each node,
Create the physical topological structure of node, the Spanning-Tree Protocol STP BPDUs and/or Ethernet enabled by node
Many ring protection ERPS messages, remove the loop in the physical topological structure, generate node topology structure chart,
Wherein, the physical topological structure characterizes annexation between each node.
10. system as claimed in claim 8, it is characterised in that the performing module, is additionally operable to detection
Whether version task identical version task with the present node is deposited in task ready queue；If in the presence of,
Then delete the version task of the present node；If not existing, detect whether there is the present node
Other version tasks；If there are other version tasks of the present node, refuse the version task and add
It is added to task ready queue；If in the absence of other version tasks of the present node, allowing the version
This task is added in the task ready queue.
11. systems as claimed in claim 8, it is characterised in that the scheduler module, specifically for sentencing
Whether the request times of the corresponding task lock of version task of settled front nodal point are 0；In the present node
When the request times of task type corresponding task lock are 0, the present node and current with described is transferred
Save the task lock of other related nodes.
12. systems as claimed in claim 11, it is characterised in that the scheduler module, specifically for
Locked in the downloading task of the downloading task that the version task is scheduling present node, and the present node
Request times be 0 when, transfer the present node predecessor node activation task lock and downloading task
Lock, dispatches the activation task lock of all predecessor nodes of the present node.
13. systems as claimed in claim 11, it is characterised in that the scheduler module, specifically for
Locked in the activation task of the activation task that the version task is scheduling present node, and the present node
Request times when being 0, transfer the activation task lock of the predecessor node of the present node, transfer described working as
All predecessor nodes of front nodal point activation task lock, transfer the present node all subsequent nodes swash
Task lock living and downloading task lock.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510924620.9A CN106878039A (en) | 2015-12-14 | 2015-12-14 | A kind of version task scheduling and managing method and system |
| PCT/CN2016/094838 WO2017101468A1 (en) | 2015-12-14 | 2016-08-12 | Version task scheduling management method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510924620.9A CN106878039A (en) | 2015-12-14 | 2015-12-14 | A kind of version task scheduling and managing method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106878039A true CN106878039A (en) | 2017-06-20 |
Family
ID=59055636
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510924620.9A Pending CN106878039A (en) | 2015-12-14 | 2015-12-14 | A kind of version task scheduling and managing method and system |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN106878039A (en) |
| WO (1) | WO2017101468A1 (en) |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101290588B (en) * | 2008-03-07 | 2010-06-16 | 重庆邮电大学 | Micro-embedded real time task scheduling device and scheduling method |
| US8954986B2 (en) * | 2010-12-17 | 2015-02-10 | Intel Corporation | Systems and methods for data-parallel processing |
| CN102185761B (en) * | 2011-04-13 | 2013-08-07 | 中国人民解放军国防科学技术大学 | Two-layer dynamic scheduling method facing to ensemble prediction applications |
| CN104536811B (en) * | 2014-12-26 | 2018-10-16 | 广州华多网络科技有限公司 | Method for scheduling task based on HIVE tasks and device |
-
2015
- 2015-12-14 CN CN201510924620.9A patent/CN106878039A/en active Pending
-
2016
- 2016-08-12 WO PCT/CN2016/094838 patent/WO2017101468A1/en active Application Filing
Also Published As
| Publication number | Publication date |
|---|---|
| WO2017101468A1 (en) | 2017-06-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yeoh et al. | BnB-ADOPT: An asynchronous branch-and-bound DCOP algorithm | |
| Yu et al. | Output synchronization of networked passive systems with event-driven communication | |
| CN110018893A (en) | A kind of method for scheduling task and relevant device based on data processing | |
| CN108255592A (en) | A kind of Quartz clusters timing task processing system and method | |
| CN105260203B (en) | A kind of Hadoop deployment and collocation method based on model | |
| CN101477386B (en) | Timer implementing method and apparatus | |
| CN102752198A (en) | Multi-core message forwarding method, multi-core processor and network equipment | |
| CN107491346A (en) | A kind of task processing method of application, apparatus and system | |
| CN104793992B (en) | The parallel task processing method that a kind of task based access control decomposes | |
| CN101771600A (en) | Method for concurrently processing join in multi-core systems | |
| CN104809551A (en) | Cross-system workflow cooperation method based on mobile agent client side | |
| CN101150431B (en) | A method for alarm processing streamline and alarm processing | |
| CN116991949B (en) | Data synchronization method, device, equipment, server and readable storage medium | |
| Di Luna et al. | Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks | |
| CN106878039A (en) | A kind of version task scheduling and managing method and system | |
| CN106775984A (en) | A kind of method and apparatus for managing thread pool | |
| CN108733477A (en) | The method, apparatus and equipment of data clusterization processing | |
| CN113992509B (en) | SDN network service configuration issuing method, device and storage medium | |
| EP3043521B1 (en) | Method and device for sending crossover command | |
| CN109756354B (en) | Ring network management method, network management equipment and computer readable storage medium | |
| Balhara et al. | Leader election algorithms in distributed systems | |
| CN107682362B (en) | Information flow control method and device | |
| CN108734398A (en) | Task flow synchronisation control means, device and storage medium and electronic equipment | |
| CN115718741A (en) | Automatic cleaning method and device for health data, electronic equipment and storage medium | |
| CN110855541B (en) | Ring splitting method and device for ring network equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20170620 |
|
| WD01 | Invention patent application deemed withdrawn after publication |