Robust priority assignment for messages on Controller Area network (CAN)
From MaRDI portal
(Redirected from Publication:844239)
Recommendations
- scientific article; zbMATH DE number 5315995
- 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
Cites work
- On priority assignment in fixed priority scheduling
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Optimal \((D - J)\)-monotonic priority assignment
- Optimal priority assignment in the presence of blocking
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Timing analysis of real-time communication under electromagnetic interference
Cited in
(8)- A combinatorial algorithm for message scheduling on controller area networks
- scientific article; zbMATH DE number 5315995 (Why is no real title available?)
- Schedulability analysis for controller area network (CAN) with FIFO queues priority queues and gateways
- Enhanced utilization bound of rate-monotonic scheduling in controller area networks
- Timing analysis of real-time communication under electromagnetic interference
- scientific article; zbMATH DE number 1983184 (Why is no real title available?)
- The Multi-Domain Frame Packing Problem for CAN-FD
- INTEGER FORMULATIONS FOR THE MESSAGE SCHEDULING PROBLEM ON CONTROLLER AREA 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)