scientific article; zbMATH DE number 7286768

DOI10.4230/LIPIcs.ECRTS.2018.11zbMath1497.68056MaRDI QIDQ5140795

Sanjoy K. Baruah, Kunal Agrawal

Publication date: 16 December 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

competitive ratiosporadic tasksapproximation ratiospeedup factormixed-criticality schedulingNP-completeness results

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Narrowing the speedup factor gap of partitioned EDF

Cites Work

• Unnamed Item
• NP-complete scheduling problems
• Scheduling Real-Time Mixed-Criticality Jobs
• Bounds on Multiprocessing Timing Anomalies
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: