Skip to main content
Log in

Linear-time admission control for elastic scheduling

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

Prior algorithms that have been proposed for the uniprocessor implementation of systems of elastic tasks have computational complexity quadratic (\(O(n^2)\)) in the number of tasks n, for both initialization and for admitting new tasks during run-time. We present a more efficient implementation in which initialization takes quasilinear (\(O(n\log n)\)), and on-line admission control, linear (O(n)), time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. For tasks \(\tau _i\) having \(E_i=0\), \(U_i=U_i^{\min }\), and therefore the relationship needs not be satisfied.

  2. All tasks \(\tau _i\) with \(E_i=0\) must have \(U_i \leftarrow U_i^{\max }\) in order to satisfy Expression 1; we assume this is done in a pre-processing step, and the value of \(U_d\) updated to reflect the remaining available utilization.

  3. Observe that \(\varDelta \) equals the amount of utilization that is allocated to the tasks in \(\varGamma _{\textsc {fixed}}\); therefore \((U_d-\varDelta )\) represents the amount available for the tasks in \(\varGamma _{\textsc {variable}}\), and \(\bigl (U_{\textsc {sum}}-(U_d - \varDelta )\bigr )\) the amount by which the cumulative utilizations of these tasks must be reduced from their desired maximums. As shown in the RHS of Expression 2, under elastic scheduling this reduction is shared amongst the tasks in proportion to their elasticity parameters: \(\tau _i\)’s share is \((E_i/E_{\textsc {sum}})\).

References

  • Buttazzo GC, Lipari G, Abeni L (1998) Elastic task model for adaptive rate control. In: IEEE real-time systems symposium

  • Buttazzo GC, Lipari G, Caccamo M, Abeni L (2002) Elastic scheduling for flexible workload management. IEEE Trans Comput 51(3):289–302

    Article  Google Scholar 

  • Chantem T, Hu XS, Lemmon MD (2006) Generalized elastic scheduling. In: IEEE international real-time systems symposium

  • Chantem T, Hu XS, Lemmon MD (2009) Generalized elastic scheduling for real-time tasks. IEEE Trans Comput 58(4):480–495

    Article  MathSciNet  Google Scholar 

Download references

Funding

This study was funded by the National Science Foundation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sanjoy Baruah.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sudvarg, M., Gill, C. & Baruah, S. Linear-time admission control for elastic scheduling. Real-Time Syst 57, 485–490 (2021). https://doi.org/10.1007/s11241-021-09373-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-021-09373-4

Keywords

Navigation