CN104954381B - A kind of dynamic priority broadcast scheduling method supporting consecutive periods to inquire about - Google Patents
A kind of dynamic priority broadcast scheduling method supporting consecutive periods to inquire about Download PDFInfo
- Publication number
- CN104954381B CN104954381B CN201510351785.1A CN201510351785A CN104954381B CN 104954381 B CN104954381 B CN 104954381B CN 201510351785 A CN201510351785 A CN 201510351785A CN 104954381 B CN104954381 B CN 104954381B
- Authority
- CN
- China
- Prior art keywords
- task
- tasks
- data
- broadcast
- privately owned
- 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.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/60—Network streaming of media packets
- H04L65/61—Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio
- H04L65/611—Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio for multicast or broadcast
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/80—Responding to QoS
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Under the invention discloses a kind of broadcast environment, for the data dispatching method of cycle, the inquiry of continuity real-time task.Broadcast scheduling method disclosed in this invention is first on-fixed priority broadcast dispatching method, and it, under the sustainable prerequisite completed of guarantee broadcast query task, has taken into full account the basic demand of broadcast bandwidth efficiency utilization.The key step of method proposed by the invention comprises: data item classification and initiating task set generating process, common tasks dispatch deal, privately owned task scheduling processing and overall dispatch deal, wherein, the definition of common tasks and privately owned task specifically will provide in invention.Use the broadcasting server of method proposed by the invention more effectively can utilize broadcast bandwidth, in time, effectively for more query task synchronously provides service.Compared with existing broadcast scheduling method, dispatching method proposed by the invention considers the sharing of broadcast data simultaneously, the real-time of task, the continuation of service and the high efficiency of bandwidth usage.
Description
Technical field
The invention belongs to data real-time broadcast dispatching technique field, more specifically, relate to a kind of dynamic priority broadcast scheduling method supporting consecutive periods to inquire about.
Background technology
Along with the development of wireless communication technology and widely using of portable communication device, data broadcast has become a kind of popular data communication method, and people employing wireless network and portable communication device can inquire about the various data messages required for it anywhere or anytime.But in actual environment, data may frequent change (as the price of stock, the position of automobile in mobile), query task also may have different urgencies, thus result in query task and often have duty cycles different separately.In order to ensure completing smoothly of query task, server needs within each cycle of task, at least broadcast once its all data of inquiring about.That is, in the applied environment of reality, query task often consecutive periods and each query task often need to inquire about multiple data simultaneously.Can predict, the data broadcast dispatching technique be directed under this environment will be the development trend of the communication technology, and will be widely used in the numerous areas such as finance, military affairs, automobile.
Present stage, although carried out studying comparatively widely to real-time data broadcast technology both at home and abroad, but most research is not deep enough, existing support broadcast scheduling method is limited, and there is obvious defect: although the broadcast scheduling method of existing support consecutive periods inquiry has taken into account the sharing of broadcast data, the real-time of query task and the stability of broadcast service, but, the use of broadcast bandwidth also exists obvious waste, thus it is often barely satisfactory to result in scheduling result.How to take into account the sharing of broadcast data, the real-time of query task, the high efficiency that the stability of broadcast service and broadcast bandwidth use, this becomes the important topic of research simultaneously.
In addition, at home and abroad, the research of real-time data broadcast scheduling is all as the sole criterion weighing dispatching method quality using missed deadline percentage.For the different dispatching methods performed under same set of tasks, existing research generally believes that the dispatching method that missed deadline percentage is low has better performance.But this criterion ignores the stability of service.For disposable inquiry, missed deadline percentage can as the criterion of dispatching method quality; But for continuity inquiry, what inquiring client terminal wished acquisition is lasting service, and the query feedback cut in and out can not be considered to a high-quality service.So, for real-time broadcast dispatching method, can under the prerequisite ensureing query task real-time the continuation of Deterministic service, be also one of major criterion weighing its quality.Only have the continuation of service to be guaranteed, the quality of service just can be improved.At present, at home and abroad, the broadcast scheduling research inquired about for supporting consecutive periods under broadcast environment is also fewer, and the sharing of broadcast data, the real-time of task can be considered simultaneously, and the broadcast scheduling method of continuation of Deterministic service can only have RM-UO (RMuniqueonly) algorithm, its applied environment and feature are summarized as follows:
RM-UO: a given server and several communication equipments, server and communication equipment are by uploading channel and unique download channels intercoms mutually.By uploading channel, communication equipment can send data inquiry request to server at any time, then monitors download channels, the response of waiting for server.As server, itself store the data message for communication equipment inquiry.When receiving the inquiry from communication equipment, server organization, data dispatching, before task deadline, (before end cycle) makes answer (denial of service or the total data broadcasted needed for it) to inquiry.The major advantage of RM-UO algorithm is the sharing of its compatibility broadcast data and the real-time of inquiry, and can the continuation of Deterministic service.But RM-UO algorithm is a kind of broadcast scheduling method of fixed priority formula.As everyone knows, in real-time task scheduling field, the threshold value of Fixed-priority Scheduling Strategy method is starkly lower than on-fixed priority dispatching method.That is, the set of tasks of a given non-scheduling under Fixed-priority Scheduling Strategy method, it is likely schedulable in on-fixed priority dispatching method.Therefore, in the present invention, we attempt the broadcast scheduling problem solving consecutive periods inquiry with the scheduling mode of on-fixed priority, thus improve the service scale of broadcast system.
At present, widely using of mobile communication equipment becomes natural trend, and increasing people will be had from now on to select to carry out data communication and data query with broadcast mode.Can Radio Data System utilize broadcast bandwidth and effectively utilize, and this directly affects the quality of service and the scale of service.Under equivalent environment, for more inquiry provides service to be more timely and effectively the desirability of real world applications.Therefore, study the data broadcast dispatching method of compatible task real-time, broadcast data sharing, service continuity and bandwidth utilization efficiency, there is quite main practical significance.
Summary of the invention
The invention provides a kind of broadcast scheduling method supporting consecutive periods to inquire about, it can in guarantee broadcast data sharing, while task real-time and broadcast service stability, ensures the high efficiency that broadcast bandwidth utilizes.It should be noted that, broadcast scheduling method provided by the present invention is a kind of on-fixed priority broadcast dispatching method, it can improve the service scale of broadcast system to a great extent, under equal conditions, more broadcast query task can be obtained service simultaneously and complete smoothly.
To achieve these goals, support the on-fixed priority broadcast dispatching method of cycle continuity real-time query under the invention provides a kind of broadcast environment, described method comprises the steps:
(1) data item classification and initiating task set generating process: data are carried out classify (being divided into conventional data and private data), thus generates initiating task set (being made up of common tasks and privately owned task);
(2) common tasks dispatch deal: call Sr algorithm and common tasks set is converted into initial 2 harmonic wave set of tasks, then, a virtual task is generated according to initial 2 harmonic wave set of tasks, and generate final 2 harmonic wave set of tasks, finally, by the final 2 harmonic wave set of tasks of EDF algorithmic dispatching, thus generate common tasks dispatch list;
(3) privately owned task scheduling processing: virtual task is inserted privately owned set of tasks, the set of tasks after virtual task is inserted in scheduling, thus obtains privately owned schedule of tasks;
(4) overall dispatch deal: according to common tasks dispatch list and privately owned schedule of tasks, selects the data that this unit interval needs broadcast, and broadcasts within each unit interval.
In one embodiment of the present of invention, described step (1) specifically comprises:
(1.1) collect all data item being broadcasted task and inquiring about, thus obtain a collection of data items, and the data in this collection of data items are carried out classify (being divided into conventional data and private data);
(1.2) according to the collection of data items that attribute and (1.1) of broadcast query task obtain, generate an initiating task set, then, according to the classification results of data item, task in initiating task set is carried out divide (being divided into common tasks and privately owned task), thus obtain common tasks set and privately owned set of tasks;
In one embodiment of the present of invention, described step (1.1) specifically comprises:
(1.1.1) access all broadcast query tasks, obtain all broadcast datas be queried, thus obtain collection of data items;
(1.1.2) for each data item in collection of data items, the cycle of all tasks of this data item of statistical query, if the value of statistics is not unique, and the shortest two duty cycle (A and B, to A<B be established) meet equation: A<B<2A, then this data item is private data, otherwise this data item is conventional data.
In one embodiment of the present of invention, described step (1.2) specifically comprises:
(1.2.1) for the data item that each (1.1.1) obtains, find the task that the cycle of this data item of inquiry is the shortest, and task is equal and only inquire about the initiating task of this data item therewith to generate one-period, all this walks the initiating task generated and forms initiating task set;
(1.2.2) for each task in initiating task set, if the data item that this task is inquired about is a conventional data, so this task is a common tasks, otherwise, this task is a privately owned task, all privately owned tasks form privately owned set of tasks, and all common tasks form common tasks set.
In one embodiment of the present of invention, described step (2) specifically comprises:
(2.1) call Sr algorithm and common tasks set is converted into initial 2 harmonic wave set of tasks;
(2.2) virtual task is generated according to initial 2 harmonic wave set of tasks;
(2.3) according to virtual task, final 2 harmonic wave set of tasks are generated;
(2.4) call the final 2 harmonic wave set of tasks of EDF algorithmic dispatching, thus generate common tasks dispatch list.
In one embodiment of the present of invention, described step (2.2) specifically comprises:
(2.2.1) according to the initial 2 harmonic wave set of tasks that (2.1) generate, the overall bandwidth (being set to 1/A) that all required by task in this set are wanted is calculated.
(2.2.2) generating one-period is A, and institute's data query is the virtual task of virtual data (actual is all conventional datas).
In one embodiment of the present of invention, described step (2.3) specifically comprises following sub-step:
(2.3.1) the initial 2 harmonic wave set of tasks that (2.1) generate are traveled through, for each 2 initial harmonic wave task (assumption period is T), generate one-period and equal the new task of T/A, wherein the cycle of virtual task of A for generating in (2.2);
(2.3.2) all newly-generated tasks form final 2 harmonic wave set of tasks.
In one embodiment of the present of invention, described step (3) specifically comprises following sub-step:
(3.1) virtual task that (2.2) generate is inserted privately owned set of tasks;
(3.2) set of tasks after scheduling insertion virtual task, thus obtain privately owned schedule of tasks.
In one embodiment of the present of invention, described step (3.2) specifically comprises following sub-step:
(3.2.1) limit priority is given by special duty;
(3.2.2) on the basis of (3.2.1), EDF scheduling is performed to final privately owned set of tasks, thus obtains privately owned schedule of tasks.
In one embodiment of the present of invention, described step (4) specifically comprises following sub-step:
(4.1) calculate the broadcast bandwidth required for broadcast query set of tasks, determine service object's (which task can be served).
(4.2) serve for existing all broadcast query tasks, select suitable data item at each broadcast moments and broadcast.
In one embodiment of the present of invention, described step (4.1) specifically comprises following sub-step:
(4.1.1) the broadcast bandwidth X required for privately owned set of tasks after inserting virtual task is calculated;
If (4.1.2) X>100%, keep original broadcast order, broadcast scheduling method performs end; Otherwise, enter service object for all existing broadcast query tasks.
In one embodiment of the present of invention, described step (4.2) specifically comprises following sub-step:
(4.2.1) according to privately owned schedule of tasks, the task of now needing to perform is selected in each moment;
If (4.2.2) this task is a privately owned task, directly broadcasts the data item that this task is inquired about, return (4.2.1); Otherwise, enter (4.2.3).
(4.2.3) according to final common tasks dispatch list, select a common tasks successively, and broadcast the data item that this task inquires about, return (4.2.1).
The above technical scheme conceived by the present invention compared with prior art, has following beneficial effect:
(1) compared with existing real-time data broadcast technology, method proposed by the invention, in guarantee broadcast data sharing, on the basis of query task real-time and broadcast service stability, adds the consideration that broadcast bandwidth effectively utilizes aspect, therefore, there is better performance.
(2) the present invention proposes the on-fixed priority broadcast dispatching method of first support consecutive periods broadcast query, the method has very strong novelty, and has wide development potentiality.In addition, the time complexity of method proposed by the invention is linear session, thus, ensure that the online executive capability of method.
(3) dispatching technique that the broadcast scheduling method that the present invention proposes adopts realizes simple, is easy to operation, is convenient to developer and grasps, and this way ensure that maintenance simplification and the extensibility of the broadcast system using the method.
Generally speaking, the data broadcast dispatching method that the present invention realizes, has considered the high efficiency that the sharing of broadcast data, the real-time of task, the continuation of service and bandwidth use.Use the Radio Data System of method proposed by the invention in the demand meeting user's data query to a greater extent, the acquisition that more user can be walked abreast is served in time, effectively.
Accompanying drawing explanation
Fig. 1 is the general flow chart of data broadcast dispatching method of the present invention;
Fig. 2 is data item classification and initiating task set generating process flow chart in the inventive method;
Fig. 3 is common tasks scheduling processing flow figure in the inventive method;
Fig. 4 is privately owned task scheduling processing flow chart in the inventive method;
Fig. 5 is overall scheduling processing flow figure in the inventive method.
Embodiment
In order to make object of the present invention, technical scheme and advantage clearly understand, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.In addition, if below in described each execution mode of the present invention involved technical characteristic do not form conflict each other and just can mutually combine.Now lay down a definition as follows:
Under the inventive method is applicable to broadcast environment, for the broadcast scheduling process of consecutive periods inquiry.Method has considered the high efficiency that the sharing of broadcast data, the real-time of task, the continuation of service and bandwidth use.Method proposed by the invention is classified by data item and initiating task set generating process, common tasks dispatch deal, privately owned task scheduling processing and overall dispatch deal are formed.Wherein data item classification and initiating task set generating process are bases, comprise the division of data and the generation of ancestral task, common tasks dispatch deal and privately owned task scheduling processing are the different scheduling modes to dissimilar task, and overall dispatch deal is the comprehensive process done according to front two parts result.
, specifically introduce broadcast scheduling method proposed by the invention below, as shown in Figure 1, described method comprises the steps:
(1) data item classification and initiating task set generating process
Data are carried out classify (being divided into conventional data and private data), thus generate initiating task set (being made up of common tasks and privately owned task):
(1.1) Data classification
Collect all data item being broadcasted task and inquiring about, thus obtain a collection of data items, and the data in this collection of data items carried out classify (being divided into conventional data and private data), classification processing execution step is as follows:
(1.1.1) access all broadcast query tasks, obtain all broadcast datas be queried, thus obtain collection of data items;
(1.1.2) for each data item in collection of data items, the cycle of all tasks of this data item of statistical query, if the value of statistics is not unique, and the shortest two duty cycle (A and B, to A<B be established) meet equation: A<B<2A, then this data item is private data, otherwise this data item is conventional data.
(1.2) generation of task
According to the collection of data items that attribute and (1.1) of broadcast query task obtain, generate an initiating task set, then, according to the classification results of data item, task in initiating task set is carried out divide (being divided into common tasks and privately owned task), thus obtains common tasks set and privately owned set of tasks:
(1.2.1) first query task is accessed.
(1.2.2) for accessed task, the first data that it is inquired about are accessed.
If (1.2.3) now institute's visit data is universal data, then generate a new DC task, the cycle of task equals cycle of the shortest task of accessing these data, the data data for this reason that task is inquired about.
If (1.2.4) now institute's visit data is privately owned type data, then generate a new real-time task, the cycle of task equals cycle of the shortest task of accessing these data, the data data for this reason that task is inquired about.
If (1.2.5) now institute's visit data last data of inquiring about for now institute's access task, enter (1.2.6); Otherwise, access the next data that now institute's access task is inquired about, return (1.2.3).
(1.2.6) all newly-generated DC tasks form common tasks set, and all newly-generated real-time tasks form privately owned set of tasks, enter (2).
(2) common tasks dispatch deal
Call Sr algorithm and common tasks set is converted into initial 2 harmonic wave set of tasks, then, generate a virtual task according to initial 2 harmonic wave set of tasks, and generate final 2 harmonic wave set of tasks, finally, by the final 2 harmonic wave set of tasks of EDF algorithmic dispatching, thus generate common tasks dispatch list:
(2.1) 2 harmonic wave set of tasks are generated
Call Sr algorithm and common tasks set is converted into initial 2 harmonic wave set of tasks, enter (2.2).
(2.2) generation of virtual task
Generate a virtual task according to initial 2 harmonic wave set of tasks, concrete steps comprise:
(2.2.1) according to the initial 2 harmonic wave set of tasks that (2.1) generate, the overall bandwidth (being set to 1/A) that all required by task in this set are wanted is calculated.
(2.2.2) generating one-period is A, and institute's data query is the virtual task of virtual data (actual is all conventional datas), enters (2.3).
(2.3) final 2 harmonic wave set of tasks are generated
According to the 2 harmonic wave tasks generated in (2.2) and (2.1) generate 2 harmonic wave set of tasks, generate final 2 harmonic wave set of tasks, concrete steps comprise:
(2.2.1) according to the initial 2 harmonic wave set of tasks that (2.1) generate, the overall bandwidth (being set to 1/A) that all required by task in this set are wanted is calculated.
(2.2.2) generating one-period is A, and institute's data query is the virtual task of virtual data (actual is all conventional datas), enters (2.3).
(2.3) final 2 harmonic wave set of tasks are generated
The virtual task that the 2 harmonic wave tasks generated according to (2.1) and (2.2) generate, generate final 2 harmonic wave set of tasks, concrete steps comprise:
(2.3.1) the initial 2 harmonic wave set of tasks that (2.1) generate are traveled through, for each 2 initial harmonic wave task (assumption period is T), generate one-period and equal the new task of T/A, wherein the cycle of virtual task of A for generating in (2.2);
(2.3.2) all newly-generated tasks form final 2 harmonic wave set of tasks.
(2.4) common tasks dispatch list is obtained
Call the final 2 harmonic wave set of tasks that EDF algorithmic dispatching (2.3) generates, thus generate common tasks dispatch list.
(3) privately owned task scheduling processing
Virtual task is inserted privately owned set of tasks, and the set of tasks after virtual task is inserted in scheduling, thus obtains privately owned schedule of tasks.
(3.1) final privately owned set of tasks is generated
The virtual task generated in step (2.2) is inserted among privately owned set of tasks, forms final privately owned set of tasks.
(3.2) privately owned schedule of tasks is obtained
The set of tasks after virtual task is inserted in scheduling, thus obtains privately owned schedule of tasks, and concrete steps comprise:
(3.2.1) limit priority is given by virtual task;
(3.2.2) on the basis of (3.2.1), EDF scheduling is performed to final privately owned set of tasks, thus obtains privately owned schedule of tasks.
(4) overall dispatch deal
According to common tasks dispatch list and privately owned schedule of tasks, within each unit interval, select the data that this unit interval needs broadcast, and broadcast, concrete steps comprise:
(4.1) calculate the broadcast bandwidth required for broadcast query set of tasks, determine service object's (which task can be served).
(4.1.1) the broadcast bandwidth X required for privately owned set of tasks after inserting virtual task is calculated;
If (4.1.2) X>100%, keep original broadcast order, broadcast scheduling method performs end; Otherwise, enter service object for all existing broadcast query tasks.
(4.2) serve for existing all broadcast query tasks, select suitable data item at each broadcast moments and broadcast.
(4.2.1) according to privately owned schedule of tasks, the task of now needing to perform is selected in each moment;
If (4.2.2) this task is a privately owned task, directly broadcasts the data item that this task is inquired about, return (4.2.1); Otherwise, enter (4.2.3).
(4.2.3) according to final common tasks dispatch list, select a common tasks successively, and broadcast the data item that this task inquires about, return (4.2.1).
Under illustrating broadcast environment below, for the function of the data dispatching method of cycle, the inquiry of continuity real-time task.
| Query task | q1 | q2 | q3 | q4 | q5 | q6 | q7 | q8 | q9 |
| Institute looks into data | d1 | d1 | d1,d2 | d1,d3 | d4 | d5 | d4,d6 | d5,d7 | d8 |
| Cycle | 4 | 5 | 8 | 8 | 9 | 10 | 12 | 12 | 12 |
Table 1
Table 2
Given nine query tasks, its data item of inquiring about and the cycle as shown in table 1.According to mentioned above, the broadcast scheduling method that this patent proposes, by first collecting the data being broadcasted query task and inquiring about, obtains data acquisition system { d1, d2, d3, d4, d5, d6, d7, d8}.Then, the data in this data acquisition system are classified.Such as data item d1, d1 by multiple job enquiry, and the cycle that cycle of cycle the shortest task of inquiry d1 is the 4, the second short period task be 5.Because 5<2*4=8, d1 are a conventional data.In like manner, d4, d5 are also conventional data, and other data are private data.So, generate common tasks set and privately owned set of tasks, as shown in table 2.Next, common tasks set will be converted into harmonic wave set of tasks, and after transforming, the cycle of task is 4,8 and 8.Calculate the overall bandwidth consumption of 2 harmonic wave set of tasks, obtaining result is 1/2.So generate the virtual task xt1 that one-period is 2,2 harmonic wave set of tasks will be converted into final 2 harmonic wave set of tasks, and the cycle of task is respectively 2,4 and 4.Next, call the final 2 harmonic wave set of EDF algorithmic dispatching, obtain dispatch list { ct1, ct2, ct1, ct3}.Then, virtual task is inserted privately owned set of tasks, calculate the overall bandwidth required for privately owned set of tasks after inserting virtual task, calculate known, its result is 100%.Therefore result is not more than 100%, so, the priority of virtual task is placed in the highest, calls the privately owned set of tasks after EDF algorithmic dispatching insertion virtual task, obtain dispatch list { xt1, pt1, xt1, pt2, xt1, pt3, xt1, pt4, xt1, pt5, xt1, pt1, xt1, pt2, xt1, pt3, xt1, pt1, xt1, pt2, xt1, pt4, xt1, pt5}.Finally, from final privately owned schedule of tasks, select a task in each moment, if not virtual task, then broadcast the data item that it is inquired about; If virtual task, then from common tasks tables of data, choose a task successively, broadcast the data item that this task is inquired about.Real data broadcast cycle table is:
| d1 | d2 | d4 | d3 | d1 | d6 | d5 | d7 |
| d1 | d8 | d4 | d2 | d1 | d3 | d5 | d6 |
| d1 | d2 | d4 | d3 | d1 | d7 | d5 | d8 |
Those skilled in the art will readily understand; the foregoing is only preferred embodiment of the present invention; not in order to limit the present invention, all any amendments done within the spirit and principles in the present invention, equivalent replacement and improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. support the dynamic priority broadcast scheduling method that consecutive periods is inquired about, it is characterized in that, described method comprises the steps:
(1) data item classification and initiating task set generating process: be conventional data and private data by Data classification, and then generate the initiating task set be made up of common tasks and privately owned task;
(2) common tasks dispatch deal: call Sr algorithm and common tasks set is converted into initial 2 harmonic wave set of tasks, then, a virtual task is generated according to initial 2 harmonic wave set of tasks, and generate final 2 harmonic wave set of tasks, finally use the final 2 harmonic wave set of tasks of EDF algorithmic dispatching, thus generate common tasks dispatch list;
(3) privately owned task scheduling processing: virtual task is inserted privately owned set of tasks, the set of tasks after virtual task is inserted in scheduling, thus obtains privately owned schedule of tasks;
(4) overall dispatch deal: according to common tasks dispatch list and privately owned schedule of tasks, selects the data that this unit interval needs broadcast, and broadcasts within each unit interval.
2. the method for claim 1, is characterized in that, described step (1) specifically comprises:
(1.1) collect all data item being broadcasted task and inquiring about, thus obtain a collection of data items, and be conventional data and private data by the Data classification in this collection of data items;
(1.2) according to the collection of data items that attribute and (1.1) of broadcast query task obtain, generate an initiating task set, then according to Data classification result, initiating task is divided into common tasks and privately owned task, thus obtains common tasks set and privately owned set of tasks.
3. method as claimed in claim 2, it is characterized in that, described step (1.1) specifically comprises:
(1.1.1) access all broadcast query tasks, obtain all broadcast datas be queried, thus obtain collection of data items;
(1.1.2) for each data item in collection of data items, the cycle of all tasks of this data item of statistical query, if the value of statistics is not unique, and the shortest two duty cycle A and B, if meet B<2A, so, this data item is private data, otherwise this data item is conventional data; Wherein A is less than B.
4. method as claimed in claim 3, it is characterized in that, described step (1.2) specifically comprises:
(1.2.1) for the data item that each (1.1.1) obtains, find the task that the cycle of this data item of inquiry is the shortest, and task is equal and only inquire about the initiating task of this data item therewith to generate one-period, all this walks the initiating task generated and forms initiating task set;
(1.2.2) for each task in initiating task set, if the data item that this task is inquired about is a conventional data, so this task is a common tasks, otherwise this task is a privately owned task, all privately owned tasks form privately owned set of tasks, and all common tasks form common tasks set.
5. method as claimed in claim 1 or 2, it is characterized in that, described step (2) specifically comprises:
(2.1) call Sr algorithm and common tasks set is converted into initial 2 harmonic wave set of tasks;
(2.2) virtual task is generated according to initial 2 harmonic wave set of tasks;
(2.3) according to virtual task, final 2 harmonic wave set of tasks are generated;
(2.4) call the final 2 harmonic wave set of tasks of EDF algorithmic dispatching, thus generate common tasks dispatch list.
6. method as claimed in claim 5, it is characterized in that, described step (2.2) specifically comprises:
(2.2.1) according to the initial 2 harmonic wave set of tasks that (2.1) generate, calculate the overall bandwidth that all required by task in this set are wanted, be designated as 1/A;
(2.2.2) generating one-period is A, and institute's data query is the virtual task of virtual data.
7. method as claimed in claim 5, it is characterized in that, described step (2.3) specifically comprises:
(2.3.1) the initial 2 harmonic wave set of tasks that (2.1) generate are traveled through, for the 2 harmonic wave tasks that each is initial, generate the new task that one-period equals T/A, wherein the cycle of virtual task of A for generating in (2.2), T is the cycle of 2 initial harmonic wave tasks;
(2.3.2) all newly-generated tasks form final 2 harmonic wave set of tasks.
8. the method for claim 1, is characterized in that, described step (3) specifically comprises:
(3.1) virtual task is inserted privately owned set of tasks;
(3.2) priority of virtual task is set to the highest, calls the set of tasks after EDF algorithmic dispatching insertion virtual task, thus obtain privately owned schedule of tasks.
9. method as claimed in claim 1 or 2, it is characterized in that, described step (4) specifically comprises:
(4.1) calculate the broadcast bandwidth required for broadcast query set of tasks, determine service object, described service object is the task that can obtain serving;
(4.2) serve for existing all broadcast query tasks, select suitable data item at each broadcast moments and broadcast.
10. method as claimed in claim 9, it is characterized in that, described step (4.2) specifically comprises:
(4.2.1) according to privately owned schedule of tasks, the task of now needing to perform is selected in each moment;
If (4.2.2) this task is a privately owned task, directly broadcasts the data item that this task is inquired about, return (4.2.1); Otherwise, enter (4.2.3);
(4.2.3) according to final common tasks dispatch list, select a common tasks successively, and broadcast the data item that this task inquires about, return (4.2.1).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510351785.1A CN104954381B (en) | 2015-06-24 | 2015-06-24 | A kind of dynamic priority broadcast scheduling method supporting consecutive periods to inquire about |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510351785.1A CN104954381B (en) | 2015-06-24 | 2015-06-24 | A kind of dynamic priority broadcast scheduling method supporting consecutive periods to inquire about |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104954381A CN104954381A (en) | 2015-09-30 |
| CN104954381B true CN104954381B (en) | 2016-04-20 |
Family
ID=54168734
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510351785.1A Expired - Fee Related CN104954381B (en) | 2015-06-24 | 2015-06-24 | A kind of dynamic priority broadcast scheduling method supporting consecutive periods to inquire about |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104954381B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105245472B (en) * | 2015-10-22 | 2018-09-14 | 国网安徽省电力公司 | A kind of inheritance power supply information priorities dispatching method |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5752193A (en) * | 1995-09-01 | 1998-05-12 | Motorola, Inc. | Method and apparatus for communicating in a wireless communication system |
| CN102469518B (en) * | 2010-11-09 | 2016-07-06 | 上海无线通信研究中心 | A kind of transmission method of wireless device and bag dispatching method, wireless system |
| CN103248500B (en) * | 2013-05-22 | 2016-03-16 | 武汉大学 | A kind of real-time data broadcast dispatching method as required considering data item size |
-
2015
- 2015-06-24 CN CN201510351785.1A patent/CN104954381B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN104954381A (en) | 2015-09-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | Energy-delay tradeoff for dynamic offloading in mobile-edge computing system with energy harvesting devices | |
| Zhou et al. | Cloudthings: A common architecture for integrating the internet of things with cloud computing | |
| Guo et al. | Optimal power management of residential customers in the smart grid | |
| Liang et al. | Joint resource allocation and coordinated computation offloading for fog radio access networks | |
| Liu et al. | Task scheduling and server provisioning for energy-efficient cloud-computing data centers | |
| Misra et al. | Residential energy management in smart grid: A Markov decision process-based approach | |
| Li et al. | On efficient offloading control in cloud radio access network with mobile edge computing | |
| CN102185801A (en) | Information processing method in instant messaging and instant messaging tool | |
| CN102495618A (en) | Instant communication intelligent household control system and control method thereof | |
| CN109510714A (en) | Invitation method, resource allocation methods and device in instant messaging | |
| Cao et al. | Optimal radio resource allocation for mobile task offloading in cellular networks | |
| CN105093945A (en) | System and method for safely controlling smart household apparatuses based on smart cloud | |
| CN103235835A (en) | Inquiry implementation method for database cluster and device | |
| CN108141707A (en) | A kind of method, relevant device and trunked communication system for obtaining location information | |
| CN106647295B (en) | Smart home system and cooperative operation method thereof | |
| CN110149377A (en) | A kind of video service node resource allocation methods, system, device and storage medium | |
| CN104080177A (en) | Coordinated multiple point scheduling method and base station | |
| CN110572306A (en) | wired intelligent home system with ad hoc network and ad hoc network method thereof | |
| CN104954381B (en) | A kind of dynamic priority broadcast scheduling method supporting consecutive periods to inquire about | |
| CN104866650B (en) | Method and device for creating abstract device | |
| Yuan et al. | Dcvp: Distributed collaborative video stream processing in edge computing | |
| CN103281355A (en) | Fuzzy decision-based server push method | |
| Li et al. | Energy-efficient resource allocation for application including dependent tasks in mobile edge computing | |
| CN104980685A (en) | Video service providing method and video service providing system | |
| CN107567100B (en) | Method and device for scheduling resources of wireless communication 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 | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160420 Termination date: 20190624 |