On the competitiveness of on-line real-time task scheduling

DOI10.1007/BF00365406zbMath0766.68011MaRDI QIDQ1206445

S. Singh

Publication date: 1 April 1993

Published in: Real-Time Systems (Search for Journal in Brave)

zbMATH Keywords

on-line scheduling; clairvoyancy; competitive factor; real-time environments

Mathematics Subject Classification ID

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

Related Items

ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO, On the Competitiveness of Online Real-Time Scheduling with Rate of Progress Guarantees, Random trees in queueing systems with deadlines, Randomized online interval scheduling, Scheduling parallel tasks with individual deadlines, MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling, Online real-time preemptive scheduling of jobs with deadlines on multiple machines, A 2.79 competitive on-line algorithm for two processor real-time systems with uniform value density, On-line scheduling with tight deadlines., Preemptive scheduling in overloaded systems., Approximating scheduling for multimedia applications under overload conditions, Competitive on-line scheduling of continuous-media streams, Online scheduling with partial job values: does timesharing or randomization help?, Improved competitive algorithms for online scheduling with partial job values

Cites Work

• Convergence of discrete ordinates iteration scheme
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment