Dynamic scheduling method for OSEK COM messages based on CAN network
A dynamic scheduling and network technology, applied in the field of CAN network communication
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0025] Within each ECU, each IPDU data unit of the OSEK COM layer has an IPDU ID to address different IPDUs. This design takes IPDU ID as an important part of CANID. On the same ECU, a data unit with a smaller IPDU ID has a higher priority. Such as figure 2 As shown, the IPDU ID occupies 7 bits from 8 to 14, and there are at most 2^7=128 IPDUs on an ECU.
[0026] Within an ECU, the priority between IPDUs is easy to determine. However, it is difficult to determine the priority of IPDUs between different ECUs. In order to coordinate the IPDU priority between different ECUs, the wood design introduces the node priority (Node Priority) as an important part of the CAN ID. Such as figure 2 As shown, NodePriority occupies 14 positions from 15 to 29. Up to 2^14 node priorities can be assigned on the CAN network. The Node Priority field of CANID will be adjusted according to the actual conditions on the network. At most sqrt(2^14)=2^7=128 CAN nodes are allowed to be mounted on the networ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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