Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme (Q438181): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11241-011-9126-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085383769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility problems for recurring tasks on one processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the performance of schedulability tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of hard real-time scheduling for multiprocessor systems / 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: New Algorithms for Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schedulability Analysis for Real-Time Systems with EDF Scheduling / rank
 
Normal rank

Latest revision as of 12:43, 5 July 2024

scientific article
Language Label Description Also known as
English
Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme
scientific article

    Statements