IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS

DOI10.1142/S0129054104002728zbMath1098.68016MaRDI QIDQ4667921

Joseph Y.-T. Leung

Publication date: 18 April 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

on-line scheduling

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Uses Software

• MOCA

Cites Work

• Minimizing the number of late tasks with error constraint
• Minimizing the weighted number of tardy task units
• MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
• Scheduling imprecise computation tasks with \(0/1\)-constraint
• Minimizing mean flow time with error constraint
• Algorithms for Scheduling Imprecise Computations with Timing Constraints
• Minimizing Maximum Weighted Error for Imprecise Computation Tasks
• Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems

This page was built for publication: IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS