scientific article; zbMATH DE number 6297766

zbMath1288.68114MaRDI QIDQ5417686

Thomas Rothvoß, Friedrich Eisenbrand

Publication date: 22 May 2014

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (13)

A constant-approximate feasibility test for multiprocessor real-time scheduling ⋮ Open problems in real-time scheduling ⋮ A bandwidth allocation scheme for compositional real-time systems with periodic resources ⋮ Feasibility analysis of real-time transactions ⋮ Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory ⋮ Graph-based models for real-time workload: a survey ⋮ Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks ⋮ Precautious-RM: a predictable non-preemptive scheduling algorithm for harmonic tasks ⋮ Feasibility analysis of sporadic real-time multiprocessor task systems ⋮ Unnamed Item ⋮ Improved multiprocessor global schedulability analysis ⋮ Narrowing the speedup factor gap of partitioned EDF ⋮ Unnamed Item

This page was built for publication: