Approximating scheduling for multimedia applications under overload conditions

DOI10.1016/S0888-613X(98)00016-4zbMATH Open1044.90512OpenAlexW2018621662MaRDI QIDQ1606211FDOQ1606211

Authors: Guan Tan Teik, Hsu Wynne 

Publication date: 29 July 2002

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0888-613x(98)00016-4

Recommendations

• Media streams scheduling for synchronization in distributed multimedia systems
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• A technique for adaptive scheduling of soft real-time tasks
• Multimedia information delivery over wireless channels
• scientific article; zbMATH DE number 2090583

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cites Work

• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• On the competitiveness of on-line real-time task scheduling
• Title not available (Why is that?)

This page was built for publication: Approximating scheduling for multimedia applications under overload conditions

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