CN105808330A - Task change processing method, task change processing apparatus and internet-of-vehicles server - Google Patents

Task change processing method, task change processing apparatus and internet-of-vehicles server Download PDF

Info

Publication number
CN105808330A
CN105808330A CN201610108923.8A CN201610108923A CN105808330A CN 105808330 A CN105808330 A CN 105808330A CN 201610108923 A CN201610108923 A CN 201610108923A CN 105808330 A CN105808330 A CN 105808330A
Authority
CN
China
Prior art keywords
task
queue
period
type
periodic
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
Application number
CN201610108923.8A
Other languages
Chinese (zh)
Inventor
陈皓
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Yulong Computer Telecommunication Scientific Shenzhen Co Ltd
Original Assignee
Yulong Computer Telecommunication Scientific Shenzhen Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Yulong Computer Telecommunication Scientific Shenzhen Co Ltd filed Critical Yulong Computer Telecommunication Scientific Shenzhen Co Ltd
Priority to CN201610108923.8A priority Critical patent/CN105808330A/en
Publication of CN105808330A publication Critical patent/CN105808330A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues

Abstract

The invention proposes a task change processing method, a task change processing apparatus and an internet-of-vehicles server. The task change processing method comprises the steps of monitoring whether task change occurs or not in an internet of vehicles in real time; and according to the type of the task change, executing a task distribution function corresponding to the type. Through the technical scheme provided by the method, the apparatus and the server, a corresponding solution can be provided according to the type of the task change, and the problem of poor data distribution timeliness, or insufficient consideration of task distribution for traffic emergency events or the like due to adoption of a single algorithm mechanism such as FCFS, EDF or the like is avoided, so that the data distribution efficiency in the internet-of-vehicles environment is improved.

Description

Task changing process method, task change process device and car networked server
Technical field
The present invention relates to server technology field, process device and a kind of car networked server in particular to a kind of task changing process method, a kind of task change.
Background technology
At present, existing data distributing method has FCFS and EDF algorithm mechanism.FCFS (FirstComeFirstServed) refers to prerequisite variable, namely it is ranked up processing successively to task the time of advent according to distributed tasks, it is left out task size and execution time, the distributed tasks first arrived first is distributed, the rear rear distribution arrived.
EDF (EarliestDeadlineFirst) is a kind of time limit priority algorithm, namely priority is distributed according to the absolute cutoff phase of each distributed tasks, owing to the absolute cutoff phase of task is continually changing, so EDF algorithm belongs to dynamic priority algorithm, the priority of task was determined according to the off period of task, the off period of the current distributed tasks that request occurs, more early the priority of distributed tasks was more high.
Such as, distributing tri-tasks of Task1, Task2, Task3, execution time respectively 1s, 2s, 1s of three tasks, duty cycle is 3s, 4s, 6s respectively, and release time is 0s, 0s, 0s respectively.According to Fig. 1 it can be seen that in 0 moment, the off period of tri-tasks of Task1, Task2, Task3 is 3,4,6 respectively, thus Task1 is first carried out, in 1 moment, the off period of Task2 and Task3 is 3 and 5 respectively, therefore first carry out Task2, arriving in 3 moment task task 1, now the off period of Task1 and Task3 is all 3, therefore first carries out Task1, in 4 moment, Task2 task arrives, and now the off period of Task2 and Task3 is 4 and 2 respectively, therefore first carries out Task3.
It follows that EDF algorithms selection calculates the off period of current time task on each time point, and preferentially performing off period task the earliest, the task that the cycle that first carries out when the off period is identical time is short, the task priority that namely cycle is short is higher.
But, in above two scheme, FCFS algorithm adopts the strategy of First Come First Served, but do not account for urgency and the importance of event, after burst data distributed tasks and real-time data distributed tasks may be arranged at the weak data distributed tasks of real-time, thus significantly postponing, it is impossible to meet the requirement of real-time that data are distributed by vehicle-subgrade system.And although EDF algorithm obtains each distributed tasks real-time priority in the off period that each moment can recalculate each task, relatively urgent distributed tasks is made preferentially to perform, real-time is higher, but, EDF algorithm is also the distributed tasks collection being only applicable to periodic, and burst data distributed tasks often occurs in car networking, and it does not have periodically, event occurs to distribute this event immediately, and event terminates distributed tasks and terminates.
It addition, in EDF algorithm, when a certain task is cancelled, other tasks continue to press primitive period EDF algorithm and perform, it may appear that free time, cause that the data distribution efficiency in car networking reduces, reduce effective distribution time and handling capacity.
It is thus desirable to a kind of new technical scheme, it is possible to the counter-measure adapted to is provided for different task change types.
Summary of the invention
The present invention is based on the problems referred to above, it is proposed that a kind of new technical scheme, it is possible to provide the counter-measure adapted to for different task change types.
In view of this, an aspect of of the present present invention proposes a kind of task changing process method, including: whether the networking of monitor in real time car occur task to change;According to the type that described task changes, perform the task distribution function that described type is corresponding.
In this technical scheme, when in monitoring car networking, generation task changes, can first determine the type that task changes, such that it is able to provide the task distribution function corresponding with the type that this task changes, such as, the task of cancelling this type that can arrange task changes corresponding A PEDF (AlterablePeriodEDF, time limit variable cycle priority algorithm) task distribution function.By this technical scheme, corresponding solution can be provided according to the type that task changes, avoid causing data distribution real-time weak because adopting the single algorithm mechanism such as FCFS or EDF or the problems such as not enough being considered for traffic unexpected incidents distributed tasks, to improve data distribution efficiency under car networked environment.
In technique scheme, it is preferable that the type that described task changes includes: the cancellation of task, cancel the insertion of the recovery of task, the insertion of burst aperiodicity task and periodic task.
In this technical scheme, the type that task changes includes the cancellation of task, cancels the insertion of the recovery of task, the burst insertion of aperiodicity task and periodic task, certainly, the type that task changes can also include other change types in addition as required, corresponding solution is provided, it is to avoid cause data distribution real-time weak because adopting the single algorithm mechanism such as FCFS or EDF or the problems such as not enough are considered for traffic unexpected incidents distributed tasks by the type changed according to task.
In any of the above-described technical scheme, it is preferable that when the cancellation that the type that described task changes is described task, the task distribution function that the described type of described execution is corresponding, comprise determining that the quantity of other tasks in the current queue beyond the task of needing to cancel;By the execution time of described needing and cancelling of task divided by described quantity, obtain the first subvalue;The cycle of other tasks in each described current queue is reduced described first subvalue, to reduce the integral cycle of the first new task collection after changing.
In this technical scheme, the task of cancelling this type for task changes corresponding A PEDF task distribution function.In the related, in EDF algorithm, when a certain distributed tasks is cancelled, other distributed tasks continue to press primitive period EDF algorithm and perform, there will be free time, this vehicle road cooperation data distribution efficiency often led in car networking reduces, and the improvement that APEDF algorithm does just on the basis of EDF algorithm.
Specifically, when a certain task is cancelled, by the execution time average cutting of this task in the cycle of other tasks, the equal portions of the quantity of other tasks it are divided into by execution time of this task, and the cycle for other tasks each deducts this equal portions, so that the duty cycle entirety of new task collection diminishes, processor utillization increases.
Such as, having the task-set 1 of a n periodic duty, 2 ..., n, it performs time respectively C1、C2、……、Cn, its cycle respectively T1、T2、......、Tn, after starting to perform a period of time, task 1 is cancelled, then now task-set become 2,3 ..., n, the cycle is T respectively2、T3、……、TnIf using EDF algorithm, then processor utillization is
U E D F = C 2 T 2 + C 3 T 3 + ... + C n , T n
And APEDF algorithm is after task 1 is cancelled, by the execution time average cutting of this task in the cycle of other tasks, the cycle of APEDF task-set becomes Its processor utillization is:
U A P E D F = C 2 T 2 - C 1 n - 1 + C 3 T 3 - C 1 n - 1 + ... + C n , T n - C 1 n - 1
It should be evident that UAPEDF> UEDF, therefore, by this technical scheme, using APEDF algorithm to improve processor utillization, thus improve the utilization rate of the free time after task is cancelled, making tasks carrying improved efficiency, certainly, also solve the problem that FCFS data distribution real-time is weak.
In any of the above-described technical scheme, it is preferable that when having cancelled the recovery of task described in the type that described task changes is, the task distribution function that the described type of described execution is corresponding, comprise determining that the total quantity of task in the task and current queue needing to recover;By the execution time of described needing and recovering of task divided by described total quantity, obtain the second subvalue;The cycle of the task in each described current queue is increased described second subvalue, to increase the integral cycle of the second new task collection after changing.
In this technical scheme, the task of recovering this type for cancelling task changes corresponding A PEDF task distribution function.In the related, in EDF algorithm, when needs to cancel task recover time, other distributed tasks continue to press primitive period EDF algorithm and perform, there will be free time, this vehicle road cooperation data distribution efficiency often led in car networking reduces, and the improvement that APEDF algorithm does just on the basis of EDF algorithm.
Specifically, when needs to cancel task recover time, the time average that performs of this task is added to the cycle of other tasks, the equal portions of the quantity of other tasks it are divided into by execution time of this task, and be that cycle of other tasks each is plus these equal portions, so that the duty cycle entirety of new task collection restores to the original state, meet UEDF< 1.
By this technical scheme, optimize EDF distribution algorithms so that it makes full use of the free time of distribution, to improve data distribution efficiency and handling capacity under car networked environment.
In any of the above-described technical scheme, preferably, when the insertion that the type that described task changes is described burst aperiodicity task, the task distribution function that the described type of described execution is corresponding, including: interrupt this subtask, burst aperiodicity task is inserted the head of task queue, and after described burst aperiodicity tasks carrying, initializes described task queue.
In this technical scheme, when there is the insertion of burst aperiodicity task, can directly interrupt this subtask, burst aperiodicity task is inserted the head of task queue, to perform, so, the insertion for the aperiodicity task that happens suddenly provides counter-measure, solves EDF algorithm and considers not enough problem for traffic unexpected incidents distributed tasks.
In any of the above-described technical scheme, preferably, when the insertion that described task change type is described periodic task, the task distribution function that the described type of described execution is corresponding, including: when having detected that task queue is inserted in periodic task request, whether the current task first detecting described task queue is finished;When the current task described task queue being detected is finished, calculates the off period of the periodic task needing insertion, and compare the off period of next task of described task queue and the off period of the periodic task of described needs insertion;When off period of next task of described task queue less than or equal to the described off period of periodic task needing and inserting time, after the described periodic task needing to insert is inserted into next task of described task queue, when off period of next task of described task queue more than the described off period of periodic task needing and inserting time, the described periodic task needing to insert is inserted into the head of described task queue.
In this technical scheme, during the insertion of generating period task, can the current task of first Detection task queue whether be finished, after determining that it is finished, when off period of next task of task queue less than or equal to off period of the periodic task to insert time, after the periodic task that will insert is inserted into next task of task queue, thus the insertion avoiding this periodic task upsets tasks carrying queue.When the off period of described next task of task queue more than the described off period inserting task time, described task of inserting is inserted into task queue head.The periodic task that the preferential execution off period is the shortest, it is ensured that the real-time of traffic data distribution.
Another aspect of the present invention proposes a kind of task change and processes device, including: monitor in real time unit, whether the networking of monitor in real time car occur task to change;Task changes processing unit, according to the type that described task changes, performs the task distribution function that described type is corresponding.
In this technical scheme, when in monitoring car networking, generation task changes, can first determine the type that task changes, such that it is able to provide the task distribution function corresponding with the type that this task changes, such as, the task of cancelling this type that can arrange task changes corresponding A PEDF (AlterablePeriodEDF, time limit variable cycle priority algorithm) task distribution function.By this technical scheme, corresponding solution can be provided according to the type that task changes, avoid causing data distribution real-time weak because adopting the single algorithm mechanism such as FCFS or EDF or the problems such as not enough being considered for traffic unexpected incidents distributed tasks, to improve data distribution efficiency under car networked environment.
In technique scheme, it is preferable that the type that described task changes includes: the cancellation of task, cancel the insertion of the recovery of task, the insertion of burst aperiodicity task and periodic task.
In this technical scheme, the type that task changes includes the cancellation of task, cancels the insertion of the recovery of task, the burst insertion of aperiodicity task and periodic task, certainly, the type that task changes can also include other change types in addition as required, corresponding solution is provided, it is to avoid cause data distribution real-time weak because adopting the single algorithm mechanism such as FCFS or EDF or the problems such as not enough are considered for traffic unexpected incidents distributed tasks by the type changed according to task.
In any of the above-described technical scheme, preferably, described task changes processing unit and includes: first subvalue's computing unit, when the cancellation that the type that described task changes is described task, determine the quantity of other tasks in the current queue beyond the task of needing to cancel, and by the execution time of described needing and cancelling of task divided by described quantity, obtain the first subvalue;Cycle reduction unit, reduces described first subvalue by the cycle of other tasks in each described current queue, to reduce the integral cycle of the first new task collection after changing.
In this technical scheme, the task of cancelling this type for task changes corresponding A PEDF task distribution function.In the related, in EDF algorithm, when a certain distributed tasks is cancelled, other distributed tasks continue to press primitive period EDF algorithm and perform, there will be free time, this vehicle road cooperation data distribution efficiency often led in car networking reduces, and the improvement that APEDF algorithm does just on the basis of EDF algorithm.
Specifically, when a certain task is cancelled, by the execution time average cutting of this task in the cycle of other tasks, the equal portions of the quantity of other tasks it are divided into by execution time of this task, and the cycle for other tasks each deducts this equal portions, so that the duty cycle entirety of new task collection diminishes, processor utillization increases.
Such as, having the task-set 1 of a n periodic duty, 2 ..., n, it performs time respectively C1、C2、……、Cn, its cycle respectively T1、T2、......、Tn, after starting to perform a period of time, task 1 is cancelled, then now task-set become 2,3 ..., n, the cycle is T respectively2、T3、……、TnIf using EDF algorithm, then processor utillization is
U E D F = C 2 T 2 + C 3 T 3 + ... + C n , T n
And APEDF algorithm is after task 1 is cancelled, by the execution time average cutting of this task in the cycle of other tasks, the cycle of APEDF task-set becomes Its processor utillization is:
U A P E D F = C 2 T 2 - C 1 n - 1 + C 3 T 3 - C 1 n - 1 + ... + C n , T n - C 1 n - 1
It should be evident that UAPEDF> UEDF, therefore, by this technical scheme, using APEDF algorithm to improve processor utillization, thus improve the utilization rate of the free time after task is cancelled, making tasks carrying improved efficiency, certainly, also solve the problem that FCFS data distribution real-time is weak.
In any of the above-described technical scheme, preferably, described task changes processing unit and includes: second subvalue's computing unit, when having cancelled the recovery of task described in the type that described task changes is, determine the total quantity of task in the task and current queue needing to recover, and by the execution time of described needing and recovering of task divided by described total quantity, obtain the second subvalue;Cycle increases unit, and the cycle of the task in each described current queue is increased described second subvalue, to increase the integral cycle of the second new task collection after changing.
In this technical scheme, the task of recovering this type for cancelling task changes corresponding A PEDF task distribution function.In the related, in EDF algorithm, when needs to cancel task recover time, other distributed tasks continue to press primitive period EDF algorithm and perform, there will be free time, this vehicle road cooperation data distribution efficiency often led in car networking reduces, and the improvement that APEDF algorithm does just on the basis of EDF algorithm.
Specifically, when needs to cancel task recover time, the time average that performs of this task is added to the cycle of other tasks, the equal portions of the quantity of other tasks it are divided into by execution time of this task, and be that cycle of other tasks each is plus these equal portions, so that the duty cycle entirety of new task collection restores to the original state, meet UEDF< 1.
By this technical scheme, optimize EDF distribution algorithms so that it makes full use of the free time of distribution, to improve data distribution efficiency and handling capacity under car networked environment.
In any of the above-described technical scheme, preferably, described task changes processing unit and includes: the first burst handling unit, when the insertion that the type that described task changes is described burst aperiodicity task, interrupt this subtask, burst aperiodicity task is inserted the head of task queue, and after described burst aperiodicity tasks carrying, initializes described task queue.
In this technical scheme, when there is the insertion of burst aperiodicity task, can directly interrupt this subtask, burst aperiodicity task is inserted the head of task queue, to perform, so, the insertion for the aperiodicity task that happens suddenly provides counter-measure, solves EDF algorithm and considers not enough problem for traffic unexpected incidents distributed tasks.
In any of the above-described technical scheme, preferably, described task changes processing unit and includes: the second burst handling unit, when the insertion that described task change type is described periodic task, when having detected that task queue is inserted in periodic task request, whether the current task first detecting described task queue is finished;Off period judging unit, when the current task described task queue being detected is finished, calculates the off period of the periodic task needing insertion, and compares the off period of next task of described task queue and the off period of the periodic task of described needs insertion;And described task changes processing unit and is additionally operable to: when off period of next task of described task queue less than or equal to off period of the described periodic task needing and inserting time, after the described periodic task needing to insert is inserted into next task of described task queue, when off period of next task of described task queue more than the described off period of periodic task needing and inserting time, the described periodic task needing to insert is inserted into the head of described task queue.
In this technical scheme, during the insertion of generating period task, can the current task of first Detection task queue whether be finished, after determining that it is finished, when off period of next task of task queue less than or equal to off period of the periodic task to insert time, after the periodic task that will insert is inserted into next task of task queue, thus the insertion avoiding this periodic task upsets tasks carrying queue.When the off period of described next task of task queue more than the described off period inserting task time, described task of inserting is inserted into task queue head.The periodic task that the preferential execution off period is the shortest, it is ensured that the real-time of traffic data distribution.
Another aspect of the invention proposes a kind of car networked server, device is processed including the task change according to any one of technique scheme, therefore, this car networked server has the technique effect identical with the task change process device according to any one of technique scheme, does not repeat them here.
By above technical scheme, corresponding solution can be provided according to the type that task changes, avoid causing data distribution real-time weak because adopting the single algorithm mechanism such as FCFS or EDF or the problems such as not enough being considered for traffic unexpected incidents distributed tasks, to improve data distribution efficiency under car networked environment.
Accompanying drawing explanation
Fig. 1 illustrates schematic diagram task time under the EDF algorithm mechanism in correlation technique;
Fig. 2 illustrates the flow chart of task changing process method according to an embodiment of the invention;
Fig. 3 illustrates that task change according to an embodiment of the invention processes the block diagram of device;
Fig. 4 illustrates the block diagram of car networked server according to an embodiment of the invention;
Fig. 5 illustrates the flow chart of task changing process method according to another embodiment of the invention;
Fig. 6 illustrates the schematic diagram that task class according to an embodiment of the invention is distributed;
Fig. 7 and Fig. 8 illustrates execution result schematic diagram according to an embodiment of the invention.
Detailed description of the invention
In order to be more clearly understood that the above-mentioned purpose of the present invention, feature and advantage, below in conjunction with the drawings and specific embodiments, the present invention is further described in detail.It should be noted that when not conflicting, embodiments herein and the feature in embodiment can be mutually combined.
Elaborate a lot of detail in the following description so that fully understanding the present invention; but; the present invention can also adopt other to be different from other modes described here to implement, and therefore, protection scope of the present invention is by the restriction of following public specific embodiment.
Fig. 2 illustrates the flow chart of task changing process method according to an embodiment of the invention.
As in figure 2 it is shown, task changing process method according to an embodiment of the invention, including:
Whether step 202, occur task to change in the networking of monitor in real time car;
Step 204, according to the type that described task changes, performs the task distribution function that described type is corresponding.
In this technical scheme, when in monitoring car networking, generation task changes, can first determine the type that task changes, such that it is able to provide the task distribution function corresponding with the type that this task changes, such as, the task of cancelling this type that can arrange task changes corresponding A PEDF (AlterablePeriodEDF, time limit variable cycle priority algorithm) task distribution function.By this technical scheme, corresponding solution can be provided according to the type that task changes, avoid causing data distribution real-time weak because adopting the single algorithm mechanism such as FCFS or EDF or the problems such as not enough being considered for traffic unexpected incidents distributed tasks, to improve data distribution efficiency under car networked environment.
In technique scheme, it is preferable that the type that described task changes includes: the cancellation of task, cancel the insertion of the recovery of task, the insertion of burst aperiodicity task and periodic task.
In this technical scheme, the type that task changes includes the cancellation of task, cancels the insertion of the recovery of task, the burst insertion of aperiodicity task and periodic task, certainly, the type that task changes can also include other change types in addition as required, corresponding solution is provided, it is to avoid cause data distribution real-time weak because adopting the single algorithm mechanism such as FCFS or EDF or the problems such as not enough are considered for traffic unexpected incidents distributed tasks by the type changed according to task.
In any of the above-described technical scheme, it is preferable that when the cancellation that the type that described task changes is described task, step 204 comprises determining that the quantity of other tasks in the current queue beyond the task of needing to cancel;By the execution time of described needing and cancelling of task divided by described quantity, obtain the first subvalue;The cycle of other tasks in each described current queue is reduced described first subvalue, to reduce the integral cycle of the first new task collection after changing.
In this technical scheme, the task of cancelling this type for task changes corresponding A PEDF task distribution function.In the related, in EDF algorithm, when a certain distributed tasks is cancelled, other distributed tasks continue to press primitive period EDF algorithm and perform, there will be free time, this vehicle road cooperation data distribution efficiency often led in car networking reduces, and the improvement that APEDF algorithm does just on the basis of EDF algorithm.
Specifically, when a certain task is cancelled, by the execution time average cutting of this task in the cycle of other tasks, the equal portions of the quantity of other tasks it are divided into by execution time of this task, and the cycle for other tasks each deducts this equal portions, so that the duty cycle entirety of new task collection diminishes, processor utillization increases.
Such as, having the task-set 1 of a n periodic duty, 2 ..., n, it performs time respectively C1、C2、……、Cn, its cycle respectively T1、T2、......、Tn, after starting to perform a period of time, task 1 is cancelled, then now task-set become 2,3 ..., n, the cycle is T respectively2、T3、……、TnIf using EDF algorithm, then processor utillization is
U E D F = C 2 T 2 + C 3 T 3 + ... + C n , T n
And APEDF algorithm is after task 1 is cancelled, by the execution time average cutting of this task in the cycle of other tasks, the cycle of APEDF task-set becomes Its processor utillization is:
U A P E D F = C 2 T 2 - C 1 n - 1 + C 3 T 3 - C 1 n - 1 + ... + C n , T n - C 1 n - 1
It should be evident that UAPEDF> UEDF, therefore, by this technical scheme, using APEDF algorithm to improve processor utillization, thus improve the utilization rate of the free time after task is cancelled, making tasks carrying improved efficiency, certainly, also solve the problem that FCFS data distribution real-time is weak.
In any of the above-described technical scheme, it is preferable that when having cancelled the recovery of task described in the type that described task changes is, step 204 comprises determining that the total quantity of the task in the task and current queue needing to recover;By the execution time of described needing and recovering of task divided by described total quantity, obtain the second subvalue;The cycle of the task in each described current queue is increased described second subvalue, to increase the integral cycle of the second new task collection after changing.
In this technical scheme, the task of recovering this type for cancelling task changes corresponding A PEDF task distribution function.In the related, in EDF algorithm, when needs to cancel task recover time, other distributed tasks continue to press primitive period EDF algorithm and perform, there will be free time, this vehicle road cooperation data distribution efficiency often led in car networking reduces, and the improvement that APEDF algorithm does just on the basis of EDF algorithm.
Specifically, when needs to cancel task recover time, the time average that performs of this task is added to the cycle of other tasks, the equal portions of the quantity of other tasks it are divided into by execution time of this task, and be that cycle of other tasks each is plus these equal portions, so that the duty cycle entirety of new task collection restores to the original state, meet UEDF< 1.
By this technical scheme, optimize EDF distribution algorithms so that it makes full use of the free time of distribution, to improve data distribution efficiency and handling capacity under car networked environment.
In any of the above-described technical scheme, preferably, when the insertion that the type that described task changes is described burst aperiodicity task, step 204 includes: interrupt this subtask, burst aperiodicity task is inserted the head of task queue, and after described burst aperiodicity tasks carrying, initialize described task queue.
In this technical scheme, when there is the insertion of burst aperiodicity task, can directly interrupt this subtask, burst aperiodicity task is inserted the head of task queue, to perform, so, the insertion for the aperiodicity task that happens suddenly provides counter-measure, solves EDF algorithm and considers not enough problem for traffic unexpected incidents distributed tasks.
In any of the above-described technical scheme, preferably, when the insertion that described task change type is described periodic task, step 204 includes: when having detected that task queue is inserted in periodic task request, whether the current task first detecting described task queue is finished;When the current task described task queue being detected is finished, calculates the off period of the periodic task needing insertion, and compare the off period of next task of described task queue and the off period of the periodic task of described needs insertion;When off period of next task of described task queue less than or equal to the described off period of periodic task needing and inserting time, after the described periodic task needing to insert is inserted into next task of described task queue, when off period of next task of described task queue more than the described off period of periodic task needing and inserting time, the described periodic task needing to insert is inserted into the head of described task queue.
In this technical scheme, during the insertion of generating period task, can the current task of first Detection task queue whether be finished, after determining that it is finished, when off period of next task of task queue less than or equal to off period of the periodic task to insert time, after the periodic task that will insert is inserted into next task of task queue, thus the insertion avoiding this periodic task upsets tasks carrying queue.When the off period of described next task of task queue more than the described off period inserting task time, described task of inserting is inserted into task queue head.The periodic task that the preferential execution off period is the shortest, it is ensured that the real-time of traffic data distribution.
Fig. 3 illustrates that task change according to an embodiment of the invention processes the block diagram of device.
As it is shown on figure 3, task change according to an embodiment of the invention processes device 300, including: monitor in real time unit 302 and task change processing unit 304.
Wherein, whether monitor in real time unit 302 is for occurring task to change in the networking of monitor in real time car;Task changes processing unit 304 for the type changed according to described task, performs the task distribution function that described type is corresponding.
In this technical scheme, when in monitoring car networking, generation task changes, can first determine the type that task changes, such that it is able to provide the task distribution function corresponding with the type that this task changes, such as, the task of cancelling this type that can arrange task changes corresponding A PEDF (AlterablePeriodEDF, time limit variable cycle priority algorithm) task distribution function.By this technical scheme, corresponding solution can be provided according to the type that task changes, avoid causing data distribution real-time weak because adopting the single algorithm mechanism such as FCFS or EDF or the problems such as not enough being considered for traffic unexpected incidents distributed tasks, to improve data distribution efficiency under car networked environment.
In technique scheme, it is preferable that the type that described task changes includes: the cancellation of task, cancel the insertion of the recovery of task, the insertion of burst aperiodicity task and periodic task.
In this technical scheme, the type that task changes includes the cancellation of task, cancels the insertion of the recovery of task, the burst insertion of aperiodicity task and periodic task, certainly, the type that task changes can also include other change types in addition as required, corresponding solution is provided, it is to avoid cause data distribution real-time weak because adopting the single algorithm mechanism such as FCFS or EDF or the problems such as not enough are considered for traffic unexpected incidents distributed tasks by the type changed according to task.
In any of the above-described technical scheme, preferably, task changes processing unit 304 and includes: first subvalue's computing unit 3042, when the cancellation that the type that described task changes is described task, determine the quantity of other tasks in the current queue beyond the task of needing to cancel, and by the execution time of described needing and cancelling of task divided by described quantity, obtain the first subvalue;Cycle reduction unit 3044, reduces described first subvalue by the cycle of other tasks in each described current queue, to reduce the integral cycle of the first new task collection after changing.
In this technical scheme, the task of cancelling this type for task changes corresponding A PEDF task distribution function.In the related, in EDF algorithm, when a certain distributed tasks is cancelled, other distributed tasks continue to press primitive period EDF algorithm and perform, there will be free time, this vehicle road cooperation data distribution efficiency often led in car networking reduces, and the improvement that APEDF algorithm does just on the basis of EDF algorithm.
Specifically, when a certain task is cancelled, by the execution time average cutting of this task in the cycle of other tasks, the equal portions of the quantity of other tasks it are divided into by execution time of this task, and the cycle for other tasks each deducts this equal portions, so that the duty cycle entirety of new task collection diminishes, processor utillization increases.
Such as, having the task-set 1 of a n periodic duty, 2 ..., n, it performs time respectively C1、C2、……、Cn, its cycle respectively T1、T2、......、Tn, after starting to perform a period of time, task 1 is cancelled, then now task-set become 2,3 ..., n, the cycle is T respectively2、T3、……、TnIf using EDF algorithm, then processor utillization is
U E D F = C 2 T 2 + C 3 T 3 + ... + C n , T n
And APEDF algorithm is after task 1 is cancelled, by the execution time average cutting of this task in the cycle of other tasks, the cycle of APEDF task-set becomes Its processor utillization is:
U A P E D F = C 2 T 2 - C 1 n - 1 + C 3 T 3 - C 1 n - 1 + ... + C n , T n - C 1 n - 1
It should be evident that UAPEDF> UEDF, therefore, by this technical scheme, using APEDF algorithm to improve processor utillization, thus improve the utilization rate of the free time after task is cancelled, making tasks carrying improved efficiency, certainly, also solve the problem that FCFS data distribution real-time is weak.
In any of the above-described technical scheme, preferably, task changes processing unit 304 and includes: second subvalue's computing unit 3046, when having cancelled the recovery of task described in the type that described task changes is, determine the total quantity of task in the task and current queue needing to recover, and by the execution time of described needing and recovering of task divided by described total quantity, obtain the second subvalue;Cycle increases unit 3048, and the cycle of the task in each described current queue is increased described second subvalue, to increase the integral cycle of the second new task collection after changing.
In this technical scheme, the task of recovering this type for cancelling task changes corresponding A PEDF task distribution function.In the related, in EDF algorithm, when needs to cancel task recover time, other distributed tasks continue to press primitive period EDF algorithm and perform, there will be free time, this vehicle road cooperation data distribution efficiency often led in car networking reduces, and the improvement that APEDF algorithm does just on the basis of EDF algorithm.
Specifically, when needs to cancel task recover time, the time average that performs of this task is added to the cycle of other tasks, the equal portions of the quantity of other tasks it are divided into by execution time of this task, and be that cycle of other tasks each is plus these equal portions, so that the duty cycle entirety of new task collection restores to the original state, meet UEDF< 1.
By this technical scheme, optimize EDF distribution algorithms so that it makes full use of the free time of distribution, to improve data distribution efficiency and handling capacity under car networked environment.
In any of the above-described technical scheme, preferably, task changes processing unit 304 and includes: the first burst handling unit 30410, when the insertion that the type that described task changes is described burst aperiodicity task, interrupt this subtask, burst aperiodicity task is inserted the head of task queue, and after described burst aperiodicity tasks carrying, initializes described task queue.
In this technical scheme, when there is the insertion of burst aperiodicity task, can directly interrupt this subtask, burst aperiodicity task is inserted the head of task queue, to perform, so, the insertion for the aperiodicity task that happens suddenly provides counter-measure, solves EDF algorithm and considers not enough problem for traffic unexpected incidents distributed tasks.
In any of the above-described technical scheme, it is preferable that task changes processing unit 304 and includes: the second burst handling unit 30412, when having detected that described current queue is inserted in periodic task request, it is determined that whether described task queue current task is finished;Off period judging unit 30414, when determining that described task queue current task is finished, compare the off period of described next task of task queue and the off period of the described periodic task to insert, wherein, when the off period of described next task of task queue less than or equal to off period of the described periodic task to insert time, after the described periodic task to insert is inserted into next task of described task queue, when the off period of described next task of task queue more than off period of the described periodic task to insert time, the described periodic task to insert is inserted into the head of described task queue.
In any of the above-described technical scheme, preferably, task changes processing unit 304 and includes: the second burst handling unit 30412, when the insertion that described task change type is described periodic task, when having detected that task queue is inserted in periodic task request, whether the current task first detecting described task queue is finished;Off period judging unit 30414, when the current task described task queue being detected is finished, calculate the off period of the periodic task needing insertion, and compare the off period of next task of described task queue and the off period of the periodic task of described needs insertion;And task changes processing unit 304 and is additionally operable to: when off period of next task of described task queue less than or equal to the described off period of periodic task needing and inserting time, after the described periodic task needing to insert is inserted into next task of described task queue, when off period of next task of described task queue more than the described off period of periodic task needing and inserting time, the described periodic task needing to insert is inserted into the head of described task queue.
In this technical scheme, during the insertion of generating period task, can the current task of first Detection task queue whether be finished, after determining that it is finished, when off period of next task of task queue less than or equal to off period of the periodic task to insert time, after the periodic task that will insert is inserted into next task of task queue, thus the insertion avoiding this periodic task upsets tasks carrying queue.When the off period of described next task of task queue more than the described off period inserting task time, described task of inserting is inserted into task queue head.The periodic task that the preferential execution off period is the shortest, it is ensured that the real-time of traffic data distribution.
Fig. 4 illustrates the block diagram of car networked server according to an embodiment of the invention.
As shown in Figure 4, car networked server 400 according to an embodiment of the invention, processes device 300 including the task change shown in Fig. 3, therefore, this car networked server 400 has the technique effect identical with the task change process device 300 shown in Fig. 3, does not repeat them here.
Fig. 5 illustrates the flow chart of task changing process method according to another embodiment of the invention.
As it is shown in figure 5, task changing process method according to another embodiment of the invention, including:
Step 502, TransferService (car networked server) service background turn-on data distributed tasks scheduler.
Whether step 504, open thread and monitor and have task to cancel or recover, when determine have task to cancel or recover time, enter step 506, otherwise, terminate process.
Step 506, performs APEDF algorithm.
Wherein, when a certain task is cancelled, by the execution time average cutting of this task in the cycle of other tasks, the equal portions of the quantity of other tasks it are divided into by execution time of this task, and the cycle for other tasks each deducts this equal portions, so that the duty cycle entirety of new task collection diminishes, processor utillization increases.
Such as, having the task-set 1 of a n periodic duty, 2 ..., n, it performs time respectively C1、C2、……、Cn, its cycle respectively T1、T2、......、Tn, after starting to perform a period of time, task 1 is cancelled, then now task-set become 2,3 ..., n, the cycle is T respectively2、T3、……、TnIf using EDF algorithm, then processor utillization is
U E D F = C 2 T 2 + C 3 T 3 + ... + C n , T n
And APEDF algorithm is after task 1 is cancelled, by the execution time average cutting of this task in the cycle of other tasks, the cycle of APEDF task-set becomes Its processor utillization is:
U A P E D F = C 2 T 2 - C 1 n - 1 + C 3 T 3 - C 1 n - 1 + ... + C n , T n - C 1 n - 1
It should be evident that UAPEDF> UEDF, therefore, by this technical scheme, using APEDF algorithm to improve processor utillization, thus improve the utilization rate of the free time after task is cancelled, making tasks carrying improved efficiency, certainly, also solve the problem that FCFS data distribution real-time is weak.
In like manner, when needs to cancel task recover time, the time average that performs of this task is added to the cycle of other tasks, the equal portions of the quantity of other tasks it are divided into by execution time of this task, and be that cycle of other tasks each is plus these equal portions, so that the duty cycle entirety of new task collection restores to the original state, meet UEDF< 1.
Step 508, opens thread monitors whether there is pop-up mission Task (), when determine have pop-up mission Task () time, enter step 510, otherwise, terminate process.
Step 510, interrupts current task at once, and APEDF_head points to Task ().Wherein, when there is the insertion of burst aperiodicity task, can directly interrupt this subtask, burst aperiodicity task is inserted the head of task queue, to perform, so, the insertion for the aperiodicity task that happens suddenly provides counter-measure, solves EDF algorithm and considers not enough problem for traffic unexpected incidents distributed tasks.
Step 512, Task () has performed.
Step 514, initializes task queue according to the initial cutoff phase.
Step 516, has detected whether that insertion task arrives, and when testing result is no, enters step 518, when the test results is yes, enters step 520.
Step 518, continues executing with by task queue.
Step 520, it is judged that whether this subtask is finished, when judged result is no, enters step 524, when judged result is for being, enters step 522.
Step 522, calculates the off period of inserting of task.
Step 524, waits this subtask and completes.
Step 526, it is judged that the off period of next task of task queue, whether less than the off period of inserting of task, when judged result is no, enters step 530, when judged result is for being, entrance step 528.
Wherein, when there is the insertion of burst aperiodicity task, can first detect whether this subtask is finished, only when the off period of this subtask is not less than the off period of described burst aperiodicity task, just interrupt this subtask, burst aperiodicity task is inserted the head of described task queue, thus the insertion avoiding burst aperiodicity task upsets tasks carrying queue, so, insertion for the aperiodicity task that happens suddenly provides counter-measure, solves EDF algorithm and considers not enough problem for traffic unexpected incidents distributed tasks.
Step 528, after will inserting of task is inserted into next task of task queue, and performs next task.
Step 530, will inserting of task is inserted into task queue head, and APEDF_head points to this task.
In this application, car networking data distributed tasks collection is as shown in table 1 below.
Table 1
According to table 1 it can be seen that each Charge-de-Mission distributes such content-data, Task () refers to the task of distribution incident data, and wherein the cycle for the real-time task distribution of Task1 to Taskn is relatively small, but still has T1<T2…<Tn, the cycle distributed for the task that the real-time of Taskn+1 to Taskm is weak is relatively large, wherein Tn+1<Tn+2…<Tm, according to the priority entirety of the known Task1 to Taskn of APEDF algorithm principle higher than Taskn+1 to Taskm, reach the purpose of the real-time data of preferential distribution.
Fig. 6 illustrates the schematic diagram that task class according to an embodiment of the invention is distributed.
When carrying out data distribution, it is necessary first to structure data distributed tasks class, in this programme, for each task creation, one such object stores such relevant information.Wherein, member variable has priod, time, number, number to refer to the cycle times that this generic task has performed, and adopting static variable so lower cycle is number+1 by the document number of transmission.Fileurl refers to transmit file path.In function, setPriod () refers to arrange this duty cycle, and when a certain task disappears, the cycle amendment of other task also realizes in setPriod ().Numberadd () refers to that often completing a cycle then number adds 1, it is therefore an objective to arrive to use transfer () function transfer next one file in next cycle of this task.
In this programme, adopting timer driver mode, whenever a periodic duty arrives, will carry out judgement once, it is judged that the off period of new task and the off period of subtask, update task queue, data transfer task performs according to queue.
Fig. 7 and Fig. 8 illustrates execution result schematic diagram according to an embodiment of the invention.
It is possible, firstly, to distribution tri-tasks of Task1, Task2, Task3, execution time respectively 1s, 2s, 1s of three tasks, duty cycle is 3s, 4s, 6s respectively, and release time is 0s, 0s, 0s respectively.
Perform result under linux as it is shown in fig. 7, execution sequence is it can be seen that APEDF distribution method is always according to the preferential execution the earliest of current expiration phase from figure, reach to perform in real time the purpose of distributed tasks.
When tri-tasks carryings of Task1, Task2, Task3 are to 12s, cancel Task1 task, obtain shown in new execution result Fig. 8.
As can be seen from Figure 8 after cancelling Task1 task, the duty cycle of Task2 and Task3 decreases 0.5 second respectively, thus newly Task2 duty cycle is just 3.5 seconds, new Task3 duty cycle is just 5.5 seconds, processor utillization has been brought up to 75.32% by 66.67%, substantially increases distribution efficiency.
Technical scheme is described in detail above in association with accompanying drawing, pass through technical scheme, corresponding solution can be provided according to the type that task changes, avoid causing data distribution real-time weak because adopting the single algorithm mechanism such as FCFS or EDF or the problems such as not enough being considered for traffic unexpected incidents distributed tasks, to improve data distribution efficiency under car networked environment.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, for a person skilled in the art, the present invention can have various modifications and variations.All within the spirit and principles in the present invention, any amendment of making, equivalent replacement, improvement etc., should be included within protection scope of the present invention.

Claims (13)

1. a task changing process method, it is characterised in that including:
Whether the networking of monitor in real time car occur task to change;
According to the type that described task changes, perform the task distribution function that described type is corresponding.
2. task changing process method according to claim 1, it is characterised in that the type that described task changes includes: the cancellation of task, cancel the insertion of the recovery of task, the insertion of burst aperiodicity task and periodic task.
3. task changing process method according to claim 2, it is characterised in that when the cancellation that the type that described task changes is described task, the task distribution function that the described type of described execution is corresponding, including:
Determine the quantity of other tasks in the current queue beyond the task of needing to cancel;
By the execution time of described needing and cancelling of task divided by described quantity, obtain the first subvalue;
The cycle of other tasks in each described current queue is reduced described first subvalue, to reduce the integral cycle of the first new task collection after changing.
4. the task changing process method according to Claims 2 or 3, it is characterised in that when having cancelled the recovery of task described in the type that described task changes is, the task distribution function that the described type of described execution is corresponding, including:
Determine the total quantity of task in the task and current queue needing to recover;
By the execution time of described needing and recovering of task divided by described total quantity, obtain the second subvalue;
The cycle of the task in each described current queue is increased described second subvalue, to increase the integral cycle of the second new task collection after changing.
5. task changing process method according to claim 2, it is characterised in that when the insertion that the type that described task changes is described burst aperiodicity task, the task distribution function that the described type of described execution is corresponding, including:
Interrupt this subtask, burst aperiodicity task is inserted the head of task queue, and after described burst aperiodicity tasks carrying, initializes described task queue.
6. task changing process method according to claim 2, it is characterised in that when the insertion that described task change type is described periodic task, the task distribution function that the described type of described execution is corresponding, including:
When having detected that task queue is inserted in periodic task request, whether the current task first detecting described task queue is finished;
When the current task described task queue being detected is finished, calculates the off period of the periodic task needing insertion, and compare the off period of next task of described task queue and the off period of the periodic task of described needs insertion;
When off period of next task of described task queue less than or equal to the described off period of periodic task needing and inserting time, after the described periodic task needing to insert is inserted into next task of described task queue, when off period of next task of described task queue more than the described off period of periodic task needing and inserting time, the described periodic task needing to insert is inserted into the head of described task queue.
7. a task change processes device, it is characterised in that including:
Whether monitor in real time unit, occur task to change in the networking of monitor in real time car;
Task changes processing unit, according to the type that described task changes, performs the task distribution function that described type is corresponding.
8. task change according to claim 7 processes device, it is characterised in that the type that described task changes includes: the cancellation of task, cancel the insertion of the recovery of task, the insertion of burst aperiodicity task and periodic task.
9. task change according to claim 8 processes device, it is characterised in that described task changes processing unit and includes:
First subvalue's computing unit, when the cancellation that the type that described task changes is described task, determine the quantity of other tasks in the current queue beyond the task of needing to cancel, and by the execution time of described needing and cancelling of task divided by described quantity, obtain the first subvalue;
Cycle reduction unit, reduces described first subvalue by the cycle of other tasks in each described current queue, to reduce the integral cycle of the first new task collection after changing.
10. task change according to claim 8 or claim 9 processes device, it is characterised in that described task changes processing unit and includes:
Second subvalue's computing unit, when having cancelled the recovery of task described in the type that described task changes is, determine the total quantity of task in the task and current queue needing to recover, and by the execution time of described needing and recovering of task divided by described total quantity, obtain the second subvalue;
Cycle increases unit, and the cycle of the task in each described current queue is increased described second subvalue, to increase the integral cycle of the second new task collection after changing.
11. task change according to claim 8 processes device, it is characterised in that described task changes processing unit and includes:
First burst handling unit, when the insertion that the type that described task changes is described burst aperiodicity task, interrupt this subtask, burst aperiodicity task is inserted the head of task queue, and after described burst aperiodicity tasks carrying, initialize described task queue.
12. task change according to claim 8 processes device, it is characterised in that described task changes processing unit and includes:
Second burst handling unit, when the insertion that described task change type is described periodic task, when having detected that task queue is inserted in periodic task request, whether the current task first detecting described task queue is finished;
Off period judging unit, when the current task described task queue being detected is finished, calculates the off period of the periodic task needing insertion, and compares the off period of next task of described task queue and the off period of the periodic task of described needs insertion;And
Described task changes processing unit and is additionally operable to:
When off period of next task of described task queue less than or equal to the described off period of periodic task needing and inserting time, after the described periodic task needing to insert is inserted into next task of described task queue, when off period of next task of described task queue more than the described off period of periodic task needing and inserting time, the described periodic task needing to insert is inserted into the head of described task queue.
13. a car networked server, it is characterised in that include the task change as according to any one of claim 7 to 12 and process device.
CN201610108923.8A 2016-02-26 2016-02-26 Task change processing method, task change processing apparatus and internet-of-vehicles server Pending CN105808330A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610108923.8A CN105808330A (en) 2016-02-26 2016-02-26 Task change processing method, task change processing apparatus and internet-of-vehicles server

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610108923.8A CN105808330A (en) 2016-02-26 2016-02-26 Task change processing method, task change processing apparatus and internet-of-vehicles server

Publications (1)

Publication Number Publication Date
CN105808330A true CN105808330A (en) 2016-07-27

Family

ID=56465805

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610108923.8A Pending CN105808330A (en) 2016-02-26 2016-02-26 Task change processing method, task change processing apparatus and internet-of-vehicles server

Country Status (1)

Country Link
CN (1) CN105808330A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111353719A (en) * 2020-03-11 2020-06-30 深圳市元征科技股份有限公司 Diagnostic task execution method, device, equipment and medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103236180A (en) * 2013-01-21 2013-08-07 杭州路享科技有限公司 Vehicular information interactive interface method
CN104580335A (en) * 2013-10-29 2015-04-29 上海沐风数码科技有限公司 3G communication technology-based intelligent internet-of-vehicle vehicle-mounted terminal
CN104683405A (en) * 2013-11-29 2015-06-03 国际商业机器公司 Method and device for distributing map matching task by cluster server in Internet of Vehicles

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103236180A (en) * 2013-01-21 2013-08-07 杭州路享科技有限公司 Vehicular information interactive interface method
CN104580335A (en) * 2013-10-29 2015-04-29 上海沐风数码科技有限公司 3G communication technology-based intelligent internet-of-vehicle vehicle-mounted terminal
CN104683405A (en) * 2013-11-29 2015-06-03 国际商业机器公司 Method and device for distributing map matching task by cluster server in Internet of Vehicles

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
陈皓: "《基于Wi-Fi Direct的车路协同数据分发技术》", 《中国优秀硕士学位论文全文数据库》 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111353719A (en) * 2020-03-11 2020-06-30 深圳市元征科技股份有限公司 Diagnostic task execution method, device, equipment and medium

Similar Documents

Publication Publication Date Title
WO2016074538A1 (en) Sent order ranking system and method for reducing no-load running and waiting time in online taxi renting
CN112508616A (en) Order allocation method and device
WO2020019543A1 (en) Electric vehicle domain architecture vehicle network system, domain collaborative processing method and domain control device
JP5843020B2 (en) Communication apparatus and communication method
CN105644558B (en) A kind of vehicle communication message treatment method and system
RU2017135412A (en) MANAGEMENT OF VEHICLE NAVIGATION THROUGH CROSSROADS
CN110910019B (en) Data processing method and device, electronic equipment and computer readable storage medium
WO2007092406A3 (en) Methods and systems for reducing burst usage of a networked computer system
CN107845253B (en) Reservation order early warning method and server
CN108629642B (en) Order processing method and device
CN107612774B (en) Multi-channel synchronous sleeping method and system
CN108399779B (en) Vehicle scheduling processing method, device, equipment and storage medium
US20190171895A1 (en) Autonomous vehicle adaptive parallel image processing system
CN112590889B (en) Rail transit operation control system and control method
KR101073428B1 (en) Method for scheduling task in embedded operating system of automobile
CN107977257A (en) A kind of method for scheduling task and device
CN109963325A (en) A kind of localization method based on base station, device and equipment
CN105808330A (en) Task change processing method, task change processing apparatus and internet-of-vehicles server
CN113085722A (en) Vehicle control method, electronic device, and computer-readable medium
CN108512917B (en) Data pushing method and system based on Websocket
CN116430738B (en) Self-adaptive dynamic scheduling method of hybrid key system
CN105141649A (en) System and method for transmitting data of vehicle
CN108347781B (en) A kind of information transferring method and device
CN105975355B (en) A kind of drawing practice, device and mobile device
JP2009278366A (en) Roadside device, communication method of roadside device, and communication program

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

Application publication date: 20160727

RJ01 Rejection of invention patent application after publication