Improved schedulability analysis of real-time transactions with earliest deadline scheduling
R Pellizzoni, G Lipari - 11th IEEE Real Time and Embedded …, 2005 - ieeexplore.ieee.org
In this paper we address the problem of schedulability analysis of distributed real-time
transactions under EDF, where each transaction is a chain of precedence constrained tasks.
We propose a new efficient methodology and a set of algorithms that explicitly take into
account the offsets of the transactions. We show, with an extensive set of simulations, that
our methodology provides improved schedulability conditions with respect to existing
algorithms. Finally, we apply the methodology to an important class of systems …
transactions under EDF, where each transaction is a chain of precedence constrained tasks.
We propose a new efficient methodology and a set of algorithms that explicitly take into
account the offsets of the transactions. We show, with an extensive set of simulations, that
our methodology provides improved schedulability conditions with respect to existing
algorithms. Finally, we apply the methodology to an important class of systems …
[PDF][PDF] Improved schedulability analysis of real-time transactions with earliest deadline scheduling
SSS Anna - researchgate.net
In this paper we address the problem of schedulability analysis of distributed real-time
transactions under EDF, where each transaction is a chain of precedence constrained tasks.
We propose a new efficient methodology and a set of algorithms that explicitly take into
account the offsets of the transactions. We show, with an extensive set of simulations, that
our methodology provides improved schedulability conditions with respect to existing
algorithms. Finally, we apply the methodology to an important class of systems …
transactions under EDF, where each transaction is a chain of precedence constrained tasks.
We propose a new efficient methodology and a set of algorithms that explicitly take into
account the offsets of the transactions. We show, with an extensive set of simulations, that
our methodology provides improved schedulability conditions with respect to existing
algorithms. Finally, we apply the methodology to an important class of systems …
Showing the best results for this search. See all results