Robust priority assignment for messages on Controller Area network (CAN)
From MaRDI portal
Publication:844239
DOI10.1007/S11241-008-9065-2zbMATH Open1185.68025OpenAlexW2133132919MaRDI QIDQ844239FDOQ844239
Publication date: 18 January 2010
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-008-9065-2
optimal priority assignmentfixed priority schedulingReal-timeSchedulability analysisController Area Network (CAN)Response time analysisrobust priority assignmenttransmission errors
Cites Work
- On priority assignment in fixed priority scheduling
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Optimal priority assignment in the presence of blocking
- Optimal \((D - J)\)-monotonic priority assignment
- Timing analysis of real-time communication under electromagnetic interference
Cited In (4)
Recommendations
- Title not available (Why is that?) π π
- Schedulability analysis for controller area network (CAN) with FIFO queues priority queues and gateways π π
- A combinatorial algorithm for message scheduling on controller area networks π π
- INTEGER FORMULATIONS FOR THE MESSAGE SCHEDULING PROBLEM ON CONTROLLER AREA NETWORKS π π
- A data reorganization algorithm to improve transmission efficiency in CAN networks π π
This page was built for publication: Robust priority assignment for messages on Controller Area network (CAN)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844239)