An integrated DBP for streams with (m, k)-firm real-time guarantee

DOI10.1631/JZUS.2004.0816MaRDI QIDQ3371699zbMATHOpenAlexWikidataFDO

Authors Zhi Wang, Jiming Chen, Youxian Sun

Publication date 21 February 2006

Published in Journal of Zhejiang University-SCIENCE A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1631/jzus.2004.0816

zbMATH Keywords

Distance Based Priority

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

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

• scientific article; zbMATH DE number 46744 (Why is no real title available?)
• scientific article; zbMATH DE number 46747 (Why is no real title available?)
• scientific article; zbMATH DE number 1106353 (Why is no real title available?)
• A calculus for network delay. I. Network elements in isolation
• A dynamic priority assignment technique for streams with (m, k)-firm deadlines
• Efficient Selective Frame Discard Algorithms for Stored Video Delivery Across Resource Constrained Networks
• Weakly hard real-time systems

Cited in

(1)

• A dynamic priority assignment technique for streams with (m, k)-firm deadlines

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)