Optimal \((D - J)\)-monotonic priority assignment
From MaRDI portal
Publication:2379982
DOI10.1016/j.ipl.2007.04.006zbMath1184.68143OpenAlexW2019944217MaRDI QIDQ2379982
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.04.006
Related Items (4)
Robust priority assignment for messages on Controller Area network (CAN) ⋮ Maintaining data temporal consistency in distributed real-time systems ⋮ Schedulability analysis for controller area network (CAN) with FIFO queues priority queues and gateways ⋮ Tangent cones to two-dimensional area-minimizing integral currents are unique
Cites Work
This page was built for publication: Optimal \((D - J)\)-monotonic priority assignment