scientific article
From MaRDI portal
Publication:3361873
zbMath0734.68018MaRDI QIDQ3361873
Rodney R. Howell, Sanjoy K. Baruah, Louis E. Rosier
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-completefeasibility problemco-NP-completecomplete task systemsincomplete task systemspreemptive schedule on one processorSimultaneous Congruences Problem
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (max. 100)
Periodic assignment and graph colouring ⋮ Proportionate progress: A notion of fairness in resource allocation ⋮ Feasibility analysis of real-time transactions ⋮ Feasibility analysis of sporadic real-time multiprocessor task systems ⋮ Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems ⋮ Vehicle minimization for periodic deliveries ⋮ Competitive analysis of online real-time scheduling algorithms under hard energy constraint ⋮ Handling mixed sets of tasks in combined offline and online scheduled real-time systems ⋮ A design flow for supporting component-based software development in multiprocessor real-time systems ⋮ Feasibility analysis of real-time periodic tasks with offsets
This page was built for publication:
