CN106201715A - A kind of method for scheduling task and device - Google Patents
A kind of method for scheduling task and device Download PDFInfo
- Publication number
- CN106201715A CN106201715A CN201610513749.5A CN201610513749A CN106201715A CN 106201715 A CN106201715 A CN 106201715A CN 201610513749 A CN201610513749 A CN 201610513749A CN 106201715 A CN106201715 A CN 106201715A
- Authority
- CN
- China
- Prior art keywords
- acquisition tasks
- priority
- current time
- information
- information node
- 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 OR CALCULATING; 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
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
This application provides a kind of method for scheduling task and device, the method includes: the task of receiving tasks carrying node obtains request, and this task obtains request and is used for asking acquisition tasks, and this acquisition tasks is for gathering the status change data of information node in network；Determine the priority orders of current time multiple acquisition tasks to be scheduled；According to priority orders, from the plurality of acquisition tasks, determine at least one target acquisition tasks the most to be allocated；This at least one target acquisition tasks is distributed to this tasks carrying node.The method and device can improve the effectiveness of data acquisition.
Description
Technical field
The application relates to data acquisition technology field, a kind of method for scheduling task and device.
Background technology
Along with the development of network technology, user can deliver letter with the form using microblogging or network to post on network
Breath.After user delivers information, this message can also be forwarded by this user or other users, comment etc. operates, and makes
The network state of the information of obtaining is constantly in lasting change.
At big data age, need to monitor the state change of these information, change and produced gathering the state of these information
Raw data.But hardware and Internet resources limited on the premise of, the state of some information possibly cannot be gathered in time, this
Sample is it is possible to make the state of some valuable information to be gathered in time, thus causes the effectiveness of data acquisition poor,
And then big data analysis may be had influence on.
Summary of the invention
In view of this, this application provides a kind of method for scheduling task and device, to improve the effectiveness of data acquisition.
For achieving the above object, the application provides following technical scheme:
A kind of method for scheduling task, including:
The task of receiving tasks carrying node obtains request, and described task obtains request and is used for asking acquisition tasks, described
Acquisition tasks is for gathering the status change data of information node in network；
Determine the priority orders of current multiple acquisition tasks to be scheduled；
According to described priority orders, from the plurality of acquisition tasks, determine that at least one target the most to be allocated is adopted
Set task；
At least one target acquisition tasks described is distributed to described tasks carrying node.
Preferably, before the described priority orders determining current time multiple acquisition tasks to be scheduled, also include:
Obtaining the characteristic information of information node corresponding to the plurality of acquisition tasks, described characteristic information includes described letter
The generation time of breath node；
For each described acquisition tasks, generation moment distance based on information node corresponding to described acquisition tasks is current
The duration in moment, determines the priority of described acquisition tasks, obtains the priority orders of the plurality of acquisition tasks.
Preferably, the described information node corresponding based on described acquisition tasks generate the moment distance current time time
Long, determine the priority of described acquisition tasks, including:
According to equation below, determine priority u of described acquisition tasks:
U=-u0/m* (t-t0-m) (t0 < t < t0+m)；
Wherein, t0 is the generation moment of information node corresponding to described acquisition tasks；U0 is that first pre-set initiates
Preferred value；T is current time；M is the maximum monitor duration of information node set in advance.
Preferably, before the described priority orders determining current time multiple acquisition tasks to be scheduled, also include:
Obtaining the characteristic information of information node corresponding to the plurality of acquisition tasks, described characteristic information includes that information saves
Topic type belonging to Dian；
According to the topic type belonging to described information node, determine the priority rule change of described topic type；
Based on current time and described priority rule change, determine the priority of acquisition tasks described in current time,
Obtain the priority orders of the plurality of acquisition tasks.
Preferably, described based on current time and described priority rule change, determine to gather described in current time and appoint
The priority of business, including:
According to equation below, determine priority s of described acquisition tasks:
S=s0/m1* (t+m1-t1), t1-m1 < t < t1；
Or, s=-s0/m2* (t-t1-m2), t1 < t < t1+m2；
Wherein, s0 is that second pre-set initiates preferred value；T is current time；T1 is included in information node
The generation moment of critical events；M1 and m0 is respectively first setting duration and the institute occurred before the moment of described critical events
State the second setting duration occurred after the moment.
Preferably, before the described priority orders determining current time multiple acquisition tasks to be scheduled, also include:
Obtaining the characteristic information of information node corresponding to the plurality of acquisition tasks, described characteristic information includes described letter
Topic type belonging to the generation time of breath node and information node；
According to the topic type belonging to described information node, determine the priority rule change of described topic type；
Based on the generation moment of information, current time and described priority rule change that described acquisition tasks is corresponding,
Determine the priority of acquisition tasks described in current time, obtain the priority orders of the plurality of acquisition tasks.
Preferably, the generation moment of the described information corresponding based on described acquisition tasks, current time and described preferentially
Level rule change, determines the priority that described acquisition tasks is current, including:
According to equation below, determine priority y of described acquisition tasks:
Y=u*s
Wherein, u=-u0/m0* (t-t0-m), t0 < t < t0+m；
S=s0/m1* (t+m1-t1), t1-m1 < t < t1；
Or, s=-s0/m2* (t-t1-m2), t1 < t < t1+m2；
Wherein, t0 is the generation moment of information node corresponding to described acquisition tasks；U0 is that first pre-set initiates
Preferred value；S0 is that second pre-set initiates preferred value；T is current time；T1 is the crucial thing included in information node
The generation moment of part；M is the maximum monitor duration of information node set in advance, m1 and m0 is respectively sending out of described critical events
The first setting duration before the raw moment and the second setting duration after the described generation moment.
Preferably, after the described priority orders obtaining the plurality of acquisition tasks, also include:
Store the priority orders of the plurality of acquisition tasks.
Preferably, after the priority orders of the plurality of acquisition tasks of described storage, also include:
When, after the priority update described acquisition tasks being detected, utilizing the priority of the described acquisition tasks after updating to replace
The priority of the described acquisition tasks of storage before changing current time.
On the other hand, present invention also provides a kind of task scheduling apparatus, including:
Request reception unit, obtains request for receiving the task of tasks carrying node, and described task obtains request and is used for
Request acquisition tasks, described acquisition tasks is for gathering the status change data of information node in network；
Priority determining unit, for determining the priority orders of current multiple acquisition tasks to be scheduled；
Task determines unit, for according to described priority orders, determines and currently treat point from the plurality of acquisition tasks
At least one the target acquisition tasks joined；
Task allocation unit, for distributing to described tasks carrying node by least one target acquisition tasks described.
Preferably, also include:
Feature acquiring unit, for determining current time multiple acquisition tasks to be scheduled in described priority determining unit
Priority orders before, obtain the characteristic information of information node corresponding to the plurality of acquisition tasks, described characteristic information
The generation time including described information node；
Priority calculation unit, for for each described acquisition tasks, based on the information joint that described acquisition tasks is corresponding
The duration generating moment distance current time of point, determines the priority of described acquisition tasks, obtains the plurality of acquisition tasks
Priority orders.
Preferably, also include:
Feature acquiring unit, for determining current time multiple acquisition tasks to be scheduled in described priority determining unit
Priority orders before, obtain the characteristic information of information node corresponding to the plurality of acquisition tasks, described characteristic information
Including the topic type belonging to information node；
Rule determination unit, for according to the topic type belonging to described information node, determines the excellent of described topic type
First level rule change；
Priority calculation unit, for based on current time and described priority rule change, determines current time institute
State the priority of acquisition tasks, obtain the priority orders of the plurality of acquisition tasks.
Preferably, also include:
Feature acquiring unit, for determining current time multiple acquisition tasks to be scheduled in described priority determining unit
Priority orders before, obtain the characteristic information of information node corresponding to the plurality of acquisition tasks, described characteristic information
Including the topic type belonging to generation time of described information node and information node；
Rule determination unit, for according to the topic type belonging to described information node, determines the excellent of described topic type
First level rule change；
Priority calculation unit, for based on the generation moment of information corresponding to described acquisition tasks, current time and
Described priority rule change, determines the priority of acquisition tasks described in current time, obtains the excellent of the plurality of acquisition tasks
First level order.
Understanding via above-mentioned technical scheme, in the embodiment of the present application, scheduling node receives tasks carrying node
After task scheduling request, can determine whether the priority orders of multiple acquisition tasks to be transferred, so, important information node
The acquisition tasks that status change data is corresponding could be arranged to the acquisition tasks that priority orders is forward, so, according to preferentially
Level order, distributes at least one target acquisition tasks for tasks carrying node, so that corresponding the adopting of important information node
Set task is preferentially distributed, and then can be conducive to improving collection with the status change data of the important information node of preferential collection
The effectiveness of the data arrived.
Accompanying drawing explanation
In order to be illustrated more clearly that the technical scheme of the embodiment of the present application, required use in embodiment being described below
Accompanying drawing be briefly described, it should be apparent that, below describe in accompanying drawing be only embodiments herein, for this area
From the point of view of those of ordinary skill, on the premise of not paying creative work, it is also possible to the accompanying drawing according to providing obtains the attached of other
Figure.
Fig. 1 shows the schematic diagram of a kind of possible application scenarios of the application；
Fig. 2 shows the schematic flow sheet of the application one embodiment of a kind of method for scheduling task；
Fig. 3 shows the structural representation of the application one embodiment of a kind of task scheduling apparatus.
Detailed description of the invention
The network architecture and business scenario that the embodiment of the present invention describes are in order to more clearly the explanation present invention implements
The technical scheme of example, is not intended that the restriction of the technical scheme provided for the embodiment of the present invention, those of ordinary skill in the art
Understanding, along with differentiation and the appearance of new business scene of the network architecture, the technical scheme that the embodiment of the present invention provides is for similar
Technical problem, equally applicable.
In order to make it easy to understand, possible application scenarios a kind of to the embodiment of the present application is introduced.See Fig. 1, at this kind
In application scenarios, task scheduling system may include that scheduling node 101 and multiple tasks carrying node 102.
Wherein, this tasks carrying node 102 is connected by network with this scheduling node 101, as by wired or wireless
Network is connected.
Tasks carrying node 102 can send task scheduling request to scheduling node 101, to ask scheduling node 101 to be
This tasks carrying node distribution task.
In the embodiment of the present application, scheduling node may be used for distributing acquisition tasks, and this acquisition tasks is used for gathering network
The status change data of middle information node, scheduling node is after tasks carrying node is assigned with acquisition tasks, this tasks carrying
The status change data of the information node generated in network can be acquired by node, e.g., obtains information node and is commented on, forwards
Deng status change data.
In order to gather the status change data of information node timely and effectively, scheduling node meeting in the embodiment of the present application
The priority different to different information node distribution, so, important information node can arrange higher priority, thus
The acquisition tasks to important information node is made preferentially to be distributed to tasks carrying node so that tasks carrying node can be adopted
Collection is to even more important and effective status change data.
Below in conjunction with the accompanying drawing in the embodiment of the present application, the technical scheme in the embodiment of the present application is carried out clear, complete
Describe wholely.
See Fig. 2, it illustrates the schematic flow sheet of the application one embodiment of a kind of method for scheduling task, this enforcement
Method is applied to scheduling node.
The method of the present embodiment may include that
201, the task of receiving tasks carrying node obtains request.
Wherein, this task acquisition request is used for asking acquisition tasks.This acquisition tasks is used for gathering information node in network
Status change data.
Wherein, when user delivers a piece of news in a network, server is that this message generates an information node, this letter
Breath node can store the relevant information of this message.As, user delivers in microblogging or forwards a piece of news, will generate one
Individual information node.
It is understood that scheduling node can receive what one or more tasks carrying node sent at synchronization
Task obtains request, but the processing procedure for the task acquisition request of each tasks carrying node is the most identical.
202, determine the priority orders of current time multiple acquisition tasks to be scheduled.
Storing multiple acquisition tasks in scheduling node, the information node of the required monitoring of different acquisition tasks is different.
Unlike existing, transfer before node is tasks carrying node allocation schedule task in this application, permissible
Determine the priority orders of the plurality of acquisition tasks of current time.
Wherein, this priority orders can be determined in real time, it is also possible to is before receiving task scheduling request
Determine.
203, according to this priority orders, from the plurality of acquisition tasks, determine that at least one target the most to be allocated is adopted
Set task.
According to priority orders, can first using at least one forward for prioritization acquisition tasks as mesh to be allocated
Mark acquisition tasks is allocated, and prioritization can be distributed rearward later.Wherein, the collection that wherein prioritization is forward is appointed
Business may be considered the acquisition tasks that priority is higher.
204, this at least one target acquisition tasks is distributed to this tasks carrying node.
The target acquisition tasks determined is distributed to tasks carrying node, and tasks carrying node performs acquisition tasks
Process can be identical with existing mode.
As known from the above, in the embodiment of the present application, scheduling node receives the task scheduling request of tasks carrying node
Afterwards, can determine whether the priority orders of multiple acquisition tasks to be transferred, so, the status change data of important information node
Corresponding acquisition tasks could be arranged to the acquisition tasks that priority orders is forward, so, according to priority orders, for task
Perform node and distribute at least one target acquisition tasks, so that acquisition tasks corresponding to important information node is preferentially divided
Join, and then can beneficially improve the effective of the data that collect with the status change data of the important information node of preferential collection
Property.
It is understood that the determination mode of the priority orders of acquisition tasks can have many in the embodiment of the present application
Kind.
In a kind of possible implementation, the priority orders of acquisition tasks determines that process can be such that
The characteristic information of acquisition information node corresponding to acquisition tasks, this feature information at least includes this information node
The generation time；
For each acquisition tasks, the moment distance current time that generates based on information node corresponding to this acquisition tasks
Duration, determines the priority of this acquisition tasks, obtains the priority orders of multiple acquisition tasks.
In this kind of possible implementation, the duration generating moment distance current time according to information node determines information
The priority of node.It is understood that the state change of information node includes being forwarded, commenting on and put status datas such as praising
Change, and the change of the state of information node has certain rule in time, general information is distributed, and (i.e. information node is raw
Become) time, this information can obtain substantial amounts of concern in the short time, to the number of times of the operations such as the forwarding of this information, comment the most relatively
Many, so, the state change of this information is more frequent, and the status data of generation is the most more；And As time goes on, this
The focus of information can decline, and the change of the state of this information also gradually decreases, the shape of the information node that this information is corresponding
The data volume of state data also tails off, it is seen then that the duration that information node generates can reflect the status data that information node produces
Data volume how many, namely obtain the significance level of this information node, therefore, it can the time of the generation according to information node
Length, determines the priority that this information node is corresponding.
Wherein, according to the duration generating moment and current time of information node, determine that the collection that information node is corresponding is appointed
The priority of business, can be the duration generating moment and current time according to information node, by collection corresponding for information node
Task is ranked up so that the sequence of the priority of the acquisition tasks that the longer information node of the duration of generation is corresponding rearward, and
The sequence of the priority of the acquisition tasks that the shorter information node of duration that generates is corresponding is forward.
Optionally, for the duration generating moment and current time according to information node, determine that information node is corresponding
The priority of acquisition tasks, it is also possible to be that to preset a monitor duration, such as monitor duration can be 100 hours, if
The duration that information node generates exceedes this monitor duration, and just can not generate the acquisition tasks that this information node is corresponding, or
The priority of acquisition tasks corresponding for this information node is set to minimum.In this monitor duration, can be according to default calculating
Formula calculates the priority of each acquisition tasks.As, the computing formula of the priority calculating acquisition tasks can be such that
U=-u0/m* (t-t0-m) (t0 < t < t0+m) (formula one)；
Wherein, t0 is the generation moment of information node corresponding to acquisition tasks；U0 is that first pre-set is initial preferential
Value of series；T is current time；M is the maximum monitor duration of information node set in advance.
In alternatively possible implementation, the priority of the acquisition tasks that information node is corresponding and this information node institute
The topic type discussed is relevant, the class belonging to critical events that wherein topic type comprises in can be understood as this information node
Not, if information node discussion is into being the multiple topic of film, match, special duty, place, commemoration day and current events etc.
Type.
It is understood that the critical events of different topic types has different discussion temperature distribution characteristicss, e.g., current events
This class topic typically can occur, by regular discussion, therefore comprising such current events within the short time after current events occur
It may happen that substantial amounts of status change data in the information node short time after these current events occur.And for example, film and
Compete this topic type belonging to class critical events, typically movie show or match beginning for the previous period in and electric
Shadow show or compete start after temperature in a period of time higher, if information node comprises the crucial thing belonging to such topic
Part, then the status change data of information node occurs that large change can be with the generation moment of this information node and this key thing
Part occurs the appointment time period in moment to have relation, accordingly, and the value trend that information node is monitored and this information node state
The trend of change is identical.
As known from the above, the priority of the acquisition tasks that information node is corresponding and the topic type belonging to this information node
Temperature variation tendency is relevant, and therefore, the priority of the acquisition tasks that this information node is corresponding can be determined as follows:
First, the characteristic information of acquisition information node corresponding to acquisition tasks, this feature information includes this information node
The topic type belonged to, wherein, the topic type belonging to the critical events that information node includes.
Then, according to the topic type belonging to this information, determine the priority rule change of this topic type,
Finally, based on current time and this priority rule change, the priority that this acquisition tasks is current is determined.
Wherein, after the current priority of each acquisition tasks determines, priority based on each acquisition tasks, can obtain
Priority orders to acquisition tasks.
It is understood that when topic type difference, priority rule change can be different, specifically can be according to need
Set.
In order to make it easy to understand, be introduced as a example by a kind of common topic type.As, with film, compete, the commemoration day,
As a example by the critical eventss such as satellite launch, when information node comprises this kind of critical events, the acquisition tasks that information node is corresponding
Priority and the relation between the moment that occurs that moment and current time and this critical events occur of critical events have
Close.
Wherein, in specifying the time period before and after the generation moment of this critical events, temperature is the highest.Concrete, Ke Yishe
Determine to need before critical events occurs the moment the first setting duration of monitoring, and need prison after this critical events generation moment
Second setting duration of control.Then by under the influence of this critical events, priority s of the acquisition tasks that information node is corresponding is permissible
It is calculated by equation below:
S=s0/m1* (t+m1-t1), t1-m1 < t < t1；(formula two)
Or, s=-s0/m2* (t-t1-m2), t1 < t < t1+m2；(formula three)
Wherein, t is current time；
S0 is that second pre-set initiates preferred value, wherein, second initiate preferred value be in order to the first above
Beginning priority makes a distinction, but it is understood that, this first initiate preferred value and second initiate the concrete numerical value of preferred value can
With identical, it is also possible to different, specifically can set as required.
T1 is the generation moment of the critical events included in information node, and this generation moment can be beforehand through network number
Determine according to analysis.
This m0 is the first setting duration occurred before the moment of critical events, after the generation moment of this critical events of m1
Second setting duration.
When calculating priority s of acquisition tasks, if the generation moment of this information node is in this first setting duration
In, then use formula two to calculate this priority s；If the generation moment of this information node is in this second setting duration, then
Formula two is used to calculate this priority s.
The priority more than calculating acquisition tasks is to consider generation moment and the current time etc. of critical events
Factor so that the sequence of the priority of acquisition tasks meets the crucial thing included in the information node that acquisition tasks is corresponding
The temperature regularity of distribution of part.
In alternatively possible implementation, the priority of the acquisition tasks that information node is corresponding can comprehensively above two
Kind of possible implementation determines, i.e. the current priority of acquisition tasks that information node is corresponding is except the generation with this information
Outside the Pass the duration of moment distance current time has, also relevant with the topic type that this information node is discussed.
Accordingly, determine that the process of the priority of this acquisition tasks may include that
First, the characteristic information of information node corresponding to acquisition tasks is obtained, except including that information saves in this feature information
Outside the generation moment of point, also include the topic type belonging to this information node.
Then, according to the topic type belonging to this information, determine the priority rule change of this topic type,
Finally, generation moment based on information node, current time and this priority rule change, determine that this collection is appointed
It is engaged in current priority.
Wherein, after the current priority of each acquisition tasks determines, priority based on each acquisition tasks, can obtain
Priority orders to acquisition tasks.
In the mode of the priority of this kind of calculating acquisition tasks, it is contemplated that the temperature of information node is raw along with information node
The one-tenth time elongated and the most thin out, meanwhile, combine the critical events comprised in information node temperature change.
Still by information node corresponding to acquisition tasks for being introduced as a example by a kind of common topic type.As, with film,
Match, the commemoration day, as a example by the critical events such as satellite launch.Then the computing formula of priority y of this acquisition tasks can be:
Y=u*s；(formula four)
Wherein, y is combine after above priority s of acquisition tasks and priority s of acquisition tasks comprehensive preferential
Level.Wherein, the computing formula of u may refer to formula one, and the computing formula of s may refer to formula two or formula three.
In actual applications, it is also possible to preset the priority of acquisition tasks corresponding to some information node, such as, interior
Hold and relate to the priority of acquisition tasks corresponding to the information node of national affairs can to arrange comparison high, and relate to other importances
It is on the low side that the priority of the relatively low acquisition tasks corresponding to information node can be arranged.If the priority of acquisition tasks is in advance
Set, the follow-up priority without calculating this acquisition tasks again.Of course, it is possible to the priority setting this acquisition tasks maintains
Duration, when exceeding this duration, then can calculate the priority of this acquisition tasks according to any one above mode.
It is, of course, also possible to other determine the mode of acquisition tasks priority, which kind of mode no matter is used to determine acquisition tasks
Priority be all applicable to the application.
It should be noted that in the embodiment of the present application, the priority calculating acquisition tasks can be to receive task
After obtaining request, calculate in real time, accordingly, the step 102 in above example determines the excellent of multiple acquisition tasks
The priority of each acquisition tasks that first level order can be based on currently calculating determines the preferential of the plurality of acquisition tasks
Level order.
Optionally, in order to improve the efficiency of task distribution, request can be obtained in the task of receiving tasks carrying node
Afterwards, priority and the priority orders of each acquisition tasks to be allocated are calculated.It needs to be determined that during priority orders,
Can directly obtain the priority orders of each current acquisition tasks.
It is understood that after calculating the priority orders of each acquisition tasks to be allocated, it is also possible to: storage
The priority orders of the plurality of acquisition tasks, in order to follow-up direct acquisition priority orders.
Further, the priority orders of an acquisition tasks can be redefined every preset duration, adopt when detecting
After the priority update of set task, before utilizing the priority of the acquisition tasks after updating to replace current time, the collection of storage is appointed
The priority of business.
A kind of task scheduling apparatus of corresponding the application, the embodiment of the present application additionally provides a kind of task scheduling apparatus.
See Fig. 3, it illustrates the structural representation of the application one embodiment of a kind of task scheduling apparatus, the present embodiment
Device can apply to scheduling node, the device of the present embodiment may include that
Request reception unit 301, obtains request for receiving the task of tasks carrying node, and described task obtains request and uses
In request acquisition tasks, described acquisition tasks is for gathering the status change data of information node in network；
Priority determining unit 302, for determining the priority orders of current multiple acquisition tasks to be scheduled；
Task determines unit 303, for according to described priority orders, determines and currently treat from the plurality of acquisition tasks
At least one target acquisition tasks of distribution；
Task allocation unit 304, for distributing to described tasks carrying node by least one target acquisition tasks described.
Optionally, in a kind of possible implementation, this task scheduling apparatus can also include:
Feature acquiring unit, for determining current time multiple acquisition tasks to be scheduled in described priority determining unit
Priority orders before, obtain the characteristic information of information node corresponding to the plurality of acquisition tasks, described characteristic information
The generation time including described information node；
Priority calculation unit, for for each described acquisition tasks, based on the information joint that described acquisition tasks is corresponding
The duration generating moment distance current time of point, determines the priority of described acquisition tasks, obtains the plurality of acquisition tasks
Priority orders.
Optionally, in alternatively possible implementation, this device can also include:
Feature acquiring unit, for determining current time multiple acquisition tasks to be scheduled in described priority determining unit
Priority orders before, obtain the characteristic information of information node corresponding to the plurality of acquisition tasks, described characteristic information
Including the topic type belonging to information node；
Rule determination unit, for according to the topic type belonging to described information node, determines the excellent of described topic type
First level rule change；
Priority calculation unit, for based on current time and described priority rule change, determines current time institute
State the priority of acquisition tasks, obtain the priority orders of the plurality of acquisition tasks.
Optionally, in alternatively possible implementation, this device can also include:
Feature acquiring unit, for determining current time multiple acquisition tasks to be scheduled in described priority determining unit
Priority orders before, obtain the characteristic information of information node corresponding to the plurality of acquisition tasks, described characteristic information
Including the topic type belonging to generation time of described information node and information node；
Rule determination unit, for according to the topic type belonging to described information node, determines the excellent of described topic type
First level rule change；
Priority calculation unit, for based on the generation moment of information corresponding to described acquisition tasks, current time and
Described priority rule change, determines the priority of acquisition tasks described in current time, obtains the excellent of the plurality of acquisition tasks
First level order.
Optionally, in above several possible embodiments, this device can also include:
Memory element, for the priority orders of the plurality of acquisition tasks that storage is determined.
Further, described device can also include: updating block, for when the priority described acquisition tasks being detected
After renewal, before utilizing the priority of the described acquisition tasks after updating to replace described memory element current time, storage is described
The priority of acquisition tasks.
For device embodiment, owing to it essentially corresponds to embodiment of the method, so relevant part sees method in fact
The part executing example illustrates.Device embodiment described above is only schematically, wherein said as separating component
The unit illustrated can be or may not be physically separate, and the parts shown as unit can be or can also
It not physical location, i.e. may be located at a place, or can also be distributed on multiple NE.Can be according to reality
Need to select some or all of module therein to realize the purpose of the present embodiment scheme.Those of ordinary skill in the art are not
In the case of paying creative work, i.e. it is appreciated that and implements.
In several embodiments provided by the present invention, it should be understood that disclosed apparatus and method, it is being not above
In spirit and scope, can realize in other way.Current embodiment is a kind of exemplary example,
Should not be taken as limiting, given particular content should in no way limit the purpose of the application.Such as, described unit or subelement
Dividing, be only a kind of logic function and divide, actual can have other dividing mode, the most multiple unit or multiple when realizing
Subelement combines.It addition, multiple unit can or assembly can in conjunction with or be desirably integrated into another system, or some
Feature can be ignored, or does not performs.
It addition, described system and method and the schematic diagram of different embodiment, without departing from scope of the present application, can
With with other system, module, techniques or methods combine or integrated.Another point, shown or discussed coupling each other or
Direct-coupling or communication connection can be the INDIRECT COUPLING by some interfaces, device or unit or communication connection, can be electricity
Property, machinery or other form.
The above is only the detailed description of the invention of the present invention, it is noted that for the ordinary skill people of the art
For Yuan, under the premise without departing from the principles of the invention, it is also possible to make some improvements and modifications, these improvements and modifications also should
It is considered as protection scope of the present invention.
Claims (13)
1. a method for scheduling task, it is characterised in that including:
The task of receiving tasks carrying node obtains request, and described task obtains request and is used for asking acquisition tasks, described collection
Task is for gathering the status change data of information node in network；
Determine the priority orders of current multiple acquisition tasks to be scheduled；
According to described priority orders, from the plurality of acquisition tasks, determine that at least one target collection the most to be allocated is appointed
Business；
At least one target acquisition tasks described is distributed to described tasks carrying node.
Method the most according to claim 1, it is characterised in that determine that current time multiple collections to be scheduled are appointed described
Before the priority orders of business, also include:
Obtaining the characteristic information of information node corresponding to the plurality of acquisition tasks, described characteristic information includes that described information saves
The generation time of point；
For each described acquisition tasks, generation moment distance current time based on information node corresponding to described acquisition tasks
Duration, determine the priority of described acquisition tasks, obtain the priority orders of the plurality of acquisition tasks.
Method the most according to claim 2, it is characterised in that the described information node corresponding based on described acquisition tasks
Generate the duration of moment distance current time, determine the priority of described acquisition tasks, including:
According to equation below, determine priority u of described acquisition tasks:
U=-u0/m* (t-t0-m) (t0 < t < t0+m)；
Wherein, t0 is the generation moment of information node corresponding to described acquisition tasks；U0 is that first pre-set is initial preferential
Value；T is current time；M is the maximum monitor duration of information node set in advance.
Method the most according to claim 1, it is characterised in that determine that current time multiple collections to be scheduled are appointed described
Before the priority orders of business, also include:
Obtaining the characteristic information of information node corresponding to the plurality of acquisition tasks, described characteristic information includes information node institute
The topic type belonged to；
According to the topic type belonging to described information node, determine the priority rule change of described topic type；
Based on current time and described priority rule change, determine the priority of acquisition tasks described in current time, obtain
The priority orders of the plurality of acquisition tasks.
Method the most according to claim 4, it is characterised in that described change based on current time and described priority is advised
Then, determine the priority of acquisition tasks described in current time, including:
According to equation below, determine priority s of described acquisition tasks:
S=s0/m1* (t+m1-t1), t1-m1 < t < t1；
Or, s=-s0/m2* (t-t1-m2), t1 < t < t1+m2；
Wherein, s0 is that second pre-set initiates preferred value；T is current time；T1 is the key included in information node
The generation moment of event；There is the first setting duration before the moment and described in what m1 and m0 was respectively described critical events
The second setting duration after the raw moment.
Method the most according to claim 1, it is characterised in that determine that current time multiple collections to be scheduled are appointed described
Before the priority orders of business, also include:
Obtaining the characteristic information of information node corresponding to the plurality of acquisition tasks, described characteristic information includes that described information saves
Topic type belonging to the generation time of point and information node；
According to the topic type belonging to described information node, determine the priority rule change of described topic type；
Based on the generation moment of information, current time and described priority rule change that described acquisition tasks is corresponding, determine
The priority of acquisition tasks described in current time, obtains the priority orders of the plurality of acquisition tasks.
Method the most according to claim 6, it is characterised in that the generation of the described information corresponding based on described acquisition tasks
Moment, current time and described priority rule change, determine the priority that described acquisition tasks is current, including:
According to equation below, determine priority y of described acquisition tasks:
Y=u*s
Wherein, u=-u0/m0* (t-t0-m), t0 < t < t0+m；
S=s0/m1* (t+m1-t1), t1-m1 < t < t1；
Or, s=-s0/m2* (t-t1-m2), t1 < t < t1+m2；
Wherein, t0 is the generation moment of information node corresponding to described acquisition tasks；U0 is that first pre-set is initial preferential
Value；S0 is that second pre-set initiates preferred value；T is current time；T1 is the critical events included in information node
There is the moment；M is the maximum monitor duration of information node set in advance, when m1 and m0 is respectively the generation of described critical events
The first setting duration before quarter and the second setting duration after the described generation moment.
8. according to the method described in any one of claim 2 to 7, it is characterised in that obtain the plurality of acquisition tasks described
Priority orders after, also include:
Store the priority orders of the plurality of acquisition tasks.
Method the most according to claim 8, it is characterised in that in the priority orders of the plurality of acquisition tasks of described storage
Afterwards, also include:
When, after the priority update described acquisition tasks being detected, utilizing the priority of the described acquisition tasks after updating to replace and work as
The priority of the described acquisition tasks of storage before the front moment.
10. a task scheduling apparatus, it is characterised in that including:
Request reception unit, obtains request for receiving the task of tasks carrying node, and described task obtains request and is used for asking
Acquisition tasks, described acquisition tasks is for gathering the status change data of information node in network；
Priority determining unit, for determining the priority orders of current multiple acquisition tasks to be scheduled；
Task determines unit, for according to described priority orders, determines the most to be allocated from the plurality of acquisition tasks
At least one target acquisition tasks；
Task allocation unit, for distributing to described tasks carrying node by least one target acquisition tasks described.
11. devices according to claim 10, it is characterised in that also include:
Feature acquiring unit, for determining the excellent of current time multiple acquisition tasks to be scheduled in described priority determining unit
Before first level order, obtaining the characteristic information of information node corresponding to the plurality of acquisition tasks, described characteristic information includes
The generation time of described information node；
Priority calculation unit, for for each described acquisition tasks, based on information node corresponding to described acquisition tasks
Generate the duration of moment distance current time, determine the priority of described acquisition tasks, obtain the excellent of the plurality of acquisition tasks
First level order.
12. devices according to claim 10, it is characterised in that also include:
Feature acquiring unit, for determining the excellent of current time multiple acquisition tasks to be scheduled in described priority determining unit
Before first level order, obtaining the characteristic information of information node corresponding to the plurality of acquisition tasks, described characteristic information includes
Topic type belonging to information node；
Rule determination unit, for according to the topic type belonging to described information node, determines the priority of described topic type
Rule change；
Priority calculation unit, for based on current time and described priority rule change, determines and adopts described in current time
The priority of set task, obtains the priority orders of the plurality of acquisition tasks.
13. devices according to claim 10, it is characterised in that also include:
Feature acquiring unit, for determining the excellent of current time multiple acquisition tasks to be scheduled in described priority determining unit
Before first level order, obtaining the characteristic information of information node corresponding to the plurality of acquisition tasks, described characteristic information includes
Topic type belonging to the generation time of described information node and information node；
Rule determination unit, for according to the topic type belonging to described information node, determines the priority of described topic type
Rule change；
Priority calculation unit, for based on the generation moment of information corresponding to described acquisition tasks, current time and described
Priority rule change, determines the priority of acquisition tasks described in current time, obtains the priority of the plurality of acquisition tasks
Sequentially.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610513749.5A CN106201715A (en) | 2016-06-30 | 2016-06-30 | A kind of method for scheduling task and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610513749.5A CN106201715A (en) | 2016-06-30 | 2016-06-30 | A kind of method for scheduling task and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106201715A true CN106201715A (en) | 2016-12-07 |
Family
ID=57463470
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610513749.5A Pending CN106201715A (en) | 2016-06-30 | 2016-06-30 | A kind of method for scheduling task and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106201715A (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106802582A (en) * | 2017-01-18 | 2017-06-06 | 北京光年无限科技有限公司 | A kind of sensing data call method and robot for robot |
| CN108595264A (en) * | 2018-04-10 | 2018-09-28 | 平安科技（深圳）有限公司 | Refresh tasks distribution method, electronic equipment and computer readable storage medium |
| CN111309457A (en) * | 2019-07-10 | 2020-06-19 | 浙江商安信息科技有限公司 | Method, terminal, collection node and system for collecting meal ordering shop information |
| CN111913808A (en) * | 2020-08-19 | 2020-11-10 | 百度时代网络技术（北京）有限公司 | Task allocation method, device, equipment and storage medium |
| CN112598816A (en) * | 2020-11-19 | 2021-04-02 | 广州瑞修得信息科技有限公司 | Vehicle data acquisition method and device and vehicle diagnosis system |
| CN112667901A (en) * | 2020-12-31 | 2021-04-16 | 中国电子信息产业集团有限公司第六研究所 | Social media data acquisition method and system |
| CN113242304A (en) * | 2021-05-13 | 2021-08-10 | 南方电网数字电网研究院有限公司 | Edge side multi-energy data acquisition scheduling control method, device, equipment and medium |
| CN113608852A (en) * | 2021-08-03 | 2021-11-05 | 科大讯飞股份有限公司 | Task scheduling method, scheduling module, inference node and collaborative operation system |
| CN117131117A (en) * | 2023-08-29 | 2023-11-28 | 中国工商银行股份有限公司 | Data collection and storage methods and devices |
| CN120212428A (en) * | 2025-05-22 | 2025-06-27 | 成都秦川物联网科技股份有限公司 | Pipeline network signal acquisition method and Internet of Things system for smart gas supervision |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103095492A (en) * | 2012-12-28 | 2013-05-08 | 中兴通讯股份有限公司 | Data collection method and data collection device |
| CN103577263A (en) * | 2013-11-07 | 2014-02-12 | 广东电网公司佛山供电局 | Power quality data real-time collection method and device |
| CN103631650A (en) * | 2012-08-25 | 2014-03-12 | 成都勤智数码科技股份有限公司 | Collection scheduling method used for IT operation and maintenance system |
| CN104615716A (en) * | 2015-02-05 | 2015-05-13 | 北京航空航天大学 | Distributed social network information collecting method and system based on priority sequence |
| US20150169382A1 (en) * | 2013-12-18 | 2015-06-18 | Qualcomm Incorporated | Runtime Optimization of Multi-core System Designs for Increased Operating Life and Maximized Performance |
| CN105045832A (en) * | 2015-06-30 | 2015-11-11 | 北京奇艺世纪科技有限公司 | Data acquisition method and apparatus |
-
2016
- 2016-06-30 CN CN201610513749.5A patent/CN106201715A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103631650A (en) * | 2012-08-25 | 2014-03-12 | 成都勤智数码科技股份有限公司 | Collection scheduling method used for IT operation and maintenance system |
| CN103095492A (en) * | 2012-12-28 | 2013-05-08 | 中兴通讯股份有限公司 | Data collection method and data collection device |
| CN103577263A (en) * | 2013-11-07 | 2014-02-12 | 广东电网公司佛山供电局 | Power quality data real-time collection method and device |
| US20150169382A1 (en) * | 2013-12-18 | 2015-06-18 | Qualcomm Incorporated | Runtime Optimization of Multi-core System Designs for Increased Operating Life and Maximized Performance |
| CN104615716A (en) * | 2015-02-05 | 2015-05-13 | 北京航空航天大学 | Distributed social network information collecting method and system based on priority sequence |
| CN105045832A (en) * | 2015-06-30 | 2015-11-11 | 北京奇艺世纪科技有限公司 | Data acquisition method and apparatus |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106802582A (en) * | 2017-01-18 | 2017-06-06 | 北京光年无限科技有限公司 | A kind of sensing data call method and robot for robot |
| CN108595264A (en) * | 2018-04-10 | 2018-09-28 | 平安科技（深圳）有限公司 | Refresh tasks distribution method, electronic equipment and computer readable storage medium |
| CN111309457A (en) * | 2019-07-10 | 2020-06-19 | 浙江商安信息科技有限公司 | Method, terminal, collection node and system for collecting meal ordering shop information |
| CN111913808A (en) * | 2020-08-19 | 2020-11-10 | 百度时代网络技术（北京）有限公司 | Task allocation method, device, equipment and storage medium |
| CN112598816B (en) * | 2020-11-19 | 2022-10-04 | 广州瑞修得信息科技有限公司 | Vehicle data acquisition method and device and vehicle diagnosis system |
| CN112598816A (en) * | 2020-11-19 | 2021-04-02 | 广州瑞修得信息科技有限公司 | Vehicle data acquisition method and device and vehicle diagnosis system |
| CN112667901A (en) * | 2020-12-31 | 2021-04-16 | 中国电子信息产业集团有限公司第六研究所 | Social media data acquisition method and system |
| CN112667901B (en) * | 2020-12-31 | 2024-04-26 | 中国电子信息产业集团有限公司第六研究所 | Social media data acquisition method and system |
| CN113242304A (en) * | 2021-05-13 | 2021-08-10 | 南方电网数字电网研究院有限公司 | Edge side multi-energy data acquisition scheduling control method, device, equipment and medium |
| CN113608852A (en) * | 2021-08-03 | 2021-11-05 | 科大讯飞股份有限公司 | Task scheduling method, scheduling module, inference node and collaborative operation system |
| CN117131117A (en) * | 2023-08-29 | 2023-11-28 | 中国工商银行股份有限公司 | Data collection and storage methods and devices |
| CN120212428A (en) * | 2025-05-22 | 2025-06-27 | 成都秦川物联网科技股份有限公司 | Pipeline network signal acquisition method and Internet of Things system for smart gas supervision |
| CN120212428B (en) * | 2025-05-22 | 2025-09-02 | 成都秦川物联网科技股份有限公司 | Pipeline network signal acquisition method and Internet of Things system for smart gas monitoring |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106201715A (en) | A kind of method for scheduling task and device | |
| CN104486445B (en) | Distributed extendable resource monitoring system based on cloud platform | |
| CN104065741B (en) | Data collecting system and collecting method | |
| WO2020018012A9 (en) | Open network automation platform (onap) - fifth generation core (5gc) interaction for analytics | |
| CN107209746B (en) | Model parameter fusion method and device | |
| US9104501B2 (en) | Preparing parallel tasks to use a synchronization register | |
| CN101741885A (en) | Distributed system and method for processing task flow thereof | |
| CN104580284A (en) | Service assignment device and service assignment method | |
| US11915035B1 (en) | Task state updating method and apparatus, device, and medium | |
| CN107004003B (en) | Model parameter fusion method and device | |
| CN109739690A (en) | Backup method and Related product | |
| CN103701913A (en) | Data synchronization method and device | |
| CN105491078B (en) | Data processing method and device in SOA system, SOA system | |
| CN108737570A (en) | A kind of information-pushing method, apparatus and system | |
| CN103310087A (en) | Service data statistic analysis method and device | |
| CN109062697A (en) | It is a kind of that the method and apparatus of spatial analysis service are provided | |
| CN113327028A (en) | Method, equipment and storage medium for planning satellite tasks in constellation | |
| CN112527872A (en) | Data query method and device, storage medium and electronic equipment | |
| CN111062624A (en) | Task management platform and method for automatic distribution and push | |
| CN105162869B (en) | A kind of method and apparatus for backup data management | |
| CN110347689A (en) | Date storage method, equipment and computer readable storage medium | |
| CN112686004A (en) | Block chain-based single-document multi-interface editing method | |
| CN106446289A (en) | Information inquiry method and device based on Pinpoint | |
| CN110955504A (en) | Method, server, system and storage medium for intelligently distributing rendering tasks | |
| CN208046653U (en) | A kind of electric power monitoring system network security monitoring main website plateform system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into 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: 20161207 |