Publication:692625

DOI10.1007/s00453-011-9505-6zbMath1285.68019arXiv1004.2033OpenAlexW3098817740MaRDI QIDQ692625

Vincenzo Bonifaci, Alberto Marchetti-Spaccamela

Publication date: 6 December 2012

Published in: Algorithmica, Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1004.2033

zbMATH Keywords

multiprocessorreal-time schedulingfeasibility testschedulability testsporadic task system

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (10)

On the ineffectiveness of \(1/m\)-based interference bounds in the analysis of global EDF and FIFO scheduling ⋮ A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling ⋮ Synthesising succinct strategies in safety games with an application to real-time scheduling ⋮ An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems ⋮ Automated competitive analysis of real-time scheduling with graph games ⋮ Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm ⋮ Unnamed Item ⋮ Approximation algorithms for replenishment problems with fixed turnover times ⋮ Unnamed Item ⋮ On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm

Cites Work

• Open problems in real-time scheduling
• The complexity of two-player games of incomplete information
• Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
• Infinite games played on finite graphs
• Automata, logics, and infinite games. A guide to current research
• Proportionate progress: A notion of fairness in resource allocation
• Relationships between nondeterministic and deterministic tape complexities
• Integrality Property in Preemptive Parallel Machine Scheduling
• A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
• Some simple scheduling algorithms
• Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Feasibility analysis of sporadic real-time multiprocessor task systems