CN111010187B - BCM load feedback AD sampling time-sharing scheduling method - Google Patents

BCM load feedback AD sampling time-sharing scheduling method Download PDF

Info

Publication number
CN111010187B
CN111010187B CN201911365061.7A CN201911365061A CN111010187B CN 111010187 B CN111010187 B CN 111010187B CN 201911365061 A CN201911365061 A CN 201911365061A CN 111010187 B CN111010187 B CN 111010187B
Authority
CN
China
Prior art keywords
group
time
sampling
members
level
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.)
Active
Application number
CN201911365061.7A
Other languages
Chinese (zh)
Other versions
CN111010187A (en
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.)
Dongfeng Electronic Technology Co ltd
Original Assignee
Dongfeng Electronic Technology 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 Dongfeng Electronic Technology Co ltd filed Critical Dongfeng Electronic Technology Co ltd
Priority to CN201911365061.7A priority Critical patent/CN111010187B/en
Publication of CN111010187A publication Critical patent/CN111010187A/en
Application granted granted Critical
Publication of CN111010187B publication Critical patent/CN111010187B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M1/00Analogue/digital conversion; Digital/analogue conversion
    • H03M1/66Digital/analogue converters

Abstract

The invention relates to a time-sharing scheduling method for an AD sampling fed back by a BCM load, which comprises the following steps: (1) Dividing each control object into a plurality of groups with different grades according to the time precision requirement of the BCM control object, and numbering each member of each group in sequence; (2) Setting reference time slices, wherein each reference time slice executes a sampling channel of a member of a group, the members in each group are sequentially sampled from the group with the highest level, when the sampling of the group with the non-highest level is executed, the time precision period of the group with the higher level arrives, the group with the higher level is preferentially executed until all the members of the group with the higher level are sampled, and the sampling of the group with the non-highest level is continued until all the members of the group with the lowest level are sampled.

Description

Time-sharing scheduling method for AD sampling of BCM load feedback
Technical Field
The invention relates to the technical field of automotive electronics, in particular to a fault detection function, and specifically relates to a BCM load feedback AD sampling time-sharing scheduling method.
Background
The BCM is used as an important component of the vehicle body electronics, controls a plurality of output objects, and simultaneously carries out AD sampling on the feedback of the output objects to obtain a current value or a voltage value so as to realize a fault detection function. Different control objects have different time precision requirements, and as the number of the control objects increases, the number of samples also increases, and the total sampling time consumption of each time precision is larger.
Therefore, there is a need to provide a method for uniformly managing the sampling of the control objects with different time precisions, rationalizing the time slices of the system, and reducing the MCU resource occupancy rate.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides a BCM load feedback AD sampling time-sharing scheduling method for improving the sampling efficiency and reducing the occupation rate of MCU resources.
In order to achieve the purpose, the time-sharing scheduling method for the BCM load feedback AD sampling comprises the following steps:
the method comprises the following steps:
(1) Dividing each control object into a plurality of groups with different grades according to the time precision requirement of the BCM control object, and numbering each member of each group in sequence;
(2) Setting reference time slices, each reference time slice executing a sampling channel of a member of a group, starting from the group with the highest level, sequentially sampling the members in each group according to the reference time slices, and when the sampling of the group with the non-highest level is executed, the time precision period of the group with the higher level arrives, preferentially executing the group with the higher level until all the members of the group with the higher level are sampled, and continuing the sampling of the group with the non-highest level until all the members of the group with the lowest level are sampled.
Preferably, the method comprises the steps of:
(3) If the time precision period of the highest-level packet does not arrive, entering an idle period, waiting for the arrival of the time precision period of the highest-level packet, and repeating the steps (1) to (2);
and (3) if the time precision period of the highest-level packet arrives, directly repeating the steps (1) to (2).
Preferably, the number of members in each group is set such that the time at which all members in the group are sampled does not exceed the time accuracy period of the group.
Preferably, in the step (1), when the time precision requirement of the control object changes, the group in which the control object is located is subdivided.
Therefore, in the method of the invention, the time precision grouping can be configured according to the actual need, and the members can be added or deleted according to the actual need, so that the flexibility is high; the high-level time precision is preferentially guaranteed to be executed, the low-level time precision is executed in the remaining time, each reference time slice samples one channel, time management is dispersed, and the efficiency of unit time is improved; when a certain packet is sampled, the packet with lower time precision is immediately executed, when the packet with lower time precision is not executed, the execution cycle of the packet with higher execution time precision is reached, the packet with high execution time precision is executed, and after the execution cycle is completed, the rest part of the packet with lower time precision is executed, so that the system time slice is rationalized, and the occupancy rate of MCU resources is reduced.
Drawings
Fig. 1 is a grouping schematic diagram of a BCM load feedback AD sampling time-sharing scheduling method of the present invention.
Fig. 2 is a flow chart of scheduling of sampling of a control object in the BCM load feedback AD sampling time-sharing scheduling method of the present invention.
Detailed Description
In order to more clearly describe the technical contents of the present invention, the following further description is given in conjunction with specific embodiments.
As shown in fig. 1-2, a BCM load feedback AD sampling time-sharing scheduling method of the present invention is disclosed, wherein the method comprises the following steps:
as shown in fig. 1, according to the time accuracy requirement of the BCM control object, each control object is divided into 3 groups with different levels, each member of each group is numbered in sequence, and the sampling sequence of each member in each group is performed according to the number.
The method comprises the following specific steps:
s101, placing a control object which has high time precision requirement and needs quick response in a No. 1 marshalling (time precision group 1), such as a brake lamp, a door lock and the like, and configuring a sampling channel which needs to be used;
s102, for control objects with medium time precision requirements, placing the control objects in a No. 2 grouping (time precision group 2), such as a left turn light, a right turn light and the like, and configuring sampling channels required to be used;
s103, for the control object with general time accuracy requirement, placing the control object in group No. 3 (time accuracy group 3), such as system operating voltage, turning lamp voltage, etc., and configuring the sampling channel that needs to be used.
Wherein the number of members within each group is set such that the time at which all members within the group have been sampled does not exceed the time accuracy period of the group.
When the time precision requirement of the control object is changed, the control object is divided into groups again, and the number of the groups is maintained; when the number of control objects changes, the number of group members is maintained.
As shown in fig. 2, in order to control the scheduling flow chart of object sampling, first, reference time slices are set, each reference time slice executes a sampling channel of one member of one packet, the members in each packet are sequentially sampled according to the reference time slices starting from the highest-level packet, when the sampling of a packet other than the highest-level packet is executed, the time precision cycle of a higher-level packet arrives, the higher-level packet is preferentially executed, and until all the members of the higher-level packet are sampled, the sampling of the packet other than the highest-level packet is continued until all the members of the lowest-level packet are sampled.
The group with the highest time precision is sampled firstly according to the member number sequence, after all the members of the group are sampled, the group with the second highest time precision is sampled according to the member number sequence, and the rest is analogized;
when the group execution time with higher time precision arrives again, the group is sampled preferentially, after all the group members are sampled, the rest members of the group with the second highest time precision are executed again, and the rest members are analogized;
and closing the reference time slice until the sampling of all the group members is completed, and then starting the next sampling.
Taking grouping of 3 grades as an example for explanation, the specific steps are as follows:
s201, firstly, sequentially sampling the members of the time precision group 1 according to reference time slices, wherein each reference time slice executes a sampling channel of one member until all the members in the time precision group 1 are completely sampled;
s202, sequentially sampling the members of the time precision group 2 according to a reference time slice;
s203, when the scheduling period of the time precision group 1 is up, the sampling of the time precision group 1 is performed preferentially until the members in the time precision group 1 finish sampling in sequence;
s204, continuously sampling the rest members of the time precision group 2 in sequence until all the members in the time precision group 2 are sampled;
s205, sequentially sampling the members of the time precision group 3 according to the reference time slice, and closing the reference time slice until all the members in the time precision group 3 are sampled;
s206, entering an idle period if the next sampling period does not arrive;
and S207, in the next sampling period, the scheduling period of the time precision group 1 arrives again, sampling is performed from the time precision group 1, and the steps are repeated.
In step S206, when the scheduling period of time accuracy group 1 arrives in the next sampling period, sampling is performed from time accuracy group 1, and the process is repeated.
Further, with the highest level of time accuracy as the sampling on time, one reference time slice, each sampling one packet member, is turned on at the start of sampling. After the sampling of each member of all groups is completed, the reference time slice is closed until the next sampling on time is reached.
Therefore, in the method of the invention, the time precision grouping can be configured according to the actual needs, and members can be added or deleted according to the actual needs, so that the flexibility is high; the high-level time precision is preferentially guaranteed to be executed, the low-level time precision is executed in the remaining time, each reference time slice samples one channel, time management is dispersed, and the efficiency of unit time is improved; when a certain packet is sampled, the packet with lower time precision is immediately executed, when the packet with lower time precision is not executed, the execution period of the packet with higher execution time precision arrives, the packet with high execution time precision is executed, and after the execution period is completed, the rest part of the packet with lower time precision is executed, so that the system time slice is rationalized, and the occupancy rate of MCU resources is reduced.
In this specification, the invention has been described with reference to specific embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.

Claims (4)

1. A BCM load feedback AD sampling time-sharing scheduling method is characterized by comprising the following steps:
(1) Dividing each control object into a plurality of groups with different levels according to the time precision requirement of the BCM control object, and numbering each member of each group in sequence;
(2) Setting reference time slices, each reference time slice executing a sampling channel of a member of a group, starting from the group with the highest level, sequentially sampling the members in each group according to the reference time slices, and when the sampling of the group with the non-highest level is executed, the time precision period of the group with the higher level arrives, preferentially executing the group with the higher level until all the members of the group with the higher level are sampled, and continuing the sampling of the group with the non-highest level until all the members of the group with the lowest level are sampled.
2. The BCM load feedback AD sampling time-sharing scheduling method of claim 1, wherein said method comprises the steps of:
(3) If the time precision period of the highest-level packet does not arrive, entering an idle period, waiting for the time precision period of the highest-level packet to arrive, and repeating the steps (1) to (2);
and (3) if the time precision period of the highest-level packet arrives, directly repeating the steps (1) to (2).
3. The BCM load feedback AD sample time division scheduling method according to claim 1, wherein the number of members in each packet is set such that the time at which all the members in the packet are sampled does not exceed the time precision period of the packet.
4. The BCM load feedback AD sampling time-sharing scheduling method according to claim 1 or 3, wherein in said step (1), when the time accuracy requirement of the control object changes, the group where the control object is located is re-divided.
CN201911365061.7A 2019-12-26 2019-12-26 BCM load feedback AD sampling time-sharing scheduling method Active CN111010187B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911365061.7A CN111010187B (en) 2019-12-26 2019-12-26 BCM load feedback AD sampling time-sharing scheduling method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911365061.7A CN111010187B (en) 2019-12-26 2019-12-26 BCM load feedback AD sampling time-sharing scheduling method

Publications (2)

Publication Number Publication Date
CN111010187A CN111010187A (en) 2020-04-14
CN111010187B true CN111010187B (en) 2023-03-14

Family

ID=70117938

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911365061.7A Active CN111010187B (en) 2019-12-26 2019-12-26 BCM load feedback AD sampling time-sharing scheduling method

Country Status (1)

Country Link
CN (1) CN111010187B (en)

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030095536A1 (en) * 2001-11-16 2003-05-22 Hu Teck H. Multi-priority re-sequencing method and apparatus
JP4793652B2 (en) * 2004-10-21 2011-10-12 日本電気株式会社 Communication quality measuring apparatus and measuring method thereof
JP2008543142A (en) * 2005-05-24 2008-11-27 ノキア コーポレイション Method and apparatus for hierarchical transmission and reception in digital broadcasting
CN101548494B (en) * 2006-08-22 2013-08-21 丛林网络公司 Apparatus and method of controlled delay packet forwarding, and synchronization method
US8503483B2 (en) * 2007-05-04 2013-08-06 Cisco Technology, Inc. Synchronizing media data from multiple data channels for IP network transport
CN102209307A (en) * 2011-05-20 2011-10-05 中兴通讯股份有限公司 Time synchronization method and apparatus thereof
CN106114426B (en) * 2016-06-28 2019-02-15 广州汽车集团股份有限公司 A kind of Vehicular power management system and its control method
CN107454628B (en) * 2017-07-18 2020-09-08 西安电子科技大学 Packet scheduling method based on statistical load in competitive multiple access

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
王玮 ; .变电站共网共口传输实现方法.2015,(第S1期),全文. *

Also Published As

Publication number Publication date
CN111010187A (en) 2020-04-14

Similar Documents

Publication Publication Date Title
CN108122032B (en) Neural network model training method, device, chip and system
ATE375046T1 (en) GATE SEQUENCE CONTROL AND METHOD FOR SERVICE PROCESS CONTROL WITH GUARANTEES AND HIERARCHICAL RATE LIMITING WITH OR WITHOUT OVERBOOKING POSSIBILITY
CN105825040A (en) Short-term power load prediction method
CN108805325B (en) Production planning and scheduling integrated optimization method
CN101419615A (en) Method and apparatus for synchronizing foreground and background databases
CN111010187B (en) BCM load feedback AD sampling time-sharing scheduling method
US20160055035A1 (en) Multiple simultaneous request resource management
CN110543699B (en) Shared vehicle travel data simulation and shared vehicle scheduling method, device and equipment
CN108136930B (en) Method for controlling a charging process
CN105631134A (en) Batched random mechanism for chip random verification
CN109890735B (en) Estimating passenger number in elevator system
CN102662744B (en) FPGA task scheduling method based on condition preemption
CN106897199B (en) Batch job execution time prediction method based on big data processing framework
CN102508720B (en) Method for improving efficiency of preprocessing module and efficiency of post-processing module and system
Shen et al. Vehicle scheduling based on variable trip times with expected on‐time performance
CN110850954A (en) Energy consumption optimization method based on fixed priority event triggering mixed key accidental tasks
KR101144502B1 (en) Method for scheduling Time Triggered Controller Area Network
CN110348818B (en) Intelligent process processing method and system for process engine
US8564465B2 (en) Analog to digital conversion apparatus with a reduced number of ADCs
Zadorozhnyi Peculiarities and methods of fractal queues simulation
CN107391250B (en) Controller scheduling method for improving performance of Mapreduce task Shuffle
CN110955802A (en) Data barreling method and device, electronic equipment and storage medium
CN105553802B (en) A kind of data real-time reception method of isomery avionics network and bus
CN105072209B (en) The DNS data update method and system that a kind of pair of domain name is classified and listed in order of importance and urgency
CN110825504A (en) Server-based hybrid key accidental task energy consumption optimization method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant