Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

CAN bus oriented non-destructive dynamic optimal scheduling method

A CAN bus, dynamic optimization technology, applied in the direction of bus network, data exchange through path configuration, digital transmission system, etc., can solve the problem of inability to flexibly adapt to system changes, static scheduling algorithm communication efficiency and network utilization, and algorithm complexity. , network resource overhead defects, etc.

Active Publication Date: 2017-06-13
NINGBO UNIVERSITY OF TECHNOLOGY
View PDF3 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Static scheduling algorithm in CAN network control system is very suitable for message scheduling in deterministic hard real-time systems, but static scheduling algorithm is only suitable for systems with fixed system time characteristics, and cannot flexibly adapt to system changes, making it difficult to make full use of system resources
[0003] At present, there have been researches on the dynamic scheduling optimization of CAN bus. Guan Changjiao et al. published a paper "Research on Dynamic Scheduling of CAN Bus Information Triggered by Flexible Time", and Liu Chao et al. , Yang Jie, etc. published the paper "Stochastic Dynamic Priority Scheduling of Aperiodic Information in CAN Bus", etc., but the above scheduling strategies have defects in algorithm complexity, network resource overhead, etc.
The invention proposes a new non-destructive dynamic optimal scheduling method of CAN bus, which solves the problems of low communication efficiency and network utilization of static scheduling algorithms, and ensures the real-time and reliability of messages

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • CAN bus oriented non-destructive dynamic optimal scheduling method
  • CAN bus oriented non-destructive dynamic optimal scheduling method
  • CAN bus oriented non-destructive dynamic optimal scheduling method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0020] The implementation manners of the present invention are described below through specific examples, and those skilled in the art can easily implement the content disclosed in this specification.

[0021] Such as figure 1 As shown, the present invention is oriented to the non-destructive dynamic optimization scheduling method of the CAN bus, and the identifier encoding of the CAN bus arbitration field is encoded by the mode of the task segment, the competition segment, and the auxiliary segment, and the digits of the task segment, the competition segment, and the auxiliary segment can be Determined by the specific system. When sending a message, compare the priority through three segments, task segment priority>competition segment priority>auxiliary segment priority, for messages with the same task segment priority, compare the competition segment priority, for the same competition segment priority message, compare secondary segment priorities. figure 2 It is the prior...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a CAN bus oriented non-destructive dynamic optimal scheduling method. An identifier of a CAN bus arbitration field is encoded by means of three segments, namely, a task segment, a competition segment and an auxiliary segment, wherein the competition segment is encoded by adopting a segmentation method based on an absolute deadline, and can be dynamically updated. Priorities are compared via the three segments; for messages whose priorities are the same in the task segment, the priorities in the competition segment are compared again; and for the messages whose priorities are the same in the competition segment, the priorities in the auxiliary segment are further compared. According to the CAN bus oriented non-destructive dynamic optimal scheduling method provided by the invention, the flexibility of a system is increased, the bus time is reasonably distributed and occupied, the real-time performance of the system is improved, and the system is enabled to be more reliable and has the characteristic of simple debugging.

Description

technical field [0001] The invention relates to a CAN bus-oriented non-destructive dynamic optimal scheduling method. Background technique [0002] CAN is a serial data communication bus developed by German Bosch Company in 1985 in order to solve the data transmission between many test instruments and control units on automobiles. It has been widely used in distributed real-time control of automobiles, industries, and building automation. field. Static scheduling algorithm in CAN network control system is very suitable for message scheduling in deterministic hard real-time systems, but static scheduling algorithm is only suitable for systems with fixed system time characteristics, and cannot flexibly adapt to system changes and make full use of system resources. [0003] At present, there have been researches on the dynamic scheduling optimization of CAN bus. Guan Changjiao et al. published a paper "Research on Dynamic Scheduling of CAN Bus Information Triggered by Flexible...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04L12/40
CPCH04L12/40013H04L12/40039H04L12/4013H04L12/40143H04L12/4015H04L12/40156H04L12/40163H04L2012/40215
Inventor 何金保
Owner NINGBO UNIVERSITY OF TECHNOLOGY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com