An integrated DBP for streams with (m, k)-firm real-time guarantee
From MaRDI portal
Publication:3371699
Recommendations
- A dynamic priority assignment technique for streams with (m, k)-firm deadlines
- A weakly hard real-time schedule algorithm based on cutting down
- {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
- Dynamic routing of real-time jobs among parallel EDF queues: a performance study
- scientific article; zbMATH DE number 986997
Cites work
- {{#invoke:WikidataIB|getLink|Q3996922}} scientific article; zbMATH DE number 46744 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q3996925}} scientific article; zbMATH DE number 46747 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q4371833}} scientific article; zbMATH DE number 1106353 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q3197776}} A calculus for network delay. I. Network elements in isolation
- {{#invoke:WikidataIB|getLink|Q4421136}} A dynamic priority assignment technique for streams with (m, k)-firm deadlines
- {{#invoke:WikidataIB|getLink|Q4800626}} Efficient Selective Frame Discard Algorithms for Stored Video Delivery Across Resource Constrained Networks
- {{#invoke:WikidataIB|getLink|Q4571323}} Weakly hard real-time systems
This page was built for publication: An integrated DBP for streams with (m, k)-firm real-time guarantee
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3371699)