#5482. Linear-time admission control for elastic scheduling

August 2026publication date
Proposal available till 19-05-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Engineering
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №5482.1 Contract №5482.2 Contract №5482.3 Contract №5482.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
Prior algorithms that have been proposed for the uniprocessor implementation of systems of elastic tasks have computational complexity quadratic (O(n2)) 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(nlog n)), and on-line admission control, linear (O(n)), time.
Keywords:
Admission control; Elastic tasks; Preemptive uniprocessor scheduling

Contacts :
0