In a real-time system with both hard real-time periodic jobs and soft real-time aperiodic jobs, it is important to guarantee that the deadline of each periodic job is met, as well as to provide a fast response time for each aperiodic job. We propose an ...
The priority-driven scheduling of periodic and sporadic task systems upon identical multiprocessor platforms is considered, under the restrictions that (i) each job may be assigned exactly one priority throughout its lifetime, and (ii) each job may ...
The priority-based weighted fair queueing (PWFQ) schedule for real-time networks can be used to decouple session delay and its allocated bandwidth share. The idea is to introduce the concept of sliding window on the packet's virtual finish time. For ...
IEEE Computer Society
United States