An integrated DBP for streams with (m, k)-firm real-time guarantee
From MaRDI portal
Publication:3371699
DOI10.1631/JZUS.2004.0816zbMATH Open1083.68530OpenAlexW2079238602WikidataQ51986058 ScholiaQ51986058MaRDI QIDQ3371699FDOQ3371699
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
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
- A calculus for network delay. I. Network elements in isolation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weakly hard real-time systems
- Title not available (Why is that?)
- 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
Cited In (1)
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)
