CN115658257A - Scheduling method, device, equipment and storage medium based on automobile function service - Google Patents

Scheduling method, device, equipment and storage medium based on automobile function service Download PDF

Info

Publication number
CN115658257A
CN115658257A CN202211212036.7A CN202211212036A CN115658257A CN 115658257 A CN115658257 A CN 115658257A CN 202211212036 A CN202211212036 A CN 202211212036A CN 115658257 A CN115658257 A CN 115658257A
Authority
CN
China
Prior art keywords
service
scheduling
functional
functional service
atomic
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
CN202211212036.7A
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.)
Chongqing Selis Phoenix Intelligent Innovation Technology Co ltd
Original Assignee
Chengdu Seres 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 Chengdu Seres Technology Co Ltd filed Critical Chengdu Seres Technology Co Ltd
Priority to CN202211212036.7A priority Critical patent/CN115658257A/en
Publication of CN115658257A publication Critical patent/CN115658257A/en
Pending legal-status Critical Current

Links

Images

Abstract

The application relates to a scheduling method and device based on automobile function service, computer equipment and a storage medium. The method comprises the following steps: acquiring a currently running functional service, wherein the functional service comprises one or more atomic services; detecting whether the functional service generates a timing conflict when the atomic service is called; and if so, matching the functional service with a scheduling time sequence table to obtain a matching result corresponding to the functional service, and scheduling the functional service and/or the atomic service according to the matching result. By adopting the method, the time sequence and the safety of the automobile function service are improved.

Description

Scheduling method, device, equipment and storage medium based on automobile function service
Technical Field
The application relates to the technical field of vehicle control, in particular to a scheduling method, device, equipment and storage medium based on vehicle function service.
Background
With the rapid development of the automobile industry, the intelligent demand for automobiles is also continuously promoted, and various functional services are also applied to automobiles.
Because each module in the traditional automobile software architecture has high degree of association and strong coupling, when the automobile function service of each module is called, the problems of signal interaction, data circulation and the like commonly exist among the modules.
At present, in terms of the running process of the automobile function service, time sequence disorder of automobile service calling may be generated, secondary redundancy among modules may be caused, service conflict is caused, and even an automobile is out of control.
Disclosure of Invention
Based on the above, a scheduling method, a scheduling device, computer equipment and a storage medium based on the automobile function service are provided, and the problem of time sequence disorder during automobile service calling in the prior art is solved.
In one aspect, a scheduling method based on an automobile function service is provided, and the method includes:
acquiring a currently running functional service, wherein the functional service comprises one or more atomic services;
detecting whether the functional service generates a timing conflict when the atomic service is called;
and if so, matching the functional service with a scheduling time sequence table to obtain a matching result corresponding to the functional service, and scheduling the functional service and/or the atomic service according to the matching result.
In one embodiment, the matching the functional service with the scheduling schedule includes:
and matching the priority of the currently running functional service with the scheduling time sequence table, wherein the scheduling time sequence table comprises priority information, and the priority information is configured according to the type information of the functional service and/or the atomic service.
In one embodiment, before the matching the functional service with the scheduling timing table, the method further includes:
judging whether the functional service is a concurrent service or not;
if so, controlling the functional service to perform concurrent operation;
if not, performing priority matching on the currently running functional service and the scheduling time sequence table to obtain priority information of each functional service, and scheduling the functional service according to the priority information.
In one embodiment, the scheduling the functional service according to the priority information includes:
comparing the priority according to the priority information of the functional service;
and controlling the functional service with higher priority to run, and suspending the functional service with lower priority to run.
In one embodiment, if the functional service is a concurrent service, the method further includes:
detecting whether the functional service has a concurrent flow conflict or not;
and if so, performing priority matching on the currently running functional service and the scheduling time sequence table to obtain the priority information of each functional service, and scheduling the functional service according to the priority information.
In one embodiment, the detecting whether the functional service generates a timing conflict when the atomic service is invoked includes:
obtaining a first signal of the atomic service and a second signal of the functional service, and judging whether the same first signal corresponds to at least two second signals
If so, the functional service has a time sequence conflict when calling the atomic service;
if not, the functional service does not have a time sequence conflict when calling the atomic service.
In one embodiment, the scheduling method further includes:
constructing a data flow framework for automobile control according to the atomic service and the functional service;
collecting automobile operation data carried by the first signal and the second signal in the data flow frame;
and scheduling the atomic service and/or the functional service according to the automobile operation data so as to control the operation of the vehicle.
In another aspect, there is provided a scheduling apparatus based on an automobile function service, the apparatus including:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring the currently running functional service, and the functional service comprises one or more atomic services;
the judging module is used for detecting whether the functional service generates time sequence conflict when calling the atomic service;
and the scheduling module is used for matching the functional service with a scheduling time sequence table if the functional service is in the scheduling time sequence table, obtaining a matching result corresponding to the functional service, and scheduling the functional service and/or the atomic service according to the matching result.
In another aspect, a computer device is provided, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to perform the following steps:
acquiring a currently running functional service, wherein the functional service comprises one or more atomic services;
detecting whether the functional service generates a timing conflict when the atomic service is called;
and if so, matching the functional service with a scheduling time sequence table to obtain a matching result corresponding to the functional service, and scheduling the functional service and/or the atomic service according to the matching result.
In yet another aspect, a computer-readable storage medium is provided, having stored thereon a computer program which, when executed by a processor, performs the steps of:
acquiring a currently running functional service, wherein the functional service comprises one or more atomic services;
detecting whether the functional service generates a timing conflict when the atomic service is called;
and if so, matching the functional service with a scheduling time sequence table to obtain a matching result corresponding to the functional service, and scheduling the functional service and/or the atomic service according to the matching result.
According to the scheduling method, the scheduling device, the computer equipment and the storage medium based on the automobile function service, whether the atomic service calling conflict possibly exists among a plurality of function services is judged by acquiring the currently running function service and detecting whether a plurality of function services call the same atomic service; and if so, matching the functional service with a scheduling time sequence table to obtain a matching result corresponding to the functional service, and scheduling the functional service and/or the atomic service according to the matching result so as to enable scheduling execution of the automobile service to have time sequence. By the scheduling method based on the automobile function service, the automobile function service is subjected to time sequence management and scheduling, the redundancy among the function service modules is reduced, the time sequence disorder and the service conflict of the function service are avoided, and the time sequence of the automobile function service and the safety of the driving process are improved.
Drawings
FIG. 1 is a diagram of an exemplary implementation of a scheduling method for vehicle-based functional services;
FIG. 2 is a schematic flow chart diagram of a method for vehicle function service based dispatch in one embodiment;
FIG. 3 is a diagram illustrating the invocation of functional services and atomic services in one embodiment;
FIG. 4 is a block diagram showing a configuration of a scheduling apparatus based on a car function service in one embodiment;
FIG. 5 is a diagram of the internal structure of a computer device in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of and not restrictive on the broad application.
In the description of the present application, it is to be noted that, unless otherwise explicitly specified or limited, the terms "first" and "second" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implying any number of indicated technical features. Thus, features defined as "first", "second", may explicitly or implicitly include one or more of the described features. In the description of the present application, "a plurality" means two or more unless specifically limited otherwise. The specific meaning of the above terms in the present application can be understood by those of ordinary skill in the art as appropriate.
The scheduling method based on the automobile function service can be applied to the system architecture environment shown in fig. 1. The functional service 101, the atomic service 102, and the operating environment 103 communicate with each other through a network, where the network may be a CAN network, an ethernet network, and the like, and the application may be selected according to characteristics of each network. Optionally, middleware 104 for signal conversion may be further included to convert the CAN signal and/or the CANFD signal into a signal format supported by the application program interface.
The method comprises the steps of obtaining a currently running functional service, wherein the functional service comprises one or more atomic services; detecting whether the functional service generates a timing conflict when the atomic service is called; and if so, matching the functional service with a scheduling time sequence table to obtain a matching result corresponding to the functional service, and scheduling the functional service and/or the atomic service according to the matching result.
In one embodiment, as shown in fig. 2, a scheduling method based on car function service is provided, which is described by taking the method as an example applied to the system architecture environment in fig. 1, and includes the following steps:
step 201, acquiring a currently running functional service, wherein the functional service comprises one or more atomic services.
The functional services refer to automobile services with higher functional complexity, and relate to logic control algorithms with high algorithm complexity and the like. Atomic services refer to a series of operations with minimum granularity on business, and are characterized by loose coupling, relative independence and being some lower-layer services such as I/O services, storage services and the like, and more complex functional services can be realized through the combination of one or more atomic services. Both functional services and atomic services belong to the services of automobiles.
Specifically, the method includes the steps of obtaining function services currently operated by an automobile and atomic services called by the function services, wherein in the service operation process, signal interaction usually exists between a function service module and an atomic service module which are connected and communicated with each other, and the calling relation between the function services and the atomic services can be known by verifying whether the data types and/or signal names of signals are matched or not.
Step 202, detecting whether the functional service generates a time sequence conflict when the atomic service is called.
Referring to fig. 3, a schematic diagram of a call process of a functional service and an atomic service is shown, wherein it may be detected whether the same atomic service is called by at least two functional services at the same time, and/or whether the same atomic service is already called or occupied by another functional service when called by any functional service, so as to determine whether a timing conflict (call conflict) may be triggered.
And 203, if so, matching the functional service with a scheduling time sequence table to obtain a matching result corresponding to the functional service, and scheduling the functional service and/or the atomic service according to the matching result.
The scheduling time sequence table can be preset in an automobile or acquired from a cloud database, and is mainly configured with scheduling priority rules and used for preventing time sequence disorder and service calling conflict when service scheduling is carried out according to a certain priority sequence.
Specifically, the scheduling priority rule may set the priority of each functional service and/or atomic service in order of legal requirements, hardware enforceable states, functional policy requirements, personal safety requirements, vehicle safety requirements, user frequently-used functional requirements, user infrequently-used functional requirements, non-user functions, and the like. And matching the running functional service with the scheduling time sequence table to obtain the priority of the running functional service and the priority of the called atomic service.
It can be understood that in the process of scheduling the functional service, the service with high priority degree can be ensured to normally run, so as to avoid generating driving risk to cause the out-of-control of the automobile.
In the scheduling method based on the automobile function service, whether the calling conflict of the atomic service possibly exists among a plurality of function services is judged by acquiring the currently running function service and detecting whether the plurality of function services call the same atomic service; and if so, matching the functional service with a scheduling time sequence table to obtain a matching result corresponding to the functional service, and scheduling the functional service and/or the atomic service according to the matching result so as to enable scheduling execution of the automobile service to have time sequence. By the scheduling method based on the automobile function service, the automobile function service is subjected to time sequence management and scheduling, the redundancy among the function service modules is reduced, the time sequence disorder and the service conflict of the function service are avoided, and the time sequence of the automobile function service and the safety of the driving process are improved.
In one embodiment, the matching the functional service with the scheduling schedule includes:
and matching the priority of the currently running functional service with the scheduling time sequence table, wherein the scheduling time sequence table comprises priority information, and the priority information is configured according to the type information of the functional service and/or the atomic service.
In one embodiment, before the matching the functional service with the scheduling timing table, the method further includes:
judging whether the functional service is a concurrent service or not;
if so, controlling the functional service to perform concurrent operation;
if not, performing priority matching on the currently running functional service and the scheduling time sequence table to obtain priority information of each functional service, and scheduling the functional service according to the priority information.
The concurrent service refers to a service capable of supporting multiple services to run simultaneously, and it should be noted that the concurrent service is not equivalent to parallel, and the simultaneously running services may occur at the same time or may occur and keep running at multiple times within a period, and the essence is multiplexing of a central processing unit among multiple programs, so that the running efficiency of the service can be improved.
Specifically, if the currently running functional service supports concurrent running, it indicates that the precedence scheduling for the atomic service can occur in parallel, and the functional services do not affect each other.
If the currently running functional services do not support concurrent running, the services have stronger time sequence limitation, priority matching needs to be carried out on the currently running functional services and the scheduling time sequence table to obtain priority information of each functional service, and the functional services are scheduled according to the priority information.
Preferably, if the currently running functional service does not support concurrent running, conflict service screening may be performed, specifically, the functional service and the atomic service in which scheduling conflict occurs may be determined according to a signal of interaction between the functional service and the atomic service, and priority matching may be performed on the determined functional services, so as to improve service scheduling efficiency and avoid matching all services with the scheduling schedule.
In one embodiment, the scheduling the functional service according to the priority information includes:
comparing the priority according to the priority information of the functional service;
and controlling the functional service with higher priority to run, and suspending the functional service with lower priority to run.
Illustratively, after the priority of the front functional service and the priority of the rear functional service are compared, if the priority of the rear functional service is higher, the front functional service is suspended or stopped to run, and the rear functional service is run; if the priority of the former functional service is higher or the same as the priority of the latter functional service, the operation of the former functional service is continuously maintained, and the operation of the latter functional service is suspended or stopped.
In one embodiment, if the functional service is a concurrent service, the method further includes:
detecting whether the functional service has a concurrent flow conflict or not;
and if so, performing priority matching on the currently running functional service and the scheduling time sequence table to obtain the priority information of each functional service, and scheduling the functional service according to the priority information.
In addition to a time sequence conflict of atomic service calling, a concurrent flow conflict may also be generated during service operation, where the concurrent flow conflict refers to a conflict that may be generated during the operation of the concurrent service, and for example, a scheduling conflict of high voltage power on and off exists between high voltage maintenance and vehicle charging, and the high voltage power off may cause charging abnormality, so that the priority of the high voltage power off maintenance may be configured to be higher than the priority of the vehicle charging, and the vehicle charging function service may be interrupted during the high voltage power off maintenance, while the vehicle charging may not affect the high voltage power off maintenance service. For the scheduling policy, reference may be made to the scheduling control for the non-concurrent service in the foregoing embodiment, which is not described herein again.
It should be noted that, when the functional service is running or scheduled, the running data of the functional service may be compared with relevant national and/or international standard specifications, and if the running data exceeds the standard specifications, the running of the functional service should be prohibited.
In one embodiment, the method further comprises the step of scheduling the control strategy of the concurrent service across the domains:
it should be noted that, in the current architecture of the automotive domain control system, a plurality of control domains are divided, and different control domains are responsible for providing different functions, so that the priority problem also needs to be considered when the cross-domain functional service scheduling is faced.
Illustratively, the control policy for scheduling concurrent services across domains may be:
1. two or more parts with functions related to a power domain are used as main control, and a whole vehicle domain controller is selected as the main control in a centralized manner;
2. preferentially concentrating the sub-components to the function master control to judge, rather than judging by the sub-component which runs first in time sequence, and preferentially selecting the sub-component with higher priority as the master control;
3. in a scene which does not meet the enabling condition of a certain subsystem, the subsystem is temporarily set as a master control;
4. if the two functions are allowed to be concurrent, no obvious master control unit may be provided.
In one embodiment, the detecting whether the functional service generates a timing conflict when the atomic service is invoked includes:
obtaining a first signal of the atomic service and a second signal of the functional service, and determining whether the same first signal corresponds to at least two second signals
If so, the functional service has a time sequence conflict when calling the atomic service;
if not, the functional service does not have a time sequence conflict when calling the atomic service.
The "first" and "second" in the first signal and the second signal are merely for convenience of description, and are distinguished in terms of names, and no limitation is made to the number relationship, master-slave relationship, sequence relationship, or other attributes.
Specifically, in the operation process of the automobile service, signal interaction usually exists between the function service module and the atomic service module which are connected and communicated with each other, and the calling relationship between the function service and the atomic service can be known by verifying whether the data type and/or the signal name of the signal are matched.
Illustratively, referring to fig. 3, if a first signal of an atomic service corresponds to a second signal of two functional services (including data type correspondence and/or signal name correspondence of a signal, etc.), it indicates that the atomic service is called by the two functional services.
It should be noted that there may be one or more atomic services and functional services in the detection process, which are not limited herein, for example: the existence of any one or more first signals in the plurality of atomic services corresponding to any one or more second signals in the plurality of functional services indicates that the plurality of atomic services are simultaneously called by the plurality of functional services.
In one embodiment, the scheduling method further includes:
constructing a data flow framework for automobile control according to the atomic service and the functional service;
collecting automobile operation data carried by the first signal and the second signal in the data flow frame;
and scheduling the atomic service and/or the functional service according to the automobile operation data so as to control the operation of the vehicle.
The data flow framework is used for indicating a communication relationship (data transmission relationship) between modules of an automobile service in an operation process, the automobile operation data includes an operation state of an automobile component, and the automobile component may be some electronic control units or control systems, such as BMS (Battery Management System), MCU (micro controller Unit), DCDC converter and other components strongly related to driving and power.
Specifically, a data flow frame is constructed according to relevant information such as connection communication relation, signal interaction transmission and the like of atomic service and functional service, signals and data transmitted in the data flow frame are collected and analyzed, corresponding scheduling and operation control are carried out, and parameter and algorithm optimization and expansion are carried out according to automobile operation data collected in real time aiming at different driving conditions.
Illustratively, in the process of service scheduling, some services may be out of control or fail, and thus certain driving risks may be generated. Therefore, the operation control can be carried out according to the collected automobile operation data, and the operation control comprises the following steps: and carrying out self-adaptive torque adjustment according to the information of the driving mode, the state of the power domain component, the energy of the whole vehicle and the like acquired in real time, such as torque transfer of front and rear shaft torques according to the working conditions, avoiding plans, whole vehicle posture maintenance during tail flicking and slipping and vehicle power stability control, so as to ensure driving safety.
In addition, the function service and/or the atomic service can be updated respectively, and the corresponding service interface is set, so that iterative incorporation of new functions is realized, and the change of the whole system architecture is avoided.
It should be understood that, although the steps in the above-described flowcharts are shown in sequence as indicated by the arrows, the steps are not necessarily performed in sequence as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least a portion of the steps in the above-described flowcharts may include multiple sub-steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of performing the sub-steps or the stages is not necessarily sequential, but may be performed alternately or alternatingly with other steps or at least a portion of the sub-steps or stages of other steps.
In one embodiment, as shown in fig. 4, there is provided a scheduling apparatus based on an automobile function service, including: the device comprises an acquisition module, a detection module and a scheduling module, wherein:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring the currently running functional service, and the functional service comprises one or more atomic services;
the detection module is used for detecting whether the functional service generates time sequence conflict when the atomic service is called;
and the scheduling module is used for matching the functional service with a scheduling time sequence table to obtain a matching result corresponding to the functional service, and scheduling the functional service and/or the atomic service according to the matching result.
In one embodiment, the method further comprises the following steps:
and the matching module is used for performing priority matching on the currently running functional service and the scheduling time sequence table, wherein the scheduling time sequence table comprises priority information, and the priority information is configured according to the type information of the functional service and/or the atomic service.
In one embodiment, the method further comprises the following steps:
the judging module is used for judging whether the functional service is a concurrent service or not;
if so, controlling the functional service to perform concurrent operation;
if not, performing priority matching on the currently running functional service and the scheduling time sequence table to obtain priority information of each functional service, and scheduling the functional service according to the priority information.
In one embodiment, the method comprises the following steps:
the scheduling module is also used for comparing the priority according to the priority information of the functional service;
and controlling the functional service with higher priority to run, and suspending the functional service with lower priority to run.
In one embodiment, the method comprises the following steps:
the detection module is also used for detecting whether the functional service has a concurrent flow conflict or not;
and if so, performing priority matching on the currently running functional service and the scheduling time sequence table to obtain the priority information of each functional service, and scheduling the functional service according to the priority information.
In one embodiment, the method comprises the following steps:
a detection module, further configured to obtain a first signal of the atomic service and a second signal of the functional service, and determine whether the same first signal corresponds to at least two of the second signals
If so, the functional service has a time sequence conflict when calling the atomic service;
if not, the functional service does not have a time sequence conflict when calling the atomic service.
In one embodiment, the method further comprises the following steps:
the operation control module is used for constructing a data flow framework for automobile control according to the atomic service and the functional service;
collecting automobile operation data carried by the first signal and the second signal in the data flow frame;
and scheduling the atomic service and/or the functional service according to the automobile operation data so as to control the operation of the vehicle.
For specific limitations of the scheduling device based on the car function service, reference may be made to the above limitations of the scheduling method based on the car function service, and details thereof are not repeated here. The modules in the scheduling device based on the vehicle function service can be wholly or partially realized by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent of a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be as shown in fig. 5. The computer device comprises a processor, a memory, a network interface, a display screen and an input device which are connected through a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method of scheduling based on vehicle function services. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on the shell of the computer equipment, an external keyboard, a touch pad or a mouse and the like.
Those skilled in the art will appreciate that the architecture shown in fig. 5 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a computer device is provided, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:
acquiring a currently running functional service, wherein the functional service comprises one or more atomic services;
detecting whether the functional service generates a timing conflict when the atomic service is called;
and if so, matching the functional service with a scheduling time sequence table to obtain a matching result corresponding to the functional service, and scheduling the functional service and/or the atomic service according to the matching result.
In one embodiment, the processor when executing the computer program further performs the steps of:
and matching the priority of the currently running functional service with the scheduling time sequence table, wherein the scheduling time sequence table comprises priority information, and the priority information is configured according to the type information of the functional service and/or the atomic service.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
judging whether the functional service is a concurrent service or not;
if so, controlling the functional service to perform concurrent operation;
if not, performing priority matching on the currently running functional service and the scheduling time sequence table to obtain priority information of each functional service, and scheduling the functional service according to the priority information.
In one embodiment, the processor when executing the computer program further performs the steps of:
comparing the priority according to the priority information of the functional service;
and controlling the functional service with higher priority to run, and suspending the functional service with lower priority to run.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
detecting whether the functional service has a concurrent flow conflict or not;
and if so, performing priority matching on the currently operated functional service and the scheduling time sequence table to obtain the priority information of each functional service, and scheduling the functional service according to the priority information.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
obtaining a first signal of the atomic service and a second signal of the functional service, and judging whether the same first signal corresponds to at least two second signals
If so, the functional service has a time sequence conflict when calling the atomic service;
if not, the functional service does not have time sequence conflict when calling the atomic service.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
constructing a data flow framework for automobile control according to the atomic service and the functional service;
collecting automobile operation data carried by the first signal and the second signal in the data flow frame;
and scheduling the atomic service and/or the functional service according to the automobile operation data so as to control the operation of the vehicle.
In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of:
acquiring a currently running functional service, wherein the functional service comprises one or more atomic services;
detecting whether the functional service generates a timing conflict when the atomic service is called;
and if so, matching the functional service with a scheduling time sequence table to obtain a matching result corresponding to the functional service, and scheduling the functional service and/or the atomic service according to the matching result.
In one embodiment, the computer program when executed by the processor further performs the steps of:
and matching the priority of the currently running functional service with the scheduling time sequence table, wherein the scheduling time sequence table comprises priority information, and the priority information is configured according to the type information of the functional service and/or the atomic service.
In one embodiment, the computer program when executed by the processor further performs the steps of:
judging whether the functional service is a concurrent service or not;
if so, controlling the functional service to perform concurrent operation;
if not, performing priority matching on the currently running functional service and the scheduling time sequence table to obtain priority information of each functional service, and scheduling the functional service according to the priority information.
In one embodiment, the computer program when executed by the processor further performs the steps of:
comparing the priority according to the priority information of the functional service;
and controlling the functional service with higher priority to run, and suspending the functional service with lower priority to run.
In one embodiment, the computer program when executed by the processor further performs the steps of:
detecting whether the functional service has a concurrent flow conflict or not;
and if so, performing priority matching on the currently running functional service and the scheduling time sequence table to obtain the priority information of each functional service, and scheduling the functional service according to the priority information.
In one embodiment, the computer program when executed by the processor further performs the steps of:
obtaining a first signal of the atomic service and a second signal of the functional service, and determining whether the same first signal corresponds to at least two second signals
If so, the functional service has a time sequence conflict when calling the atomic service;
if not, the functional service does not have a time sequence conflict when calling the atomic service.
In one embodiment, the computer program when executed by the processor further performs the steps of:
constructing a data flow framework for automobile control according to the atomic service and the functional service;
collecting automobile operation data carried by the first signal and the second signal in the data flow frame;
and scheduling the atomic service and/or the functional service according to the automobile operation data so as to control the operation of the vehicle.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above may be implemented by hardware instructions of a computer program, which may be stored in a non-volatile computer-readable storage medium, and when executed, may include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), rambus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
All possible combinations of the technical features in the above embodiments may not be described for the sake of brevity, but should be considered as being within the scope of the present disclosure as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims (10)

1. A scheduling method based on automobile function service is characterized by comprising the following steps:
acquiring a currently running functional service, wherein the functional service comprises one or more atomic services;
detecting whether the functional service generates a timing conflict when the atomic service is called;
and if so, matching the functional service with a scheduling time sequence table to obtain a matching result corresponding to the functional service, and scheduling the functional service and/or the atomic service according to the matching result.
2. The method of scheduling of claim 1, wherein said matching the functional service to a scheduling schedule comprises:
and matching the priority of the currently running functional service with the scheduling time sequence table, wherein the scheduling time sequence table comprises priority information, and the priority information is configured according to the type information of the functional service and/or the atomic service.
3. The method for scheduling of claim 2, wherein before matching the functional service with a scheduling schedule, further comprising:
judging whether the functional service is a concurrent service or not;
if so, controlling the functional service to perform concurrent operation;
if not, performing priority matching on the currently running functional service and the scheduling time sequence table to obtain priority information of each functional service, and scheduling the functional service according to the priority information.
4. The scheduling method of claim 3, wherein the scheduling the functional service according to the priority information comprises:
comparing the priority according to the priority information of the functional service;
and controlling the functional service with higher priority to run, and suspending the functional service with lower priority to run.
5. The scheduling method of claim 3, wherein if the functional service is a concurrent service, further comprising:
detecting whether the functional service has a concurrent flow conflict or not;
and if so, performing priority matching on the currently running functional service and the scheduling time sequence table to obtain the priority information of each functional service, and scheduling the functional service according to the priority information.
6. The scheduling method of claim 1, wherein the detecting whether the functional service generates a timing conflict when the atomic service is invoked comprises:
acquiring a first signal of the atomic service and a second signal of the functional service, and judging whether the same first signal corresponds to at least two second signals;
if so, the functional service has a time sequence conflict when calling the atomic service;
if not, the functional service does not have a time sequence conflict when calling the atomic service.
7. The scheduling method of claim 6, further comprising:
constructing a data flow framework for automobile control according to the atomic service and the functional service;
collecting automobile operation data carried by the first signal and the second signal in the data flow frame;
and scheduling the atomic service and/or the functional service according to the automobile operation data so as to control the operation of the vehicle.
8. A scheduling apparatus for vehicle function based service, the apparatus comprising:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring the currently running functional service, and the functional service comprises one or more atomic services;
the detection module is used for detecting whether the functional service generates time sequence conflict when the atomic service is called;
and the scheduling module is used for matching the functional service with a scheduling time sequence table if the functional service is matched with the scheduling time sequence table, obtaining a matching result corresponding to the functional service, and scheduling the functional service and/or the atomic service according to the matching result.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method for scheduling based on car function services of any one of claims 1 to 7 when executing the computer program.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method for car functions service based scheduling of any one of claims 1 to 7.
CN202211212036.7A 2022-09-30 2022-09-30 Scheduling method, device, equipment and storage medium based on automobile function service Pending CN115658257A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211212036.7A CN115658257A (en) 2022-09-30 2022-09-30 Scheduling method, device, equipment and storage medium based on automobile function service

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211212036.7A CN115658257A (en) 2022-09-30 2022-09-30 Scheduling method, device, equipment and storage medium based on automobile function service

Publications (1)

Publication Number Publication Date
CN115658257A true CN115658257A (en) 2023-01-31

Family

ID=84986094

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211212036.7A Pending CN115658257A (en) 2022-09-30 2022-09-30 Scheduling method, device, equipment and storage medium based on automobile function service

Country Status (1)

Country Link
CN (1) CN115658257A (en)

Similar Documents

Publication Publication Date Title
US9880927B2 (en) Functionally expandable vehicle control device and method for supplementing the functionality of a vehicle control device
US11240317B2 (en) Diagnostic method and system for vehicle, and related device thereof
CN112130880A (en) Micro-service publishing method and device, computer equipment and storage medium
CN111861482A (en) Block chain account checking method and system
US8752067B2 (en) Control apparatus, control method and storage medium
CN114286970A (en) Partial vehicle diagnostics
CN113377658B (en) Vehicle controller debugging method and device
CN114637598A (en) Vehicle controller and scheduling method of operating system thereof
CN115658257A (en) Scheduling method, device, equipment and storage medium based on automobile function service
CN112702220B (en) Network testing method and network testing device
CN111625282A (en) Multi-subnet cooperative sleep method and system based on CAN bus
CN111831406A (en) Multi-task scheduling method and device based on vehicle-mounted embedded system
CN114967634A (en) Processor diagnostic device, processor diagnostic method, and electronic apparatus
CN116540666A (en) Vehicle diagnosis system, method, electronic equipment and medium based on TBOX
CN116319499A (en) Diagnostic method and device for vehicle, electronic equipment and storage medium
CN114872645A (en) Vehicle-mounted system application management method, framework, vehicle and medium
KR101382109B1 (en) Apparatus and method for middleware
CN111791886A (en) Real-time control system for vehicle and method for performing vehicle control via real-time control system
US20240036943A1 (en) Vehicle control module allocation
CN114661427B (en) Node management method and system for computing cluster for deploying containerized application service
CN116431391A (en) Data backup method, device, vehicle and storage medium
CN110171305B (en) Charging method, system, device, equipment, storage medium and electric vehicle
CN117785045A (en) Autosar-based controller ASW data storage method and device
CN117492946A (en) Method for controlling access of various applications in vehicle
CN113535217A (en) ECU (electronic control unit) updating optimization system and method on CAN (controller area network) bus

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
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20240118

Address after: No. 13 Xingxiang Road, Zengjia Town, High tech Zone, Jiulongpo District, Chongqing, 400039

Applicant after: Chongqing Selis Phoenix Intelligent Innovation Technology Co.,Ltd.

Address before: 610095 No. 2901, floor 29, unit 1, building 1, No. 151, Tianfu Second Street, high tech Zone, China (Sichuan) pilot Free Trade Zone, Chengdu, Sichuan Province

Applicant before: Chengdu Thalys Technology Co.,Ltd.