We present a 12(1 + 3R/(4m)) competitive algorithm for scheduling implicit-deadline sporadic tasks on a platform comprising m processors, where a task may request one of R shared resources
Consider the problem of scheduling a set of periodically arriving tasks on a multiprocessor with the...
In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-...
This paper addresses the schedulability problem of periodic and sporadic real-time task sets with co...
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines o...
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines o...
We present a 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time ...
Consider the problem of scheduling a task set τ of implicit-deadline sporadic tasks to meet all dead...
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines o...
We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable pro-cess...
URL : http://rtns07.irisa.fr/fichiers/actes.pdfInternational audienceWe investigate the global sched...
In this paper we study energy efficient deadline scheduling on multiprocessors in which the processo...
In this paper we propose an end-to-end approach to scheduling tasks that share resources in a multip...
A preliminary version of this paper appeared in Proceedings of the 31st IEEE Real-Time Systems Sympo...
A new algorithm is proposed for scheduling preemptible arbitrary-deadline sporadic task systems upon...
We consider a scheduling problem onm identical processors sharing an arbitrarily divisible resource....
Consider the problem of scheduling a set of periodically arriving tasks on a multiprocessor with the...
In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-...
This paper addresses the schedulability problem of periodic and sporadic real-time task sets with co...
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines o...
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines o...
We present a 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time ...
Consider the problem of scheduling a task set τ of implicit-deadline sporadic tasks to meet all dead...
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines o...
We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable pro-cess...
URL : http://rtns07.irisa.fr/fichiers/actes.pdfInternational audienceWe investigate the global sched...
In this paper we study energy efficient deadline scheduling on multiprocessors in which the processo...
In this paper we propose an end-to-end approach to scheduling tasks that share resources in a multip...
A preliminary version of this paper appeared in Proceedings of the 31st IEEE Real-Time Systems Sympo...
A new algorithm is proposed for scheduling preemptible arbitrary-deadline sporadic task systems upon...
We consider a scheduling problem onm identical processors sharing an arbitrarily divisible resource....
Consider the problem of scheduling a set of periodically arriving tasks on a multiprocessor with the...
In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-...
This paper addresses the schedulability problem of periodic and sporadic real-time task sets with co...
DOI
Add to ORKG