Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm (Q2251369): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11241-012-9172-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036749964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility analysis of sporadic real-time multiprocessor task systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichains: A New Algorithm for Checking Universality of Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichain Algorithms for Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Task automata: Schedulability, decidability and undecidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Antichain Algorithm for LTL Realizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority-driven scheduling of periodic task systems on multiprocessors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank

Latest revision as of 18:40, 8 July 2024

scientific article
Language Label Description Also known as
English
Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm
scientific article

    Statements

    Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm (English)
    0 references
    0 references
    0 references
    0 references
    14 July 2014
    0 references
    hard real-time scheduling
    0 references
    formal methods
    0 references
    automata theory
    0 references
    sporadic tasks
    0 references
    exact schedulability test
    0 references
    multiprocessor scheduling
    0 references
    complexity
    0 references

    Identifiers