A virtual channels scheduling algorithm with broad applicability based on movable boundary

DOI10.1155/2013/391493zbMATH Open1299.90163OpenAlexW2168551783WikidataQ59024340 ScholiaQ59024340MaRDI QIDQ473553FDOQ473553

Authors: J. Herrera, Sumit K. Garg 

Publication date: 24 November 2014

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/391493

Recommendations

• Anchored opportunity queueing: a low-latency scheduler for fair arbitration among virtual channels.
• scientific article; zbMATH DE number 2088477
• scientific article; zbMATH DE number 1977189
• scientific article; zbMATH DE number 638301
• scientific article; zbMATH DE number 1977235

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

This page was built for publication: A virtual channels scheduling algorithm with broad applicability based on movable boundary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473553)