A 2.79 competitive on-line algorithm for two processor real-time systems with uniform value density

DOI10.1007/S11766-997-0034-7zbMath0878.90070OpenAlexW2335311573MaRDI QIDQ1370302

Qi-Fan Yang

Publication date: 5 January 1998

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-997-0034-7

zbMATH Keywords

competitive on-line schedulingSafe-Risky-fixed algorithmtwo processor real-time systemsvalue density

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50)

Cites Work

• On the competitiveness of on-line real-time task scheduling
• MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems

This page was built for publication: A 2.79 competitive on-line algorithm for two processor real-time systems with uniform value density